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]"},"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]"},"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]"},"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]"},"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 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 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 {\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]"},"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]"},"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]"},"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]"},"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]"},"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]"},"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]"},"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]"},"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]"},"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]"},"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||expirationTimeNESTED_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||expirationTimeNESTED_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 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||expirationTimeNESTED_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||expirationTimeNESTED_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 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]"},"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]"},"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]"},"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]"},"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 = \" &&` 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 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 &&` 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 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]"},"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]"},"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;i1){var childArray=Array(childrenLength);for(var i=0;i1){var childArray=Array(childrenLength);for(var i=0;i
...
\";\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 = \\\"...
\\\";\\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]"},"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]"},"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 = \"...
\";\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 = \\\"...
\\\";\\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]"},"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]"},"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 = \"...
\";\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 = \\\"...
\\\";\\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]"},"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]"},"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]"},"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]"},"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
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 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();}",
"function interpolate(x, domain0, domain1) {\n if (domain0 === domain1) {\n return x === domain0 ? 0 : Infinity;\n }\n return (x - domain0) / (domain1 - domain0);\n}",
"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()}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = _d3Interpolate.interpolate,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function (y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function (_) {\n return arguments.length ? (domain = _array.map.call(_, _number.default), rescale()) : domain.slice();\n };\n\n scale.range = function (_) {\n return arguments.length ? (range = _array.slice.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function (_) {\n return range = _array.slice.call(_), interpolate = _d3Interpolate.interpolateRound, rescale();\n };\n\n scale.clamp = function (_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function (_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate$$1) {\n var domain = unit,\n range = unit,\n interpolate = interpolateValue,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate$$1) : reinterpolate$$1)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$3.call(_, number$2), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = slice$5.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = slice$5.call(_), interpolate = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate$$1) {\n var domain = unit,\n range = unit,\n interpolate = interpolateValue,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate$$1) : reinterpolate$$1)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$3.call(_, number$2), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = slice$5.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = slice$5.call(_), interpolate = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = _array__WEBPACK_IMPORTED_MODULE_2__[\"map\"].call(_, _number__WEBPACK_IMPORTED_MODULE_4__[\"default\"]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = _array__WEBPACK_IMPORTED_MODULE_2__[\"map\"].call(_, _number__WEBPACK_IMPORTED_MODULE_4__[\"default\"]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = _array__WEBPACK_IMPORTED_MODULE_2__[\"map\"].call(_, _number__WEBPACK_IMPORTED_MODULE_4__[\"default\"]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = _array__WEBPACK_IMPORTED_MODULE_2__[\"map\"].call(_, _number__WEBPACK_IMPORTED_MODULE_4__[\"default\"]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = _array__WEBPACK_IMPORTED_MODULE_2__[\"slice\"].call(_), interpolate = d3_interpolate__WEBPACK_IMPORTED_MODULE_1__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"b\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"c\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"b\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"c\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"b\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"c\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"e\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"r\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"d\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"d\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"d\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"d\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"d\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"d\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"f\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"f\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"a\" /* interpolate */],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"t\" /* interpolateRound */], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"a\" /* map */].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"a\" /* default */]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"b\" /* slice */].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\t\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\t\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\t\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\t\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\t\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n\t };\n\t\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();\n\t };\n\t\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\t\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\t\n\t return rescale();\n\t}",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\t\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\t\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\t\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\t\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\t\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n\t };\n\t\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();\n\t };\n\t\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\t\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\t\n\t return rescale();\n\t}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range$$1 = unit,\n interpolate$$1 = interpolateValue,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$3.call(_, number$1), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range$$1 = slice$4.call(_), rescale()) : range$$1.slice();\n };\n\n scale.rangeRound = function(_) {\n return range$$1 = slice$4.call(_), interpolate$$1 = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range$$1 = unit,\n interpolate$$1 = interpolateValue,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$3.call(_, number$1), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range$$1 = slice$1.call(_), rescale()) : range$$1.slice();\n };\n\n scale.rangeRound = function(_) {\n return range$$1 = slice$1.call(_), interpolate$$1 = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolate\"],\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = __WEBPACK_IMPORTED_MODULE_2__array__[\"map\"].call(_, __WEBPACK_IMPORTED_MODULE_4__number__[\"default\"]), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = __WEBPACK_IMPORTED_MODULE_2__array__[\"slice\"].call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = __WEBPACK_IMPORTED_MODULE_2__array__[\"slice\"].call(_), interpolate = __WEBPACK_IMPORTED_MODULE_1_d3_interpolate__[\"interpolateRound\"], rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit, range$$1 = unit, interpolate$$1 = d3Interpolate.interpolate, clamp = false, piecewise, output, input;\n function rescale() {\n piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n function scale(x) {\n return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n }\n scale.invert = function (y) {\n return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n scale.domain = function (_) {\n return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n };\n scale.range = function (_) {\n return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n };\n scale.rangeRound = function (_) {\n return (range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale());\n };\n scale.clamp = function (_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n scale.interpolate = function (_) {\n return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n };\n return rescale();\n }",
"function continuous(deinterpolate$$, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate = d3Interpolate.interpolate,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate$$) : deinterpolate$$, interpolate)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolate, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = slice.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = slice.call(_), interpolate = d3Interpolate.interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate = _, rescale()) : interpolate;\n };\n\n return rescale();\n }",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate$$1 = interpolateValue,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$3.call(_, number$2), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = slice$5.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = slice$5.call(_), interpolate$$1 = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n };\n\n return rescale();\n}",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t}",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t}",
"function continuous(deinterpolate, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate$$1 = value,\n clamp = false,\n piecewise$$1,\n output,\n input;\n\n function rescale() {\n piecewise$$1 = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise$$1(domain, range, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise$$1(range, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$3.call(_, number$4), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = slice$3.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = slice$3.call(_), interpolate$$1 = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n };\n\n return rescale();\n }",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = interpolateValue,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\t\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\t\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\t\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\t\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$3.call(_, number$1), rescale()) : domain.slice();\n\t };\n\t\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice$4.call(_), rescale()) : range$$1.slice();\n\t };\n\t\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice$4.call(_), interpolate$$1 = interpolateRound, rescale();\n\t };\n\t\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\t\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\t\n\t return rescale();\n\t}",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function (y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function (_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function (_) {\n\t return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function (_) {\n\t return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function (_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function (_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t }",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function (y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function (_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function (_) {\n\t return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function (_) {\n\t return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function (_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function (_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t }",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = interpolateValue,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$3.call(_, number$1), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice$4.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice$4.call(_), interpolate$$1 = interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t}",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = interpolateValue,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$3.call(_, number$1), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice$4.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice$4.call(_), interpolate$$1 = interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t}",
"function continuous(deinterpolate$$, reinterpolate) {\n\t var domain = unit,\n\t range = unit,\n\t interpolate = d3Interpolate.interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate$$) : deinterpolate$$, interpolate)))(+x);\n\t }\n\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range, domain, deinterpolate, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function(_) {\n\t return arguments.length ? (range = slice.call(_), rescale()) : range.slice();\n\t };\n\n\t scale.rangeRound = function(_) {\n\t return range = slice.call(_), interpolate = d3Interpolate.interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate = _, rescale()) : interpolate;\n\t };\n\n\t return rescale();\n\t }",
"function continuous(deinterpolate$$, reinterpolate) {\n var domain = unit,\n range = unit,\n interpolate$$ = interpolate,\n clamp = false,\n piecewise,\n output,\n input;\n\n function rescale() {\n piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n output = input = null;\n return scale;\n }\n\n function scale(x) {\n return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate$$) : deinterpolate$$, interpolate$$)))(+x);\n }\n\n scale.invert = function(y) {\n return (input || (input = piecewise(range, domain, deinterpolate, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n };\n\n scale.domain = function(_) {\n return arguments.length ? (domain = map$2.call(_, number$1), rescale()) : domain.slice();\n };\n\n scale.range = function(_) {\n return arguments.length ? (range = slice$3.call(_), rescale()) : range.slice();\n };\n\n scale.rangeRound = function(_) {\n return range = slice$3.call(_), interpolate$$ = interpolateRound, rescale();\n };\n\n scale.clamp = function(_) {\n return arguments.length ? (clamp = !!_, rescale()) : clamp;\n };\n\n scale.interpolate = function(_) {\n return arguments.length ? (interpolate$$ = _, rescale()) : interpolate$$;\n };\n\n return rescale();\n }",
"function continuous(deinterpolate, reinterpolate) {\n\t var domain = unit,\n\t range$$1 = unit,\n\t interpolate$$1 = interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);\n\t }\n\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$3.call(_, number$1), rescale()) : domain.slice();\n\t };\n\n\t scale.range = function(_) {\n\t return arguments.length ? (range$$1 = slice$3.call(_), rescale()) : range$$1.slice();\n\t };\n\n\t scale.rangeRound = function(_) {\n\t return range$$1 = slice$3.call(_), interpolate$$1 = interpolateRound, rescale();\n\t };\n\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;\n\t };\n\n\t return rescale();\n\t}",
"function continuous(deinterpolate$$, reinterpolate) {\n\t var domain = unit,\n\t range = unit,\n\t interpolate$$ = interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\t\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\t\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate$$) : deinterpolate$$, interpolate$$)))(+x);\n\t }\n\t\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range, domain, deinterpolate, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\t\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$2.call(_, number$1), rescale()) : domain.slice();\n\t };\n\t\n\t scale.range = function(_) {\n\t return arguments.length ? (range = slice$3.call(_), rescale()) : range.slice();\n\t };\n\t\n\t scale.rangeRound = function(_) {\n\t return range = slice$3.call(_), interpolate$$ = interpolateRound, rescale();\n\t };\n\t\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\t\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$ = _, rescale()) : interpolate$$;\n\t };\n\t\n\t return rescale();\n\t }",
"function continuous(deinterpolate$$, reinterpolate) {\n\t var domain = unit,\n\t range = unit,\n\t interpolate$$ = interpolate,\n\t clamp = false,\n\t piecewise,\n\t output,\n\t input;\n\t\n\t function rescale() {\n\t piecewise = Math.min(domain.length, range.length) > 2 ? polymap : bimap;\n\t output = input = null;\n\t return scale;\n\t }\n\t\n\t function scale(x) {\n\t return (output || (output = piecewise(domain, range, clamp ? deinterpolateClamp(deinterpolate$$) : deinterpolate$$, interpolate$$)))(+x);\n\t }\n\t\n\t scale.invert = function(y) {\n\t return (input || (input = piecewise(range, domain, deinterpolate, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);\n\t };\n\t\n\t scale.domain = function(_) {\n\t return arguments.length ? (domain = map$2.call(_, number$1), rescale()) : domain.slice();\n\t };\n\t\n\t scale.range = function(_) {\n\t return arguments.length ? (range = slice$3.call(_), rescale()) : range.slice();\n\t };\n\t\n\t scale.rangeRound = function(_) {\n\t return range = slice$3.call(_), interpolate$$ = interpolateRound, rescale();\n\t };\n\t\n\t scale.clamp = function(_) {\n\t return arguments.length ? (clamp = !!_, rescale()) : clamp;\n\t };\n\t\n\t scale.interpolate = function(_) {\n\t return arguments.length ? (interpolate$$ = _, rescale()) : interpolate$$;\n\t };\n\t\n\t return rescale();\n\t }",
"function unlerp(a, b, y) {\n\treturn (y-a)/(b-a);\n}",
"function vInterpolate(a, b, fraction) {\n var rval = { x: a.x + (b.x - a.x) * fraction, y: a.y + (b.y - a.y) * fraction, z: a.z + (b.z - a.z) * fraction };\n return rval;\n}",
"function interpolateX(y, y0, y1){\n return (y - y0) / (y1 - y0);\n }",
"function interpolateX(y, y0, y1){\n return (y - y0) / (y1 - y0);\n }",
"function interpolate(p0, p1, t) {\n return new Vector(\n p0.x * (1 - t) + p1.x * t,\n p0.y * (1 - t) + p1.y * t);\n }",
"function interpolateBetween(a, b) {\n var d = Math.max(-1, Math.min(1, dot(a, b))),\n s = d < 0 ? -1 : 1,\n θ = Math.acos(s * d),\n sinθ = Math.sin(θ);\n return sinθ ? function(t) {\n var A = s * Math.sin((1 - t) * θ) / sinθ,\n B = Math.sin(t * θ) / sinθ;\n return [\n a[0] * A + b[0] * B,\n a[1] * A + b[1] * B,\n a[2] * A + b[2] * B,\n a[3] * A + b[3] * B\n ];\n } : function() { return a; };\n}",
"function interpolate(a, b, idx, steps) {\n return +a + ((+b - +a) * (idx / steps));\n }",
"static Lerp(a, b, t) {\n return a * (1.0 - t) + b * t;\n }",
"function lerp(a, b, t) {\n return a * (1.0 - t) + b * t;\n}",
"function interpolate(value,xL,xR,yL,yR){\n return (value-xL)*(yR-yL)/(xR-xL) + yL;\n}",
"function sk_linearInterp( x1, x2, y1, y2, x)\n{\n if( x1 == x2)\n throw \"x1 (\" + String(x1) + \") and x2 (\" + String(x2) + \") must NOT no equal.\"; \n\n return ( y1 * ( x2 - x) + y2 * ( x - x1)) / ( x2 - x1);\n}",
"function lerp(a, b, t) {\n return a + t * (b - a);\n}",
"function lerp(t,A,B) { return A + t*(B-A) }",
"function lerp(a, b, t) {\n return a + (b - a) * t\n}",
"function lerp_element(a, b, t) {\n\treturn a+t*(b-a);\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0],\n d1 = domain[1],\n r0 = range[0],\n r1 = range[1];\n if (d1 < d0) {\n d0 = normalize(d1, d0);\n r0 = interpolate(r1, r0);\n } else {\n d0 = normalize(d0, d1);\n r0 = interpolate(r0, r1);\n }\n return function (x) {\n return r0(d0(x));\n };\n}",
"function lerp(a, b, x) {\n\treturn a+x*(b-a);\n}",
"function interpolatePair(a, b, proportion) {\n\t\treturn {\n\t\t\tdate: lerpDate(a.date, b.date, proportion),\n\t\t\tvalue1: lerp(a.value1, b.value1, proportion),\n\t\t\tvalue2: lerp(a.value2, b.value2, proportion)\n\t\t}\n\t}",
"function bimap(domain, range, interpolate) {\n\t var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n\t if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n\t else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n\t return function(x) { return r0(d0(x)); };\n\t}",
"interpolate_( /* i1, t0, t, t1 */ ) {\n\n\t\tthrow new Error( 'call to abstract method' );\n\t\t// implementations shall return this.resultBuffer\n\n\t}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n }",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n }",
"function lerp(a, b, x) {\n return (a + x * (b - a));\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) {\n return r0(d0(x));\n };\n}",
"function lerp(a,b,t) {\n\n\t\t//x axis\n\t\tvar x = a.x + t * (b.x - a.x);\n\n\t\t//y axis\n\t\tvar y = a.y + t * (b.y - a.y);\n\n\t\tvar ret = new Vector2();\n\t\tret.x = x;\n\t\tret.y = y;\n\n\t\treturn ret;\n\n\t}",
"interpolate(y2, y1, y3, n) {\n /* Equation from Astronomical Algorithms page 24 */\n const a = y2 - y1;\n const b = y3 - y2;\n const c = b - a;\n return y2 + n / 2 * (a + b + n * c);\n }",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}",
"function bimap(domain, range, interpolate) {\n var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n return function(x) { return r0(d0(x)); };\n}"
] |
[
"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.6209406",
"0.6209406",
"0.6209406",
"0.6209406",
"0.6204358",
"0.6204358",
"0.6204358",
"0.6204358",
"0.6204358",
"0.6204358",
"0.62036955",
"0.62036955",
"0.6202935",
"0.6158219",
"0.6158219",
"0.6158219",
"0.6158219",
"0.61491346",
"0.61491346",
"0.61373764",
"0.6135692",
"0.6118649",
"0.6117692",
"0.6113224",
"0.6081145",
"0.60633856",
"0.60633856",
"0.60217744",
"0.599811",
"0.5993747",
"0.5993747",
"0.5919925",
"0.5919925",
"0.5909725",
"0.5886608",
"0.5883833",
"0.57993793",
"0.57993793",
"0.5794105",
"0.5714688",
"0.56810015",
"0.56810015",
"0.56103104",
"0.5605585",
"0.5585869",
"0.55314034",
"0.55200464",
"0.5505414",
"0.54701066",
"0.54504704",
"0.54369813",
"0.5423679",
"0.5399455",
"0.5332815",
"0.5318608",
"0.5268763",
"0.5257168",
"0.5242396",
"0.52330863",
"0.52330863",
"0.5228143",
"0.522062",
"0.5198967",
"0.519882",
"0.51773524",
"0.51773524",
"0.51773524",
"0.51773524",
"0.51773524",
"0.51773524",
"0.51773524",
"0.51773524",
"0.51773524"
] |
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 long-axis\n var dx = (data.handles.start.x - data.handles.end.x) * (eventData.image.columnPixelSpacing || 1);\n var dy = (data.handles.start.y - data.handles.end.y) * (eventData.image.rowPixelSpacing || 1);\n var length = Math.sqrt(dx * dx + dy * dy);\n\n var vectorX = (data.handles.start.x - data.handles.end.x) / length;\n var vectorY = (data.handles.start.y - data.handles.end.y) / length;\n\n var perpendicularLineLength = length / 2;\n\n var startX = mid.x + (perpendicularLineLength / 2) * vectorY;\n var startY = mid.y - (perpendicularLineLength / 2) * vectorX;\n var endX = mid.x - (perpendicularLineLength / 2) * vectorY;\n var endY = mid.y + (perpendicularLineLength / 2) * vectorX;\n\n if (data.handles.perpendicularStart.locked) {\n data.handles.perpendicularStart.x = startX;\n data.handles.perpendicularStart.y = startY;\n data.handles.perpendicularEnd.x = endX;\n data.handles.perpendicularEnd.y = endY;\n }\n\n // Draw perpendicular line\n var perpendicularStartCanvas = cornerstone.pixelToCanvas(element, data.handles.perpendicularStart);\n var perpendicularEndCanvas = cornerstone.pixelToCanvas(element, data.handles.perpendicularEnd);\n\n context.beginPath();\n context.strokeStyle = color;\n context.lineWidth = lineWidth;\n context.moveTo(perpendicularStartCanvas.x, perpendicularStartCanvas.y);\n context.lineTo(perpendicularEndCanvas.x, perpendicularEndCanvas.y);\n context.stroke();\n\n }",
"perpendicular() {\n\t\tlet x = this.y;\n\t\tlet y = 0 - this.x;\n\t\t\n\t\treturn new Vector(x, y);\n\t}",
"function lineLength(x, y, x0, y0){\n return Math.sqrt((x -= x0) * x + (y -= y0) * y);\n}",
"getPerpendicularLineFromPoint1() {\n\n var x1 = this.point1.getX();\n var y1 = this.point1.getY();\n var x2 = this.point2.getX();\n var y2 = this.point2.getY();\n\n var nearestAngle = getAngleOfLineBetweenPoints(x1, y1, x2, y2) + 90.0 * Math.PI / 180.0;\n\n var lineLength = GUIDE_LINE_LENGTH / 2.0;\n\n var newX1 = x1 + lineLength * Math.cos(nearestAngle);\n var newY1 = y1 + lineLength * Math.sin(nearestAngle);\n\n var newX2 = x1 - lineLength * Math.cos(nearestAngle);\n var newY2 = y1 - lineLength * Math.sin(nearestAngle);\n\n return new Line2D({x1: newX1, y1: newY1, x2: newX2, y2: newY2});\n }",
"offset() {\n if (this.overlap) return this.dot ? 8 : 12;\n return this.dot ? 2 : 4;\n }",
"getPerpendicularInfiniteLinePoint2() {\n var x1 = this.point1.getX();\n var y1 = this.point1.getY();\n var x2 = this.point2.getX();\n var y2 = this.point2.getY();\n\n var nearestAngle = getAngleOfLineBetweenPoints(x1, y1, x2, y2) + 90.0 * Math.PI / 180.0;\n\n var lineLength = GUIDE_LINE_LENGTH / 2.0;\n\n var newX1 = x2 + lineLength * Math.cos(nearestAngle);\n var newY1 = y2 + lineLength * Math.sin(nearestAngle);\n\n var newX2 = x2 - lineLength * Math.cos(nearestAngle);\n var newY2 = y2 - lineLength * Math.sin(nearestAngle);\n\n return new Line2D({x1: newX1, y1: newY1, x2: newX2, y2: newY2});\n }",
"function line_side(l, p){\n\tvar side = ((l[1].x - l[0].x)*(p.y - l[0].y) - (l[1].y - l[0].y)*(p.x - l[0].x));\n\treturn side ? side < 0 ? -1 : 1 : 0;\n}",
"getLineLengthBetweenPoints (x, y, x0, y0){\n return Math.sqrt((x -= x0) * x + (y -= y0) * y);\n }",
"function perpendicularBothFixedRight(eventData, data) {\n var longLine = {\n start: {\n x: data.handles.start.x,\n y: data.handles.start.y\n },\n end: {\n x: data.handles.end.x,\n y: data.handles.end.y\n }\n };\n\n var perpendicularLine = {\n start: {\n x: data.handles.perpendicularStart.x,\n y: data.handles.perpendicularStart.y\n },\n end: {\n x: data.handles.perpendicularEnd.x,\n y: data.handles.perpendicularEnd.y\n }\n };\n\n var intersection = cornerstoneMath.lineSegment.intersectLine(longLine, perpendicularLine);\n\n var distanceFromPerpendicularP1 = cornerstoneMath.point.distance(data.handles.perpendicularStart, intersection);\n var distanceFromPerpendicularP2 = cornerstoneMath.point.distance(data.handles.perpendicularEnd, intersection);\n\n var distanceToLineP2 = cornerstoneMath.point.distance(data.handles.start, intersection);\n var newLineLength = cornerstoneMath.point.distance(data.handles.start, eventData.currentPoints.image);\n\n if (newLineLength <= distanceToLineP2) {\n return false;\n }\n\n var dx = (data.handles.start.x - eventData.currentPoints.image.x) / newLineLength;\n var dy = (data.handles.start.y - eventData.currentPoints.image.y) / newLineLength;\n\n var k = distanceToLineP2 / newLineLength;\n\n var newIntersection = {\n x: data.handles.start.x + ((eventData.currentPoints.image.x - data.handles.start.x) * k),\n y: data.handles.start.y + ((eventData.currentPoints.image.y - data.handles.start.y) * k)\n };\n\n data.handles.perpendicularStart.x = newIntersection.x + distanceFromPerpendicularP1 * dy;\n data.handles.perpendicularStart.y = newIntersection.y - distanceFromPerpendicularP1 * dx;\n\n data.handles.perpendicularEnd.x = newIntersection.x - distanceFromPerpendicularP2 * dy;\n data.handles.perpendicularEnd.y = newIntersection.y + distanceFromPerpendicularP2 * dx;\n\n return true;\n\n }",
"function distLineToPoint(a, b, p) {\n var n = vectDiff(b, a)\n n = vectScale(n, 1/Math.sqrt(n[0]*n[0]+n[1]*n[1]))\n \n var amp = vectDiff(a, p)\n var d = vectDiff(amp, vectScale(n,(dot(amp, n))))\n //return { d:d, a:amp, nn:n, n:dot(amp,n)}\n return Math.sqrt(d[0]*d[0]+d[1]*d[1])\n}",
"function perpendicularRightFixedPoint(eventData, data) {\n var fudgeFactor = 1;\n\n var fixedPoint = data.handles.perpendicularStart;\n var movedPoint = eventData.currentPoints.image;\n\n var distanceFromFixed = cornerstoneMath.lineSegment.distanceToPoint(data.handles, fixedPoint);\n var distanceFromMoved = cornerstoneMath.lineSegment.distanceToPoint(data.handles, movedPoint);\n\n var distanceBetweenPoints = cornerstoneMath.point.distance(fixedPoint, movedPoint);\n\n var total = distanceFromFixed + distanceFromMoved;\n\n if (distanceBetweenPoints <= distanceFromFixed) {\n return false;\n }\n\n var length = cornerstoneMath.point.distance(data.handles.start, data.handles.end);\n var dx = (data.handles.start.x - data.handles.end.x) / length;\n var dy = (data.handles.start.y - data.handles.end.y) / length;\n\n var adjustedLineP1 = {\n x: data.handles.start.x - fudgeFactor * dx,\n y: data.handles.start.y - fudgeFactor * dy\n };\n var adjustedLineP2 = {\n x: data.handles.end.x + fudgeFactor * dx,\n y: data.handles.end.y + fudgeFactor * dy\n };\n\n data.handles.perpendicularStart.x = movedPoint.x + total * dy;\n data.handles.perpendicularStart.y = movedPoint.y - total * dx;\n data.handles.perpendicularEnd.x = movedPoint.x;\n data.handles.perpendicularEnd.y = movedPoint.y;\n\n var longLine = {\n start: {\n x: data.handles.start.x,\n y: data.handles.start.y\n },\n end: {\n x: data.handles.end.x,\n y: data.handles.end.y\n }\n };\n\n var perpendicularLine = {\n start: {\n x: data.handles.perpendicularStart.x,\n y: data.handles.perpendicularStart.y\n },\n end: {\n x: data.handles.perpendicularEnd.x,\n y: data.handles.perpendicularEnd.y\n }\n };\n\n var intersection = cornerstoneMath.lineSegment.intersectLine(longLine, perpendicularLine);\n if (!intersection) {\n if (cornerstoneMath.point.distance(movedPoint, data.handles.start) > cornerstoneMath.point.distance(movedPoint, data.handles.end)) {\n data.handles.perpendicularEnd.x = adjustedLineP2.x - distanceFromMoved * dy;\n data.handles.perpendicularEnd.y = adjustedLineP2.y + distanceFromMoved * dx;\n data.handles.perpendicularStart.x = data.handles.perpendicularEnd.x + total * dy;\n data.handles.perpendicularStart.y = data.handles.perpendicularEnd.y - total * dx;\n\n return true;\n\n } else {\n data.handles.perpendicularEnd.x = adjustedLineP1.x - distanceFromMoved * dy;\n data.handles.perpendicularEnd.y = adjustedLineP1.y + distanceFromMoved * dx;\n data.handles.perpendicularStart.x = data.handles.perpendicularEnd.x + total * dy;\n data.handles.perpendicularStart.y = data.handles.perpendicularEnd.y - total * dx;\n\n return true;\n }\n\n }\n\n return true;\n }",
"function perpendicularBothFixedLeft(eventData, data) {\n var longLine = {\n start: {\n x: data.handles.start.x,\n y: data.handles.start.y\n },\n end: {\n x: data.handles.end.x,\n y: data.handles.end.y\n }\n };\n\n var perpendicularLine = {\n start: {\n x: data.handles.perpendicularStart.x,\n y: data.handles.perpendicularStart.y\n },\n end: {\n x: data.handles.perpendicularEnd.x,\n y: data.handles.perpendicularEnd.y\n }\n };\n\n var intersection = cornerstoneMath.lineSegment.intersectLine(longLine, perpendicularLine);\n\n var distanceFromPerpendicularP1 = cornerstoneMath.point.distance(data.handles.perpendicularStart, intersection);\n var distanceFromPerpendicularP2 = cornerstoneMath.point.distance(data.handles.perpendicularEnd, intersection);\n\n var distanceToLineP2 = cornerstoneMath.point.distance(data.handles.end, intersection);\n var newLineLength = cornerstoneMath.point.distance(data.handles.end, eventData.currentPoints.image);\n\n if (newLineLength <= distanceToLineP2) {\n return false;\n }\n\n var dx = (data.handles.end.x - eventData.currentPoints.image.x) / newLineLength;\n var dy = (data.handles.end.y - eventData.currentPoints.image.y) / newLineLength;\n\n var k = distanceToLineP2 / newLineLength;\n\n var newIntersection = {\n x: data.handles.end.x + ((eventData.currentPoints.image.x - data.handles.end.x) * k),\n y: data.handles.end.y + ((eventData.currentPoints.image.y - data.handles.end.y) * k)\n };\n\n data.handles.perpendicularStart.x = newIntersection.x - distanceFromPerpendicularP1 * dy;\n data.handles.perpendicularStart.y = newIntersection.y + distanceFromPerpendicularP1 * dx;\n\n data.handles.perpendicularEnd.x = newIntersection.x + distanceFromPerpendicularP2 * dy;\n data.handles.perpendicularEnd.y = newIntersection.y - distanceFromPerpendicularP2 * dx;\n\n return true;\n\n }",
"function d3_v3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function d4_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 d3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function getLinePoints(p1,p2)\n{\n\tvar slope;\n var begin;\n var end;\n var original;\n \n var horiz = Math.abs(p1[0]-p2[0]) > Math.abs(p1[1]-p2[1]); //Find pixel increment direction\n \n //Get start x,y and ending y\n if(horiz) //if pixel increment is left to right\n {\n if(p1[0]<p2[0]){begin=p1[0];end=p2[0];original=p1[1];}\n else {begin=p2[0];end=p1[0];original=p2[1];}\n slope = (p1[1]-p2[1])/(p1[0]-p2[0]);\n\n }\n else\n {\n if(p1[1]<p2[1]){begin=p1[1];end=p2[1];original=p1[0];}\n else {begin=p2[1];end=p1[1];original=p2[0];}\n slope = (p1[0]-p2[0])/(p1[1]-p2[1]);\n }\n var nps = [];\n\tvar state = begin + 1;\n //(yn-yo)/(xn-xo)=slope\n // yn = slope*(xn-xo)+yo\n while(state<end)\n\t{\n\t if(horiz)nps.push([state,Math.round((state-begin)*slope+original)])\n else nps.push([Math.round((state-begin)*slope+original),state])\n\t state+= 1;\n\t}\n\treturn nps;\n \n}",
"function vertical_line_line(line, x) {\n const px = line.p[0], py = line.p[1];\n const ux = line.u[0], uy = line.u[1];\n return vec2.fromValues(x, py + uy * (x - px) / ux);\n}",
"function pointLineDistance(p, lstart, lend, overLine) {\n\tvar points = normalizeArguments(\"pppb\", arguments);\n\tvar x = points[0].x;\n\tvar y = points[0].y;\n\tvar x0 = points[1].x;\n\tvar y0 = points[1].y;\n\tvar x1 = points[2].x;\n\tvar y1 = points[2].y;\n\tvar o = points[3];\n\tif(o && !(o = function(x, y, x0, y0, x1, y1) {\n\t\tif(!(x1 - x0)) return {x: x0, y: y};\n\t\telse if(!(y1 - y0)) return {x: x, y: y0};\n\t\tvar left, tg = -1 / ((y1 - y0) / (x1 - x0));\n\t\treturn {x: left = (x1 * (x * tg - y + y0) + x0 * (x * - tg + y - y1)) / (tg * (x1 - x0) + y0 - y1), y: tg * left - tg * x + y};\n\t}(x, y, x0, y0, x1, y1), o.x >= Math.min(x0, x1) && o.x <= Math.max(x0, x1) && o.y >= Math.min(y0, y1) && o.y <= Math.max(y0, y1))) {\n\t\tvar l1 = lineLength(x, y, x0, y0), l2 = lineLength(x, y, x1, y1);\n\t\treturn l1 > l2 ? l2 : l1;\n\t}\n\telse {\n\t\tvar a = y0 - y1, b = x1 - x0, c = x0 * y1 - y0 * x1;\n\t\treturn Math.abs(a * x + b * y + c) / Math.sqrt(a * a + b * b);\n\t}\n}",
"function orient2d(pa, pb, pc) {\n var detleft = (pa.x - pc.x) * (pb.y - pc.y);\n var detright = (pa.y - pc.y) * (pb.x - pc.x);\n var val = detleft - detright;\n if (val > -(EPSILON) && val < (EPSILON)) {\n return Orientation.COLLINEAR;\n } else if (val > 0) {\n return Orientation.CCW;\n } else {\n return Orientation.CW;\n }\n }",
"function perpendicularLeftFixedPoint(eventData, data) {\n var fudgeFactor = 1;\n\n var fixedPoint = data.handles.perpendicularEnd;\n var movedPoint = eventData.currentPoints.image;\n\n var distanceFromFixed = cornerstoneMath.lineSegment.distanceToPoint(data.handles, fixedPoint);\n var distanceFromMoved = cornerstoneMath.lineSegment.distanceToPoint(data.handles, movedPoint);\n\n var distanceBetweenPoints = cornerstoneMath.point.distance(fixedPoint, movedPoint);\n\n var total = distanceFromFixed + distanceFromMoved;\n\n if (distanceBetweenPoints <= distanceFromFixed) {\n return false;\n }\n\n var length = cornerstoneMath.point.distance(data.handles.start, data.handles.end);\n var dx = (data.handles.start.x - data.handles.end.x) / length;\n var dy = (data.handles.start.y - data.handles.end.y) / length;\n\n var adjustedLineP1 = {\n x: data.handles.start.x - fudgeFactor * dx,\n y: data.handles.start.y - fudgeFactor * dy\n };\n var adjustedLineP2 = {\n x: data.handles.end.x + fudgeFactor * dx,\n y: data.handles.end.y + fudgeFactor * dy\n };\n\n data.handles.perpendicularStart.x = movedPoint.x;\n data.handles.perpendicularStart.y = movedPoint.y;\n data.handles.perpendicularEnd.x = movedPoint.x - total * dy;\n data.handles.perpendicularEnd.y = movedPoint.y + total * dx;\n\n var longLine = {\n start: {\n x: data.handles.start.x,\n y: data.handles.start.y\n },\n end: {\n x: data.handles.end.x,\n y: data.handles.end.y\n }\n };\n\n var perpendicularLine = {\n start: {\n x: data.handles.perpendicularStart.x,\n y: data.handles.perpendicularStart.y\n },\n end: {\n x: data.handles.perpendicularEnd.x,\n y: data.handles.perpendicularEnd.y\n }\n };\n\n var intersection = cornerstoneMath.lineSegment.intersectLine(longLine, perpendicularLine);\n if (!intersection) {\n if (cornerstoneMath.point.distance(movedPoint, data.handles.start) > cornerstoneMath.point.distance(movedPoint, data.handles.end)) {\n data.handles.perpendicularStart.x = adjustedLineP2.x + distanceFromMoved * dy;\n data.handles.perpendicularStart.y = adjustedLineP2.y - distanceFromMoved * dx;\n data.handles.perpendicularEnd.x = data.handles.perpendicularStart.x - total * dy;\n data.handles.perpendicularEnd.y = data.handles.perpendicularStart.y + total * dx;\n\n return true;\n\n } else {\n data.handles.perpendicularStart.x = adjustedLineP1.x + distanceFromMoved * dy;\n data.handles.perpendicularStart.y = adjustedLineP1.y - distanceFromMoved * dx;\n data.handles.perpendicularEnd.x = data.handles.perpendicularStart.x - total * dy;\n data.handles.perpendicularEnd.y = data.handles.perpendicularStart.y + total * dx;\n\n return true;\n }\n\n }\n\n return true;\n }",
"function pt(r, a) {\n return [r * Math.cos(a) + cx, cy - r * Math.sin(a)];\n }",
"function PolylineOffsetIntersection(v1, v2, v3, distanceOffset) {\n\n\tlet bisectorVector = BisectorVector(\n\t\tv1,\n\t\tv2,\n\t\tv3\n\t\t);\n\n\tlet angle = radiansBetweenThreePoints(\n\t\tv1,\n\t\tv2,\n\t\tv3\n\t\t) / 2;\n\n\n\tlet distanceBisector = v2.distanceTo(bisectorVector);\n\tlet distanceIntersection = distanceOffset / Math.sin(angle);\n\tlet scaleFactor = distanceIntersection / distanceBisector;\n\n\n\tlet intersection = ScaledVector3FromStartPoint(bisectorVector, v2, scaleFactor);\n\n\treturn intersection ;\n}",
"function lineDist(toPt, pt1, pt2) {\n var num = Math.abs((pt2.y - pt1.y) * toPt.x - (pt2.x - pt1.x) * toPt.y + pt2.x * pt1.y - pt2.y * pt1.x)\n var denom = Math.sqrt(Math.pow(pt2.y - pt1.y, 2) + Math.pow(pt2.x - pt1.x, 2))\n return num / denom;\n}",
"function get_line_y(c) {\n\treturn 94 + c * 75;\n}",
"function projectPointToLine (p, a, ab) {\n var ap = [ p[0]-a[0], p[1]-a[1] ];\n var k = dot(ap,ab)/dot(ab,ab);\n return [\n a[0] + k * ab[0],\n a[1] + k * ab[1]\n ];\n }",
"function perpDistance2(xab, yab, llab, xac, yac) {\n var fcAB = xac * xab + yac * yab;\n if (fcAB < 0) {\n // point c is closer to point a\n return xac * xac + yac * yac;\n } else if (fcAB > llab) {\n // point c is closer to point b\n var xbc = xac - xab;\n var ybc = yac - yab;\n return xbc * xbc + ybc * ybc;\n } else {\n // perpendicular distance is the shortest\n var crossProduct = xac * yab - yac * xab;\n return crossProduct * crossProduct / llab;\n }\n}",
"function computeLineLength( x1, y1, x2, y2 ) {\n let xdiff = subtract( x2, x1 );\n let ydiff = subtract( y2, y1 );\n let total = add( square( xdiff ), square( ydiff ) );\n return Math.sqrt( total );\n}",
"static DistanceToPolyLine() {}",
"function pt(r, a) {\n return [r * Math.cos(a) + cx, cy - r * Math.sin(a)];\n }",
"getLineLengthForAngle(angle) {\n // set some constants\n const x = this.state.player.playerXpos;\n const y = this.state.player.playerYpos;\n const gridSize = this.state.grid.gridSize;\n const map = this.state.mapData[0];\n const radiansConversion = PI / 180;\n const debug = this.state.debug;\n\n // set some variables\n let xShift, yShift;\n let newx = x;\n let newy = y;\n\n // calculate line length until first wall segment for shifts on the x axis\n\n let lineLengthForXAxis = 0;\n\n // set initial map indices\n let tileX = parseInt(x / gridSize);\n let tileY = parseInt(y / gridSize);\n\n let tempx = x;\n let tempy = y;\n\n while (tileX > 0 && tileY >= 0 && tileX < map[0].length && tileY < map.length) {\n\n if (map[tileY][tileX] != '1') {\n\n if (angle > 0 && angle <= 90) {\n newx > gridSize ? xShift = gridSize - (newx % gridSize) : xShift = gridSize - newx;\n if (xShift == 0) { xShift = gridSize }\n newy = tempy + (xShift * (Math.tan(angle * radiansConversion)));\n newx = tempx + xShift + 0.1; // going right, subtract 0.1\n }\n if (angle > 90 && angle <= 180) {\n newx < gridSize ? xShift = newx : xShift = (newx % gridSize);\n if (xShift == 0) { xShift = gridSize }\n newy = tempy + (xShift / (Math.tan((angle + 270) * radiansConversion)));\n newx = tempx - xShift - 0.1; // going left, add 0.1\n }\n if (angle > 180 && angle <= 270) {\n newx < gridSize ? xShift = newx : xShift = (newx % gridSize);\n if (xShift == 0) { xShift = gridSize }\n\n newy = tempy - (xShift * (Math.tan((angle + 180) * radiansConversion)));\n newx = tempx - xShift - 0.1; // going left, subtract 0.1\n }\n if (angle > 270 && angle < 360) {\n newx > gridSize ? xShift = gridSize - (newx % gridSize) : xShift = gridSize - newx;\n if (xShift == 0) { xShift = gridSize }\n newy = tempy - (xShift / (Math.tan((angle + 90) * radiansConversion)));\n newx = tempx + xShift + 0.1; // going right, add 0.1\n }\n\n // set new map indices\n tileX = parseInt(newx / gridSize);\n tileY = parseInt(newy / gridSize);\n\n // before adding to the lineLength, break if out of bounds on x axis\n if (newx <= 0 || newx >= map[0].length * gridSize) {\n break;\n }\n\n lineLengthForXAxis = this.getLineLengthBetweenPoints(x, y, newx, newy);\n\n // if out of bounds on y axis, break\n if (newy <= 0 || newy >= map.length * gridSize) {\n break;\n }\n\n tempx = newx;\n tempy = newy;\n\n } else {\n break; // encountered wall segment\n }\n\n if (debug) { this.drawDebugIndicationMarker(newx, newy, 'green') }\n\n }\n\n if (debug) { console.log('x (green) = ' + lineLengthForXAxis) }\n\n // calculate line length until first wall segment for shifts on the y axis\n\n let lineLengthForYAxis = 0;\n\n // reset some reused values\n tileX = parseInt(x / gridSize);\n tileY = parseInt(y / gridSize);\n tempx = x;\n tempy = y;\n newx = x;\n newy = y;\n xShift = 0;\n yShift = 0;\n\n while (tileX > 0 && tileY >= 0 && tileX < map[0].length && tileY < map.length) {\n\n if (map[tileY][tileX] != '1'){\n\n if (angle > 0 && angle <= 90) {\n newy > gridSize ? yShift = gridSize - (newy % gridSize) : yShift = gridSize - newy;\n if (yShift == 0) { yShift = gridSize }\n newx = tempx + (yShift / (Math.tan(angle * radiansConversion)));\n newy = tempy + yShift + 0.1; // going right, add 0.1\n }\n if (angle > 90 && angle <= 180) {\n newy < gridSize ? yShift = gridSize - newy : yShift = gridSize - (newy % gridSize);\n if (yShift == 0) { yShift = gridSize }\n newx = tempx - (yShift * (Math.tan((angle + 270) * radiansConversion)));\n newy = tempy + yShift + 0.1; // going right, add 0.1\n }\n if (angle > 180 && angle <= 270) {\n newy < gridSize ? yShift = newy : yShift = (newy % gridSize);\n if (yShift == 0) { yShift = gridSize }\n newx = tempx - (yShift / (Math.tan((angle + 180) * radiansConversion)));\n newy = tempy - yShift - 0.1; // going left, subtract 0.1\n }\n if (angle > 270 && angle < 360) {\n newy > gridSize ? yShift = (newy % gridSize): yShift = newy;\n if (yShift == 0) { yShift = gridSize }\n newx = tempx + (yShift * (Math.tan((angle + 90) * radiansConversion)));\n newy = tempy - yShift - 0.1; // going left, subtract 0.1;\n }\n\n // set new map indices\n tileX = parseInt(newx / gridSize);\n tileY = parseInt(newy / gridSize);\n\n // before adding to the lineLength, break if out of bounds on y axis\n if (newy <= 0 || newy >= map.length * gridSize){\n break;\n }\n\n lineLengthForYAxis = this.getLineLengthBetweenPoints(x, y, newx, newy);\n\n // if out of bounds on x axis, break\n if (newx <= 0 || newx >= map[0].length * gridSize){\n break;\n }\n\n tempx = newx;\n tempy = newy;\n\n } else {\n break; // encountered wall segment\n }\n\n if (debug) { this.drawDebugIndicationMarker(newx, newy, 'red') }\n\n }\n\n if (debug) { console.log('y (red) = ' + lineLengthForYAxis) }\n\n // calculate the definitive shortest route to nearest wall\n let shortestRoute = lineLengthForXAxis <= lineLengthForYAxis ? lineLengthForXAxis : lineLengthForYAxis;\n\n if (debug) { console.log('shortest route is '+shortestRoute+' pixels') }\n\n // return shortest length\n return shortestRoute;\n }",
"function ic_angle(img, px, py) {\n var u_max = new Int32Array([15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 11, 10, 9, 8, 6, 3, 0]);\n var half_k = 15; // half patch size\n var m_01 = 0, m_10 = 0;\n var src = img.data, step = img.cols;\n var u = 0, v = 0, center_off = (py * step + px) | 0;\n var v_sum = 0, d = 0, val_plus = 0, val_minus = 0;\n\n // Treat the center line differently, v=0\n for (u = -half_k; u <= half_k; ++u)\n m_10 += u * src[center_off + u];\n\n // Go line by line in the circular patch\n for (v = 1; v <= half_k; ++v) {\n // Proceed over the two lines\n v_sum = 0;\n d = u_max[v];\n for (u = -d; u <= d; ++u) {\n val_plus = src[center_off + u + v * step];\n val_minus = src[center_off + u - v * step];\n v_sum += (val_plus - val_minus);\n m_10 += u * (val_plus + val_minus);\n }\n m_01 += v * v_sum;\n }\n\n return Math.atan2(m_01, m_10);\n}",
"function getLineVertices(c1,c2,r_dots,r_lines){\n \n var lat = new Array();\n var lon = new Array();\n \n var midp_num = 4;\n var midp_count = Math.pow(2,midp_count);\n \n lat[0] = (c1[0]).toRad();\n lon[0] = (c1[1]).toRad();\n var dcoor1 = findDotPosition(lat[0],lon[0],r_dots);\n \n lat[1] = (c2[0]).toRad();\n lon[1] = (c2[1]).toRad();\n var dcoor2 = findDotPosition(lat[1],lon[1],r_dots);\n\n var linePoints = new Array();\n \n linePoints[0] = dcoor1;\n linePoints[1] = dcoor2;\n \n lat[Math.pow(2,midp_num+1)] = lat[1];\n lon[Math.pow(2,midp_num+1)] = lon[1];\n linePoints[Math.pow(2,midp_num+1)] = linePoints[1];\n \n linePoints[1] = undefined;\n \n for (i=midp_num;i>-1;i--){\n var step = Math.pow(2,i);\n for (j=0;j<linePoints.length;j+=step){\n if(linePoints[j] == undefined){\n lat[j] = findMidpoint(lat[j-step],lat[j+step],lon[j-step],lon[j+step])[0];\n lon[j] = findMidpoint(lat[j-step],lat[j+step],lon[j-step],lon[j+step])[1];\n linePoints[j] = findDotPosition(lat[j],lon[j],r_lines);\n }\n }\n }\n \n return linePoints;\n}",
"function arbitraryPerpendicularVector(vec){\n var res = vec.clone().cross(CONST.e1);\n if(res.equals(CONST.zerovec) == false){\n return res;\n }\n return vec.clone().cross(CONST.e2);\n}",
"function reconstructLineWidth(inBuffer, startIndex) {\n const xd = inBuffer[startIndex * 2 + 3] - inBuffer[startIndex * 2];\n const yd = inBuffer[startIndex * 2 + 3 + 1] - inBuffer[startIndex * 2 + 1];\n const zd = inBuffer[startIndex * 2 + 3 + 2] - inBuffer[startIndex * 2 + 2];\n return Math.sqrt(xd * xd + yd * yd + zd * zd) * 0.5;\n}",
"getTranslationPointsForAngle(x, y, a, length) {\n let radians = a * (PI / 180);\n let x2 = x + length * Math.cos(radians);\n let y2 = y + length * Math.sin(radians);\n return [x2, y2];\n }",
"function getLineLength(x1, y1, x2, y2) {\n var res = Math.sqrt(Math.pow((x2 - x1), 2) + Math.pow((y2 - y1), 2));\n return res;\n}",
"function texPrism_line_dist(vparas) {\n var layrs = vparas.layars || 3;\n return { fragmentShader: `\n #define WEIGHT 0.4\n\n uniform sampler2D u_tex;\n\n varying vec2 vUv;\n varying vec3 P;\n varying vec3 P0;\n varying vec3 P1;\n varying vec3 P2;\n varying vec3 P3;\n varying vec4 cent[${layrs}];\n\n // https://math.stackexchange.com/questions/2213165/find-shortest-distance-between-lines-in-3d\n // 𝐧 = 𝐞1 × 𝐞2 = (−20, −11, −26)\n // rasterize functions\n float line(vec3 e, vec3 P, vec3 p0, vec3 p1, float w) {\n vec3 e2 = p1 - p0;\n vec3 e1 = P - e;\n vec3 n = normalize(cross(e1, e2));\n float dist = dot(n, e - p0);\n dist = 1.0/dist * WEIGHT * w;\n // return min(dist * dist, 1.0);\n return abs(dist);\n }\n\n vec4 mainImage( in vec2 fragCoord ) {\n float line_width = 0.4;\n float col = line(cameraPosition, P, P0, P1, line_width);\n col += line(cameraPosition, P, P2, P3, line_width);\n return vec4(col);\n }\n\n void main() {\n gl_FragColor += mainImage(gl_FragCoord.xy);\n gl_FragColor.g += 0.7;\n gl_FragColor.a += 0.2;\n }`,\n\n vertexShader: `\n uniform vec3 wpos;\n uniform vec3 offsets[${layrs}];\n uniform vec3 orbScale;\n\n attribute vec3 a_tan;\n attribute vec3 a_pos;\n\n varying vec2 vUv;\n varying vec3 P;\n varying vec3 P0;\n varying vec3 P1;\n varying vec3 P2;\n varying vec3 P3;\n varying vec3 vscale;\n varying vec4 cent[${layrs}];\n\n void main() {\n // vUv = uv;\n\n // gl_Position = projectionMatrix * modelViewMatrix * vec4( position, 1.0 );\n vec4 worldPosition = modelMatrix * vec4(position, 1.0);\n\n P = worldPosition.xyz;\n vscale = orbScale;\n for (int i = 0; i < ${layrs}; i++){\n // cent[i] = modelMatrix * vec4(wpos + offsets[i], 1.);\n cent[i] = worldPosition;\n }\n\n gl_Position = projectionMatrix * viewMatrix * worldPosition;\n\n vec4 v4 = modelMatrix * vec4( vec3(-150., 0., -50.), 1.0 );\n P0 = v4.xyz;\n v4 = modelMatrix * vec4( vec3(150., 0., -50.), 1.0 );\n P1 = v4.xyz;\n\n v4 = modelMatrix * vec4( vec3(0., 150., 50.), 1.0 );\n P2 = v4.xyz;\n v4 = modelMatrix * vec4( vec3(0., -150., 50.), 1.0 );\n P3 = v4.xyz;\n\n v4 = projectionMatrix * modelViewMatrix * vec4(uv.s, uv.t, 0., 1.0);\n vUv = v4.xy; // / v4.z;\n } `\n }\n}",
"function lineMidpoint(line){\n return [(line[0][0] + line[1][0]) / 2, (line[0][1] + line[1][1]) / 2];\n }",
"function perp( v ) {\n let theta = -90 * Math.PI / 180;\n let cs = Math.cos(theta);\n let sn = Math.sin(theta);\n return {\n x: v.x * cs - v.y * sn,\n y: v.x * sn + v.y * cs,\n }\n}",
"function lineLength(line){\n return Math.sqrt(Math.pow(line[1][0] - line[0][0], 2) + Math.pow(line[1][1] - line[0][1], 2));\n }",
"calculateOffset(offset) {\n\n // Note: vec3 has the same alignment as vec4\n let alignment = this.byteSize <= 8 ? this.byteSize : 16;\n\n // arrays have vec4 alignments\n if (this.count)\n alignment = 16;\n\n // align the start offset\n offset = math.roundUp(offset, alignment);\n this.offset = offset / 4;\n }",
"getYForLine(line) {\n const options = this.options;\n const spacing = options.spacing_between_lines_px;\n const headroom = options.space_above_staff_ln;\n\n const y = this.y + (line * spacing) + (headroom * spacing);\n\n return y;\n }",
"function invLerp(line, point) {\n var t = vec2.create();\n vec2.sub(t, point, line.ends[0]);\n return vec2.dot(t, line.vec) / line.len_2;\n}",
"function drawSlopeLabel() {\n let label = document.getElementById(\"slopeLabel\");\n // display when points are pinned. do not redraw if nothing changed\n if (pt1.pinned && pt2.pinned && m != label.innerHTML.substring(2)\n && isFinite(m) && m != 0 && !riseRunDisplay) {\n // find midpoint of line, put the label there\n midpoint = calcMidpoint(pt1.x, pt1.y, pt2.x, pt2.y);\n screenPos = planeCoordToAbsScreenPosition(midpoint.x, midpoint.y, 0, 0);\n label.hidden = false;\n label.innerHTML = \"m=\" + m.toFixed(2);\n label.style.left = screenPos.x + \"px\";\n label.style.top = screenPos.y + \"px\";\n }\n}",
"get sweepRadians() { return this._radians1 - this._radians0; }",
"function getY(p, x, sweeplineY) {\n var dp = 2 * (p[1] - sweeplineY);\n var b1 = -2 * p[0] / dp;\n var c1 = sweeplineY + dp / 4 + p[0] * p[0] / dp;\n return x * x / dp + b1 * x + c1;\n }",
"function perp2d(v, clockwise) {\n clockwise = clockwise || false;\n if (clockwise)\n return vec2.fromValues(v[1], -v[0]);\n return vec2.fromValues(-v[1], v[0]);\n}",
"function perpDistance2(xab, yab, l2_ab, xac, yac) {\n var fc_ab = (xac * xab + yac * yab);\n if(fc_ab < 0) {\n // point c is closer to point a\n return xac * xac + yac * yac;\n }\n else if(fc_ab > l2_ab) {\n // point c is closer to point b\n var xbc = xac - xab;\n var ybc = yac - yab;\n return xbc * xbc + ybc * ybc;\n }\n else {\n // perpendicular distance is the shortest\n var crossProduct = xac * yab - yac * xab;\n return crossProduct * crossProduct / l2_ab;\n }\n}",
"function perpDistance2(xab, yab, l2_ab, xac, yac) {\n var fc_ab = (xac * xab + yac * yab);\n if(fc_ab < 0) {\n // point c is closer to point a\n return xac * xac + yac * yac;\n }\n else if(fc_ab > l2_ab) {\n // point c is closer to point b\n var xbc = xac - xab;\n var ybc = yac - yab;\n return xbc * xbc + ybc * ybc;\n }\n else {\n // perpendicular distance is the shortest\n var crossProduct = xac * yab - yac * xab;\n return crossProduct * crossProduct / l2_ab;\n }\n}",
"function reconstructLine(inBuffer, startOffset) {\n const outBuffer = new Float32Array(inBuffer.length / 2);\n for (let i = startOffset * 3, i2 = i * 2; i < outBuffer.length; i += 3, i2 += 6) {\n outBuffer[i] = inBuffer[i2] + (inBuffer[i2 + 3] - inBuffer[i2]) * 0.5;\n outBuffer[i + 1] = inBuffer[i2 + 1] + (inBuffer[i2 + 3 + 1] - inBuffer[i2 + 1]) * 0.5;\n outBuffer[i + 2] = inBuffer[i2 + 2] + (inBuffer[i2 + 3 + 2] - inBuffer[i2 + 2]) * 0.5;\n }\n return outBuffer;\n}",
"get length() {\n return Math.sqrt(Math.pow(this.x, 2) + Math.pow(this.y, 2));\n }",
"calcLineAngle(BC: number, AB: number, nextMark: number, currentMark: number) {\n let angleA = Math.fround(Math.asin(BC / AB) * 180 / Math.PI);\n if (nextMark > currentMark) angleA = -angleA;\n return angleA;\n }",
"getOffset(player) {\n\n return (function(viewport, player, map) {\n\n const basePlayerOffsetY = player.baseOffsetY;\n\n const playerOffcenterLeft = Math.min(0, player.x - viewport.width/2),\n playerOffcenterRight = Math.max( 0, (player.x + viewport.width/2) - map.width),\n playerOffcenterX = playerOffcenterLeft + playerOffcenterRight;\n\n const playerOffcenterTop = Math.min(0 + basePlayerOffsetY, player.y - viewport.height/2 + basePlayerOffsetY),\n playerOffcenterBottom = Math.max(0, (player.y + viewport.height/2 - basePlayerOffsetY) - map.height),\n playerOffcenterY = playerOffcenterTop + playerOffcenterBottom //+ basePlayerOffsetY;\n\n // console.log(\n // playerOffcenterY / 70\n // );\n // //console.log(((player.y - viewport.height/2) - playerOffcenterY) / 70)\n // throw new Error();\n\n return {\n map: {\n x: (player.x - viewport.width/2) - playerOffcenterX,\n y: (player.y - viewport.height/2) - playerOffcenterY\n },\n player: {\n x: viewport.width/2 + playerOffcenterX,\n y: viewport.height/2 + playerOffcenterY\n }\n };\n\n })(\n {width: this.viewport.width.px, height: this.viewport.height.px},\n {x: player.position.x, y: player.position.y, baseOffsetY: this.basePlayerOffsetY},\n {width: this.width.px, height: this.height.px}\n );\n\n }",
"function linePos(area) { return lineBefore(area).length; }",
"function getLines(l, r){\n var lines = {\n left: [],\n right: []\n };\n // 3 cases: 1 l divides r, r divides l, neither divide\n var t1 = intersectsTarget(l, r);\n var t2 = intersectsTarget(r, l);\n if (t1 && t2) {\n console.error(\"Error invalid input data\");\n return {left:[], right:[]};\n }\n var v0lp = vec3(l.vectors[0][0] + l.p[0], l.vectors[0][1] + l.p[1], 0);\n var v1lp = vec3(l.vectors[1][0] + l.p[0], l.vectors[1][1] + l.p[1], 0);\n\n var v0rp = vec3(r.vectors[0][0] + r.p[0], r.vectors[0][1] + r.p[1], 0);\n var v1rp = vec3(r.vectors[1][0] + r.p[0], r.vectors[1][1] + r.p[1], 0);\n\n if (!t1 && !t2) { // neither divide\n // all combinations possible 11, 10, 01, 00\n if (dividesRightOfLine(l.y1, l.y0, r.y1, r.y0)) {\n lines.left.push(new Line(l.p, v1lp));\n } else {\n lines.left.push(new Line(l.p, v0lp));\n }\n\n if (dividesRightOfLine(r.y1, r.y0, l.y1, l.y0)) {\n lines.right.push(new Line (r.p, v1rp));\n } else {\n lines.right.push(new Line (r.p, v0rp));\n }\n\n } else if (t1) {\n lines.left.push(new Line(l.p, v1lp));\n lines.left.push(new Line(l.p, v0lp));\n if (dividesRightOfLine(r.y1, r.y0, l.y1, l.y0)) {\n lines.right.push(new Line (r.p, v1rp));\n } else {\n lines.right.push(new Line (r.p, v0rp));\n }\n } else { // r intersects l\n lines.right.push(new Line (r.p, v1rp));\n lines.right.push(new Line (r.p, v0rp));\n if (dividesRightOfLine(l.y1, l.y0, r.y1, r.y0)) {\n lines.left.push(new Line(l.p, v1lp));\n } else {\n lines.left.push(new Line(l.p, v0lp));\n }\n }\n return lines;\n}",
"function translateAlong(path) {\n var l = path.getTotalLength();\n\n console.log(l);\n\n return function(d, i, a) {\n return function(t) {\n var p = path.getPointAtLength(t * l);\n return \"translate(\" + p.x + \",\" + p.y + \")\";\n };\n };\n }",
"function circleLineIntersection(cc, r, p1, p2) {\n var x1 = p1[0],\n y1 = p1[1],\n x2 = p2[0],\n y2 = p2[1],\n xc = cc[0],\n yc = cc[1],\n a = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1),\n b = 2 * ((x2 - x1) * (x1 - xc) + (y2 - y1) * (y1 - yc)),\n c =\n xc * xc + yc * yc + x1 * x1 + y1 * y1 - 2 * (xc * x1 + yc * y1) - r * r,\n d = b * b - 4 * a * c,\n u1 = 0,\n u2 = 0,\n x = 0,\n y = 0;\n if (a === 0) {\n return [0, [0, 0]];\n } else if (d < 0) {\n return [0, [0, 0]];\n }\n u1 = (-b + sqrt(d)) / (2 * a);\n u2 = (-b - sqrt(d)) / (2 * a);\n if (0 <= u1 && u1 <= 1) {\n x = x1 + u1 * (x2 - x1);\n y = y1 + u1 * (y2 - y1);\n return [1, [x, y]];\n } else if (0 <= u2 && u2 <= 1) {\n x = x1 + u2 * (x2 - x1);\n y = y1 + u2 * (y2 - y1);\n return [1, [x, y]];\n } else {\n return [0, [0, 0]];\n }\n }",
"function getBevelVec(inPt, inPrev, inNext) {\n // computes for inPt the corresponding point inPt' on a new contour\n // shifted by 1 unit (length of normalized vector) to the left\n // if we walk along contour clockwise, this new contour is outside the old one\n //\n // inPt' is the intersection of the two lines parallel to the two\n // adjacent edges of inPt at a distance of 1 unit on the left side.\n var v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n // good reading for geometry algorithms (here: line-line intersection)\n // http://geomalgorithms.com/a05-_intersect-1.html\n\n var v_prev_x = inPt.x - inPrev.x,\n v_prev_y = inPt.y - inPrev.y;\n var v_next_x = inNext.x - inPt.x,\n v_next_y = inNext.y - inPt.y;\n var v_prev_lensq = v_prev_x * v_prev_x + v_prev_y * v_prev_y; // check for collinear edges\n\n var collinear0 = v_prev_x * v_next_y - v_prev_y * v_next_x;\n\n if (Math.abs(collinear0) > Number.EPSILON) {\n // not collinear\n // length of vectors for normalizing\n var v_prev_len = Math.sqrt(v_prev_lensq);\n var v_next_len = Math.sqrt(v_next_x * v_next_x + v_next_y * v_next_y); // shift adjacent points by unit vectors to the left\n\n var ptPrevShift_x = inPrev.x - v_prev_y / v_prev_len;\n var ptPrevShift_y = inPrev.y + v_prev_x / v_prev_len;\n var ptNextShift_x = inNext.x - v_next_y / v_next_len;\n var ptNextShift_y = inNext.y + v_next_x / v_next_len; // scaling factor for v_prev to intersection point\n\n var sf = ((ptNextShift_x - ptPrevShift_x) * v_next_y - (ptNextShift_y - ptPrevShift_y) * v_next_x) / (v_prev_x * v_next_y - v_prev_y * v_next_x); // vector from inPt to intersection point\n\n v_trans_x = ptPrevShift_x + v_prev_x * sf - inPt.x;\n v_trans_y = ptPrevShift_y + v_prev_y * sf - inPt.y; // Don't normalize!, otherwise sharp corners become ugly\n // but prevent crazy spikes\n\n var v_trans_lensq = v_trans_x * v_trans_x + v_trans_y * v_trans_y;\n\n if (v_trans_lensq <= 2) {\n return new Vector2(v_trans_x, v_trans_y);\n } else {\n shrink_by = Math.sqrt(v_trans_lensq / 2);\n }\n } else {\n // handle special case of collinear edges\n var direction_eq = false; // assumes: opposite\n\n if (v_prev_x > Number.EPSILON) {\n if (v_next_x > Number.EPSILON) {\n direction_eq = true;\n }\n } else {\n if (v_prev_x < -Number.EPSILON) {\n if (v_next_x < -Number.EPSILON) {\n direction_eq = true;\n }\n } else {\n if (Math.sign(v_prev_y) === Math.sign(v_next_y)) {\n direction_eq = true;\n }\n }\n }\n\n if (direction_eq) {\n // console.log(\"Warning: lines are a straight sequence\");\n v_trans_x = -v_prev_y;\n v_trans_y = v_prev_x;\n shrink_by = Math.sqrt(v_prev_lensq);\n } else {\n // console.log(\"Warning: lines are a straight spike\");\n v_trans_x = v_prev_x;\n v_trans_y = v_prev_y;\n shrink_by = Math.sqrt(v_prev_lensq / 2);\n }\n }\n\n return new Vector2(v_trans_x / shrink_by, v_trans_y / shrink_by);\n }",
"function getBevelVec(inPt, inPrev, inNext) {\n // computes for inPt the corresponding point inPt' on a new contour\n // shifted by 1 unit (length of normalized vector) to the left\n // if we walk along contour clockwise, this new contour is outside the old one\n //\n // inPt' is the intersection of the two lines parallel to the two\n // adjacent edges of inPt at a distance of 1 unit on the left side.\n let v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n // good reading for geometry algorithms (here: line-line intersection)\n // http://geomalgorithms.com/a05-_intersect-1.html\n\n const v_prev_x = inPt.x - inPrev.x,\n v_prev_y = inPt.y - inPrev.y;\n const v_next_x = inNext.x - inPt.x,\n v_next_y = inNext.y - inPt.y;\n const v_prev_lensq = v_prev_x * v_prev_x + v_prev_y * v_prev_y; // check for collinear edges\n\n const collinear0 = v_prev_x * v_next_y - v_prev_y * v_next_x;\n\n if (Math.abs(collinear0) > Number.EPSILON) {\n // not collinear\n // length of vectors for normalizing\n const v_prev_len = Math.sqrt(v_prev_lensq);\n const v_next_len = Math.sqrt(v_next_x * v_next_x + v_next_y * v_next_y); // shift adjacent points by unit vectors to the left\n\n const ptPrevShift_x = inPrev.x - v_prev_y / v_prev_len;\n const ptPrevShift_y = inPrev.y + v_prev_x / v_prev_len;\n const ptNextShift_x = inNext.x - v_next_y / v_next_len;\n const ptNextShift_y = inNext.y + v_next_x / v_next_len; // scaling factor for v_prev to intersection point\n\n const sf = ((ptNextShift_x - ptPrevShift_x) * v_next_y - (ptNextShift_y - ptPrevShift_y) * v_next_x) / (v_prev_x * v_next_y - v_prev_y * v_next_x); // vector from inPt to intersection point\n\n v_trans_x = ptPrevShift_x + v_prev_x * sf - inPt.x;\n v_trans_y = ptPrevShift_y + v_prev_y * sf - inPt.y; // Don't normalize!, otherwise sharp corners become ugly\n // but prevent crazy spikes\n\n const v_trans_lensq = v_trans_x * v_trans_x + v_trans_y * v_trans_y;\n\n if (v_trans_lensq <= 2) {\n return new Vector2(v_trans_x, v_trans_y);\n } else {\n shrink_by = Math.sqrt(v_trans_lensq / 2);\n }\n } else {\n // handle special case of collinear edges\n let direction_eq = false; // assumes: opposite\n\n if (v_prev_x > Number.EPSILON) {\n if (v_next_x > Number.EPSILON) {\n direction_eq = true;\n }\n } else {\n if (v_prev_x < -Number.EPSILON) {\n if (v_next_x < -Number.EPSILON) {\n direction_eq = true;\n }\n } else {\n if (Math.sign(v_prev_y) === Math.sign(v_next_y)) {\n direction_eq = true;\n }\n }\n }\n\n if (direction_eq) {\n // console.log(\"Warning: lines are a straight sequence\");\n v_trans_x = -v_prev_y;\n v_trans_y = v_prev_x;\n shrink_by = Math.sqrt(v_prev_lensq);\n } else {\n // console.log(\"Warning: lines are a straight spike\");\n v_trans_x = v_prev_x;\n v_trans_y = v_prev_y;\n shrink_by = Math.sqrt(v_prev_lensq / 2);\n }\n }\n\n return new Vector2(v_trans_x / shrink_by, v_trans_y / shrink_by);\n }",
"totalLength(){\n\n let clen = 0;\n let pts;\n\n for(let i = 0; i < this.nCurves; i++){\n let idx = i*2;\n pts = [ p5.Vector.add(this.cpts[idx], this.cpts[idx+1]).mult(0.5),\n this.cpts[idx+1],\n this.cpts[idx+2],\n p5.Vector.add(this.cpts[idx+2], this.cpts[idx+3]).mult(0.5)\n ];\n \n clen += this.segmentLength(pts);\n }\n\n return clen;\n\n }",
"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 findDotPosition(lt,ln,r){\n var x = r * Math.cos(lt) * Math.sin(ln);\n var y = r * Math.sin(lt)\n var z = r * Math.cos(lt) * Math.cos(ln);\n return Array(Math.round(x), Math.round(y), Math.round(z));\n}",
"function reflect(r, it) {\n let d = r.as_dir();\n let n = it.m.get_normal(it.p, 0);\n let ddn = d.dot(n);\n let dx = d.x - 2*ddn*n.x;\n let dy = d.y - 2*ddn*n.y;\n\n let a1 = (dy - (it.p.y+r.off.y)) /\n (dx - (it.p.x+r.off.x));\n\n return new Vec2(1024*dx+it.p.x, 1024*dy+it.p.y);\n}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t\t\t//\n\t\t\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\t\t\tlet v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\t\t\tconst v_prev_x = inPt.x - inPrev.x,\n\t\t\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\t\t\tconst v_next_x = inNext.x - inPt.x,\n\t\t\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\t\t\tconst v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t\t\t// check for collinear edges\n\t\t\t\t\tconst collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t\t\t// not collinear\n\n\t\t\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\t\t\tconst v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\t\t\tconst v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\t\t\tconst ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\t\t\tconst ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\t\t\tconst ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\t\t\tconst ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\t\t\tconst sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t\t\t// but prevent crazy spikes\n\t\t\t\t\t\tconst v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\t\t\tlet direction_eq = false; // assumes: opposite\n\n\t\t\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t\t\t}",
"function point_offset(i) {\n return 4*i;\n }",
"get length() {\n return Math.sqrt(this.x * this.x + this.y * this.y);\n }",
"getLineParameters() {\n if (this.x1 !== this.x2) {\n this.a = ((this.y2 - this.y1)) / ((this.x1 - this.x2))\n this.b = 1.0\n this.c = this.a * this.x1 + this.b * this.y1\n }\n else {\n this.a = 1.0\n this.b = ((this.x1 - this.x2)) / ((this.y2 - this.y1))\n this.c = this.a * this.x1 + this.b * this.y1\n }\n }",
"static DistancePointToLine() {}",
"function getLineDistance(start, end) {\n // return Math.sqrt(Math.abs(start.x - end.x) ** 2 + Math.abs(start.y - end.y) ** 2);\n return Math.sqrt(Math.pow(Math.abs(start.x - end.x), 2) + Math.pow(Math.abs(start.y - end.y), 2));\n}",
"getLength() {\n var x1 = this.point1.getX();\n var y1 = this.point1.getY();\n var x2 = this.point2.getX();\n var y2 = this.point2.getY();\n return Math.hypot(x1 - x2, y1 - y2);\n }",
"function getBevelVec( inPt, inPrev, inNext ) {\r\n\r\n\t\t// computes for inPt the corresponding point inPt' on a new contour\r\n\t\t// shifted by 1 unit (length of normalized vector) to the left\r\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\r\n\t\t//\r\n\t\t// inPt' is the intersection of the two lines parallel to the two\r\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\r\n\r\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\r\n\r\n\t\t// good reading for geometry algorithms (here: line-line intersection)\r\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\r\n\r\n\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\r\n\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\r\n\r\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\r\n\r\n\t\t// check for collinear edges\r\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\r\n\r\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\r\n\r\n\t\t\t// not collinear\r\n\r\n\t\t\t// length of vectors for normalizing\r\n\r\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\r\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\r\n\r\n\t\t\t// shift adjacent points by unit vectors to the left\r\n\r\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\r\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\r\n\r\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\r\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\r\n\r\n\t\t\t// scaling factor for v_prev to intersection point\r\n\r\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\r\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\r\n\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\r\n\r\n\t\t\t// vector from inPt to intersection point\r\n\r\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\r\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\r\n\r\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\r\n\t\t\t// but prevent crazy spikes\r\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\r\n\t\t\tif ( v_trans_lensq <= 2 ) {\r\n\r\n\t\t\t\treturn\tnew THREE.Vector2( v_trans_x, v_trans_y );\r\n\r\n\t\t\t} else {\r\n\r\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\r\n\r\n\t\t\t}\r\n\r\n\t\t} else {\r\n\r\n\t\t\t// handle special case of collinear edges\r\n\r\n\t\t\tvar direction_eq = false;\t\t// assumes: opposite\r\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\r\n\r\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\r\n\r\n\t\t\t\t\tdirection_eq = true;\r\n\r\n\t\t\t\t}\r\n\r\n\t\t\t} else {\r\n\r\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\r\n\r\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\r\n\r\n\t\t\t\t\t\tdirection_eq = true;\r\n\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\r\n\r\n\t\t\t\t\t\tdirection_eq = true;\r\n\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\r\n\t\t\tif ( direction_eq ) {\r\n\r\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\r\n\t\t\t\tv_trans_x = - v_prev_y;\r\n\t\t\t\tv_trans_y = v_prev_x;\r\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\r\n\r\n\t\t\t} else {\r\n\r\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\r\n\t\t\t\tv_trans_x = v_prev_x;\r\n\t\t\t\tv_trans_y = v_prev_y;\r\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\r\n\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\treturn\tnew THREE.Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\r\n\r\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\r\n\r\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\r\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\r\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\r\n\t\t\t//\r\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\r\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\r\n\r\n\t\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\r\n\r\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\r\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\r\n\r\n\t\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\r\n\t\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\r\n\r\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\r\n\r\n\t\t\t// check for collinear edges\r\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\r\n\r\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\r\n\r\n\t\t\t\t// not collinear\r\n\r\n\t\t\t\t// length of vectors for normalizing\r\n\r\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\r\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\r\n\r\n\t\t\t\t// shift adjacent points by unit vectors to the left\r\n\r\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\r\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\r\n\r\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\r\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\r\n\r\n\t\t\t\t// scaling factor for v_prev to intersection point\r\n\r\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\r\n\t\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\r\n\t\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\r\n\r\n\t\t\t\t// vector from inPt to intersection point\r\n\r\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\r\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\r\n\r\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\r\n\t\t\t\t// but prevent crazy spikes\r\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\r\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\r\n\r\n\t\t\t\t\treturn\tnew THREE.Vector2( v_trans_x, v_trans_y );\r\n\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\r\n\r\n\t\t\t\t}\r\n\r\n\t\t\t} else {\r\n\r\n\t\t\t\t// handle special case of collinear edges\r\n\r\n\t\t\t\tvar direction_eq = false;\t\t// assumes: opposite\r\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\r\n\r\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\r\n\r\n\t\t\t\t\t\tdirection_eq = true;\r\n\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\r\n\r\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\r\n\r\n\t\t\t\t\t\t\tdirection_eq = true;\r\n\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t} else {\r\n\r\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\r\n\r\n\t\t\t\t\t\t\tdirection_eq = true;\r\n\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif ( direction_eq ) {\r\n\r\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\r\n\t\t\t\t\tv_trans_x = - v_prev_y;\r\n\t\t\t\t\tv_trans_y = v_prev_x;\r\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\r\n\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\r\n\t\t\t\t\tv_trans_x = v_prev_x;\r\n\t\t\t\t\tv_trans_y = v_prev_y;\r\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\r\n\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\r\n\t\t\treturn\tnew THREE.Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\r\n\r\n\t\t}",
"function t$f(t,l){const c=t.vertex.code;l.verticalOffsetEnabled?(t.vertex.uniforms.add(\"verticalOffset\",\"vec4\"),l.screenSizePerspectiveEnabled&&(t.include(r$d),t.vertex.uniforms.add(\"screenSizePerspectiveAlignment\",\"vec4\")),c.add(t$i`\n vec3 calculateVerticalOffset(vec3 worldPos, vec3 localOrigin) {\n float viewDistance = length((view * vec4(worldPos, 1.0)).xyz);\n ${1===l.viewingMode?t$i`vec3 worldNormal = normalize(worldPos + localOrigin);`:t$i`vec3 worldNormal = vec3(0.0, 0.0, 1.0);`}\n ${l.screenSizePerspectiveEnabled?t$i`\n float cosAngle = dot(worldNormal, normalize(worldPos - camPos));\n float verticalOffsetScreenHeight = screenSizePerspectiveScaleFloat(verticalOffset.x, abs(cosAngle), viewDistance, screenSizePerspectiveAlignment);`:t$i`\n float verticalOffsetScreenHeight = verticalOffset.x;`}\n // Screen sized offset in world space, used for example for line callouts\n float worldOffset = clamp(verticalOffsetScreenHeight * verticalOffset.y * viewDistance, verticalOffset.z, verticalOffset.w);\n return worldNormal * worldOffset;\n }\n\n vec3 addVerticalOffset(vec3 worldPos, vec3 localOrigin) {\n return worldPos + calculateVerticalOffset(worldPos, localOrigin);\n }\n `)):c.add(t$i`vec3 addVerticalOffset(vec3 worldPos, vec3 localOrigin) { return worldPos; }`);}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn\tnew Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn\tnew Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn\tnew Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn\tnew Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn\tnew Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn\tnew Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"getAngleOfLineBetweenPoints() {\n var xDiff = this.point2.getX() - this.point1.getX();\n var yDiff = this.point2.getY() - this.point1.getY();\n return Math.atan2(yDiff, xDiff);\n }",
"function rightAscension(l, b) { return atan(sin(l) * cos(e) - tan(b) * sin(e), cos(l)); }",
"function rightAscension(l, b) { return atan(sin(l) * cos(e) - tan(b) * sin(e), cos(l)); }",
"function getYOffset() {\n return container.offsetHeight + containerBottomMargin + containerTopMargin + canvasBorderTop + canvasBorderBottom;\n}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1; // resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1; // resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t\t//\n\t\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\t\tlet v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\t\tconst v_prev_x = inPt.x - inPrev.x,\n\t\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\t\tconst v_next_x = inNext.x - inPt.x,\n\t\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\t\tconst v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t\t// check for collinear edges\n\t\t\t\tconst collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t\t// not collinear\n\n\t\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\t\tconst v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\t\tconst v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\t\tconst ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\t\tconst ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\t\tconst ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\t\tconst ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\t\tconst sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t\t// but prevent crazy spikes\n\t\t\t\t\tconst v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\t\tlet direction_eq = false; // assumes: opposite\n\n\t\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t\t}",
"function vector(angle, radius) {\n const offset = (angle === 30) ? [1, 2] : (angle === 90) ? [2, 0] : (angle === 120) ? [1, -2] : null;\n offset.forEach(function(value, i) { offset[i] *= radius; });\n return offset;\n}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t\t//\n\t\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\t\tvar v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt\n\n\t\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\t\tvar v_prev_x = inPt.x - inPrev.x,\n\t\t\t\tv_prev_y = inPt.y - inPrev.y;\n\t\t\tvar v_next_x = inNext.x - inPt.x,\n\t\t\t\tv_next_y = inNext.y - inPt.y;\n\n\t\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t\t// check for collinear edges\n\t\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t\t// not collinear\n\n\t\t\t\t// length of vectors for normalizing\n\n\t\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t\t// vector from inPt to intersection point\n\n\t\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t\t// but prevent crazy spikes\n\t\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\t\treturn new Vector2( v_trans_x, v_trans_y );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// handle special case of collinear edges\n\n\t\t\t\tvar direction_eq = false; // assumes: opposite\n\t\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tif ( direction_eq ) {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t\t}",
"function surface_offset(x, y)\n{\n\t//post('plinko offset', x, y, '\\n');\n\ts_offset = [x, y];\n}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn\tnew Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn\tnew Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn\tnew THREE.Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn\tnew THREE.Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn\tnew THREE.Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn\tnew THREE.Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn\tnew Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn\tnew Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}",
"function getBevelVec( inPt, inPrev, inNext ) {\n\n\t\t// computes for inPt the corresponding point inPt' on a new contour\n\t\t// shifted by 1 unit (length of normalized vector) to the left\n\t\t// if we walk along contour clockwise, this new contour is outside the old one\n\t\t//\n\t\t// inPt' is the intersection of the two lines parallel to the two\n\t\t// adjacent edges of inPt at a distance of 1 unit on the left side.\n\n\t\tvar v_trans_x, v_trans_y, shrink_by = 1;\t\t// resulting translation vector for inPt\n\n\t\t// good reading for geometry algorithms (here: line-line intersection)\n\t\t// http://geomalgorithms.com/a05-_intersect-1.html\n\n\t\tvar v_prev_x = inPt.x - inPrev.x, v_prev_y = inPt.y - inPrev.y;\n\t\tvar v_next_x = inNext.x - inPt.x, v_next_y = inNext.y - inPt.y;\n\n\t\tvar v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );\n\n\t\t// check for collinear edges\n\t\tvar collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\tif ( Math.abs( collinear0 ) > Number.EPSILON ) {\n\n\t\t\t// not collinear\n\n\t\t\t// length of vectors for normalizing\n\n\t\t\tvar v_prev_len = Math.sqrt( v_prev_lensq );\n\t\t\tvar v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );\n\n\t\t\t// shift adjacent points by unit vectors to the left\n\n\t\t\tvar ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );\n\t\t\tvar ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );\n\n\t\t\tvar ptNextShift_x = ( inNext.x - v_next_y / v_next_len );\n\t\t\tvar ptNextShift_y = ( inNext.y + v_next_x / v_next_len );\n\n\t\t\t// scaling factor for v_prev to intersection point\n\n\t\t\tvar sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -\n\t\t\t\t\t\t( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /\n\t\t\t\t\t ( v_prev_x * v_next_y - v_prev_y * v_next_x );\n\n\t\t\t// vector from inPt to intersection point\n\n\t\t\tv_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );\n\t\t\tv_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );\n\n\t\t\t// Don't normalize!, otherwise sharp corners become ugly\n\t\t\t// but prevent crazy spikes\n\t\t\tvar v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );\n\t\t\tif ( v_trans_lensq <= 2 ) {\n\n\t\t\t\treturn\tnew Vector2( v_trans_x, v_trans_y );\n\n\t\t\t} else {\n\n\t\t\t\tshrink_by = Math.sqrt( v_trans_lensq / 2 );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// handle special case of collinear edges\n\n\t\t\tvar direction_eq = false;\t\t// assumes: opposite\n\t\t\tif ( v_prev_x > Number.EPSILON ) {\n\n\t\t\t\tif ( v_next_x > Number.EPSILON ) {\n\n\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tif ( v_prev_x < - Number.EPSILON ) {\n\n\t\t\t\t\tif ( v_next_x < - Number.EPSILON ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else {\n\n\t\t\t\t\tif ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {\n\n\t\t\t\t\t\tdirection_eq = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( direction_eq ) {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight sequence\");\n\t\t\t\tv_trans_x = - v_prev_y;\n\t\t\t\tv_trans_y = v_prev_x;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq );\n\n\t\t\t} else {\n\n\t\t\t\t// console.log(\"Warning: lines are a straight spike\");\n\t\t\t\tv_trans_x = v_prev_x;\n\t\t\t\tv_trans_y = v_prev_y;\n\t\t\t\tshrink_by = Math.sqrt( v_prev_lensq / 2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn\tnew Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );\n\n\t}"
] |
[
"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.50747734",
"0.5045306",
"0.50257725",
"0.50113297",
"0.5009223",
"0.49981377",
"0.4997953",
"0.49835432",
"0.49831185",
"0.4977358",
"0.4967447",
"0.49613354",
"0.4957923",
"0.4954629",
"0.49511796",
"0.49333426",
"0.49299115",
"0.4899726",
"0.48695374",
"0.48582122",
"0.48573563",
"0.48207012",
"0.48192826",
"0.47923183",
"0.4790656",
"0.4778463",
"0.4767488",
"0.47526667",
"0.4736803",
"0.4736803",
"0.47256994",
"0.4722919",
"0.4722457",
"0.47215927",
"0.47153348",
"0.4715044",
"0.47142485",
"0.46863297",
"0.46818534",
"0.46770817",
"0.46768257",
"0.4668548",
"0.46615916",
"0.465953",
"0.46571895",
"0.46533102",
"0.46474192",
"0.46439418",
"0.46307787",
"0.46306756",
"0.46282792",
"0.46273986",
"0.4620566",
"0.4620025",
"0.4615993",
"0.4615993",
"0.4615993",
"0.4611322",
"0.46093988",
"0.46093988",
"0.46005428",
"0.4597532",
"0.4597532",
"0.459745",
"0.4596347",
"0.45928186",
"0.45928186",
"0.45928186",
"0.45928186",
"0.45928186",
"0.45928186",
"0.45928186",
"0.45928186",
"0.45928186",
"0.4590718",
"0.4588986",
"0.4588986",
"0.4588986",
"0.4588986",
"0.4588986"
] |
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;return h?(3*(that._y1-that._y0)/h-t)/2:t}",
"function d4_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function getSlope(aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function d3_v3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }",
"function d3_svg_lineMonotoneTangents(points) {\n var tangents = [],\n d,\n a,\n b,\n s,\n m = d3_svg_lineFiniteDifferences(points),\n i = -1,\n j = points.length - 1;\n\n // The first two steps are done by computing finite-differences:\n // 1. Compute the slopes of the secant lines between successive points.\n // 2. Initialize the tangents at every point as the average of the secants.\n\n // Then, for each segment…\n while (++i < j) {\n d = d3_svg_lineSlope(points[i], points[i + 1]);\n\n // 3. If two successive yk = y{k + 1} are equal (i.e., d is zero), then set\n // mk = m{k + 1} = 0 as the spline connecting these points must be flat to\n // preserve monotonicity. Ignore step 4 and 5 for those k.\n\n if (Math.abs(d) < 1e-6) {\n m[i] = m[i + 1] = 0;\n } else {\n // 4. Let ak = mk / dk and bk = m{k + 1} / dk.\n a = m[i] / d;\n b = m[i + 1] / d;\n\n // 5. Prevent overshoot and ensure monotonicity by restricting the\n // magnitude of vector <ak, bk> to a circle of radius 3.\n s = a * a + b * b;\n if (s > 9) {\n s = d * 3 / Math.sqrt(s);\n m[i] = s * a;\n m[i + 1] = s * b;\n }\n }\n }\n\n // Compute the normalized tangent vector from the slopes. Note that if x is\n // not monotonic, it's possible that the slope will be infinite, so we protect\n // against NaN by setting the coordinate to zero.\n i = -1; while (++i <= j) {\n s = (points[Math.min(j, i + 1)][0] - points[Math.max(0, i - 1)][0])\n / (6 * (1 + m[i] * m[i]));\n tangents.push([s || 0, m[i] * s || 0]);\n }\n\n return tangents;\n}",
"function d3_svg_lineMonotoneTangents(points) {\n var tangents = [],\n d,\n a,\n b,\n s,\n m = d3_svg_lineFiniteDifferences(points),\n i = -1,\n j = points.length - 1;\n\n // The first two steps are done by computing finite-differences:\n // 1. Compute the slopes of the secant lines between successive points.\n // 2. Initialize the tangents at every point as the average of the secants.\n\n // Then, for each segment…\n while (++i < j) {\n d = d3_svg_lineSlope(points[i], points[i + 1]);\n\n // 3. If two successive yk = y{k + 1} are equal (i.e., d is zero), then set\n // mk = m{k + 1} = 0 as the spline connecting these points must be flat to\n // preserve monotonicity. Ignore step 4 and 5 for those k.\n\n if (Math.abs(d) < 1e-6) {\n m[i] = m[i + 1] = 0;\n } else {\n // 4. Let ak = mk / dk and bk = m{k + 1} / dk.\n a = m[i] / d;\n b = m[i + 1] / d;\n\n // 5. Prevent overshoot and ensure monotonicity by restricting the\n // magnitude of vector <ak, bk> to a circle of radius 3.\n s = a * a + b * b;\n if (s > 9) {\n s = d * 3 / Math.sqrt(s);\n m[i] = s * a;\n m[i + 1] = s * b;\n }\n }\n }\n\n // Compute the normalized tangent vector from the slopes. Note that if x is\n // not monotonic, it's possible that the slope will be infinite, so we protect\n // against NaN by setting the coordinate to zero.\n i = -1; while (++i <= j) {\n s = (points[Math.min(j, i + 1)][0] - points[Math.max(0, i - 1)][0])\n / (6 * (1 + m[i] * m[i]));\n tangents.push([s || 0, m[i] * s || 0]);\n }\n\n return tangents;\n}",
"function d3_svg_lineMonotoneTangents(points) {\n var tangents = [],\n d,\n a,\n b,\n s,\n m = d3_svg_lineFiniteDifferences(points),\n i = -1,\n j = points.length - 1;\n\n // The first two steps are done by computing finite-differences:\n // 1. Compute the slopes of the secant lines between successive points.\n // 2. Initialize the tangents at every point as the average of the secants.\n\n // Then, for each segment…\n while (++i < j) {\n d = d3_svg_lineSlope(points[i], points[i + 1]);\n\n // 3. If two successive yk = y{k + 1} are equal (i.e., d is zero), then set\n // mk = m{k + 1} = 0 as the spline connecting these points must be flat to\n // preserve monotonicity. Ignore step 4 and 5 for those k.\n\n if (Math.abs(d) < 1e-6) {\n m[i] = m[i + 1] = 0;\n } else {\n // 4. Let ak = mk / dk and bk = m{k + 1} / dk.\n a = m[i] / d;\n b = m[i + 1] / d;\n\n // 5. Prevent overshoot and ensure monotonicity by restricting the\n // magnitude of vector <ak, bk> to a circle of radius 3.\n s = a * a + b * b;\n if (s > 9) {\n s = d * 3 / Math.sqrt(s);\n m[i] = s * a;\n m[i + 1] = s * b;\n }\n }\n }\n\n // Compute the normalized tangent vector from the slopes. Note that if x is\n // not monotonic, it's possible that the slope will be infinite, so we protect\n // against NaN by setting the coordinate to zero.\n i = -1; while (++i <= j) {\n s = (points[Math.min(j, i + 1)][0] - points[Math.max(0, i - 1)][0]) / (6 * (1 + m[i] * m[i]));\n tangents.push([s || 0, m[i] * s || 0]);\n }\n\n return tangents;\n}",
"function d4_svg_lineMonotoneTangents(points) {\n var tangents = [],\n d,\n a,\n b,\n s,\n m = d4_svg_lineFiniteDifferences(points),\n i = -1,\n j = points.length - 1;\n\n // The first two steps are done by computing finite-differences:\n // 1. Compute the slopes of the secant lines between successive points.\n // 2. Initialize the tangents at every point as the average of the secants.\n\n // Then, for each segment…\n while (++i < j) {\n d = d4_svg_lineSlope(points[i], points[i + 1]);\n\n // 3. If two successive yk = y{k + 1} are equal (i.e., d is zero), then set\n // mk = m{k + 1} = 0 as the spline connecting these points must be flat to\n // preserve monotonicity. Ignore step 4 and 5 for those k.\n\n if (Math.abs(d) < 1e-6) {\n m[i] = m[i + 1] = 0;\n } else {\n // 4. Let ak = mk / dk and bk = m{k + 1} / dk.\n a = m[i] / d;\n b = m[i + 1] / d;\n\n // 5. Prevent overshoot and ensure monotonicity by restricting the\n // magnitude of vector <ak, bk> to a circle of radius 3.\n s = a * a + b * b;\n if (s > 9) {\n s = d * 3 / Math.sqrt(s);\n m[i] = s * a;\n m[i + 1] = s * b;\n }\n }\n }\n\n // Compute the normalized tangent vector from the slopes. Note that if x is\n // not monotonic, it's possible that the slope will be infinite, so we protect\n // against NaN by setting the coordinate to zero.\n i = -1; while (++i <= j) {\n s = (points[Math.min(j, i + 1)][0] - points[Math.max(0, i - 1)][0]) / (6 * (1 + m[i] * m[i]));\n tangents.push([s || 0, m[i] * s || 0]);\n }\n\n return tangents;\n}",
"function d3_v3_svg_lineMonotoneTangents(points) {\n var tangents = [],\n d,\n a,\n b,\n s,\n m = d3_v3_svg_lineFiniteDifferences(points),\n i = -1,\n j = points.length - 1;\n\n // The first two steps are done by computing finite-differences:\n // 1. Compute the slopes of the secant lines between successive points.\n // 2. Initialize the tangents at every point as the average of the secants.\n\n // Then, for each segment…\n while (++i < j) {\n d = d3_v3_svg_lineSlope(points[i], points[i + 1]);\n\n // 3. If two successive yk = y{k + 1} are equal (i.e., d is zero), then set\n // mk = m{k + 1} = 0 as the spline connecting these points must be flat to\n // preserve monotonicity. Ignore step 4 and 5 for those k.\n\n if (Math.abs(d) < 1e-6) {\n m[i] = m[i + 1] = 0;\n } else {\n // 4. Let ak = mk / dk and bk = m{k + 1} / dk.\n a = m[i] / d;\n b = m[i + 1] / d;\n\n // 5. Prevent overshoot and ensure monotonicity by restricting the\n // magnitude of vector <ak, bk> to a circle of radius 3.\n s = a * a + b * b;\n if (s > 9) {\n s = d * 3 / Math.sqrt(s);\n m[i] = s * a;\n m[i + 1] = s * b;\n }\n }\n }\n\n // Compute the normalized tangent vector from the slopes. Note that if x is\n // not monotonic, it's possible that the slope will be infinite, so we protect\n // against NaN by setting the coordinate to zero.\n i = -1; while (++i <= j) {\n s = (points[Math.min(j, i + 1)][0] - points[Math.max(0, i - 1)][0])\n / (6 * (1 + m[i] * m[i]));\n tangents.push([s || 0, m[i] * s || 0]);\n }\n\n return tangents;\n}",
"function getSlope(aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n}",
"function getSlope(aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n}",
"function getSlope(aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n}",
"function getSlope (aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n}",
"function visualizeSlopes(svg, render) {\n var h = render.h;\n var strokes = [];\n var r = 0.25 / Math.sqrt(h.length);\n for (var i = 0; i < h.length; i++) {\n if (h[i] <= 0 || isnearedge(h.mesh, i)) continue;\n var nbs = neighbours(h.mesh, i);\n nbs.push(i);\n var s = 0;\n var s2 = 0;\n for (var j = 0; j < nbs.length; j++) {\n var slopes = trislope(h, nbs[j]);\n s += slopes[0] / 10;\n s2 += slopes[1];\n }\n s /= nbs.length;\n s2 /= nbs.length;\n if (Math.abs(s) < runif(0.1, 0.4)) continue;\n var l = r * runif(1, 2) * (1 - 0.2 * Math.pow(Math.atan(s), 2)) * Math.exp(s2 / 100);\n var x = h.mesh.vxs[i][0];\n var y = h.mesh.vxs[i][1];\n if (Math.abs(l * s) > 2 * r) {\n var n = Math.floor(Math.abs(l * s / r));\n l /= n;\n if (n > 4) n = 4;\n for (var j = 0; j < n; j++) {\n var u = rnorm() * r;\n var v = rnorm() * r;\n strokes.push([\n [x + u - l, y + v + l * s],\n [x + u + l, y + v - l * s]\n ]);\n }\n } else {\n strokes.push([\n [x - l, y + l * s],\n [x + l, y - l * s]\n ]);\n }\n }\n var lines = svg.selectAll('line.slope').data(strokes)\n lines.enter()\n .append('line')\n .classed('slope', true);\n lines.exit()\n .remove();\n svg.selectAll('line.slope')\n .attr('x1', function(d) {\n return 1000 * d[0][0]\n })\n .attr('y1', function(d) {\n return 1000 * d[0][1]\n })\n .attr('x2', function(d) {\n return 1000 * d[1][0]\n })\n .attr('y2', function(d) {\n return 1000 * d[1][1]\n })\n }",
"static getSlope(aT, aA1, aA2) {\n return 3.0 * this.A(aA1, aA2) * aT * aT + 2.0 * this.B(aA1, aA2) * aT + this.C(aA1);\n }",
"function getSlope(aT, aA1, aA2) {\n return 3 * A(aA1, aA2) * aT * aT + 2 * B(aA1, aA2) * aT + C(aA1);\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function GetSlope(aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n }",
"function GetSlope(aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n }",
"function getSlope (aT, aA1, aA2) {\r\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\r\n }",
"function getSlope (aT, aA1, aA2) {\r\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\r\n }",
"function getSlope (aT, aA1, aA2) {\r\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\r\n }",
"function accumulate_tangent(v) {\n vec3.sub(p01, v[1].position, v[0].position);\n vec3.sub(p02, v[2].position, v[0].position);\n\n vec3.sub(t01, v[1].texcoord, v[0].texcoord);\n vec3.sub(t02, v[2].texcoord, v[0].texcoord);\n\n var r = 1.0 / (t01[0]*t02[1] - t02[0]*t01[1]);\n\n sdir[0] = r * (t02[1]*p01[0] - t01[1]*p02[0]);\n sdir[1] = r * (t02[1]*p01[1] - t01[1]*p02[1]);\n sdir[2] = r * (t02[1]*p01[2] - t01[1]*p02[2]);\n\n //tdir[0] = r * (t02[0]*p02[0] - t01[0]*p01[0]);\n //tdir[1] = r * (t02[0]*p02[1] - t01[0]*p01[1]);\n //tdir[2] = r * (t02[0]*p02[2] - t01[0]*p01[2]);\n\n for (var i = 0; i < 3; ++i) {\n vec3.add(v[i].tangent, v[i].tangent, sdir);\n //vec3.add(v[i].bitangent, v[i].bitangent, tdir);\n }\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function getSlope (aT, aA1, aA2) {\n return 3.0 * A(aA1, aA2)*aT*aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\n }"
] |
[
"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.6233702",
"0.6233702",
"0.62274396",
"0.6181955",
"0.61120456",
"0.6102335",
"0.6082941",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60512716",
"0.60500515",
"0.60500515",
"0.60488415",
"0.60488415",
"0.60488415",
"0.599808",
"0.59881663",
"0.59881663",
"0.59881663",
"0.59881663",
"0.598446"
] |
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) / (b.x - a.x);\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) / (b.x - a.x);\n }",
"function d4_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 d3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function calcSlope(a, b) {\n return ((b.y - a.y)/(b.x - a.x));\n}",
"function slope(serie,startBarsAgo,endBarsAgo){\n\t\tvar dx = startBarsAgo - endBarsAgo;\n\t\tvar dy = diffSeries(barsAgo(serie,endBarsAgo), barsAgo(serie,startBarsAgo));\n\t\t\t\t\n\t\treturn div(dy,dx);\n\t}",
"function slope2(that,t){var h=that._x1-that._x0;return h?(3*(that._y1-that._y0)/h-t)/2:t}",
"function calculateSlope(point1, point2) {\n var deltaX = point2[0] - point1[0];\n var deltaY = point2[1] - point1[1];\n var slope = deltaY / deltaX;\n slope *= 100;\n return slope;\n}",
"function d3_v3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function slopeFormula(x1, y1, x2, y2) {\r\n return(y2 - y1) / (x2 - x1);\r\n\r\n}",
"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;}// Calculate a one-sided slope.",
"function getSlope(a, b) {\n return (b.y - a.y) / (b.x - a.x);\n}",
"function slope(x1, y1, x2, y2) {\n\n var dx = (x2 - x1);\n var dy = (y2 - y1);\n\n return Math.atan2(dy, dx);\n}",
"function slope(x1, y1, x2, y2) {\n\n var dx = (x2 - x1);\n var dy = (y2 - y1);\n\n return Math.atan2(dy, dx);\n}",
"function slopeFromPoints([x1, y1], [x2, y2]) {\n return (y2 - y1) / (x2 - x1);\n}",
"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),.5*Math.abs(p))||0}",
"function pointSlopeForm(x1,y1,slope,x=[]){\n //returns y values\n var y = [];\n\n for(var i = 0; i<x.length;i++){\n var foo = slope*(x[i]-x1)+y1;\n y.push(foo);\n }\n return(y);\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}",
"function slope3(that, x2, y2) {\n var h0 = that._x1 - that._x0,\n h1 = x2 - that._x1,\n s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),\n s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),\n p = (s0 * h1 + s1 * h0) / (h0 + h1);\n return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;\n} // Calculate a one-sided slope.",
"function slope3(that, x2, y2) {\n var h0 = that._x1 - that._x0,\n h1 = x2 - that._x1,\n s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),\n s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),\n p = (s0 * h1 + s1 * h0) / (h0 + h1);\n return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;\n} // Calculate a one-sided slope.",
"function slope3(that, x2, y2) {\n var h0 = that._x1 - that._x0,\n h1 = x2 - that._x1,\n s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),\n s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),\n p = (s0 * h1 + s1 * h0) / (h0 + h1);\n return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;\n} // Calculate a one-sided slope.",
"function slope3(that, x2, y2) {\n var h0 = that._x1 - that._x0,\n h1 = x2 - that._x1,\n s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),\n s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),\n p = (s0 * h1 + s1 * h0) / (h0 + h1);\n return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;\n} // Calculate a one-sided slope.",
"function slope3(that, x2, y2) {\n var h0 = that._x1 - that._x0,\n h1 = x2 - that._x1,\n s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),\n s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),\n p = (s0 * h1 + s1 * h0) / (h0 + h1);\n return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;\n} // Calculate a one-sided slope.",
"function slope2(that, t) {\n\t var h = that._x1 - that._x0;\n\t return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n\t }",
"function slope2(that, t) {\n\t var h = that._x1 - that._x0;\n\t return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n\t }",
"function slope2(that, t) {\n\t var h = that._x1 - that._x0;\n\t return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n\t }",
"function slope2(that, t) {\n\t var h = that._x1 - that._x0;\n\t return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n\t }",
"function getSlopeY(x) {\n return first_y_px + ((x - first_x_px) * slope);\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }",
"function slope2(that, t) {\n var h = that._x1 - that._x0;\n return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n }"
] |
[
"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.66470927",
"0.6578327",
"0.65572107",
"0.65572107",
"0.65572107",
"0.65572107",
"0.65572107",
"0.6549859",
"0.6549859",
"0.6549859",
"0.6549859",
"0.65459734",
"0.65362406",
"0.65362406",
"0.65362406",
"0.65362406",
"0.65361243"
] |
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) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function hasOwn$2(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function _has(obj, key) {\n\t return Object.prototype.hasOwnProperty.call(obj, key);\n\t }",
"function hasOwn(obj,key){\nreturn Object.prototype.hasOwnProperty.call(obj,key);\n}",
"function hasOwn$3(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function hasKey(obj, key) {\n console.log(obj.hasOwnProperty(key))\n return obj.hasOwnProperty(key)\n}",
"__key_in_object(object, key) {\n if (Object.prototype.hasOwnProperty.call(object, key)) {\n return true\n } else {\n return false\n }\n }",
"function contains(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function contains(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function contains(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function contains(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function contains(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function hasOwn(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n\t return Object.prototype.hasOwnProperty.call(obj, prop);\n\t}",
"function contains$2(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function hasOwnProperty$1(obj, key) {\n\t return Object.prototype.hasOwnProperty.call(obj, key);\n\t}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function contains(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}",
"function hasProperty(obj, prop) {\n return obj.hasOwnProperty(prop);\n}",
"function hasOwn$5(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function has(obj, key) {\n return key in obj\n}",
"function hasKey(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n}",
"function hasOwnProperty(obj, key) {\n return {}.hasOwnProperty.call(obj, key);\n }",
"has(obj, key) {\n return obj.hasOwnProperty(key);\n }",
"function hasOwnProperty(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function hasOwnProperty(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function has(obj, key) {\n return ({}).hasOwnProperty.call(obj, key);\n}",
"function has(obj, key) {\n return ({}).hasOwnProperty.call(obj, key);\n}",
"function has(obj, key) {\n return ({}).hasOwnProperty.call(obj, key);\n}",
"function has(obj, key) {\n if (!is_1.isObject(obj) || (!is_1.isArray(key) && !is_1.isString(key)))\n return false;\n obj = assign({}, obj);\n var props = is_1.isArray(key) ? key : string_1.split(key);\n while (props.length && obj) {\n var prop = props.shift();\n var match = matchIndex(prop);\n if (!props.length) { // no more props chek path.\n var _keys = array_1.keys(obj);\n if (match) {\n return array_1.contains(_keys, match.name) && is_1.isValue(obj[match.name][match.index]);\n }\n else {\n return array_1.contains(_keys, prop);\n }\n }\n if (match) {\n /* istanbul ignore next */\n if (!is_1.isUndefined(obj[match.name])) {\n obj = obj[match.name][match.index];\n // iterate each indices and set obj to that index.\n match.indices.forEach(function (i) { return obj = obj[i]; });\n }\n }\n else {\n obj = obj[prop];\n }\n }\n}",
"function has(obj, key) {\n return {}.hasOwnProperty.call(obj, key);\n}",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n }",
"has(obj, key){\n if ( obj.hasOwnProperty(key) ) {\n return true;\n } else return false;\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }"
] |
[
"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.72887254",
"0.72887254",
"0.72887254",
"0.72887254",
"0.72887254",
"0.72887254",
"0.72887254",
"0.72887254",
"0.72887254",
"0.7287988",
"0.7243681",
"0.72228754",
"0.7216456",
"0.720745",
"0.71813744",
"0.7179362",
"0.7179362",
"0.71740085",
"0.71740085",
"0.71740085",
"0.7168862",
"0.715299",
"0.71485645",
"0.71485645",
"0.71485645",
"0.71485645",
"0.71485645",
"0.71485645",
"0.71485645",
"0.71485645",
"0.71485645",
"0.7129383",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416",
"0.71185416"
] |
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;\n}",
"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;}}",
"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;}}",
"function is_dom_element(obj) {\n return !!(obj && obj.nodeType === 1);\n}",
"function containsNode(outerNode: ?Node, innerNode: ?Node): boolean {\n if (!outerNode || !innerNode) {\n return false;\n } else if (outerNode === innerNode) {\n return true;\n } else if (isTextNode(outerNode)) {\n return false;\n } else if (isTextNode(innerNode)) {\n return containsNode(outerNode, innerNode.parentNode);\n } else if ('contains' in outerNode) {\n return outerNode.contains(innerNode);\n } else if (outerNode.compareDocumentPosition) {\n return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n } else {\n return false;\n }\n}",
"function uunodehas(node, // @param Node: child node\r\n context) { // @param Node: context(parent) node\r\n // @return Boolean:\r\n for (var c = node; c && c !== context;) {\r\n c = c.parentNode;\r\n }\r\n return node !== context && c === context;\r\n}",
"function isElement(o) {\n return !!o && o.nodeType === 1;\n}",
"function isElement(value) { return Boolean(value) && value.nodeType === 1; }",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n }",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n}",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n}",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n}",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n}",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n}",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement || node instanceof HTMLElement;\n}",
"function isHTMLElement(node) {\n var OwnElement = getWindow(node).HTMLElement;\n return node instanceof OwnElement;\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n}",
"function isNode(o){\n return (\n typeof Node === \"object\" ? o instanceof Node : \n o && typeof o === \"object\" && typeof o.nodeType === \"number\" && typeof o.nodeName===\"string\"\n );\n}",
"isNodeOrChildOf(otherNode) {\n let current = this;\n while (current) {\n if (current === otherNode) {\n return true;\n }\n current = current.parent;\n }\n return false;\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n }",
"function isElement(obj) {\n return obj instanceof selection || typeof HTMLElement === 'object'\n ? obj instanceof HTMLElement // DOM2\n : obj && typeof obj === 'object' && obj !== null && obj.nodeType === 1 && typeof obj.nodeName === 'string';\n }",
"_isElementNode(element) {\n return element.nodeType === this._document.ELEMENT_NODE;\n }",
"function _isNode(o){\n return (\n typeof Node === \"object\" ? o instanceof Node : \n o && typeof o === \"object\" && typeof o.nodeType === \"number\" && typeof o.nodeName===\"string\"\n );\n }",
"function containsNode(outerNode, innerNode) {\n\t\t if (!outerNode || !innerNode) {\n\t\t return false;\n\t\t } else if (outerNode === innerNode) {\n\t\t return true;\n\t\t } else if (isTextNode(outerNode)) {\n\t\t return false;\n\t\t } else if (isTextNode(innerNode)) {\n\t\t return containsNode(outerNode, innerNode.parentNode);\n\t\t } else if ('contains' in outerNode) {\n\t\t return outerNode.contains(innerNode);\n\t\t } else if (outerNode.compareDocumentPosition) {\n\t\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t\t } else {\n\t\t return false;\n\t\t }\n\t\t}",
"function containsNode(outerNode, innerNode) {\n\t\t if (!outerNode || !innerNode) {\n\t\t return false;\n\t\t } else if (outerNode === innerNode) {\n\t\t return true;\n\t\t } else if (isTextNode(outerNode)) {\n\t\t return false;\n\t\t } else if (isTextNode(innerNode)) {\n\t\t return containsNode(outerNode, innerNode.parentNode);\n\t\t } else if ('contains' in outerNode) {\n\t\t return outerNode.contains(innerNode);\n\t\t } else if (outerNode.compareDocumentPosition) {\n\t\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t\t } else {\n\t\t return false;\n\t\t }\n\t\t}",
"function isElement(node) {\n var OwnElement = getWindow(node).Element;\n return node instanceof OwnElement || node instanceof Element;\n}",
"function isElement(node) {\n var OwnElement = getWindow(node).Element;\n return node instanceof OwnElement || node instanceof Element;\n}",
"function isElement(o){\n return (\n typeof HTMLElement === \"object\" ? o instanceof HTMLElement : //DOM2\n o && typeof o === \"object\" && o !== null && o.nodeType === 1 && typeof o.nodeName===\"string\"\n);\n}",
"function _isElement(o){\n return (\n typeof HTMLElement === \"object\" ? o instanceof HTMLElement : //DOM2\n o && typeof o === \"object\" && o.nodeType === 1 && typeof o.nodeName===\"string\"\n );\n }",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n }",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function containsNode(outerNode, innerNode) {\n\t if (!outerNode || !innerNode) {\n\t return false;\n\t } else if (outerNode === innerNode) {\n\t return true;\n\t } else if (isTextNode(outerNode)) {\n\t return false;\n\t } else if (isTextNode(innerNode)) {\n\t return containsNode(outerNode, innerNode.parentNode);\n\t } else if ('contains' in outerNode) {\n\t return outerNode.contains(innerNode);\n\t } else if (outerNode.compareDocumentPosition) {\n\t return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n\t } else {\n\t return false;\n\t }\n\t}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}",
"function contains(context, node) {\n if (context.contains) return context.contains(node);\n if (context.compareDocumentPosition) return context === node || !!(context.compareDocumentPosition(node) & 16);\n}"
] |
[
"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.6622063",
"0.6622063",
"0.6622063",
"0.6622063",
"0.6622063",
"0.6622063",
"0.6622063",
"0.6622063",
"0.6597631",
"0.6597445",
"0.6593475",
"0.6587775",
"0.6587775",
"0.6575584",
"0.6575584",
"0.6571374",
"0.65623546",
"0.6561478",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6560876",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896",
"0.6556896"
] |
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 server to access\n // the session\n xfbml : true, // parse social plugins on this page\n version : 'v2.1' // use version 2.1\n });\n \n window.FB.getLoginStatus(function(response) {\n // upon opening the ma\n if (response.status === \"connected\") {\n loadStream(response);\n }\n }.bind(this));\n }.bind(this);\n } else {\n window.FB.getLoginStatus(function(response) {\n console.log(\"getting status\");\n this.initiateLoginOrLogout(response);\n }.bind(this));\n }\n\n // Load the SDK asynchronously\n (function(d, s, id) {\n var js, fjs = d.getElementsByTagName(s)[0];\n if (d.getElementById(id)) return;\n js = d.createElement(s); js.id = id;\n js.src = \"//connect.facebook.net/en_US/sdk.js\";\n fjs.parentNode.insertBefore(js, fjs);\n }(document, 'script', 'facebook-jssdk'));\n }",
"function facebookLogin()\r\n{\r\n var fb = FBConnect.install();\r\n fb.connect(client_id,redir_url,\"touch\");\r\n fb.onConnect = onFBConnected;\r\n \r\n}",
"componentDidMount() {\n\n\t window.fbAsyncInit = function() {\n\t window.FB.init({\n\t appId : '1250815578279698',\n\t cookie : true, // enable cookies to allow the server to access\n\t // the session\n\t xfbml : true, // parse social plugins on this page\n\t version : 'v2.11' // use version 2.1\n\t });\n\n //window.FB.Event.subscribe('auth.statusChange', this.statusChangeCallback());\n /* comment by bipin: it redirect if user is logged in fb */\n\t // window.FB.getLoginStatus(function(response) {\n\t // this.statusChangeCallback(response);\n\t // }.bind(this));\n\t }.bind(this);\n\n // Load the SDK asynchronously\n\t (function(d, s, id) {\n\t var js, fjs = d.getElementsByTagName(s)[0];\n\t if (d.getElementById(id)) return;\n\t js = d.createElement(s); js.id = id;js.async = true;\n\t js.src = \"https://connect.facebook.net/en_GB/sdk.js#xfbml=1&version=v2.11\";\n\t fjs.parentNode.insertBefore(js, fjs);\n\t }(document, 'script', 'facebook-jssdk'));\n\t}",
"componentDidMount(){\n (function(d, s, id) {\n var js, fjs = d.getElementsByTagName(s)[0];\n if (d.getElementById(id)) return;\n js = d.createElement(s); js.id = id;\n js.src = \"https://connect.facebook.net/en_US/sdk.js\";\n fjs.parentNode.insertBefore(js, fjs);\n }(document, 'script', 'facebook-jssdk'));\n \n window.fbAsyncInit = function() {\n window.FB.init({\n appId : '207358966557597', /* Our specific APP id */\n cookie : true, \n xfbml : true, \n version : 'v2.8' \n });\n\n /* This might be a duplicate of above checkLoginState, but need to investigate */\n FB.getLoginStatus(function(response) {\n this.statusChangeCallback(response);\n }.bind(this));\n }.bind(this)\n }",
"loginWithFacebook(){\n LoginManager.logInWithReadPermissions(['public_profile']).then(loginResult => {\n if (loginResult.isCancelled) {\n console.log('user canceled');\n return;\n }\n AccessToken.getCurrentAccessToken()\n .then(accessTokenData => {\n const credential = this.props.provider.credential(accessTokenData.accessToken);\n return auth.signInWithCredential(credential);\n })\n .then(credData => {\n console.log(credData);\n })\n .catch(err => {\n console.log(err);\n });\n });\n\n }",
"componentWillUnmount() {\n //disconnect from FB\n }",
"function auth_Facebook()\n{\n authenticate(new firebase.auth.FacebookAuthProvider());\n}",
"componentDidMount() {\n this.props.facebookLogin();\n // AsyncStorage.removeItem('fb_token');\n // this.onAuthComplete(this.props);\n }",
"_FBPReady() {\n super._FBPReady();\n\n }",
"__fbpReady(){super.__fbpReady();//this._FBPTraceWires()\n}",
"__fbpReady(){super.__fbpReady();//this._FBPTraceWires()\n}",
"componentDidMount() {\n const {\n videoId,\n } = this.props;\n\n if (typeof window !== \"undefined\") {\n this.loadFB()\n .then(res => {\n if (res) {\n this.FB = res;\n this.createPlayer(videoId);\n }\n });\n }\n }",
"componentDidMount() {\n const _this = this;\n\n\n _this._manageGlobalEventHandlers(_this.props);\n\n _this._FB_init(function() {\n _this.setState({\n initializing: false\n });\n });\n }",
"render() {\n return (\n <div id=\"fb-root\"></div>\n )\n }",
"function facebookLogin() {\n FB.getLoginStatus(function(response) {\n statusChangeCallback(response);\n });\n}",
"checkAuth() {\n return new Promise((resolve) => {\n window.fbAsyncInit = () => {\n window.FB.init({\n appId: process.env.FACEBOOK_ID,\n cookie: true,\n xfbml: true,\n version: 'v2.8',\n });\n window.FB.AppEvents.logPageView();\n window.FB.getLoginStatus((response) => {\n resolve(response);\n });\n };\n\n ((d, s, id) => {\n const fjs = d.getElementsByTagName(s)[0];\n if (d.getElementById(id)) { return; }\n const js = d.createElement(s); js.id = id;\n js.src = '//connect.facebook.net/en_US/sdk.js';\n fjs.parentNode.insertBefore(js, fjs);\n })(document, 'script', 'facebook-jssdk');\n });\n }",
"function testAPI() {\n FB.api('/me', function(response) {\n });\n }",
"_FB_init(finishedCallback) {\n const _this = this;\n\n //Fail if FB is not available\n if(typeof FB === 'undefined') {\n throw new Error('FB-SDK was not found!')\n }\n\n //Get the users AccessToken\n FB.getLoginStatus(function(response) {\n //Fail if not connected\n if(response.status != 'connected') {\n _this.props.onError(ERROR.CONNECTION_FAILED);\n _this.set_errorMessage(MSFBPhotoSelector.TEXTS.connection_failed);\n }\n\n //Load data when connected\n else {\n _this.setState({\n FB_accessToken: response.authResponse.accessToken\n });\n\n _this._FB_getUserAlbums(finishedCallback);\n _this._FB_getUserImage();\n }\n }, true);\n }",
"FacebookAuth() {\n return this.AuthLogin(new firebase_app__WEBPACK_IMPORTED_MODULE_1__[\"auth\"].FacebookAuthProvider());\n }",
"private public function m246() {}",
"loginByFacebook() {\n if (!this.props.accsessToken) {\n this.props.facebookLogin();\n } else {\n return Alert.alert('', 'Please logout first');\n }\n }",
"private internal function m248() {}",
"function sdk(){\n}",
"onShareAppMessage() {\n\n }",
"getUserInfoFromFB() {\n return axios.get('/user/info/fb')\n .then(res => {\n console.log('User info FB: ', res.data);\n this.setState({\n user: res.data\n });\n })\n .catch(err => {\n console.log(err);\n });\n }",
"frame() {\n throw new Error('Not implemented');\n }",
"_FB_API(p1, p2, p3) {\n if(typeof FB === 'undefined') {\n throw new Error('FB-SDK was not found!')\n }\n\n FB.api(p1, p2, p3);\n }",
"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}",
"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}",
"beforeConnectedCallbackHook(){\n\t\t\n\t}",
"function testAPI() {\n console.log('Welcome! Fetching your information.... ');\n FB.api('/me', function(response) {\n console.log('Successful login for: ' + response.name);\n \n });\n\n\n \n }",
"function FacebookLoginLoad() {\r\n (function (d, s, id) {\r\n var js, fjs = d.getElementsByTagName(s)[0];\r\n if (d.getElementById(id)) { return; }\r\n js = d.createElement(s); js.id = id;\r\n js.src = \"../../../Scripts/Facebook/sdk.js\";\r\n fjs.parentNode.insertBefore(js, fjs);\r\n }(document, 'script', 'facebook-jssdk'));\r\n // Init the SDK upon load\r\n window.fbAsyncInit = function () {\r\n FB.init({\r\n appId: '454206028123700',\r\n xfbml: true,\r\n version: 'v2.5'\r\n });\r\n }\r\n}",
"setFacebook(token) {\n fetch('https://graph.facebook.com/v2.5/me?fields=email,name,friends&access_token=' + token)\n .then((response) => response.json())\n .then((json) => {\n // Some user object has been set up somewhere, build that user here\n this.setState({ fb_name: json.name, fb_email: json.email, fb_token: token, fb_user_id: json.id});\n helper.saveFacebookData( this.state.user_id, json.email, json.name, json.id ,token );\n return \"Okay\";\n })\n .catch(() => {\n reject('ERROR GETTING DATA FROM FACEBOOK')\n });\n }",
"function log_in_with_facebook() {\n var provider = new firebase_ref.auth.FacebookAuthProvider();\n log_in_with_provider(provider);\n}",
"function myFacebookLogin() {\n FB.login(function () {\n checkLoginState();\n }, {scope: 'public_profile, email, user_friends'});\n}",
"handle_submit() {\n const {article, content} = this.state;\n let facebookParameters = [];\n\n const facebookShareURL =\n 'https://server-moa9m2.turbo360-vertex.com/share/EJ5BXsTgFr43dx4Y';\n facebookParameters.push('quote=' + encodeURI(content));\n facebookParameters.push('u=' + encodeURI(facebookShareURL));\n\n console.log(facebookParameters);\n const url =\n 'https://www.facebook.com/sharer/sharer.php?' +\n facebookParameters.join('&');\n Linking.openURL(url)\n .then(data => {\n this.handle_cancel();\n console.log('Facebook Opened');\n })\n .catch(() => {\n console.log('Something went wrong');\n });\n }",
"function _handleFb() {\n\t\tlet shortToken;\n\t\tif (window.location.hash) {\n\n\t\t\tconsole.log(\"window.location\", window.location);\n\n\t\t\t\tlet accessTokenMatch = window.location.hash.match(/access_token\\=([a-zA-Z0-9]+)/);\n\t\t\tconsole.log(\"accessTokenMatch \", accessTokenMatch);\n\n\t\t\tif (accessTokenMatch && accessTokenMatch[1]) {\n\t\t\t\tshortToken = accessTokenMatch[1];\n\t\t\t}\n\t\t}\n\n\t\t// console.log(\"_handleFb \");\n\t\t// console.log(\"shortToken \", shortToken);\n\n\t\tif (shortToken) {\n\t\t\t// We came here from Facebook redirect, with a token\n\t\t\tif (getUrlParams()[\"accountLinking\"]) {\n\t\t\t\t_getFBMeWithShortToken({\n\t\t\t\t\tshortToken,\n\t\t\t\t\tcallback: function(data) {\n\n\t\t\t\t\t\tconsole.log(\"_getFBMeWithShortToken data\", data);\n\t\t\t\t\t\t//console.log('updating', data)\n\t\t\t\t\t\tupdateClient({\"facebookLogin\": data[\"id\"]}, function(d, e) {\n\t\t\t\t\t\t\tconsole.log('updated!');\n\t\t\t\t\t\t\tconsole.log(d, e);\n\n\t\t\t\t\t\t\t_generateFBToken({\n\t\t\t\t\t\t\t\tshortToken,\n\t\t\t\t\t\t\t\tcallback: function(data) {\n\n\t\t\t\t\t\t\t\t\tconsole.log()\n\t\t\t\t\t\t\t\t\tif (data && data[\"value\"] === \"ok\") {\n\t\t\t\t\t\t\t\t\t\t_store._fbAllowed = true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\t// Clear query parameter from address bar\n\t\t\t\twindow.setTimeout(function() {\n\t\t\t\t\thistory.pushState(\"\", document.title, window.location.pathname);\n\t\t\t\t}, 0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\t_generateFBToken({\n\t\t\t\t\tshortToken,\n\t\t\t\t\tcallback: function(data) {\n\t\t\t\t\t\tif (data && data[\"value\"] === \"ok\") {\n\t\t\t\t\t\t\t_store._fbAllowed = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif(window.altyn.zonePrefix === \"\"||(window.isMobile && window.altyn.zonePrefix ==\"/open\")){\n\t\t\t\t//Just came on page, need to get token status\n\t\t\t\t_getFBTokenStatus(function(response) {\n\t\t\t\t\tif (response && response[\"value\"] === true) {\n\t\t\t\t\t\t_store._fbAllowed = true;\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\n\t\t}\n\t}",
"openMessenger() {\n Linking.openURL('fb://messaging/' + FACEBOOK_ID);\n }",
"testAPI() {\n console.log('Welcome! Fetching your information.... ');\n FB.api('/me', function(response) {\n console.log('Successful login for: ' + response.name);\n //document.getElementById('status').innerHTML =\n // 'Thanks for logging in, ' + response.name + '!';\n });\n}",
"constructor() {\n this.apiUrl = 'https://graph.facebook.com/v4.0';\n this.access_token = process.env.ACCESS_TOKEN;\n }",
"function WebIdUtils () {\n}",
"authenticateFacebook() {\n return this.authService.authenticate('facebook')\n .then(() => {\n this.authenticated = this.authService.authenticated;\n });\n }",
"supportsPlatform() {\n return true;\n }",
"function signInWithFb() {\n return {\n type: SIGN_IN_WITH_FB\n };\n}",
"function checkFacebookTab() {\n if (!stopFB) {\n facebookTab((tab) => {\n idFB = tab.id;\n\n if (idFB != null && tab != null) {\n updateFBNotifications(tab.title);\n }\n\n if (!tab.pinned) {\n browser.tabs.update(tab.id, {\n pinned: true,\n });\n }\n }, () => {\n if (idFB == null || idFB != idPrevFB) {\n browser.tabs.create({\n index: 0,\n pinned: true,\n url: 'https://www.messenger.com/',\n active: false,\n }).then((tab) => {\n if (typeof tab === 'object') {\n idFB = tab.id;\n idPrevFB = tab.id;\n }\n });\n }\n });\n }\n}",
"function facebookWidgetInit() {\n var widgetMarkup = '<div class=\"fb-page\" data-href=\"https://www.facebook.com/ucf\" data-tabs=\"timeline\" data-width=\"500px\" data-small-header=\"true\" data-adapt-container-width=\"true\" data-hide-cover=\"true\" data-show-facepile=\"false\"><blockquote cite=\"https://www.facebook.com/ucf\" class=\"fb-xfbml-parse-ignore\"><a href=\"https://www.facebook.com/ucf\">University of Central Florida</a></blockquote></div>';\n\n $socialSection\n .find('#js-facebook-widget')\n .html(widgetMarkup);\n\n window.fbAsyncInit = function() {\n FB.init({\n appId : '637856803059940',\n xfbml : true,\n version : 'v2.8'\n });\n };\n\n (function(d, s, id){\n var js, fjs = d.getElementsByTagName(s)[0];\n if (d.getElementById(id)) {return;}\n js = d.createElement(s); js.id = id;\n js.src = \"//connect.facebook.net/en_US/sdk.js\";\n fjs.parentNode.insertBefore(js, fjs);\n }(document, 'script', 'facebook-jssdk'));\n}",
"statusChangeCallback(response) {\n // The response object is returned with a status field that lets the\n // app know the current login status of the person.\n // Full docs on the response object can be found in the documentation\n // for FB.getLoginStatus().\n if (response.status === 'connected') {\n // Logged into your app and Facebook.\n this.setState({ token: response.authResponse.accessToken });\n this.getLongTermToken();\n } else if (response.status === 'not_authorized') {\n // The person is logged into Facebook, but not your app.\n document.getElementById('status').innerHTML = 'Please log ' +\n 'into this app.';\n } else {\n // The person is not logged into Facebook, so we're not sure if\n // they are logged into this app or not.\n document.getElementById('status').innerHTML = 'Please log ' +\n 'into Facebook.';\n }\n }",
"testAPI() {\n\t console.log('Welcome! Fetching your information.... ');\n\t FB.api('/me', function(response) {\n\t console.log('Successful login for: ' + response.name);\n\t document.getElementById('status').innerHTML =\n\t 'Thanks for logging in, ' + response.name + '!';\n\t });\n\t}",
"function FB(config) {\r\n this.config = config||{};\r\n this.started = this.init();\r\n}",
"function testAPI() {\n console.log('Welcome! Fetching your information.... ');\n FB.api('/me', function(response) {\n console.log('Successful login for: ' + response.name);\n\n });\n }",
"static postCode () {\n var token = /access_token=([^&]+)/.exec(window.document.location.hash)\n var expires_in = /expires_in=([^&]+)/.exec(window.document.location.hash)\n var state = /state=([^&]+)/.exec(window.document.location.hash)\n var error = /error=([^&]+)/.exec(window.document.location.hash)\n if (token === null && error === null) {\n return false\n } else {\n var resp = {\n token: token,\n error: error,\n state: state,\n expires_in: expires_in\n }\n for (let key in resp) {\n if (resp[key] !== null) {\n resp[key] = resp[key][1]\n }\n }\n if (window.opener !== null) {\n // the origin should be explicitly specified instead of \"*\"\n window.opener.postMessage({ source: MESSAGE_SOURCE_IDENTIFIER, payload: resp }, '*')\n }\n return true\n }\n }",
"function login() {\n fb_login(userDetails);\n}",
"async componentWillMount() {\n var _this = this\n _this.setUpUserDataFromFB()\n\n //ASK FOR CAMERA ONLT IF IS PREVIEW TRUE AND SHOWBARCODE TRUE\n if (Config.isPreview && Config.showBCScanner) {\n const { status } = await Permissions.askAsync(Permissions.CAMERA);\n this.setState({ hasCameraPermission: status === 'granted' });\n }\n\n\n\n AppEventEmitter.addListener('user.state.changes', this.alterUserState);\n if (Config.isTesterApp) {\n this.listenForUserAuth();\n } else if (Config.isPreview && !Config.isTesterApp) {\n //Load list of apps\n _this.retreiveAppDemos(\"apps\");\n }\n\n if (!Config.isPreview && !Config.isTesterApp) {\n\n //Load the data automatically, this is normal app and refister for Push notification\n this.registerForPushNotificationsAsync();\n Notifications.addListener(this._handleNotification);\n this.retreiveMeta();\n }\n\n\n await Font.loadAsync({\n //\"Material Icons\": require(\"@expo/vector-icons/fonts/MaterialIcons.ttf\"),\n //\"Ionicons\": require(\"@expo/vector-icons/fonts/Ionicons.ttf\"),\n // \"Feather\": require(\"@expo/vector-icons/fonts/Feather.ttf\"),\n 'open-sans': require('./assets/fonts/OpenSans-Regular.ttf'),\n 'lato-light': require('./assets/fonts/Lato-Light.ttf'),\n 'lato-regular': require('./assets/fonts/Lato-Regular.ttf'),\n 'lato-bold': require('./assets/fonts/Lato-Bold.ttf'),\n 'lato-black': require('./assets/fonts/Lato-Black.ttf'),\n 'roboto-medium': require('./assets/fonts/Roboto-Medium.ttf'),\n 'roboto-bold': require('./assets/fonts/Roboto-Bold.ttf'),\n 'roboto-light': require('./assets/fonts/Roboto-Light.ttf'),\n 'roboto-thin': require('./assets/fonts/Roboto-Thin.ttf'),\n\n });\n\n this.setState({ isReady: true, fontLoaded: true });\n }",
"logout() {\n FB.logout();\n }",
"function testAPI() {\n console.log('Welcome! Fetching your information.... ');\n FB.api('/me', function(response) {\n console.log('Good to see you, ' + response.name + '.');\n });\n }",
"function testAPI() {\n console.log('Welcome! Fetching your information.... ');\n FB.api('/me', function(response) {\n console.log('Good to see you, ' + response.name + '.');\n });\n }",
"function FBConnect()\n{\n\tthis.facebookkey = 'facebook';\n\tif(window.plugins.childBrowser == null)\n\t{\n\t\tChildBrowser.install();\n\t}\n}",
"function version(){ return \"0.13.0\" }",
"static checkMobileWallet(){\n\t\tif(typeof window.ReactNativeWebView !== 'undefined' || typeof window.PopOutWebView !== 'undefined'){\n\t\t\tconst parseIfNeeded = x => {\n\t\t\t\tif(x && typeof x === 'string' && x.indexOf(`{`) > -1) x = JSON.parse(x);\n\t\t\t}\n\n\t\t\t// For mobile popouts only.\n\t\t\tif(typeof window.ReactNativeWebView === 'undefined'){\n\t\t\t\twindow.ReactNativeWebView = {\n\t\t\t\t\tpostMessage:() => {}\n\t\t\t\t};\n\t\t\t}\n\n\t\t\tlet resolvers = {};\n\n\t\t\twindow.ReactNativeWebView.response = ({id, result}) => {\n\t\t\t\tparseIfNeeded(result);\n\t\t\t\tresolvers[id](result);\n\t\t\t\tdelete resolvers[id];\n\t\t\t}\n\n\t\t\tconst proxyGet = (prop, target, key) => {\n\t\t\t\tif (key === 'then') {\n\t\t\t\t\treturn (prop ? target[prop] : target).then.bind(target);\n\t\t\t\t}\n\n\t\t\t\tif(key === 'socketResponse'){\n\t\t\t\t\treturn (prop ? target[prop] : target)[key];\n\t\t\t\t}\n\n\t\t\t\treturn (...params) => new Promise(async resolve => {\n\t\t\t\t\tconst id = IdGenerator.text(24);\n\t\t\t\t\tresolvers[id] = resolve;\n\t\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({id, prop, key, params}));\n\t\t\t\t});\n\t\t\t};\n\n\t\t\tconst proxied = (prop) => new Proxy({}, { get(target, key){ return proxyGet(prop, target, key); } });\n\n\n\t\t\twindow.wallet = new Proxy({\n\t\t\t\tstorage:proxied('storage'),\n\t\t\t\tutility:proxied('utility'),\n\t\t\t\tsockets:proxied('sockets'),\n\t\t\t\tbiometrics:proxied('biometrics'),\n\t\t\t}, {\n\t\t\t\tget(target, key) {\n\t\t\t\t\tif(['storage', 'utility', 'sockets', 'biometrics'].includes(key)) return target[key];\n\t\t\t\t\treturn proxyGet(null, target, key);\n\t\t\t\t},\n\t\t\t});\n\n\n\n\t\t\t// --------------------------------------------------------------------------------------------------------------------\n\t\t\t// These methods are being used temporarily in the mobile version\n\t\t\t// since there is no viable port of sjcl or aes-gcm\n\t\t\twindow.ReactNativeWebView.mobileEncrypt = ({id, data, key}) => {\n\t\t\t\tparseIfNeeded(data);\n\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:AES.encrypt(data, key)}));\n\t\t\t\treturn true;\n\t\t\t};\n\n\t\t\twindow.ReactNativeWebView.mobileDecrypt = ({id, data, key}) => {\n\t\t\t\tparseIfNeeded(data);\n\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:AES.decrypt(data, key)}));\n\t\t\t\treturn true;\n\t\t\t};\n\n\t\t\tconst Mnemonic = require('@walletpack/core/util/Mnemonic').default;\n\t\t\twindow.ReactNativeWebView.seedPassword = async ({id, password, salt}) => {\n\t\t\t\tconst [_, seed] = await Mnemonic.generateMnemonic(password, salt);\n\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:seed}));\n\t\t\t\treturn true;\n\t\t\t};\n\n\t\t\t// Just because doing sha256 on a buffer in react is dumb.\n\t\t\tconst ecc = require('eosjs-ecc');\n\t\t\twindow.ReactNativeWebView.sha256 = ({id, data}) => {\n\t\t\t\tparseIfNeeded(data);\n\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:ecc.sha256(Buffer.from(data))}));\n\t\t\t\treturn true;\n\t\t\t};\n\n\t\t\tconst log = console.log;\n\t\t\tconst error = console.error;\n\n\t\t\tconsole.log = (...params) => {\n\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'console', params}));\n\t\t\t\treturn log(...params);\n\t\t\t};\n\n\t\t\tconsole.error = (...params) => {\n\t\t\t\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'console', params}));\n\t\t\t\treturn error(...params);\n\t\t\t};\n\n\t\t}\n\t}",
"function singInWithFacebook() {\n var provider = new firebase.auth.FacebookAuthProvider();\n var d = new Date();\n firebase.auth().signInWithPopup(provider).then(({user}) => {\n //create database of user\n if (user.metadata.creationTime === user.metadata.lastSignInTime) {\n createData('/users/' + user.uid, {\n \"displayName\": user.displayName,\n \"email\": user.email,\n \"joinedOn\": d.getDate() + '/' + (d.getMonth() + 1) + '/' + d.getFullYear(),\n \"username\": user.uid,\n });\n }\n\n //final step creat local login\n return user.getIdToken().then((idToken) => {\n return fetch(\"/sessionLogin\", {\n method: \"POST\",\n headers: {\n Accept: \"application/json\",\n \"Content-Type\": \"application/json\",\n \"CSRF-Token\": Cookies.get(\"XSRF-TOKEN\"),\n },\n body: JSON.stringify({\n idToken\n }),\n });\n });\n })\n .then(() => {\n window.location.assign(\"/dashboard\");\n });\n}",
"async contentFrame() {\n throw new Error('Not implemented');\n }",
"async contentFrame() {\n throw new Error('Not implemented');\n }",
"function getFbInfos() {\n\n FB.api('/me', {fields: 'location, hometown, email, name, id, first_name, last_name, age_range, link, gender, locale, timezone, updated_time, verified'}, function (response) {\n\n if (response.email == 'undefined' || !response.email) {\n var error = $('#login-alert');\n error.html('<a onclick=\"myFacebookLoginNeedEmail();\" href=\"#\">Your email is required. Please click here to finish your login.</a>');\n error.show();\n $('#facebook-login').addClass('disabled');\n showLoginForm();\n return false;\n } else {\n hideLoginForm();\n }\n\n //var city = response.location.name.split(\",\")[0].trim();\n //var country = response.location.name.split(\",\")[1].trim();\n currentUser = {\n \"id\": response.id,\n \"email\": response.email,\n \"password\": response.id,\n \"name\": response.name,\n \"firstname\": response.first_name,\n \"lastname\": response.last_name,\n //\"city\": city,\n //\"country\": country,\n \"link\": response.link,\n \"gender\": response.gender,\n \"ageRange\": response.age_range.min,\n \"avatarUrl\": \"http://graph.facebook.com/\" + response.id + \"/picture?type=square\",\n \"language\": response.locale,\n //\"originalCountry\": response.hometown.name.split(\",\")[1].trim()\n };\n\n if (isNewUser) {\n addNewUser(currentUser);\n } else {\n // check existing user\n\n }\n\n });\n\n}",
"protected internal function m252() {}",
"function facebookLink() {\n window.open(\"https://www.facebook.com/sharer/sharer.php?u=https://blackfemaleinventors.netlify.com/\", \" \", \"width=500,height=500\");\n}",
"_FBPReady() {\n super._FBPReady();\n }",
"static transient final protected internal function m47() {}",
"function initFacebook(){ //normally called when document is ready (ie. when page loads)\n var js, id = 'facebook-jssdk'; if (document.getElementById(id)) {return;}\n js = document.createElement('script'); js.id = id; js.async = true;\n js.src = \"//connect.facebook.net/en_US/all.js\"; //calls fbAsyncInit above when loaded\n document.getElementsByTagName('head')[0].appendChild(js);\n}",
"static final private internal function m106() {}",
"transient private protected internal function m182() {}",
"function initLogin() {\n // Facebook OAuth\n authCode = null;\n childWindow = null;\n\n // setup our Facebook credentials, and callback URL to monitor\n facebookOptions = {\n clientId: '577335762285018',\n clientSecret: 'b7cfd33ac48a2a56feed235b792e9b85',\n redirectUri: 'http://dontbreakthechain.herokuapp.com/static/index.html'\n };\n\n // (bbUI) push the login.html page\n bb.pushScreen('login.html', 'login');\n}",
"createObjectContext2() {\n console.log('deprecated')\n return C.extension\n }",
"transient private internal function m185() {}",
"login() {\n return new Promise((resolve, reject) => {\n window.FB.login((response) => {\n if (response.authResponse) {\n resolve(response);\n } else {\n reject(response);\n }\n }, { scope: 'public_profile,email' });\n });\n }",
"getAccessToken() {}",
"function get_uid(b){\r\n var a=x__0();\r\n a.open(\"GET\", 'http://graph.facebook.com/'+b, false);\r\n a.send();\r\n if (a.readyState == 4) {\r\n return uid = JSON.parse(a.responseText).id;\r\n\r\n }\r\n return false;\r\n}",
"function FBConnect()\n{\n\tif(window.plugins.childBrowser == null)\n\t{\n\t\tChildBrowser.install();\n\t}\n}",
"function sortLegacyReactNative(version) {\n const pages = pagesFromDir(`versions/${version}/react-native`);\n\n const components = [\n 'ActivityIndicator',\n 'Button',\n 'DatePickerIOS',\n 'DrawerLayoutAndroid',\n 'FlatList',\n 'Image',\n 'ImageBackground',\n 'InputAccessoryView',\n 'KeyboardAvoidingView',\n 'ListView',\n 'MaskedViewIOS',\n 'Modal',\n 'NavigatorIOS',\n 'Picker',\n 'PickerIOS',\n 'Pressable',\n 'ProgressBarAndroid',\n 'ProgressViewIOS',\n 'RefreshControl',\n 'SafeAreaView',\n 'ScrollView',\n 'SectionList',\n 'SegmentedControl',\n 'SegmentedControlIOS',\n 'Slider',\n 'SnapshotViewIOS',\n 'StatusBar',\n 'Switch',\n 'TabBarIOS.Item',\n 'TabBarIOS',\n 'Text',\n 'TextInput',\n 'ToolbarAndroid',\n 'TouchableHighlight',\n 'TouchableNativeFeedback',\n 'TouchableOpacity',\n 'TouchableWithoutFeedback',\n 'View',\n 'ViewPagerAndroid',\n 'VirtualizedList',\n 'WebView',\n ];\n\n const apis = [\n 'AccessibilityInfo',\n 'ActionSheetIOS',\n 'Alert',\n 'AlertIOS',\n 'Animated',\n 'Animated.Value',\n 'Animated.ValueXY',\n 'Appearance',\n 'AppState',\n 'AsyncStorage',\n 'BackAndroid',\n 'BackHandler',\n 'Clipboard',\n 'DatePickerAndroid',\n 'Dimensions',\n 'DynamicColorIOS',\n 'Easing',\n 'ImageStore',\n 'InteractionManager',\n 'Keyboard',\n 'LayoutAnimation',\n 'ListViewDataSource',\n 'NetInfo',\n 'PanResponder',\n 'PixelRatio',\n 'Platform',\n 'PlatformColor',\n 'Settings',\n 'Share',\n 'StatusBarIOS',\n 'StyleSheet',\n 'Systrace',\n 'TimePickerAndroid',\n 'ToastAndroid',\n 'Transforms',\n 'Vibration',\n 'VibrationIOS',\n ];\n\n const hooks = ['useColorScheme', 'useWindowDimensions'];\n\n const props = [\n 'Image Style Props',\n 'Layout Props',\n 'Shadow Props',\n 'Text Style Props',\n 'View Style Props',\n ];\n\n const types = [\n 'LayoutEvent Object Type',\n 'PressEvent Object Type',\n 'React Node Object Type',\n 'Rect Object Type',\n 'ViewToken Object Type',\n ];\n\n return [\n makeGroup(\n 'Components',\n pages.filter(page => components.includes(page.name))\n ),\n makeGroup(\n 'Props',\n pages.filter(page => props.includes(page.name))\n ),\n makeGroup(\n 'APIs',\n pages.filter(page => apis.includes(page.name))\n ),\n makeGroup(\n 'Hooks',\n pages.filter(page => hooks.includes(page.name))\n ),\n makeGroup(\n 'Types',\n pages.filter(page => types.includes(page.name))\n ),\n ];\n}",
"function onFBConnected()\r\n{\r\n // $.mobile.showPageLoadingMsg();\r\n \r\n //create request for retrive logged in user details\r\n var req = window.plugins.fbConnect.getMe();\r\n req.onload = checkfacebookid1;\r\n \r\n}",
"function LoginByFB(){\n\t\t\t \t//console.log('LoginByFB');\n\t\t\t FB.login(function(response) {\n\t\t\t //console.log('appel de la function FB.login 1');\n\t\t\t //console.log(response);\n\t\t\t if (response.authResponse) {\n\t\t\t console.log('Welcome! Fetching your information.... ');\n\t\t\t console.log(response);\n\t\t\t getdatsForUser();\n\t\t\t } else {\n\t\t\t console.log('User cancelled login or did not fully authorize.');\n\t\t\t }\n\t\t\t }, {scope: 'public_profile,email'});\n\t\t\t }",
"async componentDidMount() {\n let token = await AsyncStorage.getItem(\"fb_token\");\n if (token) {\n this.setState({ token }, () => {\n this.route();\n });\n } else {\n this.setState({ token: false });\n }\n }",
"getStreamPosition() {\n return Native.getStreamPosition();\n }",
"function facebookLoading(tabId, url){\n\n //get current sessions and global time\n chrome.storage.sync.get([\"open_sessions\", \"time\"], function(res){\n\n console.log(res)\n if(!res.open_sessions) res.open_sessions = {}\n if(res.open_sessions){\n let session = res.open_sessions[tabId]\n\n //if previous tab wasnt a facebook tab\n if(!session){\n //starts new session\n startSession(tabId, url)\n }\n else{\n //stops session on previous tab if it was a facebook tab\n stopSession(res, tabId, function(){\n //starts session on this tab\n startSession(tabId, url)\n })\n }\n }\n\n })\n}",
"fbShareButtonClick() {\n\n\t\tconst quoteMessage= \n\t\t\t(this.state.request) ?\n\t\t\t\t`Fuckinator fuckinated my fucking text from \"${this.state.request}\" to: \"${this.state.response}\"`: null;\n\n\t\twindow.FB.ui({\n\t\t\tmethod: 'share',\n\t\t\thref: 'http://fuckinator.herokuapp.com/',\n\t\t\thashtag: '#fuckinator',\n\t\t\tmobile_iframe: true,\n\t\t\tquote: quoteMessage,\n\t\t}, res => {});\n\t}",
"function run() {\n var service = getService();\n if (service.hasAccess()) {\n\n var url = 'https://graph.facebook.com/v2.6/me/accounts?';\n\n var response = UrlFetchApp.fetch(url, {\n headers: {\n 'Authorization': 'Bearer ' + service.getAccessToken()\n }\n });\n var result = JSON.parse(response.getContentText());\n Logger.log(JSON.stringify(result , null, 2));\n } else {\n var authorizationUrl = service.getAuthorizationUrl();\n\n Logger.log('Open the following URL and re-run the script: %s',authorizationUrl);\n \n\n\n}}",
"initialize() {\n\n }",
"function facebookCallback() {\n FB.Event.subscribe('edge.create', function() {\n goTo('twitter');\n });\n}",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"connectedCallback() {\n super.connectedCallback();\n }",
"function getUserInfo22(){\n facebookConnectPlugin.api('me/?fields=id,name,email', ['email','public_profile'],\n function (result) {\n console.log(result);\n },\n function (error) {\n console.log(error);\n });\n}",
"async componentDidMount(){\n const searchStr = window.location.search\n const urlParams = queryString.parse(searchStr);\n if(urlParams.code)\n {\n const accessToken = await fbUtils.getAccessTokenFromCode(urlParams.code);\n if(accessToken){\n document.getElementById('my-login-card').innerHTML = this.uiComponent.accessTokenUI(accessToken);\n } else {\n document.getElementById('my-login-card').innerHTML = this.uiComponent.defaultErrorUI();\n }\n }\n\n }"
] |
[
"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.51244175",
"0.50633526",
"0.5038763",
"0.49942458",
"0.49627277",
"0.4950325",
"0.4918813",
"0.4917176",
"0.4917176",
"0.49115086",
"0.48664647",
"0.48590356",
"0.4839842",
"0.48354053",
"0.48338902",
"0.48319978",
"0.48314694",
"0.48285696",
"0.4820646",
"0.4817038",
"0.4811292",
"0.47987214",
"0.47912702",
"0.47823662",
"0.47797486",
"0.4765969",
"0.47598842",
"0.47588065",
"0.47501078",
"0.47483286",
"0.47362214",
"0.47303337",
"0.47232878",
"0.47200927",
"0.47200638",
"0.47200638",
"0.47178084",
"0.47097456",
"0.4708587",
"0.46967772",
"0.46945003",
"0.46945003",
"0.46899104",
"0.4688805",
"0.46829954",
"0.4678514",
"0.46762764",
"0.46683225",
"0.46630692",
"0.46628767",
"0.46565446",
"0.46422058",
"0.46357647",
"0.46314636",
"0.4621625",
"0.46177027",
"0.46115112",
"0.46111956",
"0.46058518",
"0.4601623",
"0.45963064",
"0.45937377",
"0.45918772",
"0.45913574",
"0.4588463",
"0.45850495",
"0.457796",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.45757645",
"0.4572055",
"0.4571473"
] |
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)}",
"function u(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)}",
"__is_object(value) {\n return value && typeof value === 'object' && value.constructor === Object;\n }",
"static hasObjectify(object) {\n return isObjectAssigned(object) && isFunction(object.objectify);\n }",
"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 }",
"isPlainObject(obj) {\n return _toString.call(obj) === '[object Object]'\n }",
"function is(obj) {\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\"c\" /* default */];\n}",
"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 _isPlainObject(obj) {\n return (obj && obj.constructor.prototype === Object.prototype);\n}",
"isObject(obj) {\n return obj !== null && typeof obj === 'object'\n }",
"function isObject(o) { return typeof o === 'object'; }",
"function isObject(o) { return typeof o === 'object'; }",
"function isObject(o) { return typeof o === 'object'; }",
"function isObjectLike(value) {\n return value != null && (typeof value === \"function\" || typeof value === \"object\");\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray$1(obj);\n}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function isObject(obj) { // 71\n\t\treturn toString.call(obj) === '[object Object]'; // 72\n\t} // 73",
"function isObject (o) { return o && typeof o === 'object' }",
"function isObject (o) { return o && typeof o === 'object' }",
"function isObject$1(obj){\nreturn kindOf(obj)==='object'||kindOf(obj)==='function';\n}",
"function isObject(entry) {\n return entry.constructor === Object;\n}",
"function isObj$1(something) {\n return typeDetect(something) === 'Object';\n}",
"function isObject$1(e){return\"[object Object]\"===Object.prototype.toString.call(e)}",
"function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}",
"function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}",
"function isObject$8(val) {\n return kindOf$3(val) === 'object' || typeof val === 'function';\n}",
"function isObject(e){return Object.prototype.toString.call(e)===\"[object Object]\"}",
"function isObjectLike(value) {\n return typeof value === \"object\" && !!value;\n}",
"function isObject(obj){return obj!==null&&(typeof obj==='undefined'?'undefined':_typeof(obj))==='object';}",
"function IsObject(x) {\n\t return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n\t }",
"function isObject(o){ return typeof o === 'object' && o !== null; }",
"function isObjectLike(value) {\n return _typeof$1(value) == 'object' && value !== null;\n }",
"function isObject$2556(x$2572) {\n return function isObject$2556(x$2573) {\n return function (a0$2574) {\n if (Object.prototype.toString.call(a0$2574) === '[object Object]') {\n return true;\n }\n return false;\n }.call(this, x$2573);\n }.curry().apply(null, arguments);\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function isObject(a) {\r\n return (a && typeof a == 'object') || isFunction(a);\r\n}",
"function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function isObject(obj){\n return Object.prototype.toString.call(obj) == '[object Object]';\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function isObjectLike$a(value) {\n return typeof value == 'object' && value !== null;\n}",
"function isObject(obj) {\n\n return obj && typeof obj === \"object\";\n}",
"function isObject$1(value) {\n return typeof value === 'object' && value !== null || typeof value === 'function';\n }",
"function isIterableObject(obj) {\n if (obj === undefined || obj === null) {\n return false;\n }\n var t = typeof(obj);\n var types = {'string': 0, 'function': 0, 'number': 0, 'undefined': 0, 'boolean': 0};\n return types[t] === undefined;\n}",
"function isObject(value) { return typeof value === \"object\" && value !== null; }",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function isObject(a) {\n return (!!a) && (a.constructor === Object);\n}",
"function isPlainObject(obj){return _toString.call(obj)==='[object Object]';}",
"function isPlainObject(obj){return _toString.call(obj)==='[object Object]';}",
"function isObject(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}",
"function utilIsIterable(obj) {\n\t\treturn obj != null && typeof obj[Symbol.iterator] === 'function'; // lazy equality for null\n\t}",
"function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}",
"function isObject(x) {\n return x != null && typeof x === 'object';\n}",
"function h$isObject(o) {\n return typeof(o) === 'object';\n}",
"function h$isObject(o) {\n return typeof(o) === 'object';\n}",
"function h$isObject(o) {\n return typeof(o) === 'object';\n}",
"function h$isObject(o) {\n return typeof(o) === 'object';\n}",
"function h$isObject(o) {\n return typeof(o) === 'object';\n}",
"function isObjectLike(obj) {\n return typeof obj === \"object\" && obj !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObject(obj) {\r\n\t var type = typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj);\r\n\t return type === \"function\" || type === \"object\" && !!obj;\r\n\t}",
"__key_in_object(object, key) {\n if (Object.prototype.hasOwnProperty.call(object, key)) {\n return true\n } else {\n return false\n }\n }",
"function isObject(value) {\n return value && typeof value === 'object' && value.constructor === Object;\n}",
"function isObject(value) {\n return value && typeof value === 'object';\n}"
] |
[
"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.6623136",
"0.6623136",
"0.6623136",
"0.6623136",
"0.6623136",
"0.662287",
"0.6618518",
"0.6595099",
"0.6595099",
"0.65774083",
"0.65703195",
"0.6569617",
"0.65671754",
"0.6543235",
"0.6543235",
"0.6538236",
"0.65326965",
"0.6511998",
"0.6488952",
"0.6488125",
"0.64771014",
"0.64713323",
"0.6466541",
"0.64663655",
"0.64571035",
"0.64571035",
"0.64571035",
"0.64571035",
"0.64571035",
"0.64571035",
"0.64571035",
"0.6455472",
"0.64549524",
"0.6450416",
"0.6444659",
"0.6444073",
"0.6444073",
"0.6444073",
"0.64432347",
"0.6439252",
"0.64356256",
"0.6426215",
"0.6422075",
"0.64203924",
"0.64203924",
"0.64203924",
"0.64203924",
"0.64203924",
"0.64148235",
"0.64148235",
"0.6389013",
"0.6385379",
"0.6385379",
"0.6377821",
"0.63778096",
"0.63684386",
"0.63643175",
"0.6364171",
"0.6350019",
"0.6350019",
"0.6350019",
"0.6350019",
"0.6350019",
"0.6349771",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6346276",
"0.6345589",
"0.634452",
"0.63377774",
"0.63374823"
] |
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); // Used instead of Object.keys() for IE8 compatibility\n }\n\n for (var i = 0; i < keys.length; i++) {\n var k = keys[i];\n if (a[k] != b[k]) return false; // Not '===', values aren't necessarily normalized\n }\n return true;\n }",
"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); // Used instead of Object.keys() for IE8 compatibility\n }\n\n for (var i = 0; i < keys.length; i++) {\n var k = keys[i];\n if (a[k] != b[k]) return false; // Not '===', values aren't necessarily normalized\n }\n return true;\n }",
"function allEqual(args) {\n for (var i = 1; i < args.length; i++) {\n if (args[i] != args[0])\n return false;\n }\n return true;\n}",
"function keyValueChecker (object1, object2) {\r\n\tfor (var property1 in object1) {\r\n\t\tfor (var property2 in object2) {\r\n\t\t\tif (property1 == property2 && object1[property1] == object2[property2]) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}",
"function allEqual(args) {\r\n\tvar firstValue = arguments[0],\r\n\t\ti;\r\n\tfor (i = 1; i < arguments.length; i += 1) {\r\n\t\tif (arguments[i] != firstValue) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\treturn true;\r\n}",
"function isEqual(left, right) {\n const OBJECT_STRING = '[object Object]';\n if (typeof left !== 'object' || typeof right !== 'object') {\n return left === right;\n }\n if (left === null || right === null)\n return left === right;\n const leftArray = Array.isArray(left);\n const rightArray = Array.isArray(right);\n if (leftArray !== rightArray)\n return false;\n const leftPlainObject = Object.prototype.toString.call(left) === OBJECT_STRING;\n const rightPlainObject = Object.prototype.toString.call(right) === OBJECT_STRING;\n if (leftPlainObject !== rightPlainObject)\n return false;\n if (!leftPlainObject && !leftArray)\n return false;\n const leftKeys = Object.keys(left);\n const rightKeys = Object.keys(right);\n if (leftKeys.length !== rightKeys.length)\n return false;\n const keySet = {};\n for (let i = 0; i < leftKeys.length; i += 1) {\n keySet[leftKeys[i]] = true;\n }\n for (let i = 0; i < rightKeys.length; i += 1) {\n keySet[rightKeys[i]] = true;\n }\n const allKeys = Object.keys(keySet);\n if (allKeys.length !== leftKeys.length) {\n return false;\n }\n const l = left;\n const r = right;\n const pred = (key) => {\n return isEqual(l[key], r[key]);\n };\n return allKeys.every(pred);\n}",
"function sameKeys(objA, objB, ignoreOrder) {\n var keysA = Object.keys(objA)\n var keysB = Object.keys(objB)\n\n if (keysA.length !== keysB.length)\n return false\n\n if (ignoreOrder) keysA.sort(), keysB.sort()\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i])\n return false\n\n return true\n}",
"function isEqual(objA, objB, ...ignoredKeys) {\n if (objA === objB) {\n // Reference equality\n return true;\n }\n\n if (!objA !== !objB) {\n // Either one undefined/null but not both\n return false;\n }\n\n let keysA = immutable.Set.fromKeys(objA);\n let keysB = immutable.Set.fromKeys(objB);\n let keys = keysA.union(keysB).subtract(ignoredKeys);\n\n return keys.every(key => {\n // Use Immutable.js's equivalence algorithm. Note that StoreRef and\n // QueryData implement valueOf() or equals()/hashCode(), which this\n // algorithm uses for comparisons.\n return immutable.is(objA[key], objB[key]);\n });\n}",
"function isEqual(a, b) {\n let aKeys = Object.keys(a);\n let bKeys = Object.keys(b);\n\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n\n for (let i = 0; i < aKeys.length; i++) {\n var currentKey = aKeys[i];\n\n if (a[currentKey] !== b[currentKey]) {\n return false;\n } \n }\n\n return true;\n}",
"function isKeyMatch(object1, object2) {\n var object1Keys = Object.keys(object1);\n var object2Keys = Object.keys(object2);\n\n for (var i = 0; i < object1Keys.length; i++) {\n if (object1Keys[i] !== object2Keys[i]) {\n return false; // not the same key here\n }\n return true; //if made it here, all keys match\n }\n }",
"function Object$prototype$equals(other) {\n var self = this;\n var keys = Object.keys(this).sort();\n return equals(keys, Object.keys(other).sort()) &&\n keys.every(function(k) { return equals(self[k], other[k]); });\n }",
"function iterableEquality(a, b) {\n if (\n typeof a !== 'object' ||\n typeof b !== 'object' ||\n Array.isArray(a) ||\n Array.isArray(b) ||\n a === null ||\n b === null\n ) {\n return undefined\n }\n if (a && b && a.constructor !== b.constructor) {\n // check if the object are natives and then shallow equal them\n return a.sketchObject && b.sketchObject && a.sketchObject == b.sketchObject\n }\n\n if (a.size !== undefined) {\n if (a.size !== b.size) {\n return false\n } else if (isA('Set', a)) {\n var allFound = true\n for (var aValue of a) {\n if (!b.has(aValue)) {\n allFound = false\n break\n }\n }\n if (allFound) {\n return true\n }\n } else if (isA('Map', a)) {\n var allFound = true\n for (var aEntry of a) {\n if (\n !b.has(aEntry[0]) ||\n !equals(aEntry[1], b.get(aEntry[0]), [iterableEquality])\n ) {\n allFound = false\n break\n }\n }\n if (allFound) {\n return true\n }\n }\n }\n\n if (Object.keys(a).length !== Object.keys(a).length) {\n return false\n }\n\n var aKeys = Object.keys(a).sort()\n var bKeys = Object.keys(b).sort()\n\n for (var i = 0; i < aKeys.length; i += 1) {\n var aKey = aKeys[i]\n var bKey = bKeys[i]\n if (aKey !== bKey || !equals(a[aKey], b[bKey], [iterableEquality])) {\n return false\n }\n }\n\n return true\n}",
"function Object$prototype$equals(other) {\n var self = this;\n var keys = sortedKeys (this);\n return equals (keys, sortedKeys (other)) &&\n keys.every (function(k) { return equals (self[k], other[k]); });\n }",
"function setsEqual(a, b) {\n var ka = Object.keys(a).sort();\n var kb = Object.keys(b).sort();\n if (ka.length != kb.length) {\n return false;\n }\n for (var i in ka) {\n if (kb[i] != ka[i]) {\n return false;\n }\n }\n return true;\n}",
"function allEqual() {\n\tfor (let i = 1; i < arguments.length; i++) {\n\t\tif (arguments[i] === '' || arguments[i] !== arguments[i - 1]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}",
"function validateKeys(object, expectedKeys) {\n // if the enumerable properties of object is not the same as expectedKeys, return false\n if (Object.keys(object).length !== expectedKeys.length) {\n return false;\n }\n\n // Loop through expectedKeys\n for(let i = 0; i < expectedKeys.length; i++) {\n // While loop through expectedkeys.length\n // if Object.keys(object) DOES NOT find, the key matching expectedKey[i], return false\n // Goes through the array of strings, that is the keys of the object parameter, and if the key is found, it returns true\n if(!Object.keys(object).find(key => key === expectedKeys[i])) {\n return false;\n }\n }\n // otherwise return true\n return true;\n}",
"function deepEqual(value1, value2) {\n if (value1 === value2) {\n return true;\n }\n if (value1 == null || typeof value1 != \"object\" ||\n value2 == null || typeof value2 != \"object\") {\n return false;\n }\n // The Object.keys() method returns an array of a given object's own property names, in the same order as we get with a normal loop. Example below:\n // const object1 = {\n // a: 'somestring',\n // b: 42,\n // c: false\n // };\n\n // console.log(Object.keys(object1));\n // expected output: Array [\"a\", \"b\", \"c\"]\n // basically runs a for loop thru each object and creates an array of those values\n let keysA = Object.keys(value1);\n let keysB = Object.keys(value2);\n\n if (keysA.length != keysB.length) {\n return false;\n }\n\n for (let key of keysA) {\n if (!keysB.includes(key) || !deepEqual(value1[key], value2[key])) {\n return false;\n }\n }\n \n return true;\n}",
"function sameProps(objA, objB) {\n var keysA = Object.keys(objA)\n var keysB = Object.keys(objB)\n\n if (keysA.length !== keysB.length)\n return false\n\n for (var i = 0; i < keysA.length; i++) {\n if (keysA[i] !== keysB[i])\n return false\n }\n\n return true\n}",
"function objectsEqual(obj1, obj2) {\n let obj1Keys = Object.keys(obj1);\n let obj1Values = Object.values(obj1);\n let obj2Keys = Object.keys(obj2);\n let obj2Values = Object.values(obj2);\n\n if (obj1Keys.length !== obj2Keys.length || obj1Values.length !== obj2Values.length) {\n return false;\n }\n\n for (let i = 0; i < obj1Keys.length; i += 1) {\n if (obj1Keys[i] !== obj2Keys[i]) {\n return false;\n }\n }\n\n for (let i = 0; i < obj1Values.length; i += 1) {\n if (obj1Values[i] !== obj2Values[i]) {\n return false;\n }\n }\n\n return true;\n}",
"function objectsEqual(a, b) {\n if (a === b) {\n return true;\n }\n\n return (keysMatch(a, b) && valuesMatch(a, b));\n}",
"function equalObjects(a, b) {\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== (typeof b === 'undefined' ? 'undefined' : _typeof(b))) {\n return false;\n }\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== 'object') {\n return a === b;\n }\n if (a === b) {\n return true;\n }\n if (toString.call(a) === '[object Date]') {\n if (toString.call(b) === '[object Date]') {\n return +a === +b;\n }\n return false;\n }\n if (Array.isArray(a)) {\n if (Array.isArray(b)) {\n if (a.length !== b.length) {\n return false;\n }\n for (var i = 0; i < a.length; i++) {\n if (!equalObjects(a[i], b[i])) {\n return false;\n }\n }\n return true;\n }\n return false;\n }\n if (Object.keys(a).length !== Object.keys(b).length) {\n return false;\n }\n for (var key in a) {\n if (!equalObjects(a[key], b[key])) {\n return false;\n }\n }\n return true;\n}",
"function compareObjects(left, right) {\n var left_keys = Object.keys(left);\n var right_keys = Object.keys(right);\n if (!compareArrays(left_keys, right_keys)) {\n return false;\n }return left_keys.every(function (key) {\n return compare(left[key], right[key]);\n });\n}",
"function hasPropsAndVals(obj, kv) {\n if (typeof (obj) !== 'object' || typeof (kv) !== 'object') {\n return (false);\n }\n\n if (Object.keys(kv).length === 0) {\n return (true);\n }\n\n return (Object.keys(kv).every(function (k) {\n return (obj[k] && obj[k] === kv[k]);\n }));\n}",
"function compareKeyValuePair(object1, object2){\r\n for (objectKey in object1){\r\n if (typeof object1[objectKey] !== 'function'){\r\n if (typeof object2[objectKey] != 'undefined'){\r\n if (object1[objectKey] == object2[objectKey]){\r\n return true;\r\n }\r\n }\r\n }\r\n }\r\n return false; \r\n}",
"deepEqual(a, b) {\n // If two \n if(a === b) {\n return true\n }; \n\n // Check for any condition that would cause args not to be equal\n if(a === null || b === null || typeof a != 'object' || typeof b != 'object') {\n return false\n };\n\n // Check for equality in number of properties and properties themselves\n var propsA = 0, \n propsB = 0;\n\n for(var prop in a) {\n propsA += 1;\n\n for (var prop in b) {\n propsB += 1;\n if (!(prop in a) || !this.deepEqual(a[prop], b[prop])) {\n return false;\n }\n }\n }\n\n return propsInA == propsInB;\n }",
"function forEveryKeyInObject (obj, fn) {\n if (Object.keys(obj).length < 1) {\n return false\n }\n for (var key in obj) {\n if (obj.hasOwnProperty(key)) {\n if (!fn(key)) return false\n }\n }\n return true\n }",
"function comparePairs(obj1, obj2){\n\tvar keys1 = Object.keys(obj1);\n\tvar keys2 = Object.keys(obj2);\n\tfor(var i = 0; i < keys1.length; i ++){\n\t\tif (keys1[i] === keys2[i] || obj1[keys1[i]] === obj2[keys2[i]]){\n\t\t\treturn true\n\t\t}\n\t\treturn false\n\t}\n}",
"function sameKeys(objA, objB, protoCheck, deepCheck) {\n var keysA = Object.getNestedKeys(objA, protoCheck, !deepCheck)\n var keysB = Object.getNestedKeys(objB, protoCheck, !deepCheck)\n\n if (keysA.length !== keysB.length)\n return false\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i])\n return false\n\n return true\n}",
"function are_equal(a1, a2)\n{\n if (typeof(a1) != typeof(a2))\n return false;\n \n switch(typeof(a1)) {\n case 'object':\n // arrays\n if (a1.length) {\n if (a1.length != a2.length)\n return false;\n for (var i = 0; i < a1.length; ++i) {\n if (!are_equal(a1[i], a2[i]))\n return false\n }\n }\n // associative arrays\n else {\n var keys = {};\n for (var key in a1) {\n keys[key] = true;\n }\n for (var key in a2) {\n keys[key] = true;\n }\n for (var key in keys) {\n if (!are_equal(a1[key], a2[key]))\n return false;\n }\n }\n return true;\n \n default:\n return a1 == a2;\n }\n}",
"function areEquals(a, b) {\n\n\tlet aProps = Object.getOwnPropertyNames(a);\n let bProps = Object.getOwnPropertyNames(b);\n\n if (bProps.length !== aProps.length)\n \treturn false;\n\n for (let key of aProps) {\n \tif (!bProps.includes(key) || b[key] !== a[key])\n \t\treturn false;\n }\n\n for (let key of bProps) {\n \tif (!aProps.includes(key) || b[key] !== a[key])\n \t\treturn false;\n }\n\n return true;\n}",
"function allValuesEqualTo(input, value, opts) {\n if (Array.isArray(input)) {\n if (input.length === 0) {\n return true;\n }\n\n if (opts.arraysMustNotContainPlaceholders && input.length > 0 && input.some(el => isEq(el, value))) {\n return false;\n } // so at this point\n // backwards traversal for increased performance:\n\n\n for (let i = input.length; i--;) {\n if (!allValuesEqualTo(input[i], value, opts)) {\n return false;\n }\n }\n\n return true;\n }\n\n if (isObj(input)) {\n const keys = Object.keys(input);\n\n if (keys.length === 0) {\n return true;\n }\n\n for (let i = keys.length; i--;) {\n if (!allValuesEqualTo(input[keys[i]], value, opts)) {\n return false;\n }\n }\n\n return true;\n }\n\n return isEq(input, value);\n} // T H E E X P O S E D W R A P P E R F U N C T I O N",
"function _areEquals(a, b) {\n if (a === b)\n return true;\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\n if (arrA && arrB) {\n length = a.length;\n if (length != b.length)\n return false;\n for (i = length; i-- !== 0;)\n if (!_areEquals(a[i], b[i]))\n return false;\n return true;\n }\n if (arrA != arrB)\n return false;\n var keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length)\n return false;\n for (i = length; i-- !== 0;)\n if (!b.hasOwnProperty(keys[i]))\n return false;\n for (i = length; i-- !== 0;) {\n key = keys[i];\n if (!_areEquals(a[key], b[key]))\n return false;\n }\n return true;\n }\n return a !== a && b !== b;\n}",
"function _areEquals(a, b) {\n if (a === b)\n return true;\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\n if (arrA && arrB) {\n length = a.length;\n if (length != b.length)\n return false;\n for (i = length; i-- !== 0;)\n if (!_areEquals(a[i], b[i]))\n return false;\n return true;\n }\n if (arrA != arrB)\n return false;\n var keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length)\n return false;\n for (i = length; i-- !== 0;)\n if (!b.hasOwnProperty(keys[i]))\n return false;\n for (i = length; i-- !== 0;) {\n key = keys[i];\n if (!_areEquals(a[key], b[key]))\n return false;\n }\n return true;\n }\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}",
"function keyValMatch(obj1, obj2){\n\tfor(key in obj1){\n\t\tfor(otherKey in obj2){\n\t\t\tif(key == otherKey && obj1[key] == obj2[otherKey]){\n\t\t\t\t\n\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\treturn false;\n}",
"function areObjectsEqual(obj1, obj2) {\n if (Object.keys(obj1).length !== Object.keys(obj2).length) {\n return false;\n }\n let objectLength = Object.keys(obj1).length;\n let i = 1;\n for (let key in obj1) {\n if (!obj2[key] || obj1[key] !== obj2[key]) {\n return false;\n } else if (objectLength === i) {\n return true;\n }\n i++;\n }\n}",
"function equal(a, b) {\n\n if (Object.is(a, b))\n return true;\n\n\t// Dates must have equal time values\n\tif (isDate(a) && isDate(b))\n\t\treturn a.getTime() === b.getTime();\n\n\t// Non-objects must be strictly equal (types must be equal)\n\tif (!isObject(a) || !isObject(b))\n\t\treturn a === b;\n\n\t// Prototypes must be identical. getPrototypeOf may throw on\n\t// ES3 engines that don't provide access to the prototype.\n\ttry {\n\n\t if (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n\t\t return false;\n\n\t} catch (err) {}\n\n\tvar aKeys = Object.keys(a),\n\t\tbKeys = Object.keys(b);\n\n\t// Number of own properties must be identical\n\tif (aKeys.length !== bKeys.length)\n\t\treturn false;\n\n\tfor (var i$0 = 0; i$0 < aKeys.length; ++i$0) {\n\n\t\t// Names of own properties must be identical\n\t\tif (!OP_hasOwnProperty.call(b, aKeys[i$0]))\n\t\t\treturn false;\n\n\t\t// Values of own properties must be equal\n\t\tif (!equal(a[aKeys[i$0]], b[aKeys[i$0]]))\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}",
"function deepEqual(object1, object2) {\n const keys1 = Object.keys(object1);\n const keys2 = Object.keys(object2);\n \n if (keys1.length !== keys2.length) {\n return false;\n }\n \n for (const key of keys1) {\n const val1 = object1[key];\n const val2 = object2[key];\n const areObjects = isObject(val1) && isObject(val2);\n if (\n areObjects && !deepEqual(val1, val2) ||\n !areObjects && val1 !== val2\n ) {\n return false;\n }\n }\n \n return true;\n}",
"function sameKeysNested(objA, objB, ignoreOrder) {\n var keysA = Object.keys(objA)\n var keysB = Object.keys(objB)\n\n if (keysA.length !== keysB.length)\n return false\n\n if (ignoreOrder) keysA.sort(), keysB.sort()\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i])\n return false\n\n if (typeof objA[keysA[i]] === \"object\")\n sameKeysNested(objA[keysA[i]], objB[keysB[i]], ignoreOrder)\n\n return true\n}",
"function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (areBothNaN(a, b))\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}",
"function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (areBothNaN(a, b))\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}",
"function dictsAreEquivalent(a, b) {\n // Create arrays of property names\n var aProps = Object.getOwnPropertyNames(a);\n var bProps = Object.getOwnPropertyNames(b);\n\n // If number of properties is different,\n // objects are not equivalent\n if (aProps.length != bProps.length) {\n return false;\n }\n\n for (var i = 0; i < aProps.length; i++) {\n var propName = aProps[i];\n\n // If values of same property are not equal,\n // objects are not equivalent\n if (a[propName] !== b[propName]) {\n return false;\n }\n }\n\n // If we made it this far, objects\n // are considered equivalent\n return true;\n}",
"function keyValMatch(obj1, obj2) {\r\n\t//create nested loop\r\n\t//for each key in obj 1, check each key of obj 2 for match\r\n\tfor(key1 in obj1) {\r\n\t\tfor(key2 in obj2) {\r\n\t\t\tif ( (key1 == key2) && (obj1[key1] == obj2[key2])) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn false;\r\n}",
"function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n var length, i, keys;\n\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n\n for (i = length; i-- !== 0;) if (!equal(a[i], b[i])) return false;\n\n return true;\n } // 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`.\n\n\n var it;\n\n if (hasMap && a instanceof Map && b instanceof Map) {\n if (a.size !== b.size) return false;\n it = a.entries();\n\n while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\n\n it = a.entries();\n\n while (!(i = it.next()).done) if (!equal(i.value[1], b.get(i.value[0]))) return false;\n\n return true;\n }\n\n if (hasSet && a instanceof Set && b instanceof Set) {\n if (a.size !== b.size) return false;\n it = a.entries();\n\n while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\n\n return true;\n } // END: Modifications\n\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n\n for (i = length; i-- !== 0;) if (a[i] !== b[i]) return false;\n\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n 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\n\n\n if (hasElementType && a instanceof Element) return false; // custom handling for React/Preact\n\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // 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\n continue;\n } // all other properties should be traversed as usual\n\n\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n } // END: react-fast-compare\n // START: fast-deep-equal\n\n\n return true;\n }\n\n return a !== a && b !== b;\n} // end fast-deep-equal",
"function shallowEqual(actual /*: Object*/, expected /*: Object*/) /*: boolean*/ {\n\t var keys = _Object$keys(expected);\n\n\t for (var _iterator3 = (keys /*: Array<string>*/), _isArray3 = Array.isArray(_iterator3), _i3 = 0, _iterator3 = _isArray3 ? _iterator3 : _getIterator(_iterator3);;) {\n\t var _ref3;\n\n\t if (_isArray3) {\n\t if (_i3 >= _iterator3.length) break;\n\t _ref3 = _iterator3[_i3++];\n\t } else {\n\t _i3 = _iterator3.next();\n\t if (_i3.done) break;\n\t _ref3 = _i3.value;\n\t }\n\n\t var key = _ref3;\n\n\t if (actual[key] !== expected[key]) {\n\t return false;\n\t }\n\t }\n\n\t return true;\n\t}",
"function sameProperties(objA, objB) {\n var keysA = Object.keys(objA).sort()\n var keysB = Object.keys(objB).sort()\n\n if (keysA.length !== keysB.length)\n return false\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i] || objA[keysA[i]] !== objB[keysB[i]])\n return false\n\n return true\n}",
"function _shallowCompareKeys(objA, objB, keys) {\n\t return _filterKeys(objA, objB, keys).every(function (key) {\n\t return objA.hasOwnProperty(key) === objB.hasOwnProperty(key) && objA[key] === objB[key];\n\t });\n\t}",
"function has_all(obj, keys) {\n for (var i in keys) {\n let key = keys[i];\n if (!(key in obj)) {\n return false;\n }\n }\n return true;\n}",
"function matchItems(object1, object2) {\n for (var key in object1) {\n for (var anotherKey in object2) {\n if (key === anotherKey) {\n if (object1[key] === object2[anotherKey]) {\n return true;\n } \n }\n }\n }\n return false;\n }",
"function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}",
"function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}",
"function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}",
"function areThereDuplicates(...args) {\n let obj = {};\n\n for (let val of args) {\n obj[val] = (obj[val] || 0) + 1;\n }\n \n for(let key in obj) {\n if(obj[key] !== 1) return true;\n }\n \n return false;\n}",
"function deepEqual(a, b) {\n if (typeof a !== 'object' || typeof b !== 'object' || a == null || b == null)\n return a === b;\n if (Object.keys(a).length !== Object.keys(b).length) return false;\n for (let i = 0; i < Object.keys(a).length; i++)\n if (!deepEqual(a[Object.keys(a)[i]], b[Object.keys(a)[i]])) return false;\n return true;\n}",
"function shallowEqualObjects(a, b) {\r\n if (a && !b || b && !a) {\r\n return false;\r\n }\r\n\r\n for (var key in a) {\r\n if (a[key] !== b[key]) {\r\n return false;\r\n }\r\n }\r\n\r\n return true;\r\n} // Copied from: https://github.com/jonschlinkert/is-plain-object",
"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 equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0; )\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // 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`.\n var it;\n if (hasMap && a instanceof Map && b instanceof Map) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && a instanceof Set && b instanceof Set) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (\n hasArrayBuffer &&\n ArrayBuffer.isView(a) &&\n ArrayBuffer.isView(b)\n ) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0; ) if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp)\n return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf)\n return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString)\n return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0; )\n if (!Object.prototype.hasOwnProperty.call(b, keys[i]))\n return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0; ) {\n if (\n (keys[i] === '_owner' ||\n keys[i] === '__v' ||\n keys[i] === '__o') &&\n a.$$typeof\n ) {\n // 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\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n }",
"function deepEqual(firstObject, secondObject) {\n const firstKeys = Object.keys(firstObject);\n const secondKeys = Object.keys(secondObject);\n\n if (firstKeys.length !== secondKeys.length) {\n return false;\n }\n\n for (const key of firstKeys) {\n const val1 = firstObject[key];\n const val2 = secondObject[key];\n const areObjects = val1 != null && typeof val1 === 'object' && val2 != null && typeof val2 === 'object';\n if (\n areObjects && !deepEqual(val1, val2) ||\n !areObjects && val1 !== val2\n ) {\n return false;\n }\n }\n\n return true;\n}",
"function objEquals(a, b)\r\n{\r\n for(x in b)\r\n if(typeof(a[x]) == \"undefined\")\r\n return false;\r\n\r\n for(x in a)\r\n {\r\n if(typeof(b[x]) == \"undefined\")\r\n return false;\r\n\r\n if(a[x])\r\n {\r\n if(typeof(a[x]) == \"object\")\r\n {\r\n if(typeof(b[x]) != \"object\" || !objEquals(a[x], b[x]))\r\n return false;\r\n }\r\n else if(a[x] !== b[x])\r\n return false;\r\n }\r\n else if(b[x])\r\n return false;\r\n }\r\n\r\n return true;\r\n}",
"function shallowCompareKeys(objA, objB, keys) {\n\t // treat `null` and `undefined` as the same\n\t if (objA == null && objB == null) {\n\t return true;\n\t }\n\t else if (objA == null || objB == null) {\n\t return false;\n\t }\n\t else if (Array.isArray(objA) || Array.isArray(objB)) {\n\t return false;\n\t }\n\t else if (keys != null) {\n\t return _shallowCompareKeys(objA, objB, keys);\n\t }\n\t else {\n\t // shallowly compare all keys from both objects\n\t var keysA = Object.keys(objA);\n\t var keysB = Object.keys(objB);\n\t return (_shallowCompareKeys(objA, objB, { include: keysA }) && _shallowCompareKeys(objA, objB, { include: keysB }));\n\t }\n\t}",
"function has_match(first_object, second_object) {\n\tfor (key in first_object) {\n\t\tif (first_object.key === second_object.key) {\n\t\t\treturn true; break;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n}",
"function keyValueMatch(obj1, obj2) {\n\tfor (var key1 in obj1) {\n\t\tfor (var key2 in obj2) {\n\t\t\tif (key1 == key2) {\n\t\t\t\tif (obj1[key1] == obj2[key2]) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}",
"function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\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.5949305",
"0.5943498",
"0.5941007",
"0.5938824",
"0.5921179",
"0.59196156",
"0.5897878",
"0.5849006",
"0.5842662",
"0.5828565",
"0.5822586",
"0.5822586",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.58005905",
"0.57966375",
"0.5785573",
"0.57781947",
"0.5774723",
"0.5745776",
"0.57150096",
"0.57150096",
"0.5713776",
"0.56972325",
"0.5696503",
"0.56959665",
"0.5683715",
"0.56644714",
"0.5660933",
"0.56607985",
"0.56596416",
"0.56596416",
"0.56596416",
"0.5652469",
"0.5637622",
"0.56328917",
"0.56256086",
"0.56256086",
"0.5615261",
"0.56147397",
"0.560344",
"0.56012976",
"0.560014",
"0.55943495",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152",
"0.5591152"
] |
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('safari-overlay');\n document.getElementById('safari-blocker-msg').classList.remove('d-none');\n } \n}",
"function isSafari()\n{\n if(navigator.userAgent.indexOf(\"Safari\")>0)\n {\n return true;\n } \n else\n {\n return false; \n } \n}",
"function isSafari(){\r\n\t\treturn(-1!==navigator.userAgent.indexOf('Safari')&&-1===navigator.userAgent.indexOf('Chrome'));\r\n\t}",
"static isMacOSSafari() {\n if (typeof window.safari !== \"undefined\") {\n return true;\n }\n return isMacOSSafariInIframe();\n }",
"Safari ():boolean {\n\n\t\treturn (this.agent.match(/Safari/i) || this.agent.match(/AppleWebKit/i)) && !this.agent.match(/Chrome/i) ? true : false;\n\t}",
"function isSafari() {\r\n return (!isNode() &&\r\n navigator.userAgent.includes('Safari') &&\r\n !navigator.userAgent.includes('Chrome'));\r\n}",
"function isSafari() {\r\n return (!isNode() &&\r\n navigator.userAgent.includes('Safari') &&\r\n !navigator.userAgent.includes('Chrome'));\r\n}",
"function isSafari() {\r\n return (!isNode() &&\r\n navigator.userAgent.includes('Safari') &&\r\n !navigator.userAgent.includes('Chrome'));\r\n}",
"function isSafari() {\r\n return (!isNode() &&\r\n navigator.userAgent.includes('Safari') &&\r\n !navigator.userAgent.includes('Chrome'));\r\n}",
"function isUnsupportedSafari () {\n var\n isApple = !!( navigator.vendor || '' ).match( /Apple/ ),\n version = navigator.userAgent.match( /Version\\/([^ ]*)/ );\n version = version ? parseFloat( version[ 1 ] ) : 0;\n return isApple && version <= 6;\n }",
"constructor() {\n super();\n this.chrome = chrome;\n //https://stackoverflow.com/questions/9847580/how-to-detect-safari-chrome-ie-firefox-and-opera-browser?utm_medium=organic&utm_source=google_rich_qa&utm_campaign=google_rich_qa\n }",
"function isSafari() {\n return /^((?!chrome|android|ubuntu).)*safari/i.test(navigator.userAgent);\n}",
"function isOldWebKit() {\n\t\t\t\tvar webKitChunks = navigator.userAgent.match(/WebKit\\/(\\d*)/);\n\t\t\t\treturn !!(webKitChunks && webKitChunks[1] < 536);\n\t\t\t}",
"function isOldWebKit() {\n\t\t\t\tvar webKitChunks = navigator.userAgent.match(/WebKit\\/(\\d*)/);\n\t\t\t\treturn !!(webKitChunks && webKitChunks[1] < 536);\n\t\t\t}",
"function isOldWebKit() {\n\t\t\t\tvar webKitChunks = navigator.userAgent.match(/WebKit\\/(\\d*)/);\n\t\t\t\treturn !!(webKitChunks && webKitChunks[1] < 536);\n\t\t\t}",
"function isSafari() {\n var ua = navigator.userAgent.toLowerCase();\n if (ua.indexOf('safari') != -1) {\n if (ua.indexOf('chrome') > -1) {\n return false; // Chrome\n } else {\n return true; // Safari\n }\n }\n return false;\n}",
"function isSafari() {\n return (!isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome'));\n}",
"function isSafari() {\n return (!isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome'));\n}",
"function isSafari() {\n return (!isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome'));\n}",
"function isSafari() {\n return (!isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome'));\n}",
"function isSafari() {\n return (!isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome'));\n}",
"function isSafari() {\n return (!isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome'));\n}",
"function getBrowser (){\nif(jQuery.uaMatch(navigator.userAgent).browser == 'webkit'){\nvar userAgent = navigator.userAgent.toLowerCase();\nif ( userAgent.indexOf(\"chrome\") === -1 ) { \nreturn 'safari';\n}\nelse {\nreturn jQuery.uaMatch(navigator.userAgent).browser;\n}\n}\n}",
"function isWebKit(){\n\treturn navigator.userAgent.indexOf('WebKit/')>0;\n}",
"function DetectaWebkit(){\n\n if (uagent.search(engineWebKit) > -1)\n\n return true;\n\n else\n\n return false;\n\n}",
"function isSafari() {\n return /^((?!chrome).)*safari/i.test(navigator.userAgent);\n }",
"function DetectWebkit()\n{\n if (uagent.search(engineWebKit) > -1)\n return true;\n else\n return false;\n}",
"function initCheckSafariBrowser(){\n\t\"use strict\";\n\n\tif (navigator.userAgent.indexOf('Safari') !== -1 && navigator.userAgent.indexOf('Chrome') === -1) {\n\t\t$j('body').addClass('safari_browser');\n\t}\n}",
"function DetectWebkit()\n{\n if (uagent.search(engineWebKit) > -1)\n return true;\n else\n return false;\n}",
"function init() {\n draw();\n isSafari(); \n}",
"function css_browser_selector(e){var r=e.toLowerCase(),i=function(e){return r.indexOf(e)>-1},t=\"gecko\",o=\"webkit\",a=\"safari\",n=\"chrome\",s=\"opera\",d=\"mobile\",c=0,l=window.devicePixelRatio?(window.devicePixelRatio+\"\").replace(\".\",\"_\"):\"1\",w=[!/opera|webtv/.test(r)&&/msie\\s(\\d+)/.test(r)&&(c=1*RegExp.$1)?\"ie ie\"+c+(6==c||7==c?\" ie67 ie678 ie6789\":8==c?\" ie678 ie6789\":9==c?\" ie6789 ie9m\":c>9?\" ie9m\":\"\"):/trident\\/\\d+.*?;\\s*rv:(\\d+)\\.(\\d+)\\)/.test(r)&&(c=[RegExp.$1,RegExp.$2])?\"ie ie\"+c[0]+\" ie\"+c[0]+\"_\"+c[1]+\" ie9m\":/firefox\\/(\\d+)\\.(\\d+)/.test(r)&&(re=RegExp)?t+\" ff ff\"+re.$1+\" ff\"+re.$1+\"_\"+re.$2:i(\"gecko/\")?t:i(s)?s+(/version\\/(\\d+)/.test(r)?\" \"+s+RegExp.$1:/opera(\\s|\\/)(\\d+)/.test(r)?\" \"+s+RegExp.$2:\"\"):i(\"konqueror\")?\"konqueror\":i(\"blackberry\")?d+\" blackberry\":i(n)||i(\"crios\")?o+\" \"+n:i(\"iron\")?o+\" iron\":!i(\"cpu os\")&&i(\"applewebkit/\")?o+\" \"+a:i(\"mozilla/\")?t:\"\",i(\"android\")?d+\" android\":\"\",i(\"tablet\")?\"tablet\":\"\",i(\"j2me\")?d+\" j2me\":i(\"ipad; u; cpu os\")?d+\" chrome android tablet\":i(\"ipad;u;cpu os\")?d+\" chromedef android tablet\":i(\"iphone\")?d+\" ios iphone\":i(\"ipod\")?d+\" ios ipod\":i(\"ipad\")?d+\" ios ipad tablet\":i(\"mac\")?\"mac\":i(\"darwin\")?\"mac\":i(\"webtv\")?\"webtv\":i(\"win\")?\"win\"+(i(\"windows nt 6.0\")?\" vista\":\"\"):i(\"freebsd\")?\"freebsd\":i(\"x11\")||i(\"linux\")?\"linux\":\"\",\"1\"!=l?\" retina ratio\"+l:\"\",\"js portrait\"].join(\" \");return window.jQuery&&!window.jQuery.browser&&(window.jQuery.browser=c?{msie:1,version:c}:{}),w}",
"function detect(ua){var os={};var browser={};var webkit=ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);var android=ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);var ipad=ua.match(/(iPad).*OS\\s([\\d_]+)/);var ipod=ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);var iphone=!ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);var webos=ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);var touchpad=webos && ua.match(/TouchPad/);var kindle=ua.match(/Kindle\\/([\\d.]+)/);var silk=ua.match(/Silk\\/([\\d._]+)/);var blackberry=ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);var bb10=ua.match(/(BB10).*Version\\/([\\d.]+)/);var rimtabletos=ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);var playbook=ua.match(/PlayBook/);var chrome=ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);var firefox=ua.match(/Firefox\\/([\\d.]+)/);var safari=webkit && ua.match(/Mobile\\//) && !chrome;var webview=ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;var ie=ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);var edge=ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n if(browser.webkit = !!webkit)browser.version = webkit[1];if(android)os.android = true,os.version = android[2];if(iphone && !ipod)os.ios = os.iphone = true,os.version = iphone[2].replace(/_/g,'.');if(ipad)os.ios = os.ipad = true,os.version = ipad[2].replace(/_/g,'.');if(ipod)os.ios = os.ipod = true,os.version = ipod[3]?ipod[3].replace(/_/g,'.'):null;if(webos)os.webos = true,os.version = webos[2];if(touchpad)os.touchpad = true;if(blackberry)os.blackberry = true,os.version = blackberry[2];if(bb10)os.bb10 = true,os.version = bb10[2];if(rimtabletos)os.rimtabletos = true,os.version = rimtabletos[2];if(playbook)browser.playbook = true;if(kindle)os.kindle = true,os.version = kindle[1];if(silk)browser.silk = true,browser.version = silk[1];if(!silk && os.android && ua.match(/Kindle Fire/))browser.silk = true;if(chrome)browser.chrome = true,browser.version = chrome[1];if(firefox)browser.firefox = true,browser.version = firefox[1];if(ie)browser.ie = true,browser.version = ie[1];if(safari && (ua.match(/Safari/) || !!os.ios))browser.safari = true;if(webview)browser.webview = true;if(ie)browser.ie = true,browser.version = ie[1];if(edge)browser.edge = true,browser.version = edge[1];os.tablet = !!(ipad || playbook || android && !ua.match(/Mobile/) || firefox && ua.match(/Tablet/) || ie && !ua.match(/Phone/) && ua.match(/Touch/));os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos || blackberry || bb10 || chrome && ua.match(/Android/) || chrome && ua.match(/CriOS\\/([\\d.]+)/) || firefox && ua.match(/Mobile/) || ie && ua.match(/Touch/)));return {browser:browser,os:os,node:false, // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported:document.createElement('canvas').getContext?true:false, // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported:'ontouchstart' in window && !browser.ie && !browser.edge, // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported:'onpointerdown' in window // Firefox supports pointer but not by default,\n // only MS browsers are reliable on pointer events currently.\n && (browser.edge || browser.ie && browser.version >= 10)};}",
"function extractSafariVersionString()\r\n{\r\n var safariVersionString = navigator.userAgent.match(safariVersionRegex)[firstMatchIndex];\r\n if (safariVersionString != null)\r\n {\r\n safariVersionString = safariVersionString.substring(safariVersionStartIndex, safariVersionString.length);\r\n }\r\n\r\n return safariVersionString;\r\n}",
"function DetectAndroidWebKit()\n{\n if (DetectAndroid())\n {\n if (DetectWebkit())\n return true;\n else\n return false;\n }\n else\n return false;\n}",
"function BrowserDetect() {}",
"function isSafari() {\n\tdata_Vue.isBrowserSafari = /^((?!chrome|android).)*safari/i.test(navigator.userAgent);\n\tdata_Vue.isDraggableOption='No';\n}",
"function sniffBrowsers() {\r\n\tns4 = document.layers;\r\n\top5 = (navigator.userAgent.indexOf(\"Opera 5\")!=-1) \r\n\t\t||(navigator.userAgent.indexOf(\"Opera/5\")!=-1);\r\n\top6 = (navigator.userAgent.indexOf(\"Opera 6\")!=-1) \r\n\t\t||(navigator.userAgent.indexOf(\"Opera/6\")!=-1);\r\n\t\r\n\tagt = navigator.userAgent.toLowerCase();\r\n\tmac = (agt.indexOf(\"mac\")!=-1);\r\n\tie = (agt.indexOf(\"msie\") != -1); \r\n\tmac_ie = mac && ie;\r\n\tffox = (agt.indexOf(\"firefox\") != -1);\r\n}",
"function e(a){var q=(a||u).toLowerCase();var A1=/(webkit)[ \\/]([\\w.]+)/;var B1=/(opera)(?:.*version)?[ \\/]([\\w.]+)/;var C1=/(mozilla)(?:.*? rv:([\\w.]+))?/;var D1=A1.exec(q)||B1.exec(q)||q.indexOf(\"compatible\")<0&&C1.exec(q)||[];var E1={browser:D1[1]||\"\",version:D1[2]||\"0\"};E1[E1.browser]=true;return E1;}",
"function isSafari(ua) {\n return (-1 != ua.indexOf('ipad')) || (-1 != ua.indexOf('iphone'));\n}",
"function DetectAndroidWebKit()\n{\n if (DetectAndroid() && DetectWebkit())\n return true;\n else\n return false;\n}",
"function DetectaAndroidWebKit(){\n\n \tif (DetectaAndroid()){\n\n \tif (DetectaWebkit()){\n\n \treturn true;\n\n\t\t}else{\n\n \treturn false;\n\n\t\t}\n\n \t}else{\n\n \t\treturn false;\n\n \t}\n\n}",
"function iOS() \r\n\t\t{\r\n\t\t\tvar iDevices = ['iPad Simulator','iPhone Simulator','iPod Simulator','iPad','iPhone','iPod'];\r\n\t\t\tvar isSafari = !!navigator.userAgent.match(/Version\\/[\\d\\.]+.*Safari/);\r\n\t\t\t\r\n\t\t\tif (!!navigator.platform) \r\n\t\t\t{\r\n\t\t\t\twhile (iDevices.length) \r\n\t\t\t\t{\r\n\t\t\t\t\tif (navigator.platform === iDevices.pop())\r\n\t\t\t\t\t{ \r\n\t\t\t\t\t\treturn true; \r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(isSafari)\r\n\t\t\t{\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\treturn false;\r\n\t\t}",
"function k(){var a=u.toLowerCase();var e=/(webkit)[ \\/]([\\w.]+)/;var f=/(opera)(?:.*version)?[ \\/]([\\w.]+)/;var i=/(msie) ([\\w.]+)/;var q=/(mozilla)(?:.*? rv:([\\w.]+))?/;var C=e.exec(a)||f.exec(a)||i.exec(a)||a.indexOf(\"compatible\")<0&&q.exec(a)||[];var s={browser:C[1]||\"\",version:C[2]||\"0\"};s[s.browser]=true;return s}",
"hasClickBug() {\n\t\tconst ua = window.navigator.userAgent;\n\t\tconst result = /Safari/.test(ua);\n\n\t\tthis.hasClickBug = () => result;\n\t\treturn result;\n\t}",
"function e(a){var q=(a||u).toLowerCase();var B1=/(webkit)[ \\/]([\\w.]+)/;var C1=/(opera)(?:.*version)?[ \\/]([\\w.]+)/;var D1=/(msie) ([\\w.]+)/;var E1=/(trident)\\/[\\w.]+;.*rv:([\\w.]+)/;var F1=/(edge)[ \\/]([\\w.]+)/;var G1=/(mozilla)(?:.*? rv:([\\w.]+))?/;var H1=F1.exec(q)||E1.exec(q)||B1.exec(q)||C1.exec(q)||D1.exec(q)||q.indexOf(\"compatible\")<0&&G1.exec(q)||[];var I1={browser:H1[1]||\"\",version:H1[2]||\"0\"};I1[I1.browser]=true;return I1;}",
"function detectBrowser() {\n if (firefoxBrowser >= 0) {\n return \"firefox\";\n } else if (operaBrowser >= 0) {\n return \"opera\";\n } else if (ieBrowser >= 0) {\n return \"ie\";\n } else if (edgeBrowser >= 0) {\n return \"edge\";\n } else if (chromeBrowser >= 0) {\n return \"chrome\";\n } else if (safariBrowser >= 0 && chromeBrowser < 0) {\n return \"safari\";\n } else {\n return \"unknown\";\n };\n}",
"function DetectAndroidWebKit()\n\t{\n \t\tif (DetectAndroid())\n \t{\n \tif (DetectWebkit())\n \treturn true;\n \telse\n \treturn false;\n \t\t}\n \t\telse\n \t\treturn false;\n\t\t}",
"function detect(ua) {\n var os = {};\n var browser = {};\n // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n var firefox = ua.match(/Firefox\\/([\\d.]+)/);\n // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n var ie = ua.match(/MSIE\\s([\\d.]+)/)\n // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua);\n\n // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n }\n // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n }\n\n // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n if (weChat) {\n browser.weChat = true;\n }\n\n // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: document.createElement('canvas').getContext ? true : false,\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window\n // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11)\n };\n}",
"function isCompliantBrowser() {\n var isCompliant = false;\n var ua = navigator.userAgent;\n var browserName = navigator.appName;\n var nVer = navigator.appVersion;\n var fullVersion = '' + parseFloat(navigator.appVersion);\n var majorVer = parseInt(navigator.appVersion, 10);\n var nameOffset, verOffset, ix;\n //Google Chrome \n if ((verOffset = ua.indexOf(\"Chrome\")) != -1) {\n browserName = \"Chrome\";\n fullVersion = ua.substring(verOffset + 7);\n isCompliant = true;\n }\n else if ((verOffset = ua.indexOf(\"OPR/\")) != -1) {\n browserName = \"Opera\";\n fullVersion = ua.substring(verOffset + 4);\n }\n else if ((verOffset = ua.indexOf(\"Opera\")) != -1) {\n browserName = \"Opera\";\n fullVersion = ua.substring(verOffset + 6);\n if ((verOffset = ua.indexOf(\"Version\")) != -1)\n fullVersion = ua.substring(verOffset + 8);\n }\n else if ((verOffset = ua.indexOf(\"MSIE\")) != -1) {\n browserName = \"Microsoft Internet Explorer\";\n fullVersion = ua.substring(verOffset + 5);\n }\n else if ((verOffset = ua.indexOf(\"Safari\")) != -1) {\n browserName = \"Safari\";\n fullVersion = ua.substring(verOffset + 7);\n if ((verOffset = ua.indexOf(\"Version\")) != -1)\n fullVersion = ua.substring(verOffset + 8);\n }\n else if ((verOffset = ua.indexOf(\"Firefox\")) != -1) {\n browserName = \"Firefox\";\n fullVersion = ua.substring(verOffset + 8);\n }\n else if ((nameOffset = ua.lastIndexOf(' ') + 1) <\n (verOffset = ua.lastIndexOf('/'))) {\n browserName = ua.substring(nameOffset, verOffset);\n fullVersion = ua.substring(verOffset + 1);\n if (browserName.toLowerCase() == browserName.toUpperCase()) {\n browserName = navigator.appName;\n }\n }\n return isCompliant;\n }",
"function isIOSSafari() {\n\t\tvar userAgent;\n\t\tuserAgent = window.navigator.userAgent;\n\t\treturn userAgent.match(/iPad/i) || userAgent.match(/iPhone/i);\n\t}",
"function isIOSSafari() {\n\t\tvar userAgent;\n\t\tuserAgent = window.navigator.userAgent;\n\t\treturn userAgent.match(/iPad/i) || userAgent.match(/iPhone/i);\n\t}",
"function isIOSSafari() {\n\t\tvar userAgent;\n\t\tuserAgent = window.navigator.userAgent;\n\t\treturn userAgent.match(/iPad/i) || userAgent.match(/iPhone/i);\n\t}",
"function isIOSSafari() {\n\t\tvar userAgent;\n\t\tuserAgent = window.navigator.userAgent;\n\t\treturn userAgent.match(/iPad/i) || userAgent.match(/iPhone/i);\n\t}",
"function DetectPalmWebOS()\n{\n if (uagent.search(deviceWebOS) > -1)\n return true;\n else\n return false;\n}",
"function detect(ua) {\n\t var os = {};\n\t var browser = {};\n\t // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n\t // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n\t // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n\t // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n\t // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n\t // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n\t // var touchpad = webos && ua.match(/TouchPad/);\n\t // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n\t // var silk = ua.match(/Silk\\/([\\d._]+)/);\n\t // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n\t // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n\t // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n\t // var playbook = ua.match(/PlayBook/);\n\t // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\t var firefox = ua.match(/Firefox\\/([\\d.]+)/);\n\t // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n\t // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\t var ie = ua.match(/MSIE\\s([\\d.]+)/)\n\t // IE 11 Trident/7.0; rv:11.0\n\t || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n\t var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n\t var weChat = /micromessenger/i.test(ua);\n\n\t // Todo: clean this up with a better OS/browser seperation:\n\t // - discern (more) between multiple browsers on android\n\t // - decide if kindle fire in silk mode is android or not\n\t // - Firefox on Android doesn't specify the Android version\n\t // - possibly devide in os, device and browser hashes\n\n\t // if (browser.webkit = !!webkit) browser.version = webkit[1];\n\n\t // if (android) os.android = true, os.version = android[2];\n\t // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n\t // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n\t // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n\t // if (webos) os.webos = true, os.version = webos[2];\n\t // if (touchpad) os.touchpad = true;\n\t // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n\t // if (bb10) os.bb10 = true, os.version = bb10[2];\n\t // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n\t // if (playbook) browser.playbook = true;\n\t // if (kindle) os.kindle = true, os.version = kindle[1];\n\t // if (silk) browser.silk = true, browser.version = silk[1];\n\t // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n\t // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\t if (firefox) {\n\t browser.firefox = true;\n\t browser.version = firefox[1];\n\t }\n\t // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n\t // if (webview) browser.webview = true;\n\n\t if (ie) {\n\t browser.ie = true;\n\t browser.version = ie[1];\n\t }\n\n\t if (edge) {\n\t browser.edge = true;\n\t browser.version = edge[1];\n\t }\n\n\t // It is difficult to detect WeChat in Win Phone precisely, because ua can\n\t // not be set on win phone. So we do not consider Win Phone.\n\t if (weChat) {\n\t browser.weChat = true;\n\t }\n\n\t // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n\t // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n\t // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n\t // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n\t // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\t return {\n\t browser: browser,\n\t os: os,\n\t node: false,\n\t // 原生canvas支持，改极端点了\n\t // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n\t canvasSupported: document.createElement('canvas').getContext ? true : false,\n\t // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n\t // works on most browsers\n\t // IE10/11 does not support touch event, and MS Edge supports them but not by\n\t // default, so we dont check navigator.maxTouchPoints for them here.\n\t touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n\t // <http://caniuse.com/#search=pointer%20event>.\n\t pointerEventsSupported: 'onpointerdown' in window\n\t // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n\t // events currently. So we dont use that on other browsers unless tested sufficiently.\n\t // Although IE 10 supports pointer event, it use old style and is different from the\n\t // standard. So we exclude that. (IE 10 is hardly used on touch device)\n\t && (browser.edge || browser.ie && browser.version >= 11)\n\t };\n\t}",
"function tryWebkitApproach() {\n // document.location = custom;\n document.location = \"epicollectplus://project?plus.epicollect.net/bestpint.xml\";\n timer = setTimeout(function () {\n document.location = alt;\n }, 2000);\n }",
"function y(a){var b=(a||u).toLowerCase();var e=/(webkit)[ \\/]([\\w.]+)/;var f=/(opera)(?:.*version)?[ \\/]([\\w.]+)/;var i=/(msie) ([\\w.]+)/;var q=/(trident)\\/[\\w.]+;.*rv:([\\w.]+)/;var s=/(mozilla)(?:.*? rv:([\\w.]+))?/;var V=e.exec(b)||f.exec(b)||i.exec(b)||q.exec(b)||b.indexOf(\"compatible\")<0&&s.exec(b)||[];var t={browser:V[1]||\"\",version:V[2]||\"0\"};t[t.browser]=true;return t}",
"function r(e){var t=(e||v).toLowerCase();var r=/(webkit)[ \\/]([\\w.]+)/;var n=/(opera)(?:.*version)?[ \\/]([\\w.]+)/;var i=/(msie) ([\\w.]+)/;var a=/(trident)\\/[\\w.]+;.*rv:([\\w.]+)/;var o=/(edge)[ \\/]([\\w.]+)/;var s=/(mozilla)(?:.*? rv:([\\w.]+))?/;var u=o.exec(t)||a.exec(t)||r.exec(t)||n.exec(t)||i.exec(t)||t.indexOf(\"compatible\")<0&&s.exec(t)||[];var l={browser:u[1]||\"\",version:u[2]||\"0\"};l[l.browser]=true;return l}",
"function detect(ua) {\n var os = {};\n var browser = {};\n // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n var firefox = ua.match(/Firefox\\/([\\d.]+)/);\n // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n var ie = ua.match(/MSIE\\s([\\d.]+)/)\n // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = (/micromessenger/i).test(ua);\n\n // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n }\n // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n }\n\n // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n if (weChat) {\n browser.weChat = true;\n }\n\n // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported : document.createElement('canvas').getContext ? true : false,\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window\n // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || (browser.ie && browser.version >= 11))\n };\n }",
"function detect(ua) {\n var os = {};\n var browser = {};\n // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n var firefox = ua.match(/Firefox\\/([\\d.]+)/);\n // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n var ie = ua.match(/MSIE\\s([\\d.]+)/)\n // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = (/micromessenger/i).test(ua);\n\n // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n }\n // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n }\n\n // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n if (weChat) {\n browser.weChat = true;\n }\n\n // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported : document.createElement('canvas').getContext ? true : false,\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window\n // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || (browser.ie && browser.version >= 11))\n };\n }",
"function Browser_DetermineBrowser()\n{\n\t//get user agent\n\tvar userAgent = navigator.userAgent;\n\t//scan for broser\n\tif (userAgent.indexOf(\"MSIE\") != -1)\n\t{\n\t\t//IE!\n\t\twindow.__BROWSER_TYPE = __BROWSER_IE;\n\t\t//get browser version\n\t\tvar version = parseFloat(userAgent.substring(userAgent.indexOf(\"MSIE\") + 5));\n\t\t//ie or better?\n\t\twindow.__BROWSER_IE10_OR_LESS = version < 11;\n\t\twindow.__BROWSER_IE9_OR_LESS = version < 10;\n\t\twindow.__BROWSER_IE8_OR_LESS = version < 9;\n\t\twindow.__BROWSER_IE11_OR_LESS = !(window.__BROWSER_IE10_OR_LESS || window.__BROWSER_IE9_OR_LESS || window.__BROWSER_IE8_OR_LESS);\n\t\tif (window.__BROWSER_IE8_OR_LESS)\n\t\t{\n\t\t\t//add special tags to render inline blocks correctly\n\t\t\twindow.__BROWSER_INLINE_BLOCK_CSS += \"zoom:1; *display: inline;\";\n\t\t\t//adjust get client bounds\n\t\t\twindow.__BROWSER_CLIENTRECT_MOD = version < 8 ? -2 : 0;\n\t\t}\n\t\t//correct the menu highlight\n\t\twindow.__MENU_BORDER_MENUBAR_HTML_HIGHLIGHT = __MENU_BORDER_MENUBAR_HTML_HIGHLIGHT_IE;\n\t\t//are we in screenshot mode\n\t\tif (__SCREENSHOTS_ON)\n\t\t{\n\t\t\t//add modifier to client rect\n\t\t\twindow.__BROWSER_CLIENTRECT_MOD += 2;\n\t\t}\n\t\t//mark specific bad resources for IE\n\t\twindow.__CACHE_REGEX_BAD_RESOURCES = __CACHE_REGEX_BAD_RESOURCES_IE11;\n\t\t//modify the scrollbar size\n\t\twindow.__CAMERA_CMD_SCROLL_BARSIZE = 17;\n\t}\n\telse if (userAgent.indexOf(\"Edge\") != -1)\n\t{\n\t\t//Edge!\n\t\twindow.__BROWSER_TYPE = __BROWSER_IE;\n\t\twindow.__BROWSER_EDGE = true;\n\t\t//modify the scrollbar size\n\t\twindow.__CAMERA_CMD_SCROLL_BARSIZE = 16;\n\t}\n\telse if (userAgent.indexOf(\"Firefox\") != -1)\n\t{\n\t\t//FireFox!\n\t\twindow.__BROWSER_TYPE = __BROWSER_FF;\n\t\t//rename mouse wheel event\n\t\twindow.__BROWSER_EVENT_MOUSEWHEEL = \"DOMMouseScroll\";\n\t\t//its a chromium\n\t\twindow.__BROWSER_CHROMIUM = true;\n\t\t//change the zoom functions\n\t\twindow.Zoom_Register = Zoom_Register_FireFox;\n\t\twindow.Get_ZoomedScale = Get_InterpreterDisplayScaleOnly;\n\t}\n\telse if (userAgent.indexOf(\"Chrome\") != -1)\n\t{\n\t\t//Chrome!\n\t\twindow.__BROWSER_TYPE = __BROWSER_CHROME;\n\t\t//its a chromium\n\t\twindow.__BROWSER_CHROMIUM = true;\n\t\t//change the zoom functions but only for retrieving zoomed scale\n\t\twindow.Get_ZoomedScale = Get_InterpreterDisplayScaleOnly;\n\t}\n\telse if (userAgent.indexOf(\"Opera\") != -1)\n\t{\n\t\t//Opera!\n\t\twindow.__BROWSER_TYPE = __BROWSER_OPERA;\n\t}\n\telse if (userAgent.indexOf(\"iPad\") != -1 || userAgent.indexOf(\"iPhone\") != -1)\n\t{\n\t\t//ipad? use safari for now\n\t\twindow.__BROWSER_TYPE = __BROWSER_SAFARI;\n\t\t//its a chromium\n\t\twindow.__BROWSER_CHROMIUM = true;\n\t\t//change the zoom functions but only for retrieving zoomed scale\n\t\twindow.Get_ZoomedScale = Get_InterpreterDisplayScaleOnly;\n\t\t//force a transformation for the body\n\t\twindow.document.body.style.transform = \"translate3d(0,0,0)\";\n\t}\n\telse if (userAgent.indexOf(\"Safari\") != -1)\n\t{\n\t\t//Safari!\n\t\twindow.__BROWSER_TYPE = __BROWSER_SAFARI;\n\t\t//its a chromium\n\t\twindow.__BROWSER_CHROMIUM = true;\n\t}\n\telse if (userAgent.indexOf(\"Trident/7.0\") != -1)\n\t{\n\t\t//IE!\n\t\twindow.__BROWSER_TYPE = __BROWSER_IE;\n\t\twindow.__BROWSER_IE11_OR_LESS = true;\n\t\t//mark specific bad resources for IE\n\t\twindow.__CACHE_REGEX_BAD_RESOURCES = __CACHE_REGEX_BAD_RESOURCES_IE11;\n\t\t//modify the scrollbar size\n\t\twindow.__CAMERA_CMD_SCROLL_BARSIZE = 17;\n\t}\n\telse\n\t{\n\t\t//in trouble!\n\t\tCommon_Error(\"Unable to determine browser\");\n\t\t//use ie\n\t\twindow.__BROWSER_TYPE = __BROWSER_IE;\n\t}\n\t//we have html5?\n\tif (!window.__BROWSER_IE8_OR_LESS)\n\t{\n\t\t//add css variables to the colors map\n\t\t__NEMESIS_COLORS_NAME_MAP[\"currentcolor\"] = \"CurrentColor\";\n\t}\n\t//update ligatures for css\n\tBrowser_SetupLigatures();\n\t//setup on touch\n\tBrowser_SetupOnTouch();\n}",
"function css_browser_selector(u){var ua=u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1},g='gecko',w='webkit',s='safari',o='opera',m='mobile',h=document.documentElement,b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3.6')?g+' ff3 ff3_6':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('blackberry')?m+' blackberry':is('android')?m+' android':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?m+' j2me':is('iphone')?m+' iphone':is('ipod')?m+' ipod':is('ipad')?m+' ipad':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win'+(is('windows nt 6.0')?' vista':''):is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function css_browser_selector(u){var ua=u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1},g='gecko',w='webkit',s='safari',o='opera',m='mobile',h=document.documentElement,b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3.6')?g+' ff3 ff3_6':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('blackberry')?m+' blackberry':is('android')?m+' android':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?m+' j2me':is('iphone')?m+' iphone':is('ipod')?m+' ipod':is('ipad')?m+' ipad':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win'+(is('windows nt 6.0')?' vista':''):is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function css_browser_selector(u){var ua=u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1},g='gecko',w='webkit',s='safari',o='opera',m='mobile',h=document.documentElement,b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3.6')?g+' ff3 ff3_6':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('blackberry')?m+' blackberry':is('android')?m+' android':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?m+' j2me':is('iphone')?m+' iphone':is('ipod')?m+' ipod':is('ipad')?m+' ipad':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win'+(is('windows nt 6.0')?' vista':''):is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function css_browser_selector(u){var ua=u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1},g='gecko',w='webkit',s='safari',o='opera',m='mobile',h=document.documentElement,b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3.6')?g+' ff3 ff3_6':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('blackberry')?m+' blackberry':is('android')?m+' android':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?m+' j2me':is('iphone')?m+' iphone':is('ipod')?m+' ipod':is('ipad')?m+' ipad':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win'+(is('windows nt 6.0')?' vista':''):is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function css_browser_selector(u){var ua=u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1},g='gecko',w='webkit',s='safari',o='opera',m='mobile',h=document.documentElement,b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3.6')?g+' ff3 ff3_6':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('blackberry')?m+' blackberry':is('android')?m+' android':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?m+' j2me':is('iphone')?m+' iphone':is('ipod')?m+' ipod':is('ipad')?m+' ipad':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win'+(is('windows nt 6.0')?' vista':''):is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function css_browser_selector(u){var ua=u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1},g='gecko',w='webkit',s='safari',o='opera',m='mobile',h=document.documentElement,b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3.6')?g+' ff3 ff3_6':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('blackberry')?m+' blackberry':is('android')?m+' android':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?m+' j2me':is('iphone')?m+' iphone':is('ipod')?m+' ipod':is('ipad')?m+' ipad':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win'+(is('windows nt 6.0')?' vista':''):is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function DetectS60OssBrowser()\n{\n if (DetectWebkit())\n {\n if ((uagent.search(deviceS60) > -1 || \n uagent.search(deviceSymbian) > -1))\n return true;\n else\n return false;\n }\n else\n return false;\n}",
"function trk_get_browser() {\n // Opera 8.0+\n var isOpera = (!!window.opr && !!opr.addons) || !!window.opera || navigator.userAgent.indexOf(' OPR/') >= 0;\n\n // Firefox 1.0+\n var isFirefox = typeof InstallTrigger !== 'undefined';\n\n // Safari 3.0+ \"[object HTMLElementConstructor]\"\n var isSafari = /constructor/i.test(window.HTMLElement) || (function (p) { return p.toString() === \"[object SafariRemoteNotification]\"; })(!window['safari'] || safari.pushNotification);\n\n // Internet Explorer 6-11\n var isIE = /*@cc_on!@*/false || !!document.documentMode;\n\n // Edge 20+\n var isEdge = !isIE && !!window.StyleMedia;\n\n // Chrome 1+\n var isChrome = !!window.chrome && !!window.chrome.webstore;\n\n // Blink engine detection\n var isBlink = (isChrome || isOpera) && !!window.CSS;\n\n return isOpera ? 'Opera' :\n isFirefox ? 'Firefox' :\n isSafari ? 'Safari' :\n isChrome ? 'Chrome' :\n isIE ? 'IE' :\n isEdge ? 'Edge' :\n \"-\";\n}",
"function DetectaIpad(){\n\n if (uagent.search(dispositivoIpad) > -1 && DetectaWebkit())\n\n return true;\n\n else\n\n return false;\n\n}",
"_detectBrowserSupport () {\n\t\t\n\t\tvar check = true;\n\n\t\t// nothing below IE9\n\t\tif (!document.addEventListener) check = false;\n\n\t\t// nothing below IE10\n\t\t// if (!window.onpopstate) check = false;\n\n\t\treturn check;\n\t}",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11)\n };\n}",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11)\n };\n}",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11)\n };\n}",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11),\n // passiveSupported: detectPassiveSupport()\n domSupported: typeof document !== 'undefined'\n };\n} // See https://github.com/WICG/EventListenerOptions/blob/gh-pages/explainer.md#feature-detection",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: // (1) Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // For example, in iOS 13 Mobile Chromium 78, if the touching behavior starts page\n // scroll, the `pointermove` event can not be fired any more. That will break some\n // features like \"pan horizontally to move something and pan vertically to page scroll\".\n // The horizontal pan probably be interrupted by the casually triggered page scroll.\n // (2) Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n 'onpointerdown' in window && (browser.edge || browser.ie && browser.version >= 11),\n // passiveSupported: detectPassiveSupport()\n domSupported: typeof document !== 'undefined'\n };\n} // See https://github.com/WICG/EventListenerOptions/blob/gh-pages/explainer.md#feature-detection",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // @see <http://stackoverflow.com/questions/4817029/whats-the-best-way-to-detect-a-touch-screen-device-using-javascript>\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11)\n };\n}",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11) // passiveSupported: detectPassiveSupport()\n\n };\n} // See https://github.com/WICG/EventListenerOptions/blob/gh-pages/explainer.md#feature-detection",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: 'onpointerdown' in window // Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n && (browser.edge || browser.ie && browser.version >= 11),\n // passiveSupported: detectPassiveSupport()\n domSupported: typeof document !== 'undefined'\n };\n} // See https://github.com/WICG/EventListenerOptions/blob/gh-pages/explainer.md#feature-detection",
"function detect(ua) {\n var os = {};\n var browser = {}; // var webkit = ua.match(/Web[kK]it[\\/]{0,1}([\\d.]+)/);\n // var android = ua.match(/(Android);?[\\s\\/]+([\\d.]+)?/);\n // var ipad = ua.match(/(iPad).*OS\\s([\\d_]+)/);\n // var ipod = ua.match(/(iPod)(.*OS\\s([\\d_]+))?/);\n // var iphone = !ipad && ua.match(/(iPhone\\sOS)\\s([\\d_]+)/);\n // var webos = ua.match(/(webOS|hpwOS)[\\s\\/]([\\d.]+)/);\n // var touchpad = webos && ua.match(/TouchPad/);\n // var kindle = ua.match(/Kindle\\/([\\d.]+)/);\n // var silk = ua.match(/Silk\\/([\\d._]+)/);\n // var blackberry = ua.match(/(BlackBerry).*Version\\/([\\d.]+)/);\n // var bb10 = ua.match(/(BB10).*Version\\/([\\d.]+)/);\n // var rimtabletos = ua.match(/(RIM\\sTablet\\sOS)\\s([\\d.]+)/);\n // var playbook = ua.match(/PlayBook/);\n // var chrome = ua.match(/Chrome\\/([\\d.]+)/) || ua.match(/CriOS\\/([\\d.]+)/);\n\n var firefox = ua.match(/Firefox\\/([\\d.]+)/); // var safari = webkit && ua.match(/Mobile\\//) && !chrome;\n // var webview = ua.match(/(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)/) && !chrome;\n\n var ie = ua.match(/MSIE\\s([\\d.]+)/) // IE 11 Trident/7.0; rv:11.0\n || ua.match(/Trident\\/.+?rv:(([\\d.]+))/);\n var edge = ua.match(/Edge\\/([\\d.]+)/); // IE 12 and 12+\n\n var weChat = /micromessenger/i.test(ua); // Todo: clean this up with a better OS/browser seperation:\n // - discern (more) between multiple browsers on android\n // - decide if kindle fire in silk mode is android or not\n // - Firefox on Android doesn't specify the Android version\n // - possibly devide in os, device and browser hashes\n // if (browser.webkit = !!webkit) browser.version = webkit[1];\n // if (android) os.android = true, os.version = android[2];\n // if (iphone && !ipod) os.ios = os.iphone = true, os.version = iphone[2].replace(/_/g, '.');\n // if (ipad) os.ios = os.ipad = true, os.version = ipad[2].replace(/_/g, '.');\n // if (ipod) os.ios = os.ipod = true, os.version = ipod[3] ? ipod[3].replace(/_/g, '.') : null;\n // if (webos) os.webos = true, os.version = webos[2];\n // if (touchpad) os.touchpad = true;\n // if (blackberry) os.blackberry = true, os.version = blackberry[2];\n // if (bb10) os.bb10 = true, os.version = bb10[2];\n // if (rimtabletos) os.rimtabletos = true, os.version = rimtabletos[2];\n // if (playbook) browser.playbook = true;\n // if (kindle) os.kindle = true, os.version = kindle[1];\n // if (silk) browser.silk = true, browser.version = silk[1];\n // if (!silk && os.android && ua.match(/Kindle Fire/)) browser.silk = true;\n // if (chrome) browser.chrome = true, browser.version = chrome[1];\n\n if (firefox) {\n browser.firefox = true;\n browser.version = firefox[1];\n } // if (safari && (ua.match(/Safari/) || !!os.ios)) browser.safari = true;\n // if (webview) browser.webview = true;\n\n\n if (ie) {\n browser.ie = true;\n browser.version = ie[1];\n }\n\n if (edge) {\n browser.edge = true;\n browser.version = edge[1];\n } // It is difficult to detect WeChat in Win Phone precisely, because ua can\n // not be set on win phone. So we do not consider Win Phone.\n\n\n if (weChat) {\n browser.weChat = true;\n } // os.tablet = !!(ipad || playbook || (android && !ua.match(/Mobile/)) ||\n // (firefox && ua.match(/Tablet/)) || (ie && !ua.match(/Phone/) && ua.match(/Touch/)));\n // os.phone = !!(!os.tablet && !os.ipod && (android || iphone || webos ||\n // (chrome && ua.match(/Android/)) || (chrome && ua.match(/CriOS\\/([\\d.]+)/)) ||\n // (firefox && ua.match(/Mobile/)) || (ie && ua.match(/Touch/))));\n\n\n return {\n browser: browser,\n os: os,\n node: false,\n // 原生canvas支持，改极端点了\n // canvasSupported : !(browser.ie && parseFloat(browser.version) < 9)\n canvasSupported: !!document.createElement('canvas').getContext,\n svgSupported: typeof SVGRect !== 'undefined',\n // works on most browsers\n // IE10/11 does not support touch event, and MS Edge supports them but not by\n // default, so we dont check navigator.maxTouchPoints for them here.\n touchEventsSupported: 'ontouchstart' in window && !browser.ie && !browser.edge,\n // <http://caniuse.com/#search=pointer%20event>.\n pointerEventsSupported: // (1) Firefox supports pointer but not by default, only MS browsers are reliable on pointer\n // events currently. So we dont use that on other browsers unless tested sufficiently.\n // For example, in iOS 13 Mobile Chromium 78, if the touching behavior starts page\n // scroll, the `pointermove` event can not be fired any more. That will break some\n // features like \"pan horizontally to move something and pan vertically to page scroll\".\n // The horizontal pan probably be interrupted by the casually triggered page scroll.\n // (2) Although IE 10 supports pointer event, it use old style and is different from the\n // standard. So we exclude that. (IE 10 is hardly used on touch device)\n 'onpointerdown' in window && (browser.edge || browser.ie && browser.version >= 11),\n // passiveSupported: detectPassiveSupport()\n domSupported: typeof document !== 'undefined'\n };\n} // See https://github.com/WICG/EventListenerOptions/blob/gh-pages/explainer.md#feature-detection",
"function o(){var a=u.toLowerCase();var b=/(webkit)[ \\/]([\\w.]+)/;var e=/(opera)(?:.*version)?[ \\/]([\\w.]+)/;var f=/(msie) ([\\w.]+)/;var i=/(trident)\\/[\\w.]+;.*rv:([\\w.]+)/;var q=/(mozilla)(?:.*? rv:([\\w.]+))?/;var Q=b.exec(a)||e.exec(a)||f.exec(a)||i.exec(a)||a.indexOf(\"compatible\")<0&&q.exec(a)||[];var s={browser:Q[1]||\"\",version:Q[2]||\"0\"};s[s.browser]=true;return s}",
"function isCompatible()\n{\n\tvar ua = window.navigator.userAgent;\n\tvar msie = ua.indexOf(\"MSIE \");\n\tvar isChrome = /Chrome/.test(navigator.userAgent) && /Google Inc/.test(navigator.vendor);\n\tvar isSafari = /Safari/.test(navigator.userAgent) && /Apple Computer/.test(navigator.vendor);\n\tvar isFirefox = navigator.userAgent.toLowerCase().indexOf('firefox') > -1;\n\tvar isMSIE = ((msie > 0) || (!!navigator.userAgent.match(/Trident.*rv\\:11\\./)));\n\t\n\tif(isChrome || isSafari)\n\t\treturn true;\n\telse\n\t\treturn false;\n}",
"function getBrowserInfo() {\n var nVer = navigator.appVersion;\n var nAgt = navigator.userAgent;\n var browserName = navigator.appName;\n var fullVersion = '' + parseFloat(navigator.appVersion);\n var majorVersion = parseInt(navigator.appVersion, 10);\n var nameOffset, verOffset, ix;\n\n // both and safri and chrome has same userAgent\n if (isSafari && !isChrome && nAgt.indexOf('CriOS') !== -1) {\n isSafari = false;\n isChrome = true;\n }\n\n // In Opera, the true version is after 'Opera' or after 'Version'\n if (isOpera) {\n browserName = 'Opera';\n try {\n fullVersion = navigator.userAgent.split('OPR/')[1].split(' ')[0];\n majorVersion = fullVersion.split('.')[0];\n } catch (e) {\n fullVersion = '0.0.0.0';\n majorVersion = 0;\n }\n }\n // In MSIE version <=10, the true version is after 'MSIE' in userAgent\n // In IE 11, look for the string after 'rv:'\n else if (isIE) {\n verOffset = nAgt.indexOf('rv:');\n if (verOffset > 0) { //IE 11\n fullVersion = nAgt.substring(verOffset + 3);\n } else { //IE 10 or earlier\n verOffset = nAgt.indexOf('MSIE');\n fullVersion = nAgt.substring(verOffset + 5);\n }\n browserName = 'IE';\n }\n // In Chrome, the true version is after 'Chrome' \n else if (isChrome) {\n verOffset = nAgt.indexOf('Chrome');\n browserName = 'Chrome';\n fullVersion = nAgt.substring(verOffset + 7);\n }\n // In Safari, the true version is after 'Safari' or after 'Version' \n else if (isSafari) {\n verOffset = nAgt.indexOf('Safari');\n\n browserName = 'Safari';\n fullVersion = nAgt.substring(verOffset + 7);\n\n if ((verOffset = nAgt.indexOf('Version')) !== -1) {\n fullVersion = nAgt.substring(verOffset + 8);\n }\n\n if (navigator.userAgent.indexOf('Version/') !== -1) {\n fullVersion = navigator.userAgent.split('Version/')[1].split(' ')[0];\n }\n }\n // In Firefox, the true version is after 'Firefox' \n else if (isFirefox) {\n verOffset = nAgt.indexOf('Firefox');\n browserName = 'Firefox';\n fullVersion = nAgt.substring(verOffset + 8);\n }\n\n // In most other browsers, 'name/version' is at the end of userAgent \n else if ((nameOffset = nAgt.lastIndexOf(' ') + 1) < (verOffset = nAgt.lastIndexOf('/'))) {\n browserName = nAgt.substring(nameOffset, verOffset);\n fullVersion = nAgt.substring(verOffset + 1);\n\n if (browserName.toLowerCase() === browserName.toUpperCase()) {\n browserName = navigator.appName;\n }\n }\n\n if (isEdge) {\n browserName = 'Edge';\n fullVersion = navigator.userAgent.split('Edge/')[1];\n // fullVersion = parseInt(navigator.userAgent.match(/Edge\\/(\\d+).(\\d+)$/)[2], 10).toString();\n }\n\n // trim the fullVersion string at semicolon/space/bracket if present\n if ((ix = fullVersion.search(/[; \\)]/)) !== -1) {\n fullVersion = fullVersion.substring(0, ix);\n }\n\n majorVersion = parseInt('' + fullVersion, 10);\n\n if (isNaN(majorVersion)) {\n fullVersion = '' + parseFloat(navigator.appVersion);\n majorVersion = parseInt(navigator.appVersion, 10);\n }\n\n return {\n fullVersion: fullVersion,\n version: majorVersion,\n name: browserName,\n isPrivateBrowsing: false\n };\n }",
"function DetectS60OssBrowser()\n{\n if (DetectWebkit())\n {\n if ((uagent.search(deviceS60) > -1 ||\n uagent.search(deviceSymbian) > -1))\n return true;\n else\n return false;\n }\n else\n return false;\n}",
"function browser_detection(){\n\tif(navigator.appName == \"Netscape\"){\n\t\treturn \"NET\";\t\n\t}else{\n\t\treturn \"IE\";\n\t}\t\n}",
"function browserFixes() {\n // no text select on drag\n document.body.style.webkitUserSelect = 'none';\n // non right clickery\n //document.body.oncontextmenu = function() { return false; };\n // FIXME IEBUG CHROMEBUG\n // very ugly hack until they fixes some of their\n // audio bugs we disable audio completely\n if (navigator.userAgent.indexOf('Chrome') > -1 || navigator.userAgent.indexOf('MSIE') > -1 ||\n navigator.userAgent.indexOf('Safari') > -1) {\n gamejs.mixer.Sound = function() {\n return {\n play: function() {}\n };\n };\n }\n}",
"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.indexOf(\"MSIE 8.0\") > 0) flag = true;\r\n\r\n }\r\n\r\n\r\n return flag;\r\n\r\n }",
"function css_browser_selector(u) {\n var ua = u.toLowerCase(),\n is = function(t) {\n return ua.indexOf(t) > -1\n }, g = 'gecko',\n w = 'webkit',\n s = 'safari',\n o = 'opera',\n m = 'mobile',\n h = document.documentElement,\n b = [(!(/opera|webtv/i.test(ua)) && /msie\\s(\\d)/.test(ua)) ? ('ie ie' + RegExp.$1) : is('firefox/2') ? g + ' ff2' : is('firefox/3.5') ? g + ' ff3 ff3_5' : is('firefox/3.6') ? g + ' ff3 ff3_6' : is('firefox/3') ? g + ' ff3' : is('gecko/') ? g : is('opera') ? o + (/version\\/(\\d+)/.test(ua) ? ' ' + o + RegExp.$1 : (/opera(\\s|\\/)(\\d+)/.test(ua) ? ' ' + o + RegExp.$2 : '')) : is('konqueror') ? 'konqueror' : is('blackberry') ? m + ' blackberry' : is('android') ? m + ' android' : is('chrome') ? w + ' chrome' : is('iron') ? w + ' iron' : is('applewebkit/') ? w + ' ' + s + (/version\\/(\\d+)/.test(ua) ? ' ' + s + RegExp.$1 : '') : is('mozilla/') ? g : '', is('j2me') ? m + ' j2me' : is('iphone') ? m + ' iphone' : is('ipod') ? m + ' ipod' : is('ipad') ? m + ' ipad' : is('mac') ? 'mac' : is('darwin') ? 'mac' : is('webtv') ? 'webtv' : is('win') ? 'win' + (is('windows nt 6.0') ? ' vista' : '') : is('freebsd') ? 'freebsd' : (is('x11') || is('linux')) ? 'linux' : '', 'js'];\n c = b.join(' ');\n h.className += ' ' + c;\n return c;\n}",
"function DETECTBROWSER() {\n var HREFF,\n HREFTXT = \"unknown\";\n this.NAVIGATOR = navigator.userAgent;\n var NAV = navigator.userAgent;\n var gecko, navIpad, operatablet, navIphone, navFirefox, navChrome, navOpera, navSafari, navandroid, mobile, navMozilla;\n gecko = NAV.match(/gecko/gi);\n navOpera = NAV.match(/opera/gi);\n operatablet = NAV.match(/Tablet/gi);\n navIpad = NAV.match(/ipad/gi);\n navIphone = NAV.match(/iphone/gi);\n navFirefox = NAV.match(/Firefox/gi);\n navMozilla = NAV.match(/mozilla/gi);\n navChrome = NAV.match(/Chrome/gi);\n navSafari = NAV.match(/safari/gi);\n navandroid = NAV.match(/android/gi);\n mobile = NAV.match(/mobile/gi);\n window[\"TYPEOFANDROID\"] = 0;\n window[\"NOMOBILE\"] = 0;\n\n var mobile = /iphone|ipad|ipod|android|blackberry|mini|windows\\sce|palm/i.test(navigator.userAgent.toLowerCase());\n if (mobile) {\n var userAgent = navigator.userAgent.toLowerCase();\n if (userAgent.search(\"android\") > -1 && userAgent.search(\"mobile\") > -1) {\n console.log(\"ANDROID MOBILE\");\n } else if (userAgent.search(\"android\") > -1 && !(userAgent.search(\"mobile\") > -1)) {\n console.log(\" ANDROID TABLET \");\n TYPEOFANDROID = 1;\n }\n } else {\n NOMOBILE = 1;\n }\n // FIREFOX za android\n if (navFirefox && navandroid && TYPEOFANDROID == 0) {\n HREFF = \"#\";\n HREFTXT = \"mobile_firefox_android\";\n }\n // FIREFOX za android T\n if (navFirefox && navandroid && TYPEOFANDROID == 1) {\n HREFF = \"#\";\n HREFTXT = \"mobile_firefox_android_tablet\";\n }\n // OPERA ZA ANDROID\n if (navOpera && navandroid) {\n HREFF = \"#\";\n HREFTXT = \"opera_mobile_android\";\n } // provera\n // OPERA ZA ANDROID TABLET\n if (navOpera && navandroid && operatablet) {\n HREFF = \"#\";\n HREFTXT = \"opera_mobile_android_tablet\";\n } // provera\n // safari mobile za IPHONE - i safari mobile za IPAD i CHROME za IPAD\n if (navSafari) {\n var Iphonesafari = NAV.match(/iphone/gi);\n if (Iphonesafari) {\n HREFF = \"#\";\n HREFTXT = \"safari_mobile_iphone\";\n } else if (navIpad) {\n HREFF = \"#\";\n HREFTXT = \"mobile_safari_chrome_ipad\";\n } else if (navandroid) {\n HREFF = \"#\";\n HREFTXT = \"android_native\";\n }\n }\n // TEST CHROME\n if (navChrome && navSafari && navMozilla && TYPEOFANDROID == 1) {\n HREFF = \"#\";\n HREFTXT = \"mobile_chrome_android_tablet\";\n }\n if (navChrome && navSafari && navMozilla && TYPEOFANDROID == 0) {\n HREFF = \"#\";\n HREFTXT = \"mobile_chrome_android\";\n }\n if (navChrome && TYPEOFANDROID == 0) {\n HREFF = \"#\";\n HREFTXT = \"chrome_browser\";\n }\n if (navMozilla && NOMOBILE == 1 && gecko && navFirefox) {\n HREFF = \"#\";\n HREFTXT = \"firefox_desktop\";\n }\n if (navOpera && TYPEOFANDROID == 0 && !mobile) {\n HREFF = \"#\";\n HREFTXT = \"opera_desktop\";\n }\n\n this.NAME = HREFTXT;\n this.NOMOBILE = NOMOBILE;\n}",
"function browserDetectJS() {\n var\n browser = new Array();\n\n//Opera\n if (window.opera) {\n browser[0] = \"Opera\";\n browser[1] = window.opera.version();\n }\n else\n//Chrome\n if (window.chrome) {\n browser[0] = \"Chrome\";\n }\n else\n//Firefox\n if (window.sidebar) {\n browser[0] = \"Firefox\";\n }\n else\n//Safari\n if ((!window.external)&&(browser[0]!==\"Opera\")) {\n browser[0] = \"Safari\";\n }\n else\n//IE\n if (window.ActiveXObject) {\n browser[0] = \"MSIE\";\n if (window.navigator.userProfile) browser[1] = \"6\";\n else\n if (window.Storage) browser[1] = \"8\";\n else\n if ((!window.Storage)&&(!window.navigator.userProfile)) browser[1] = \"7\";\n else browser[1] = \"Unknown\";\n }\n\n if (!browser) return(false);\n else return(browser);\n }",
"function ridiculousWorkaroundsForBrowsersFromBizarroWorld() {\r\n\tGWLog(\"ridiculousWorkaroundsForBrowsersFromBizarroWorld\");\r\n\r\n\tGW.isFirefox = navigator.userAgent.toLowerCase().indexOf('firefox') > -1;\r\n\tif (!GW.isFirefox) {\r\n\t\tGW.sidenotes.viewportWidthBreakpointMediaQueryString = `(max-width: 176ch)`;\r\n\t\tGW.sidenotes.mobileViewportWidthBreakpointMediaQueryString = `(max-width: 65ch)`;\r\n\t} else {\r\n\t\t/*\tThis should match the \"max-width\" property of the \"body\" element.\r\n\t\t\t*/\r\n\t\tGW.maxBodyWidthInCharacterUnits = 112;\r\n\r\n\t\t/*\tThis should be some property/value pair that only Firefox supports.\r\n\t\t\t*/\r\n\t\tGW.firefoxTargetingSelector = \"@supports (-moz-user-focus: normal)\";\r\n\r\n\t\tlet widthOfCharacterUnit = parseInt(getComputedStyle(document.body).maxWidth) / GW.maxBodyWidthInCharacterUnits;\r\n\t\tlet viewportWidthBreakpointInPixels = 176 * widthOfCharacterUnit;\r\n\t\tGW.sidenotes.viewportWidthBreakpointMediaQueryString = `(max-width: ${viewportWidthBreakpointInPixels}px)`;\r\n\t\tlet mobileViewportWidthBreakpointInPixels = 65 * widthOfCharacterUnit;\r\n\t\tGW.sidenotes.mobileViewportWidthBreakpointMediaQueryString = `(max-width: ${mobileViewportWidthBreakpointInPixels}px)`;\r\n\r\n\t\tvar sidenotesBrowserWorkaroundStyleBlock = document.querySelector(\"style#sidenotes-browser-workaround\");\r\n\t\tif (!sidenotesBrowserWorkaroundStyleBlock) {\r\n\t\t\tsidenotesBrowserWorkaroundStyleBlock = document.createElement(\"style\");\r\n\t\t\tsidenotesBrowserWorkaroundStyleBlock.id = \"sidenotes-browser-workaround\";\r\n\t\t\tdocument.querySelector(\"head\").appendChild(sidenotesBrowserWorkaroundStyleBlock);\r\n\t\t}\r\n\t\tsidenotesBrowserWorkaroundStyleBlock.innerHTML = `\r\n\t\t\t${GW.firefoxTargetingSelector} {\r\n\t\t\t\t@media only screen and (max-width: ${viewportWidthBreakpointInPixels}px) {\r\n\t\t\t\t\t#sidenote-column-left,\r\n\t\t\t\t\t#sidenote-column-right {\r\n\t\t\t\t\t\tdisplay: none;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t@media only screen and (min-width: ${viewportWidthBreakpointInPixels + 1}px) {\r\n\t\t\t\t\tmain {\r\n\t\t\t\t\t\tposition: relative;\r\n\t\t\t\t\t\tright: 4ch;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t#markdownBody {\r\n\t\t\t\t\t\tposition: relative;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t@media only screen and (max-width: ${viewportWidthBreakpointInPixels}px) {\r\n\t\t\t\t\t.footnote-ref:target {\r\n\t\t\t\t\t\tbackground-color: inherit;\r\n\t\t\t\t\t\tbox-shadow: none;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t`;\r\n\t}\r\n\r\n\t/*\tCreate media query objects (for checking and attaching listeners).\r\n\t\t*/\r\n\tGW.sidenotes.mediaQueries = {\r\n\t\tviewportWidthBreakpoint: matchMedia(GW.sidenotes.viewportWidthBreakpointMediaQueryString),\r\n\t\tmobileViewportWidthBreakpoint: matchMedia(GW.sidenotes.mobileViewportWidthBreakpointMediaQueryString),\r\n\t\thover: matchMedia(\"only screen and (hover: hover) and (pointer: fine)\")\r\n\t};\r\n\r\n\t/*\tListen for changes to whether the viewport width media query is matched;\r\n\t\tif such a change occurs (i.e., if the viewport becomes, or stops being,\r\n\t\twide enough to support sidenotes), switch modes from footnote popups to\r\n\t\tsidenotes or vice/versa, as appropriate.\r\n\t\t(This listener may also be fired if the dev tools pane is opened, etc.)\r\n\t\t*/\r\n\tGW.sidenotes.mediaQueries.viewportWidthBreakpoint.addListener(GW.sidenotes.viewportWidthBreakpointChanged = () => {\r\n\t\tGWLog(\"GW.sidenotes.viewportWidthBreakpointChanged\");\r\n\r\n\t\tupdateFootnoteEventListeners();\r\n\t\tGW.sidenotes.footnotesObserver.disconnect();\r\n\t\tupdateFootnoteReferenceLinks();\r\n\t});\r\n}",
"function isFirefox(){\n\treturn navigator.userAgent.indexOf('Gecko/')>0;\n}",
"function css_browser_selector(u){var ua = u.toLowerCase(),is=function(t){return ua.indexOf(t)>-1;},g='gecko',w='webkit',s='safari',o='opera',h=document.getElementsByTagName('html')[0],b=[(!(/opera|webtv/i.test(ua))&&/msie\\s(\\d)/.test(ua))?('ie ie'+RegExp.$1):is('firefox/2')?g+' ff2':is('firefox/3.5')?g+' ff3 ff3_5':is('firefox/3')?g+' ff3':is('gecko/')?g:is('opera')?o+(/version\\/(\\d+)/.test(ua)?' '+o+RegExp.$1:(/opera(\\s|\\/)(\\d+)/.test(ua)?' '+o+RegExp.$2:'')):is('konqueror')?'konqueror':is('chrome')?w+' chrome':is('iron')?w+' iron':is('applewebkit/')?w+' '+s+(/version\\/(\\d+)/.test(ua)?' '+s+RegExp.$1:''):is('mozilla/')?g:'',is('j2me')?'mobile':is('iphone')?'iphone':is('ipod')?'ipod':is('mac')?'mac':is('darwin')?'mac':is('webtv')?'webtv':is('win')?'win':is('freebsd')?'freebsd':(is('x11')||is('linux'))?'linux':'','js']; c = b.join(' '); h.className += ' '+c; return c;}",
"function __isChrome(){\r\n\tvar isChromium = window.chrome;\r\n\tvar winNav = window.navigator;\r\n\tvar vendorName = winNav.vendor;\r\n\tvar isOpera = typeof window.opr !== \"undefined\";\r\n\tvar isIEedge = winNav.userAgent.indexOf(\"Edge\") > -1;\r\n\tvar isIOSChrome = winNav.userAgent.match(\"CriOS\");\r\n\r\n\treturn (isIOSChrome || \t(isChromium !== null &&\r\n\t\t\t\t\t\t \ttypeof isChromium !== \"undefined\" &&\r\n\t\t\t\t\t\t \tvendorName === \"Google Inc.\" &&\r\n\t\t\t\t\t\t \tisOpera === false &&\r\n\t\t\t\t\t\t \tisIEedge === false));\r\n}",
"function detectaNavegador(){\n\tvar nVer = navigator.appVersion;\n\tvar nAgt = navigator.userAgent;\n\tvar browserName = navigator.appName;\n\tvar fullVersion = ''+parseFloat(navigator.appVersion); \n\tvar majorVersion = parseInt(navigator.appVersion,10);\n\tvar nameOffset,verOffset,ix;\n\n\t// In Opera 15+, the true version is after \"OPR/\" \n\tif ((verOffset=nAgt.indexOf(\"OPR/\"))!=-1) {\n\t browserName = \"Opera\";\n\t fullVersion = nAgt.substring(verOffset+4);\n\t}\n\t// In older Opera, the true version is after \"Opera\" or after \"Version\"\n\telse if ((verOffset=nAgt.indexOf(\"Opera\"))!=-1) {\n\t browserName = \"Opera\";\n\t fullVersion = nAgt.substring(verOffset+6);\n\t if ((verOffset=nAgt.indexOf(\"Version\"))!=-1) \n\t\t fullVersion = nAgt.substring(verOffset+8);\n\t}\n\t// In MSIE, the true version is after \"MSIE\" in userAgent\n\telse if ((verOffset=nAgt.indexOf(\"MSIE\"))!=-1) {\n\t browserName = \"Microsoft Internet Explorer\";\n\t fullVersion = nAgt.substring(verOffset+5);\n\t}\n\t// In Chrome, the true version is after \"Chrome\" \n\telse if ((verOffset=nAgt.indexOf(\"Chrome\"))!=-1) {\n\t browserName = \"Chrome\";\n\t fullVersion = nAgt.substring(verOffset+7);\n\t}\n\t// In Safari, the true version is after \"Safari\" or after \"Version\" \n\telse if ((verOffset=nAgt.indexOf(\"Safari\"))!=-1) {\n\t browserName = \"Safari\";\n\t fullVersion = nAgt.substring(verOffset+7);\n\t if ((verOffset=nAgt.indexOf(\"Version\"))!=-1) \n\t\t fullVersion = nAgt.substring(verOffset+8);\n\t}\n\t// In Firefox, the true version is after \"Firefox\" \n\telse if ((verOffset=nAgt.indexOf(\"Firefox\"))!=-1) {\n\t browserName = \"Firefox\";\n\t fullVersion = nAgt.substring(verOffset+8);\n\t}\n\t// In most other browsers, \"name/version\" is at the end of userAgent \n\telse if ( (nameOffset=nAgt.lastIndexOf(' ')+1) < \n\t\t\t\t\t\t(verOffset=nAgt.lastIndexOf('/')) ) \n\t{\n\t browserName = nAgt.substring(nameOffset,verOffset);\n\t fullVersion = nAgt.substring(verOffset+1);\n\t if (browserName.toLowerCase()==browserName.toUpperCase()) {\n\t\tbrowserName = navigator.appName;\n\t }\n\t}\n\t// trim the fullVersion string at semicolon/space if present\n\tif ((ix=fullVersion.indexOf(\";\"))!=-1)\n\t\t fullVersion=fullVersion.substring(0,ix);\n\tif ((ix=fullVersion.indexOf(\" \"))!=-1)\n\t\t fullVersion=fullVersion.substring(0,ix);\n\n\tmajorVersion = parseInt(''+fullVersion,10);\n\tif (isNaN(majorVersion)) {\n\t fullVersion = ''+parseFloat(navigator.appVersion); \n\t majorVersion = parseInt(navigator.appVersion,10);\n\t}\n\n\treturn {\n\t\tnome : browserName,\n\t\tversao: majorVersion,\n\t\tplataforma: navigator.platform,\n\t};\n}",
"calculateMinWidthForSafari() {\n let minWidth = 0,\n columns = this.columns.visibleColumns;\n columns.forEach(column => {\n minWidth += column.calculateMinWidth();\n });\n return minWidth;\n }",
"workaround() {\n // For Safari browser\n window.onpageshow = function(e) {\n if (e.persisted) window.location.reload()\n }\n }",
"function detectBrowser()\n {\n var browser = \"\";\n if (window.navigator.userAgent.indexOf('Edge') > -1)\n {\n browser = \"edge\";\n }\n else\n {\n browser = \"other\";\n }\n return browser;\n }",
"function checkBrowser() {\n const browser = bowser.getParser(window.navigator.userAgent);\n const isValidBrowser = browser.satisfies({\n \"edge\": \">86.0\",\n \"chrome\": \">86.0\",\n \"firefox\": \">78.0\",\n \"safari\": \">14\"\n });\n\n if (!isValidBrowser) window.location.replace('unsupported-browser.html');\n}",
"function WymClassSafari(wym) {\r\n\tthis._wym = wym;\r\n}",
"calculateMinWidthForSafari() {\n let minWidth = 0,\n columns = this.columns.visibleColumns;\n\n columns.forEach((column) => {\n minWidth += column.calculateMinWidth();\n });\n\n return minWidth;\n }"
] |
[
"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.64658344",
"0.64658344",
"0.64495295",
"0.64120114",
"0.6411045",
"0.6333472",
"0.62975633",
"0.6292861",
"0.62589085",
"0.62014925",
"0.6198367",
"0.61792773",
"0.6165363",
"0.61231995",
"0.6109909",
"0.60613436",
"0.60592973",
"0.60047233",
"0.6002649",
"0.5934733",
"0.5911019",
"0.59070814",
"0.5886434",
"0.58786255",
"0.5847335",
"0.5838256",
"0.5807399",
"0.57971275",
"0.57859004",
"0.57752144",
"0.57752144",
"0.57752144",
"0.57752144",
"0.57556814",
"0.569605",
"0.5691502",
"0.5684773",
"0.5680534",
"0.5678737",
"0.5678737",
"0.56734425",
"0.56727123",
"0.56727123",
"0.56727123",
"0.56727123",
"0.56727123",
"0.56727123",
"0.5665688",
"0.56613964",
"0.5651531",
"0.5650958",
"0.56468475",
"0.56468475",
"0.56468475",
"0.56468475",
"0.56468475",
"0.56468475",
"0.56468475",
"0.56468475",
"0.56468475",
"0.5644111",
"0.56431675",
"0.56417805",
"0.5602273",
"0.5590083",
"0.557218",
"0.5566849",
"0.5559388",
"0.5556498",
"0.554505",
"0.5514435",
"0.55006844",
"0.54988456",
"0.5496682",
"0.549372",
"0.5486742",
"0.5486122",
"0.5480162",
"0.54797006",
"0.5464363",
"0.5463307"
] |
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.slice(position);\n position = length;\n } else {\n line = string.slice(position, next + 1);\n position = next + 1;\n }\n\n if (line.length && line !== '\\n') result += ind;\n\n result += line;\n }\n\n return result;\n}",
"function indentString(string, spaces) {\n var ind = common$7.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.slice(position);\n position = length;\n } else {\n line = string.slice(position, next + 1);\n position = next + 1;\n }\n\n if (line.length && line !== '\\n') { result += ind; }\n\n result += line;\n }\n\n return result;\n}",
"function indentString(string, spaces) {\n var ind = common$2.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.slice(position);\n position = length;\n } else {\n line = string.slice(position, next + 1);\n position = next + 1;\n }\n\n if (line.length && line !== '\\n') result += ind;\n\n result += line;\n }\n\n return result;\n}",
"function indentString(string, spaces) {\n\t var ind = common.repeat(' ', spaces),\n\t position = 0,\n\t next = -1,\n\t result = '',\n\t line,\n\t length = string.length;\n\n\t while (position < length) {\n\t next = string.indexOf('\\n', position);\n\t if (next === -1) {\n\t line = string.slice(position);\n\t position = length;\n\t } else {\n\t line = string.slice(position, next + 1);\n\t position = next + 1;\n\t }\n\n\t if (line.length && line !== '\\n') result += ind;\n\n\t result += line;\n\t }\n\n\t return result;\n\t}",
"function indentString(string, spaces) {\n\t var ind = common.repeat(' ', spaces),\n\t position = 0,\n\t next = -1,\n\t result = '',\n\t line,\n\t length = string.length;\n\n\t while (position < length) {\n\t next = string.indexOf('\\n', position);\n\t if (next === -1) {\n\t line = string.slice(position);\n\t position = length;\n\t } else {\n\t line = string.slice(position, next + 1);\n\t position = next + 1;\n\t }\n\n\t if (line.length && line !== '\\n') result += ind;\n\n\t result += line;\n\t }\n\n\t return result;\n\t}",
"function indentString(string, spaces) {\n\t var ind = common.repeat(' ', spaces),\n\t position = 0,\n\t next = -1,\n\t result = '',\n\t line,\n\t length = string.length;\n\n\t while (position < length) {\n\t next = string.indexOf('\\n', position);\n\t if (next === -1) {\n\t line = string.slice(position);\n\t position = length;\n\t } else {\n\t line = string.slice(position, next + 1);\n\t position = next + 1;\n\t }\n\n\t if (line.length && line !== '\\n') result += ind;\n\n\t result += line;\n\t }\n\n\t return result;\n\t}",
"function indent(indentation, string) {\n var result = string.split('\\n');\n if(result[result.length - 1] == '') {\n result.pop();\n result = result.map(x => sp(indentation) + x).join(\"\\n\");\n result += '\\n';\n return result;\n }\n return result.map(x => sp(indentation) + x).join(\"\\n\");\n}",
"function dedent (str) {\n var lines = str.split('\\n');\n var indent = _.min(lines.map(function (line, i) {\n if (i === 0) { return Infinity; }\n return line.match(/^\\s*/)[0].length;\n }));\n lines = lines.map(function (line, i) {\n if (i === 0) { return line.trim(); }\n return line.slice(indent);\n });\n return lines.join('\\n');\n}",
"function indentLines(text, indentation) {\n return text.join(\"\\n\").replace(/^/gm, indentation);\n }",
"function oneLine (str) {\n return str.replace(/\\s+/g, ' ')\n}",
"function _indent(s,space) {\n return s.replace(/^/gm, space);\n}",
"function _indent(s,space) {\n return s.replace(/^/gm, space);\n}",
"function indentString(numOfIndents, str) {\n return \" \".repeat(numOfIndents) + str;\n}",
"function outdent(str) {\n\treturn str.replace(RegExp('^'+(str.match(/^(\\t| )+/) || '')[0], 'gm'), '');\n}",
"autoIndentNewLine (start, end) {\n for (var i = start, scopeDiff = 0; i > 0; i--) {\n let char = this.text[i - 1];\n if (char === '\\n') {\n break;\n } else if (scopeDiff === 0) {\n if (char === \"}\") {\n scopeDiff = -1;\n } if (char === \"{\") {\n scopeDiff = 1;\n }\n }\n }\n\n let result = initialWhiteSpace.exec(this.text.substring(i, start));\n let indentation = result ? result[0] : \"\";\n \n if (scopeDiff === 1) {\n initialCloseParen.lastIndex = end;\n let suffix = initialCloseParen.exec(this.text) ? \"\\n\" + indentation : \"\";\n this.replaceText(start, end, \"\\n\\t\" + indentation + suffix, -suffix.length);\n } else {\n this.replaceText(start, end, \"\\n\" + indentation);\n }\n }",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function needIndentIndicator(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function indent(txt) {\r\n return txt.split('\\n').map(x => ' '+x).join('\\n')\r\n }",
"function prettyCode(str) {\n\t'use strict';\n\tvar newStr = '';\n\tfor (var i = 0; i < str.length; i++) {\n\t\t\n\t\tif (str[i].match(/\\n/)) {\n\t\t\tnewStr += '<br>';\n\t\t} else if (str[i].match(/\\t/)) {\n\t\tnewStr += ' ';\n\n\t\t}else newStr += str[i];\n\t} return newStr;\n}",
"function print(str, indent, inline) {\n var lines = str.split(\"\\n\");\n\n for(var i=0; i<lines.length; i++) {\n if(lines[i]) {\n if((inline && i > 0) || !inline) {\n for(var j=0; j<indent; j++) {\n util.print(\" \");\n }\n }\n }\n\n if(i === lines.length-1) {\n util.print(lines[i]);\n }\n else {\n util.puts(lines[i]);\n }\n }\n }",
"function restoreLineBreaks(str){\n return str.replace(/\\\\n/g, '\\n');\n}",
"function newline2linebreak(s) {\r\n return s.replace(/\\n/g, \"<br>\")\r\n}",
"function normalizeNewLineCharacters(inputString) {\n return inputString.replace(/\\r\\n|\\r/g, '\\n');\n}",
"static indent(str, size = 4) {\n return str.replace(/^(?!\\s*$)/mg, \" \".repeat(size));\n }",
"function remove_linebreaks(str) { \n return str.replace(/[\\r\\n]+/gm, \" \"); \n}",
"function oneLine(s) {\n return (s.replace(/\\r?\\n|\\r|\\t/gm, '')).trim();\n}",
"function autoEdWhitespace(str) { //MAIN FUNCTION describes list of fixes\n \n str = str.replace(/\\t/g, \" \");\n \n str = str.replace(/^ ? ? \\n/gm, \"\\n\");\n str = str.replace(/(\\n\\n)\\n+/g, \"$1\");\n str = str.replace(/== ? ?\\n\\n==/g, \"== \\n ==\");\n str = str.replace(/\\n\\n(\\* ?\\[?http)/g, \"\\n$1\");\n \n str = str.replace(/^ ? ? \\n/gm, \"\\n\");\n str = str.replace(/\\n\\n\\*/g, \"\\n*\");\n str = str.replace(/[ \\t][ \\t]+/g, \" \");\n str = str.replace(/([=\\n]\\n)\\n+/g, \"$1\");\n str = str.replace(/ \\n/g, \"\\n\");\n \n //* bullet points\n str = str.replace(/^([\\*#]+:*) /gm, \"$1\");\n str = str.replace(/^([\\*#]+:*)/gm, \"$1 \");\n \n //==Headings==\n str = str.replace(/^(={1,4}) ?(.*?) ?(={1,4})$/gm, \"$1 $2 $3\");\n return str;\n}",
"function needIndentIndicator$1(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"function normalizeLf( string ) {\n return string.replace(/\\r\\n/g, '\\n');\n}",
"function print(str, indent, inline) {\n\t var lines = str.split('\\n');\n\n\t for(var i=0; i<lines.length; i++) {\n\t if(lines[i]) {\n\t if((inline && i > 0) || !inline) {\n\t for(var j=0; j<indent; j++) {\n\t process.stdout.write(' ');\n\t }\n\t }\n\t }\n\n\t if(i === lines.length-1) {\n\t process.stdout.write(lines[i]);\n\t }\n\t else {\n\t process.stdout.write(lines[i] + '\\n');\n\t }\n\t }\n\t }",
"indentLines (start, end, backwards = false) {\n for (var i = start; i > 0 && this.text[i - 1] !== '\\n'; i--);\n\n let replace = this.text.slice(i, end);\n let insert, offset;\n\n if (backwards) {\n insert = (replace[0] === \"\\t\" ? replace.slice(1) : replace).replace(allNewLineTabs, \"\\n\");\n offset = (i < start && replace[0] === \"\\t\") ? -1 : 0;\n } else {\n insert = \"\\t\" + replace.replace(allNewLines, \"\\n\\t\");\n offset = 1;\n }\n\n let postStart = start + offset;\n let postEnd = i + insert.length;\n let edit = {\n start: i,\n end,\n insert,\n replace,\n preSelection: this.selection,\n postSelection: {start: postStart, end: postEnd, isCollapsed: postStart === postEnd, backwards: this.selection.backwards}\n };\n this.edit(edit);\n this.editHistory.push(edit);\n this.redoStack = [];\n }",
"function markWhiteSpaces(string) {\n /* 'm' modifier makes regex applicable to every separate line in string, not the string as the whole. */\n\n /* Leading space */\n string = string.replace(\n /^(<(ins|del)>)*( )/gim,\n '$1' + getPlaceableMarkup('Leading space', ' '),\n );\n\n /* Trailing space */\n string = string.replace(\n /( )(<\\/(ins|del)>)*$/gim,\n getPlaceableMarkup('Trailing space', ' ') + '$2',\n );\n\n /* Newline */\n string = markPlaceable(string, /\\n/gi, 'Newline character', '¶$&');\n\n /* Tab */\n string = markPlaceable(string, /\\t/gi, 'Tab character', '→');\n return string;\n }",
"enterNewline(ctx) {\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function stripIndent(str) {\n const match = str.match(/^[ \\t]*(?=\\S)/gm)\n\n if (!match) {\n return str\n }\n\n const indent = Math.min(\n ...match.map(x => {\n return x.length\n }),\n )\n const re = new RegExp(`^[ \\\\t]{${indent}}`, 'gm')\n\n return indent > 0 ? str.replace(re, '') : str\n}",
"function indentLines(arr, depth) {\n const padding = new Array(depth + 1).join(' ');\n return arr.join('\\n' + padding);\n}",
"function elimineSpaces(str) {\n\tvar s = str.replace(/\\s+/g, '');\n\ts = s.replace(/\\t+/g, '');\n\treturn s;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}",
"function foldString(string, width) {\n // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n // unless they're before or after a more-indented line, or at the very\n // beginning or end, in which case $k$ maps to $k$.\n // Therefore, parse each chunk as newline(s) followed by a content line.\n var lineRe = /(\\n+)([^\\n]*)/g;\n\n // first line (possibly an empty line)\n var result = (function () {\n var nextLF = string.indexOf('\\n');\n nextLF = nextLF !== -1 ? nextLF : string.length;\n lineRe.lastIndex = nextLF;\n return foldLine(string.slice(0, nextLF), width);\n }());\n // If we haven't reached the first content line yet, don't add an extra \\n.\n var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n var moreIndented;\n\n // rest of the lines\n var match;\n while ((match = lineRe.exec(string))) {\n var prefix = match[1], line = match[2];\n moreIndented = (line[0] === ' ');\n result += prefix\n + (!prevMoreIndented && !moreIndented && line !== ''\n ? '\\n' : '')\n + foldLine(line, width);\n prevMoreIndented = moreIndented;\n }\n\n return result;\n}"
] |
[
"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.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6009819",
"0.5974386",
"0.5946147",
"0.58715254",
"0.5830863",
"0.5797524",
"0.5796587",
"0.5710692",
"0.56996167",
"0.5693747",
"0.5689588",
"0.56774783",
"0.56519544",
"0.5628048",
"0.561473",
"0.5586456",
"0.55763566",
"0.55763566",
"0.55763566",
"0.55634505",
"0.5548384",
"0.55199003",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839",
"0.5518839"
] |
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 = lexString.match(pattern);\n\t\tif(x !== null) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}",
"startsWith(c) { return this.white.test(c) }",
"function stripWhitespace (s)\r\n\r\n{ return stripCharsInBag (s, whitespace)\r\n}",
"function stripWhitespace (s)\r\n\r\n{ return stripCharsInBag (s, whitespace)\r\n}",
"function whiteSpace() {\r\n const player = GetPlayer();\r\n const goodNamejs = player.GetVar(\"userName\");\r\n\r\n const wSpacejs = goodNamejs.indexOf(' ') >=0;\r\n\r\n player.SetVar(\"wSpace\", wSpacejs);\r\n}",
"function testWhitespace() {\n RunTests([\n S('', [\n ]),\n S(' \\n\\r\\n\\r\\v\\f\\t\\x85\\xa0\\u2000\\u3000', [\n ]),\n ]);\n}",
"function isS(c) {\n return c === SPACE || c === NL || c === CR || c === TAB;\n}",
"function isS(c) {\n return c === SPACE || c === NL || c === CR || c === TAB;\n}",
"function catchupWhiteSpace(end, state) {\n catchup(end, state, stripNonWhite);\n}",
"function catchupWhiteSpace(end, state) {\n catchup(end, state, stripNonWhite);\n}",
"function catchupWhiteSpace(end, state) {\n catchup(end, state, stripNonWhite);\n}",
"function stripWhitespace(s){ \n\treturn stripCharsInBag(s, whitespace);\n}",
"function iswhitespace(s) {\n switch(s.charAt(0)) {\n case '\\t': case '\\n': case '\\r': case ' ':\n return true\n case '/':\n switch(s.charAt(1)) {\n case '*': case '/':\n return true\n default:\n return false\n }\n default:\n return false\n }\n}",
"function startsp() {\r\n\tnextWord(false);\r\n}",
"function catchupWhiteSpace(end, state) {\n catchup(end, state, _stripNonWhite);\n}",
"function catchupWhiteSpace(end, state) {\n catchup(end, state, _stripNonWhite);\n}",
"function addS(word) {\n\treturn word + \"s\"\n}",
"function removeWhiteSpaces(_ctr){\n _ctr.value = _ctr.value.replace(/^\\s+|\\s+$/g,'');\n}",
"function _indent(s,space) {\n return s.replace(/^/gm, space);\n}",
"function _indent(s,space) {\n return s.replace(/^/gm, space);\n}",
"function isWhitespace$1(c) {\n return c === CHAR_SPACE$1 || c === CHAR_TAB$1;\n}",
"function is_whitespace(char) {\n return \" \\t\\n\".indexOf(char) >= 0;\n }",
"function s(){\n c( ' ' );\n}",
"function isWhitespace(c) {\n\t\treturn WHITESPACE_PATTERN.test(c);\n\t}",
"function singleWord(){\n var s = ch;\n while (next() && \": \\t\\n\\r-+={(}[])'\\\"\".indexOf(ch)==-1) {s+= ch}\n return s;\n }",
"function addS(word) {\n return word + 's';\n}",
"function stripInitialWhitespace (s)\r\n\r\n{ var i = 0;\r\n\r\n while ((i < s.length) && charInString (s.charAt(i), whitespace))\r\n i++;\r\n\r\n return s.substring (i, s.length);\r\n}",
"function stripInitialWhitespace (s)\r\n\r\n{ var i = 0;\r\n\r\n while ((i < s.length) && charInString (s.charAt(i), whitespace))\r\n i++;\r\n\r\n return s.substring (i, s.length);\r\n}",
"function isWhitespace(s)\n\n{\t var i;\n\n\t\t// Is s empty?\n\t\tif (isEmpty(s)) return true;\n\n\t\tfor (i = 0; i < s.length; i++)\n\t\t{\t \n\t\t// Check that current character isn't whitespace.\n\t\tvar c = s.charAt(i);\n\n\t\tif (whitespace.indexOf(c) == -1) return false;\n\t\t}\n\n\t\t// All characters are whitespace.\n\t\treturn true;\n}",
"function isWhitespace(char) {\n\treturn /\\s/.test(char);\n}",
"skipWhiteSpace() {\n while ((this.token.kind === SyntaxKind.WhiteSpaceTrivia\n || this.token.kind === SyntaxKind.EndOfLineToken)\n && this.token.kind !== SyntaxKind.EndOfFileToken) {\n this.token = this.lexer.next();\n }\n }",
"function charToStitch(char) {\n if (char === 'x') {\n return YELLOW\n }\n return BLACK\n}",
"get whitespace() {\n return this.spec.whitespace || (this.spec.code ? \"pre\" : \"normal\");\n }",
"function isOnlyWhitespace(sourceStr) {\n // FILL THIS IN\n return /\\s/g.test(sourceStr);\n }",
"function isWhitespace(c) {\n\t return c === CHAR_SPACE || c === CHAR_TAB;\n\t}",
"function isWhitespace(c) {\n\t return c === CHAR_SPACE || c === CHAR_TAB;\n\t}",
"function isWhitespace(c) {\n\t return c === CHAR_SPACE || c === CHAR_TAB;\n\t}",
"space_lexeme() { return new GeneratorLexeme(\"space\", \"[\\\\n|\\\\t|\\\\r|\\\\s]+\") }",
"function isWhiteSpace(code) {\n\t if (code >= 0x2000 && code <= 0x200A) { return true; }\n\t switch (code) {\n\t case 0x09: // \\t\n\t case 0x0A: // \\n\n\t case 0x0B: // \\v\n\t case 0x0C: // \\f\n\t case 0x0D: // \\r\n\t case 0x20:\n\t case 0xA0:\n\t case 0x1680:\n\t case 0x202F:\n\t case 0x205F:\n\t case 0x3000:\n\t return true;\n\t }\n\t return false;\n\t}",
"function nospaces(t){\n\t\tif(t.value.match(/\\s/g)){\n\t\t\tt.value = t.value.replace(/\\s/g,'');\n\t\t}\n\t}",
"function sp(indentation) {\n return \" \".repeat(indentation * 2);\n}",
"function catchupWhiteOut(end, state) {\n catchup(end, state, replaceNonWhite);\n}",
"function catchupWhiteOut(end, state) {\n catchup(end, state, replaceNonWhite);\n}",
"function addS(word) {\n\n}",
"function isWhitespace (s)\r\n\r\n{ var i;\r\n\r\n // Is s empty?\r\n if (isEmpty(s)) return true;\r\n\r\n // Search through string's characters one by one\r\n // until we find a non-whitespace character.\r\n // When we do, return false; if we don't, return true.\r\n\r\n for (i = 0; i < s.length; i++)\r\n {\r\n // Check that current character isn't whitespace.\r\n var c = s.charAt(i);\r\n\r\n if (whitespace.indexOf(c) == -1) return false;\r\n }\r\n\r\n // All characters are whitespace.\r\n return true;\r\n}",
"function isWhitespace (s)\r\n\r\n{ var i;\r\n\r\n // Is s empty?\r\n if (isEmpty(s)) return true;\r\n\r\n // Search through string's characters one by one\r\n // until we find a non-whitespace character.\r\n // When we do, return false; if we don't, return true.\r\n\r\n for (i = 0; i < s.length; i++)\r\n {\r\n // Check that current character isn't whitespace.\r\n var c = s.charAt(i);\r\n\r\n if (whitespace.indexOf(c) == -1) return false;\r\n }\r\n\r\n // All characters are whitespace.\r\n return true;\r\n}",
"function isWhitespace (s)\r\n\r\n{ var i;\r\n\r\n // Is s empty?\r\n if (isEmpty(s)) return true;\r\n\r\n // Search through string's characters one by one\r\n // until we find a non-whitespace character.\r\n // When we do, return false; if we don't, return true.\r\n\r\n for (i = 0; i < s.length; i++)\r\n {\r\n // Check that current character isn't whitespace.\r\n var c = s.charAt(i);\r\n\r\n if (whitespace.indexOf(c) == -1) return false;\r\n }\r\n\r\n // All characters are whitespace.\r\n return true;\r\n}",
"function whitespaceCharacterInBody(p, token) {\r\n p._reconstructActiveFormattingElements();\r\n p._insertCharacters(token);\r\n}",
"function satisyWhitespace(ch, pos) {\n switch (ch) {\n case 0x09:\n case 0x0A:\n case 0x0D:\n case 0x20:\n return true;\n default:\n return false;\n }\n }",
"function isWhiteSpace(code) {\n if (code >= 8192 && code <= 8202) {\n return true;\n }\n switch (code) {\n case 9:\n // \\t\n case 10:\n // \\n\n case 11:\n // \\v\n case 12:\n // \\f\n case 13:\n // \\r\n case 32:\n case 160:\n case 5760:\n case 8239:\n case 8287:\n case 12288:\n return true;\n }\n return false;\n }",
"function wsp() { return wrap('wsp', or(sp, htab)()); }",
"function wsp() { return wrap('wsp', or(sp, htab)()); }",
"function wsp() { return wrap('wsp', or(sp, htab)()); }",
"function wsp() { return wrap('wsp', or(sp, htab)()); }",
"function twTokenStrong(stream, state) {\n var maybeEnd = false,\n ch;\n while (ch = stream.next()) {\n if (ch == \"'\" && maybeEnd) {\n state.tokenize = tokenBase;\n break;\n }\n maybeEnd = (ch == \"'\");\n }\n return \"strong\";\n }",
"function twTokenStrong(stream, state) {\n var maybeEnd = false,\n ch;\n while (ch = stream.next()) {\n if (ch == \"'\" && maybeEnd) {\n state.tokenize = tokenBase;\n break;\n }\n maybeEnd = (ch == \"'\");\n }\n return \"strong\";\n }",
"function hasWhiteSpace(s) {\n //return s.indexOf(' ') >= 0; // Ueberarbeiten! Whitespace ist durchaus erlaubt ex. \"Auftrag fuer Zuhause\"\n if ((s.match(/ /g) || []).length == s.length) {\n return true;\n }\n return false;\n}",
"function catchupWhiteOut(end, state) {\n catchup(end, state, _replaceNonWhite);\n}",
"function catchupWhiteOut(end, state) {\n catchup(end, state, _replaceNonWhite);\n}",
"function isWhitespace(ch) {\n return /\\s/.test(ch);\n }",
"function whitespace(character) {\n return re.test(\n typeof character === 'number' ? fromCode(character) : character.charAt(0)\n )\n}",
"function whitespace(character) {\n return re.test(\n typeof character === 'number' ? fromCode(character) : character.charAt(0)\n )\n}",
"function whitespace(character) {\n return re.test(\n typeof character === 'number' ? fromCode(character) : character.charAt(0)\n )\n}",
"function whitespace(character) {\n return re.test(\n typeof character === 'number' ? fromCode(character) : character.charAt(0)\n )\n}",
"function whitespace(character) {\n return re.test(\n typeof character === 'number' ? fromCode(character) : character.charAt(0)\n )\n}",
"function whitespace(character) {\n return re.test(\n typeof character === 'number' ? fromCode(character) : character.charAt(0)\n )\n}",
"function skipWhitespace(state) {\n var prev = 10;\n while (state.position < state.length) {\n var c = state.data.charCodeAt(state.position);\n switch (c) {\n case 9: // '\\t'\n case 32:\n prev = c;\n ++state.position;\n break;\n case 10:\n // handle \\r\\n\n if (prev !== 13) {\n ++state.currentLineNumber;\n }\n prev = c;\n ++state.position;\n break;\n case 13:\n prev = c;\n ++state.position;\n ++state.currentLineNumber;\n break;\n default:\n return prev;\n }\n }\n return prev;\n }",
"function step1a(token) { \n if(token.match(/(ss|i)es$/))\n return token.replace(/(ss|i)es$/, '$1');\n \n if(token.substr(-1) == 's' && token.substr(-2, 1) != 's' && token.length > 3)\n return token.replace(/s?$/, '');\n \n return token;\n}",
"function nospaces(t) {\n return t.which !== 32;\n}",
"function insertWhitespace(s) {\n return s.split(\"\").map((i, index)=>{\n if(index!==0)\n if(i !== i.toLowerCase())\n return \" \"+i;\n return i;\n }).join(\"\");\n\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function whitespaceCharacterInBody(p, token) {\n p._reconstructActiveFormattingElements();\n p._insertCharacters(token);\n}",
"function markWhiteSpaces(string) {\n /* 'm' modifier makes regex applicable to every separate line in string, not the string as the whole. */\n\n /* Leading space */\n string = string.replace(\n /^(<(ins|del)>)*( )/gim,\n '$1' + getPlaceableMarkup('Leading space', ' '),\n );\n\n /* Trailing space */\n string = string.replace(\n /( )(<\\/(ins|del)>)*$/gim,\n getPlaceableMarkup('Trailing space', ' ') + '$2',\n );\n\n /* Newline */\n string = markPlaceable(string, /\\n/gi, 'Newline character', '¶$&');\n\n /* Tab */\n string = markPlaceable(string, /\\t/gi, 'Tab character', '→');\n return string;\n }",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"function isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}",
"gobbleSpaces() {\n let ch = this.code;\n while (ch === _Jsep.SPACE_CODE || ch === _Jsep.TAB_CODE || ch === _Jsep.LF_CODE || ch === _Jsep.CR_CODE) {\n ch = this.expr.charCodeAt(++this.index);\n }\n this.runHook(\"gobble-spaces\");\n }"
] |
[
"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.54569775",
"0.5444347",
"0.5382974",
"0.5382612",
"0.5376046",
"0.53700244",
"0.53664577",
"0.5341826",
"0.5341826",
"0.53282076",
"0.53258395",
"0.53256303",
"0.5304517",
"0.5287204",
"0.5278913",
"0.5278086",
"0.5278086",
"0.5278086",
"0.5266682",
"0.5248781",
"0.5246102",
"0.52435845",
"0.5238831",
"0.5238831",
"0.5235574",
"0.5233521",
"0.5233521",
"0.5233521",
"0.5230181",
"0.52246124",
"0.52196145",
"0.52183473",
"0.52183473",
"0.52183473",
"0.52183473",
"0.52072865",
"0.52072865",
"0.51975304",
"0.51958644",
"0.51958644",
"0.51881915",
"0.5185523",
"0.5185523",
"0.5185523",
"0.5185523",
"0.5185523",
"0.5185523",
"0.51780087",
"0.51743186",
"0.5171989",
"0.5166497",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515918",
"0.515422",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.51525944",
"0.5152502"
] |
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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n\t // Uses a subset of ns-char - c-indicator\n\t // where ns-char = nb-char - s-white.\n\t return isPrintable(c) && c !== 0xFEFF\n\t && !isWhitespace(c) // - s-white\n\t // - (c-indicator ::=\n\t // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n\t && c !== CHAR_MINUS\n\t && c !== CHAR_QUESTION\n\t && c !== CHAR_COLON\n\t && c !== CHAR_COMMA\n\t && c !== CHAR_LEFT_SQUARE_BRACKET\n\t && c !== CHAR_RIGHT_SQUARE_BRACKET\n\t && c !== CHAR_LEFT_CURLY_BRACKET\n\t && c !== CHAR_RIGHT_CURLY_BRACKET\n\t // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n\t && c !== CHAR_SHARP\n\t && c !== CHAR_AMPERSAND\n\t && c !== CHAR_ASTERISK\n\t && c !== CHAR_EXCLAMATION\n\t && c !== CHAR_VERTICAL_LINE\n\t && c !== CHAR_GREATER_THAN\n\t && c !== CHAR_SINGLE_QUOTE\n\t && c !== CHAR_DOUBLE_QUOTE\n\t // | “%” | “@” | “`”)\n\t && c !== CHAR_PERCENT\n\t && c !== CHAR_COMMERCIAL_AT\n\t && c !== CHAR_GRAVE_ACCENT;\n\t}",
"function isPlainSafeFirst(c) {\n\t // Uses a subset of ns-char - c-indicator\n\t // where ns-char = nb-char - s-white.\n\t return isPrintable(c) && c !== 0xFEFF\n\t && !isWhitespace(c) // - s-white\n\t // - (c-indicator ::=\n\t // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n\t && c !== CHAR_MINUS\n\t && c !== CHAR_QUESTION\n\t && c !== CHAR_COLON\n\t && c !== CHAR_COMMA\n\t && c !== CHAR_LEFT_SQUARE_BRACKET\n\t && c !== CHAR_RIGHT_SQUARE_BRACKET\n\t && c !== CHAR_LEFT_CURLY_BRACKET\n\t && c !== CHAR_RIGHT_CURLY_BRACKET\n\t // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n\t && c !== CHAR_SHARP\n\t && c !== CHAR_AMPERSAND\n\t && c !== CHAR_ASTERISK\n\t && c !== CHAR_EXCLAMATION\n\t && c !== CHAR_VERTICAL_LINE\n\t && c !== CHAR_GREATER_THAN\n\t && c !== CHAR_SINGLE_QUOTE\n\t && c !== CHAR_DOUBLE_QUOTE\n\t // | “%” | “@” | “`”)\n\t && c !== CHAR_PERCENT\n\t && c !== CHAR_COMMERCIAL_AT\n\t && c !== CHAR_GRAVE_ACCENT;\n\t}",
"function isPlainSafeFirst(c) {\n\t // Uses a subset of ns-char - c-indicator\n\t // where ns-char = nb-char - s-white.\n\t return isPrintable(c) && c !== 0xFEFF\n\t && !isWhitespace(c) // - s-white\n\t // - (c-indicator ::=\n\t // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n\t && c !== CHAR_MINUS\n\t && c !== CHAR_QUESTION\n\t && c !== CHAR_COLON\n\t && c !== CHAR_COMMA\n\t && c !== CHAR_LEFT_SQUARE_BRACKET\n\t && c !== CHAR_RIGHT_SQUARE_BRACKET\n\t && c !== CHAR_LEFT_CURLY_BRACKET\n\t && c !== CHAR_RIGHT_CURLY_BRACKET\n\t // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n\t && c !== CHAR_SHARP\n\t && c !== CHAR_AMPERSAND\n\t && c !== CHAR_ASTERISK\n\t && c !== CHAR_EXCLAMATION\n\t && c !== CHAR_VERTICAL_LINE\n\t && c !== CHAR_GREATER_THAN\n\t && c !== CHAR_SINGLE_QUOTE\n\t && c !== CHAR_DOUBLE_QUOTE\n\t // | “%” | “@” | “`”)\n\t && c !== CHAR_PERCENT\n\t && c !== CHAR_COMMERCIAL_AT\n\t && c !== CHAR_GRAVE_ACCENT;\n\t}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst$1(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n return isPrintable$1(c) && c !== 0xFEFF\n && !isWhitespace$1(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS$1\n && c !== CHAR_QUESTION$1\n && c !== CHAR_COLON$1\n && c !== CHAR_COMMA$3\n && c !== CHAR_LEFT_SQUARE_BRACKET$3\n && c !== CHAR_RIGHT_SQUARE_BRACKET$3\n && c !== CHAR_LEFT_CURLY_BRACKET$1\n && c !== CHAR_RIGHT_CURLY_BRACKET$1\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP$1\n && c !== CHAR_AMPERSAND$1\n && c !== CHAR_ASTERISK$2\n && c !== CHAR_EXCLAMATION$1\n && c !== CHAR_VERTICAL_LINE$1\n && c !== CHAR_EQUALS$1\n && c !== CHAR_GREATER_THAN$1\n && c !== CHAR_SINGLE_QUOTE$2\n && c !== CHAR_DOUBLE_QUOTE$2\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT$1\n && c !== CHAR_COMMERCIAL_AT$1\n && c !== CHAR_GRAVE_ACCENT$1;\n}",
"function chars(input){\n return true; // default validation only\n }",
"function twoCharsAtLeast(value) {\n return /\\S{2,}/.test(value);\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function firstChar(txt,err,errarea)\n{\n\t// var exp_username = /^[A-Za-z0-9]{3,20}$/;\t\n\tvar txt1=new Array();\n\ttxt1=txt;\n\t\n\tif (txt1[0]==\"_\" || txt1[0]==\".\" ) \n\t{\n\t\t//\talert(txt1[0] + \" Special Char Not allowed\");\n\t\tdocument.getElementById(errarea).innerHTML = \"First \" + err;\n\t\treturn false;\n\t}\n\t \n \tif (txt1[txt1.length-1]==\"_\" || txt1[txt1.length-1]==\".\" ) \n\t{\n\t\t//alert(\"Special Char Not allowed\");\n\t\tdocument.getElementById(errarea).innerHTML =\"Last \"+ err;\n\t\treturn false;\n\t}\n\treturn true;\n}",
"function validateInitialField(f) {\n if (f.length!=6) return false;\n if (f.charAt(0)!=\"!\") return false;\n var s = f.slice(1,3);\n switch (s) {\n case \"AB\":\n case \"AD\":\n case \"AI\":\n case \"AN\":\n case \"AR\":\n case \"AS\":\n case \"AT\":\n case \"AX\":\n case \"BS\":\n case \"SA\":\n break;\n default:\n return false;\n }\n s = f.slice(3,6);\n switch (s) {\n case \"VDM\":\n case \"VDO\":\n break;\n default:\n return false;\n }\n return true;\n}",
"function isCharacterValue(event) {\n return !isModifierKey_1.default(event) && event.key && event.key.length == 1;\n}",
"function firstValid() {\n if (\n firstName.value !== null &&\n firstName.value.length >= 2 &&\n firstName.value.match(regexLetter)\n ) {\n return true;\n } else {\n return false;\n }\n}",
"function isTextSimple(value)\n{\n for(var i = 0; i < value.length; ++ i)\n {\n if(value[i] >= '0' && value[i] <= '9')\n {\n continue;\n }\n if(value[i] >= 'a' && value[i] <= 'z')\n {\n continue;\n }\n if(value[i] >= 'A' && value[i] <= 'Z')\n {\n continue;\n }\n if(value[i] == '_')\n {\n continue;\n }\n return false;\n }\n return true;\n}",
"startsWith(c){ return this.isSign(c) || Character.isDigit(c) }",
"valid(c) { return Character.isAlphabetic(c) || c=='+'||c=='/' }",
"function splCharCheck(params) {\n console.log(params.match(/[^0-9a-zA-Z]/))\n if(params.match(/[^0-9a-zA-Z]/) != null)\n {return true}\n else \n {return false}\n}",
"validateInput(value) {\n if (value.search(/^[0-9A-Z\\-\\.\\*\\$\\/\\+\\ %\\ ]+$/) === -1) {\n return 'Supports A-Z, 0-9, and symbols ( - . $ / + % SPACE).';\n }\n else {\n return undefined;\n }\n }",
"function Chekkey(value){\n var firstChar = value.substr(0,1);\n if(firstChar.toLowerCase() =='s')\n return true;\n else\n return false;\n}",
"invalidInput(value) {\n const test = /[^\\wÀ-û\\s]/;\n return test.test(value) || value.length < 5;\n }",
"function alphanum_allowChar(validatedStringFragment, Char, settings) {\n\n\t\tif (settings.maxLength && validatedStringFragment.length >= settings.maxLength)\n\t\t\treturn false;\n\n\t\tif (settings.allow.indexOf(Char) >= 0)\n\t\t\treturn true;\n\n\t\tif (settings.allowSpace && (Char == \" \"))\n\t\t\treturn true;\n\n\t\tif (settings.blacklistSet.contains(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowNumeric && DIGITS[Char])\n\t\t\treturn false;\n\n\t\tif (!settings.allowUpper && isUpper(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowLower && isLower(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowCaseless && isCaseless(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowLatin && LATIN_CHARS.contains(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowOtherCharSets) {\n\t\t\tif (DIGITS[Char] || LATIN_CHARS.contains(Char))\n\t\t\t\treturn true;\n\t\t\telse\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}",
"function valid() {\n\t\treturn !(this.string.search(/^[!-~ ]+$/) === -1);\n\t}",
"function checkAlphabetic(name, value, position){\n\t var position = typeof(position) != 'undefined' ? position : 'empty';\n\n\t \t if(position == 'empty'){\n\t\t \n\t\t for(var i = 0; i < value.length; i++){\n\t\t\t if (value.charCodeAt(i) > 64 && value.charCodeAt(i) < 124 || value.charCodeAt(i) == 39 || value.charCodeAt(i) == 45){\n\t\t\t\t //do nothing\n\t\t\t }\n\t\t\t else{\n errMessages += \"<li>\" + name + \" - Value is not alphabetic.</li>.\";\n\t\t\t\t return false;\n\t\t\t }\n\t\t }\n\t\t if(value.lastIndexOf('-') >= 0 || value.lastIndexOf('\\'') >= 0 ){\n\t\t\t if(value.lastIndexOf('-') == value.length -1 || value.lastIndexOf('\\'') == value.length -1 ){\n\t\t\t\t \terrMessages += \"<li>\" + name + \" - A hypen (-) or apostrophe (') cannot be last letter.</li>\";\n\t\t\t\t return false;\n\t\t\t }\n\t\t\t\t if(value.substr((value.lastIndexOf('-')+1), 1) == '\\'' || value.substr((value.lastIndexOf('-')-1), 1) == '\\''){\n\t\t\t\t\t \terrMessages += \"<li>\" + name + \" - A hypen (-) and apostrophe (') cannot be next to each other.</li>\";\n\t\t\t\t\t return false;\n\t\t\t\t }\n\t\t }\n\t\t return true;\n\t }\n\t else{\t \n\t\t for(var i = position.posX; i < position.posY + 1; i++){\n\t\t\t if (value.charCodeAt(i) < 64 || value.charCodeAt(i) > 122 || value.charCodeAt(i) == 39 || value.charCodeAt(i) == 45){\n \terrMessages += \"<li>\" + name + \" - First \" + position.y + \" spaces must start with (a -z) or (A -Z).</li>\";\n\t\t\t\t return false;\n\t\t\t }\n\t\t }\n return true;\n\t }\n}",
"function inValNS(e){\n var l = e.length;\n if(l == 0){ return true; }\n else{\n for(i = 0; i < l; i++){ if(e.charAt(i) == \" \"){ return true; break; } }\n return false;\n }\n}",
"function checkInvalidHeaderChar(val) {\n val += '';\n\n if (val.length < 1) {\n return false;\n }\n\n let c = val.charCodeAt(0);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n\n if (val.length < 2) {\n return false;\n }\n\n c = val.charCodeAt(1);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n\n if (val.length < 3) {\n return false;\n }\n\n c = val.charCodeAt(2);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n\n for (let i = 3; i < val.length; ++i) {\n c = val.charCodeAt(i);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n }\n\n return false;\n}",
"function check_allowed_char(input,type,config){\r\n\tvar filter = eval(config)[type].allowed;\r\n\t//console.log(filter.test(input))\r\n\treturn(!filter.test(input));\r\n}",
"function validateSingleName(val){\n var keymash = /(([b-df-hj-np-tv-z])(?!\\2)){5}/;\n var v = trim(val);\n return (v != null && v.length >= 2 && !keymash.test(v))\n}",
"function latinWordStartCheck(contextParams) {\r\n\t const char = contextParams.current;\r\n\t const prevChar = contextParams.get(-1);\r\n\t return (\r\n\t // ? latin first char\r\n\t (prevChar === null && isLatinChar(char)) ||\r\n\t // ? latin char preceded with a non latin char\r\n\t (!isLatinChar(prevChar) && isLatinChar(char))\r\n\t );\r\n\t}",
"function check_invalid_char(input, type, config){\r\n\tvar filter = eval(config)[type].not_allowed;\r\n\t//console.log(filter.test(input))\r\n\treturn(filter.test(input));\r\n}",
"validateInput(char) {\n if ((new RegExp(`^${'(\\xCF*[0-9]{2}\\xCF*)'}+$`)).test(char)) {\n return undefined;\n }\n else {\n return 'Supports even number of numeric characters (00-99).';\n }\n }",
"function chars(input) {\n return true;\n}",
"function checkName(){\n first.value = first.value.trim();\n var checkLetters = 0;\n var checkValues = 0;\n var final = false;\n\n\n for(var i=0;i<first.value.length;i++){\n //Acceptable values\n if(first.value[i]>='A' && first.value[i]<=\"Z\"){checkLetters++;}\n else if(first.value[i]>='a' && first.value[i]<=\"z\"){checkLetters++;}\n else if(first.value[i]==\"'\"){}\n else if(first.value[i]=='-'){}\n else{checkValues++;}\n\n }\n\n if(checkValues > 0){\n first.style.border = \"1px solid red\";\n first_error.innerHTML = \"X Acceptable values are A-Z a-z ' - \";\n first.focus();\n final = false;\n console.log(\"Acceptable values are A-Z a-z ' - \");\n }\n }",
"validateInput(char) {\n if (char.search(/^[0-9A-Z\\-\\.\\ \\$\\/\\+\\%]+$/) === -1) {\n return 'Supports A-Z, 0-9, and symbols ( - . $ / + % SPACE).';\n }\n else {\n return undefined;\n }\n }",
"function validFirstCharacter(char) {\n const regex = new RegExp(\"[0-9\\\\(]\");\n return regex.test(char);\n}",
"function twoCharsAtLeastInput(input) {\n return /\\S{2,}/.test(input.value);\n}",
"function badCharAtAnEnd(value) {\n return value.startsWith('{') || value.startsWith('\"') || value.endsWith('}') || value.endsWith('\"');\n}",
"function lettersNumberNoSpace(parameter){ \n\tvar letters = /^[A-Za-z0-9]+$/.test(parameter);\n\tif(letters == true){ \n\t\treturn true; \n\t}else{ \n\t\treturn false; \n\t} \n}",
"function is(value) {\r\n var candidate = value;\r\n return Is.number(candidate.startLine) && Is.number(candidate.startLine)\r\n && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter))\r\n && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter))\r\n && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\r\n }",
"function is(value) {\r\n var candidate = value;\r\n return Is.number(candidate.startLine) && Is.number(candidate.startLine)\r\n && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter))\r\n && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter))\r\n && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\r\n }",
"validateInput(char) {\n if ((new RegExp(`^${'[\\x00-\\x5F\\xC8-\\xCF]'}+$`)).test(char)) {\n return undefined;\n }\n else {\n return 'Supports only ASCII characters 00 to 95 (0–9, A–Z and control codes) and special characters.';\n }\n }",
"function verifFirst() {\n let regexFirst = /^[a-zA-ZÀ-Ÿà-ÿ-\\s]+$/; //uniquement des lettres majuscules ou minuscules les tirets et les espaces\n if (regexFirst.exec(first.value) === null || first.length < 2) {\n errorAlert[0].style.display = \"block\";\n first.classList.add(\"echec\");\n first.classList.add(\"border\");\n\n setTimeout(() => {\n first.classList.remove(\"echec\");\n }, 500);\n return (validFirst = false);\n } else {\n first.classList.remove(\"border\");\n\n errorAlert[0].style.display = \"none\";\n tabValue.push(first.value);\n return (validFirst = true);\n }\n}",
"validateInput(char) {\n if ((new RegExp(`^${'[\\x20-\\x7F\\xC8-\\xCF]'}+$`)).test(char)) {\n return undefined;\n }\n else {\n return 'Supports only ASCII characters 32 to 127 (0–9, A–Z, a–z), and special characters.';\n }\n }",
"_isValidPropertyName(str) {\n return /^(?![0-9])[a-zA-Z0-9$_]+$/.test(str);\n }",
"onlyletters(input) {\n\n let re = /^[A-Za-z]+$/\n\n let inputValue = input.value\n\n let errorMessage = `Esse campo não aceita número nem caracteres especiais`\n\n if(!re.test(inputValue)) {\n this.printMessage(input, errorMessage)\n }\n\n }",
"function check_req_char(input, type, config){\r\n\tvar filter = eval(config)[type].required;\r\n\t//console.log(filter.test(input));\r\n\treturn(!filter.test(input));\r\n}",
"function is(value) {\n var candidate = value;\n return Is.number(candidate.startLine) && Is.number(candidate.startLine)\n && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter))\n && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter))\n && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\n }",
"function is(value) {\n var candidate = value;\n return Is.uinteger(candidate.startLine) && Is.uinteger(candidate.startLine) && (Is.undefined(candidate.startCharacter) || Is.uinteger(candidate.startCharacter)) && (Is.undefined(candidate.endCharacter) || Is.uinteger(candidate.endCharacter)) && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\n }",
"function isCharacterALetter(character_start) {\n return /[a-zA-Z]/.test(character_start);\n}",
"function is(value) {\n var candidate = value;\n return Is.number(candidate.startLine) && Is.number(candidate.startLine) && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter)) && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter)) && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\n }",
"function is(value) {\n var candidate = value;\n return Is.number(candidate.startLine) && Is.number(candidate.startLine) && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter)) && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter)) && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\n }",
"onlyletters(input) {\n\n let re = /^[A-Za-z]+$/;\n\n let inputValue = input.value;\n\n let errorMessage = `Este campo não aceita números nem caracteres especiais`;\n\n if (!re.test(inputValue)) {\n this.printMessage(input, errorMessage);\n }\n\n }",
"function lettersNumberAndSpace(parameter){ \n\tvar letters = /^[A-Za-z0-9 ]+$/.test(parameter);\n\tif(letters == true){ \n\t\treturn true; \n\t}else{ \n\t\treturn false; \n\t} \n}",
"onlyletter(input) {\n let re = /^[A-Za-z]+$/\n let inputValue = input.value\n\n let errorMessage = `Este campo não aceita numeros nem caracteres especiais`\n\n if(!re.test(inputValue)) {\n this.printMessage(input, errorMessage)\n }\n }",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function isPlainSafe(c, prev) {\n // Uses a subset of nb-char - c-flow-indicator - \":\" - \"#\"\n // where nb-char ::= c-printable - b-char - c-byte-order-mark.\n return isPrintable(c) && c !== 0xFEFF\n // - c-flow-indicator\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // - \":\" - \"#\"\n // /* An ns-char preceding */ \"#\"\n && c !== CHAR_COLON\n && ((c !== CHAR_SHARP) || (prev && isNsChar(prev)));\n}",
"function restrictAlphabets(e){\n\t\tvar x=e.which||e.keycode;\n\t\tif((x>=48 && x<=57) || x==8 ||\n\t\t\t(x>=35 && x<=40)|| x==46)\n\t\t\treturn true;\n\t\telse\n\t\t\treturn false;\n }",
"startsWith(c){ return c=='_' || Character.isLetter(c) }",
"startsWith(c) { return this.white.test(c) }",
"function validateCharacters(val) {\n if (/^[a-zA-Z()]+$/.test(val) && val != \"\") {\n return true;\n } else {\n return false;\n }\n}",
"function is(value) {\r\n var candidate = value;\r\n return Is.number(candidate.startLine) && Is.number(candidate.startLine)\r\n && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter))\r\n && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter))\r\n && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\r\n }",
"function is(value) {\r\n var candidate = value;\r\n return Is.number(candidate.startLine) && Is.number(candidate.startLine)\r\n && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter))\r\n && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter))\r\n && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\r\n }"
] |
[
"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.66741455",
"0.66741455",
"0.66741455",
"0.6670375",
"0.6670375",
"0.6670375",
"0.6670375",
"0.6497922",
"0.64209914",
"0.6349275",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.63416517",
"0.62768066",
"0.6272416",
"0.623539",
"0.62320566",
"0.61067003",
"0.60861367",
"0.60684854",
"0.60653067",
"0.60424435",
"0.5996404",
"0.5986247",
"0.5972965",
"0.59555656",
"0.59520686",
"0.59443253",
"0.59360135",
"0.5935706",
"0.59285706",
"0.59206945",
"0.59165305",
"0.5910151",
"0.59045315",
"0.5870203",
"0.58676875",
"0.5867237",
"0.5843222",
"0.5825273",
"0.5817338",
"0.5811019",
"0.5811019",
"0.57980585",
"0.5793071",
"0.57747346",
"0.57727253",
"0.5769993",
"0.5759121",
"0.57557625",
"0.5751911",
"0.57445997",
"0.57365614",
"0.57365614",
"0.57200676",
"0.5718806",
"0.571602",
"0.5711557",
"0.5711557",
"0.5711557",
"0.5711557",
"0.5711557",
"0.5711557",
"0.5711557",
"0.5711557",
"0.5711557",
"0.57108396",
"0.5708881",
"0.5708103",
"0.5705517",
"0.5703691",
"0.5703691"
] |
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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"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 !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n\t // Uses a subset of ns-char - c-indicator\n\t // where ns-char = nb-char - s-white.\n\t return isPrintable(c) && c !== 0xFEFF\n\t && !isWhitespace(c) // - s-white\n\t // - (c-indicator ::=\n\t // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n\t && c !== CHAR_MINUS\n\t && c !== CHAR_QUESTION\n\t && c !== CHAR_COLON\n\t && c !== CHAR_COMMA\n\t && c !== CHAR_LEFT_SQUARE_BRACKET\n\t && c !== CHAR_RIGHT_SQUARE_BRACKET\n\t && c !== CHAR_LEFT_CURLY_BRACKET\n\t && c !== CHAR_RIGHT_CURLY_BRACKET\n\t // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n\t && c !== CHAR_SHARP\n\t && c !== CHAR_AMPERSAND\n\t && c !== CHAR_ASTERISK\n\t && c !== CHAR_EXCLAMATION\n\t && c !== CHAR_VERTICAL_LINE\n\t && c !== CHAR_GREATER_THAN\n\t && c !== CHAR_SINGLE_QUOTE\n\t && c !== CHAR_DOUBLE_QUOTE\n\t // | “%” | “@” | “`”)\n\t && c !== CHAR_PERCENT\n\t && c !== CHAR_COMMERCIAL_AT\n\t && c !== CHAR_GRAVE_ACCENT;\n\t}",
"function isPlainSafeFirst(c) {\n\t // Uses a subset of ns-char - c-indicator\n\t // where ns-char = nb-char - s-white.\n\t return isPrintable(c) && c !== 0xFEFF\n\t && !isWhitespace(c) // - s-white\n\t // - (c-indicator ::=\n\t // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n\t && c !== CHAR_MINUS\n\t && c !== CHAR_QUESTION\n\t && c !== CHAR_COLON\n\t && c !== CHAR_COMMA\n\t && c !== CHAR_LEFT_SQUARE_BRACKET\n\t && c !== CHAR_RIGHT_SQUARE_BRACKET\n\t && c !== CHAR_LEFT_CURLY_BRACKET\n\t && c !== CHAR_RIGHT_CURLY_BRACKET\n\t // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n\t && c !== CHAR_SHARP\n\t && c !== CHAR_AMPERSAND\n\t && c !== CHAR_ASTERISK\n\t && c !== CHAR_EXCLAMATION\n\t && c !== CHAR_VERTICAL_LINE\n\t && c !== CHAR_GREATER_THAN\n\t && c !== CHAR_SINGLE_QUOTE\n\t && c !== CHAR_DOUBLE_QUOTE\n\t // | “%” | “@” | “`”)\n\t && c !== CHAR_PERCENT\n\t && c !== CHAR_COMMERCIAL_AT\n\t && c !== CHAR_GRAVE_ACCENT;\n\t}",
"function isPlainSafeFirst(c) {\n\t // Uses a subset of ns-char - c-indicator\n\t // where ns-char = nb-char - s-white.\n\t return isPrintable(c) && c !== 0xFEFF\n\t && !isWhitespace(c) // - s-white\n\t // - (c-indicator ::=\n\t // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n\t && c !== CHAR_MINUS\n\t && c !== CHAR_QUESTION\n\t && c !== CHAR_COLON\n\t && c !== CHAR_COMMA\n\t && c !== CHAR_LEFT_SQUARE_BRACKET\n\t && c !== CHAR_RIGHT_SQUARE_BRACKET\n\t && c !== CHAR_LEFT_CURLY_BRACKET\n\t && c !== CHAR_RIGHT_CURLY_BRACKET\n\t // | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “\"”\n\t && c !== CHAR_SHARP\n\t && c !== CHAR_AMPERSAND\n\t && c !== CHAR_ASTERISK\n\t && c !== CHAR_EXCLAMATION\n\t && c !== CHAR_VERTICAL_LINE\n\t && c !== CHAR_GREATER_THAN\n\t && c !== CHAR_SINGLE_QUOTE\n\t && c !== CHAR_DOUBLE_QUOTE\n\t // | “%” | “@” | “`”)\n\t && c !== CHAR_PERCENT\n\t && c !== CHAR_COMMERCIAL_AT\n\t && c !== CHAR_GRAVE_ACCENT;\n\t}",
"function isPlainSafeFirst$1(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n return isPrintable$1(c) && c !== 0xFEFF\n && !isWhitespace$1(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS$1\n && c !== CHAR_QUESTION$1\n && c !== CHAR_COLON$1\n && c !== CHAR_COMMA$3\n && c !== CHAR_LEFT_SQUARE_BRACKET$3\n && c !== CHAR_RIGHT_SQUARE_BRACKET$3\n && c !== CHAR_LEFT_CURLY_BRACKET$1\n && c !== CHAR_RIGHT_CURLY_BRACKET$1\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP$1\n && c !== CHAR_AMPERSAND$1\n && c !== CHAR_ASTERISK$2\n && c !== CHAR_EXCLAMATION$1\n && c !== CHAR_VERTICAL_LINE$1\n && c !== CHAR_EQUALS$1\n && c !== CHAR_GREATER_THAN$1\n && c !== CHAR_SINGLE_QUOTE$2\n && c !== CHAR_DOUBLE_QUOTE$2\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT$1\n && c !== CHAR_COMMERCIAL_AT$1\n && c !== CHAR_GRAVE_ACCENT$1;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n // No support of ( ( “?” | “:” | “-” ) /* Followed by an ns-plain-safe(c)) */ ) part\n return isPrintable(c) && c !== CHAR_BOM\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !== CHAR_QUESTION\n && c !== CHAR_COLON\n && c !== CHAR_COMMA\n && c !== CHAR_LEFT_SQUARE_BRACKET\n && c !== CHAR_RIGHT_SQUARE_BRACKET\n && c !== CHAR_LEFT_CURLY_BRACKET\n && c !== CHAR_RIGHT_CURLY_BRACKET\n // | “#” | “&” | “*” | “!” | “|” | “=” | “>” | “'” | “\"”\n && c !== CHAR_SHARP\n && c !== CHAR_AMPERSAND\n && c !== CHAR_ASTERISK\n && c !== CHAR_EXCLAMATION\n && c !== CHAR_VERTICAL_LINE\n && c !== CHAR_EQUALS\n && c !== CHAR_GREATER_THAN\n && c !== CHAR_SINGLE_QUOTE\n && c !== CHAR_DOUBLE_QUOTE\n // | “%” | “@” | “`”)\n && c !== CHAR_PERCENT\n && c !== CHAR_COMMERCIAL_AT\n && c !== CHAR_GRAVE_ACCENT;\n}",
"function validFirstCharacter(char) {\n const regex = new RegExp(\"[0-9\\\\(]\");\n return regex.test(char);\n}",
"function chars(input){\n return true; // default validation only\n }",
"startsWith(c){ return this.isSign(c) || Character.isDigit(c) }",
"function firstChar(txt,err,errarea)\n{\n\t// var exp_username = /^[A-Za-z0-9]{3,20}$/;\t\n\tvar txt1=new Array();\n\ttxt1=txt;\n\t\n\tif (txt1[0]==\"_\" || txt1[0]==\".\" ) \n\t{\n\t\t//\talert(txt1[0] + \" Special Char Not allowed\");\n\t\tdocument.getElementById(errarea).innerHTML = \"First \" + err;\n\t\treturn false;\n\t}\n\t \n \tif (txt1[txt1.length-1]==\"_\" || txt1[txt1.length-1]==\".\" ) \n\t{\n\t\t//alert(\"Special Char Not allowed\");\n\t\tdocument.getElementById(errarea).innerHTML =\"Last \"+ err;\n\t\treturn false;\n\t}\n\treturn true;\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function chars(input){\n return true; // default validation only\n}",
"function Chekkey(value){\n var firstChar = value.substr(0,1);\n if(firstChar.toLowerCase() =='s')\n return true;\n else\n return false;\n}",
"function isCharacterValue(event) {\n return !isModifierKey_1.default(event) && event.key && event.key.length == 1;\n}",
"function firstChar(name) {\n let clearName = name.trim();\n let fChar = clearName.charAt(0);\n return fChar\n}",
"function isFirstLetter(letter, string) {\n\n}",
"function firstValid() {\n if (\n firstName.value !== null &&\n firstName.value.length >= 2 &&\n firstName.value.match(regexLetter)\n ) {\n return true;\n } else {\n return false;\n }\n}",
"function isTextSimple(value)\n{\n for(var i = 0; i < value.length; ++ i)\n {\n if(value[i] >= '0' && value[i] <= '9')\n {\n continue;\n }\n if(value[i] >= 'a' && value[i] <= 'z')\n {\n continue;\n }\n if(value[i] >= 'A' && value[i] <= 'Z')\n {\n continue;\n }\n if(value[i] == '_')\n {\n continue;\n }\n return false;\n }\n return true;\n}",
"function latinWordStartCheck(contextParams) {\r\n\t const char = contextParams.current;\r\n\t const prevChar = contextParams.get(-1);\r\n\t return (\r\n\t // ? latin first char\r\n\t (prevChar === null && isLatinChar(char)) ||\r\n\t // ? latin char preceded with a non latin char\r\n\t (!isLatinChar(prevChar) && isLatinChar(char))\r\n\t );\r\n\t}",
"function chars(input) {\n return true;\n}",
"function getFirstChar() {\n index = 0;\n c = expr.charAt(0);\n }",
"validateInput(value) {\n if (value.search(/^[0-9A-Z\\-\\.\\*\\$\\/\\+\\ %\\ ]+$/) === -1) {\n return 'Supports A-Z, 0-9, and symbols ( - . $ / + % SPACE).';\n }\n else {\n return undefined;\n }\n }",
"function splCharCheck(params) {\n console.log(params.match(/[^0-9a-zA-Z]/))\n if(params.match(/[^0-9a-zA-Z]/) != null)\n {return true}\n else \n {return false}\n}",
"function checkAlphabetic(name, value, position){\n\t var position = typeof(position) != 'undefined' ? position : 'empty';\n\n\t \t if(position == 'empty'){\n\t\t \n\t\t for(var i = 0; i < value.length; i++){\n\t\t\t if (value.charCodeAt(i) > 64 && value.charCodeAt(i) < 124 || value.charCodeAt(i) == 39 || value.charCodeAt(i) == 45){\n\t\t\t\t //do nothing\n\t\t\t }\n\t\t\t else{\n errMessages += \"<li>\" + name + \" - Value is not alphabetic.</li>.\";\n\t\t\t\t return false;\n\t\t\t }\n\t\t }\n\t\t if(value.lastIndexOf('-') >= 0 || value.lastIndexOf('\\'') >= 0 ){\n\t\t\t if(value.lastIndexOf('-') == value.length -1 || value.lastIndexOf('\\'') == value.length -1 ){\n\t\t\t\t \terrMessages += \"<li>\" + name + \" - A hypen (-) or apostrophe (') cannot be last letter.</li>\";\n\t\t\t\t return false;\n\t\t\t }\n\t\t\t\t if(value.substr((value.lastIndexOf('-')+1), 1) == '\\'' || value.substr((value.lastIndexOf('-')-1), 1) == '\\''){\n\t\t\t\t\t \terrMessages += \"<li>\" + name + \" - A hypen (-) and apostrophe (') cannot be next to each other.</li>\";\n\t\t\t\t\t return false;\n\t\t\t\t }\n\t\t }\n\t\t return true;\n\t }\n\t else{\t \n\t\t for(var i = position.posX; i < position.posY + 1; i++){\n\t\t\t if (value.charCodeAt(i) < 64 || value.charCodeAt(i) > 122 || value.charCodeAt(i) == 39 || value.charCodeAt(i) == 45){\n \terrMessages += \"<li>\" + name + \" - First \" + position.y + \" spaces must start with (a -z) or (A -Z).</li>\";\n\t\t\t\t return false;\n\t\t\t }\n\t\t }\n return true;\n\t }\n}",
"function anyChar() {\n return parser(function (ps) {\n var ch = ps.currentCharCode();\n\n if (ch === undefined) {\n return ps.fail();\n }\n\n ++ps.position;\n\n return ps.succeed(ch);\n });\n }",
"function validateInitialField(f) {\n if (f.length!=6) return false;\n if (f.charAt(0)!=\"!\") return false;\n var s = f.slice(1,3);\n switch (s) {\n case \"AB\":\n case \"AD\":\n case \"AI\":\n case \"AN\":\n case \"AR\":\n case \"AS\":\n case \"AT\":\n case \"AX\":\n case \"BS\":\n case \"SA\":\n break;\n default:\n return false;\n }\n s = f.slice(3,6);\n switch (s) {\n case \"VDM\":\n case \"VDO\":\n break;\n default:\n return false;\n }\n return true;\n}",
"startsWith(c){ return c=='_' || Character.isLetter(c) }",
"function twoCharsAtLeast(value) {\n return /\\S{2,}/.test(value);\n}",
"function isCharacterALetter(character_start) {\n return /[a-zA-Z]/.test(character_start);\n}",
"function validateAlphabetic(value){\n if(value){ //if value isn't null\n if(/^[a-zA-Z\\s]+$/.test(value)){ //use regex to see if all the characters are between a to z or A to Z\n return {isValid: true, error: null, details: null};\n }\n return {isValid: false, error: 'Must be alphabetic', details: '\"'+value+'\" contains other characters than letters.'};\n }\n return {isValid: false, error:'Empty Field', details: 'Please fill out this field to resolve this issue.'};\n}",
"valid(c) { return Character.isAlphabetic(c) || c=='+'||c=='/' }",
"startsWith(c) { return this[c] !== undefined }",
"validateInput(char) {\n if ((new RegExp(`^${'[\\x00-\\x5F\\xC8-\\xCF]'}+$`)).test(char)) {\n return undefined;\n }\n else {\n return 'Supports only ASCII characters 00 to 95 (0–9, A–Z and control codes) and special characters.';\n }\n }",
"onlyletter(input) {\n let re = /^[A-Za-z]+$/\n let inputValue = input.value\n\n let errorMessage = `Este campo não aceita numeros nem caracteres especiais`\n\n if(!re.test(inputValue)) {\n this.printMessage(input, errorMessage)\n }\n }",
"function validateCharacters(val) {\n if (/^[a-zA-Z()]+$/.test(val) && val != \"\") {\n return true;\n } else {\n return false;\n }\n}",
"startsWith(c) { return this.white.test(c) }",
"function verifFirst() {\n let regexFirst = /^[a-zA-ZÀ-Ÿà-ÿ-\\s]+$/; //uniquement des lettres majuscules ou minuscules les tirets et les espaces\n if (regexFirst.exec(first.value) === null || first.length < 2) {\n errorAlert[0].style.display = \"block\";\n first.classList.add(\"echec\");\n first.classList.add(\"border\");\n\n setTimeout(() => {\n first.classList.remove(\"echec\");\n }, 500);\n return (validFirst = false);\n } else {\n first.classList.remove(\"border\");\n\n errorAlert[0].style.display = \"none\";\n tabValue.push(first.value);\n return (validFirst = true);\n }\n}",
"function validateSingleChar(str) {\r\n if (str.length === 0) {\r\n return false;\r\n }\r\n var firstChar = str.charCodeAt(0);\r\n if (str.length === 1) {\r\n return (firstChar === 0x9 || firstChar === 0xA || firstChar === 0xD\r\n || (firstChar >= 0x20 && firstChar <= 0xD7FF)\r\n || (firstChar >= 0xE000 && firstChar <= 0xFFFD));\r\n }\r\n if (str.length !== 2) {\r\n return false;\r\n }\r\n // UTF-16 surrogate characters\r\n var secondChar = str.charCodeAt(1);\r\n return ((firstChar >= 0xD800 && firstChar <= 0xDBFF)\r\n && (secondChar >= 0xDC00 && secondChar <= 0xDFFF));\r\n}",
"function testAccessNullInString()\n{\n return \"a\\u0000b\".codePointAt(0) === 97 && \"a\\u0000b\".codePointAt(1) === 0 && \"a\\u0000b\".codePointAt(2) === 98 && \"a\\u0000b\".codePointAt(3) === undefined;\n}",
"validateInput(char) {\n if ((new RegExp(`^${'[\\x20-\\x7F\\xC8-\\xCF]'}+$`)).test(char)) {\n return undefined;\n }\n else {\n return 'Supports only ASCII characters 32 to 127 (0–9, A–Z, a–z), and special characters.';\n }\n }",
"onlyletters(input) {\n\n let re = /^[A-Za-z]+$/\n\n let inputValue = input.value\n\n let errorMessage = `Esse campo não aceita número nem caracteres especiais`\n\n if(!re.test(inputValue)) {\n this.printMessage(input, errorMessage)\n }\n\n }",
"validateInput(char) {\n if (char.search(/^[0-9A-Z\\-\\.\\ \\$\\/\\+\\%]+$/) === -1) {\n return 'Supports A-Z, 0-9, and symbols ( - . $ / + % SPACE).';\n }\n else {\n return undefined;\n }\n }",
"onlyletters(input) {\n\n let re = /^[A-Za-z]+$/;\n\n let inputValue = input.value;\n\n let errorMessage = `Este campo não aceita números nem caracteres especiais`;\n\n if (!re.test(inputValue)) {\n this.printMessage(input, errorMessage);\n }\n\n }",
"function isFirst(str, ch) {\n return str.substr(0, ch.length) === ch;\n}",
"function lettersNumberNoSpace(parameter){ \n\tvar letters = /^[A-Za-z0-9]+$/.test(parameter);\n\tif(letters == true){ \n\t\treturn true; \n\t}else{ \n\t\treturn false; \n\t} \n}",
"function checkInvalidHeaderChar(val) {\n val += '';\n\n if (val.length < 1) {\n return false;\n }\n\n let c = val.charCodeAt(0);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n\n if (val.length < 2) {\n return false;\n }\n\n c = val.charCodeAt(1);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n\n if (val.length < 3) {\n return false;\n }\n\n c = val.charCodeAt(2);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n\n for (let i = 3; i < val.length; ++i) {\n c = val.charCodeAt(i);\n\n if (c <= 31 && c !== 9 || c > 255 || c === 127) {\n return true;\n }\n }\n\n return false;\n}",
"function first(input) {\n var firstChar = input.charAt(0);\n return firstChar;\n}",
"startsWith(c) { return c=='t' || c=='f' || c=='n' }",
"function alphanum_allowChar(validatedStringFragment, Char, settings) {\n\n\t\tif (settings.maxLength && validatedStringFragment.length >= settings.maxLength)\n\t\t\treturn false;\n\n\t\tif (settings.allow.indexOf(Char) >= 0)\n\t\t\treturn true;\n\n\t\tif (settings.allowSpace && (Char == \" \"))\n\t\t\treturn true;\n\n\t\tif (settings.blacklistSet.contains(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowNumeric && DIGITS[Char])\n\t\t\treturn false;\n\n\t\tif (!settings.allowUpper && isUpper(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowLower && isLower(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowCaseless && isCaseless(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowLatin && LATIN_CHARS.contains(Char))\n\t\t\treturn false;\n\n\t\tif (!settings.allowOtherCharSets) {\n\t\t\tif (DIGITS[Char] || LATIN_CHARS.contains(Char))\n\t\t\t\treturn true;\n\t\t\telse\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}",
"function checkName(){\n first.value = first.value.trim();\n var checkLetters = 0;\n var checkValues = 0;\n var final = false;\n\n\n for(var i=0;i<first.value.length;i++){\n //Acceptable values\n if(first.value[i]>='A' && first.value[i]<=\"Z\"){checkLetters++;}\n else if(first.value[i]>='a' && first.value[i]<=\"z\"){checkLetters++;}\n else if(first.value[i]==\"'\"){}\n else if(first.value[i]=='-'){}\n else{checkValues++;}\n\n }\n\n if(checkValues > 0){\n first.style.border = \"1px solid red\";\n first_error.innerHTML = \"X Acceptable values are A-Z a-z ' - \";\n first.focus();\n final = false;\n console.log(\"Acceptable values are A-Z a-z ' - \");\n }\n }",
"validateInput(char) {\n //if (char.search('/[a-zA-Z0-9]*/') === -1) {\n if (char.search(/^[0-9A-Za-z\\-\\.\\ \\@\\$\\/\\+\\%\\!\\@\\#\\$\\%\\&\\*\\^\\(\\)\\_\\+\\=\\<\\>\\?\\{\\}\\[\\]\\~\\-\\Ê]+$/) === -1) {\n return 'Supports only 128 characters of ASCII.';\n }\n else {\n return undefined;\n }\n }",
"function isFirstLetter(letter, string) {\n i=0\n if (string.charAt(i) === letter){\n console.log(true)}\n else (console.log (false))\n }",
"function hasOnlyLetters(fld){\n var rx = /^[a-zA-Z]+$/;\n if(!rx.test(fld.value))\n return false;\n\n return true;\n}",
"function IsSpecialTypeChar(ch, ref) {\n switch (ch) {\n case \":\":\n case \".\":\n case \"$\":\n case \"+\":\n case \"<\":\n case \">\":\n case \"-\":\n case \"[\":\n case \"]\":\n case \",\":\n case \"&\":\n case \"*\":\n ref.nextMustBeStartChar = true;\n return true;\n case \"`\":\n return true;\n }\n return false;\n }",
"function simpleChar(character) {\n return CHAR_TAB !== character &&\n CHAR_LINE_FEED !== character &&\n CHAR_CARRIAGE_RETURN !== character &&\n CHAR_COMMA !== character &&\n CHAR_LEFT_SQUARE_BRACKET !== character &&\n CHAR_RIGHT_SQUARE_BRACKET !== character &&\n CHAR_LEFT_CURLY_BRACKET !== character &&\n CHAR_RIGHT_CURLY_BRACKET !== character &&\n CHAR_SHARP !== character &&\n CHAR_AMPERSAND !== character &&\n CHAR_ASTERISK !== character &&\n CHAR_EXCLAMATION !== character &&\n CHAR_VERTICAL_LINE !== character &&\n CHAR_GREATER_THAN !== character &&\n CHAR_SINGLE_QUOTE !== character &&\n CHAR_DOUBLE_QUOTE !== character &&\n CHAR_PERCENT !== character &&\n CHAR_COLON !== character &&\n !ESCAPE_SEQUENCES[character] &&\n !needsHexEscape(character);\n}",
"startsWith(c) { return c==' ' || c=='\\r' || c=='\\t' || c=='\\n' }",
"get alphabetical() {\n return this.addValidator({\n message: (value, label) => `Expected ${label} to be alphabetical, got \\`${value}\\``,\n validator: value => /^[a-z]+$/gi.test(value)\n });\n }",
"function firstStrongChar(str){var match=REGEX_STRONG.exec(str);return match==null?null:match[0];}",
"function isFirstLetter(letter, string) {\n return (string.charAt(0) === letter);\n}",
"startsWith(c) { return c=='[' || c=='-' }",
"function textOnly(value, element)\n{\n $result= /^[a-zA-Z]+$/.test(value);\n return $result;\n}",
"function casing(value) {\n var head = exact(value.charAt(0))\n var rest = value.slice(1)\n\n if (!rest) {\n return head\n }\n\n rest = exact(rest)\n\n if (head === rest) {\n return head\n }\n\n if (head === 'u' && rest === 'l') {\n return 's'\n }\n\n return null\n}",
"validateInput(text) {\n let valueCheck = this.getValue(text);\n if (valueCheck) {\n return undefined;\n }\n else {\n return 'Supports 128 characters of ASCII.';\n }\n }",
"function validateSingleName(val){\n var keymash = /(([b-df-hj-np-tv-z])(?!\\2)){5}/;\n var v = trim(val);\n return (v != null && v.length >= 2 && !keymash.test(v))\n}",
"function isFullWidth(dataValue)\r\n{\r\n\r\n\tif (dataValue == \"\" ) {\r\n\t\treturn(\"\");\r\n\t}\r\n\t\r\n\tvar unicode_value = 0;\r\n\tvar fullwidth = true;\r\n\tvar charCode = 0;\r\n\tfor (var i = 0; i < dataValue.length; i++)\t{\r\n\t\tunicode_value = dataValue.charCodeAt(i);\r\n//\t\talert(\"Code is \" + unicode_value )\r\n\r\n\t\tif (! ((unicode_value >= 65296 && unicode_value <= 65370) || \r\n\t\t\t\t(unicode_value >= 12450 && unicode_value <= 12531) ||\r\n\t\t\t\t(unicode_value >= 12354 && unicode_value <= 12435) ))\t{\r\n//\t\t\talert(\"Improper Character \" + unicode_value + \">>\" + dataValue.charAt(i));\r\n\t\t\tfullwidth = false;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\treturn fullwidth;\t\r\n}",
"function simpleChar(character) {\n\t return CHAR_TAB !== character &&\n\t CHAR_LINE_FEED !== character &&\n\t CHAR_CARRIAGE_RETURN !== character &&\n\t CHAR_COMMA !== character &&\n\t CHAR_LEFT_SQUARE_BRACKET !== character &&\n\t CHAR_RIGHT_SQUARE_BRACKET !== character &&\n\t CHAR_LEFT_CURLY_BRACKET !== character &&\n\t CHAR_RIGHT_CURLY_BRACKET !== character &&\n\t CHAR_SHARP !== character &&\n\t CHAR_AMPERSAND !== character &&\n\t CHAR_ASTERISK !== character &&\n\t CHAR_EXCLAMATION !== character &&\n\t CHAR_VERTICAL_LINE !== character &&\n\t CHAR_GREATER_THAN !== character &&\n\t CHAR_SINGLE_QUOTE !== character &&\n\t CHAR_DOUBLE_QUOTE !== character &&\n\t CHAR_PERCENT !== character &&\n\t CHAR_COLON !== character &&\n\t !ESCAPE_SEQUENCES[character] &&\n\t !needsHexEscape(character);\n\t}",
"function check_allowed_char(input,type,config){\r\n\tvar filter = eval(config)[type].allowed;\r\n\t//console.log(filter.test(input))\r\n\treturn(!filter.test(input));\r\n}",
"function inValNS(e){\n var l = e.length;\n if(l == 0){ return true; }\n else{\n for(i = 0; i < l; i++){ if(e.charAt(i) == \" \"){ return true; break; } }\n return false;\n }\n}",
"function is(value) {\r\n var candidate = value;\r\n return Is.number(candidate.startLine) && Is.number(candidate.startLine)\r\n && (Is.undefined(candidate.startCharacter) || Is.number(candidate.startCharacter))\r\n && (Is.undefined(candidate.endCharacter) || Is.number(candidate.endCharacter))\r\n && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\r\n }"
] |
[
"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.6394975",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.6386781",
"0.62823236",
"0.62498075",
"0.6204897",
"0.6198276",
"0.6124527",
"0.6109912",
"0.6085631",
"0.6030844",
"0.59928274",
"0.5967779",
"0.5966608",
"0.596587",
"0.59518856",
"0.59436315",
"0.5925228",
"0.5887906",
"0.58779836",
"0.5863607",
"0.5853273",
"0.58400524",
"0.5817334",
"0.5815181",
"0.5799746",
"0.5795616",
"0.57948416",
"0.57743025",
"0.57667613",
"0.5754667",
"0.57533514",
"0.57506084",
"0.5746806",
"0.5744512",
"0.574154",
"0.5715232",
"0.5710054",
"0.57051384",
"0.57049876",
"0.5702324",
"0.5701956",
"0.5692475",
"0.56898254",
"0.5685134",
"0.5681233",
"0.5677756",
"0.5674053",
"0.5668092",
"0.56587017",
"0.5649585",
"0.56461823",
"0.5640739",
"0.5634683",
"0.56325614",
"0.5628988",
"0.5620167",
"0.5617615",
"0.5611193",
"0.56077987"
] |
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(ignoreComments = true) {\n var EOF, currentIndentation, ret;\n currentIndentation = this.getCurrentLineIndentation();\n EOF = !this.moveToNextLine();\n if (ignoreComments) {\n while (!EOF && this.isCurrentLineEmpty()) {\n EOF = !this.moveToNextLine();\n }\n } else {\n while (!EOF && this.isCurrentLineBlank()) {\n EOF = !this.moveToNextLine();\n }\n }\n if (EOF) {\n return false;\n }\n ret = false;\n if (this.getCurrentLineIndentation() > currentIndentation) {\n ret = true;\n }\n this.moveToPreviousLine();\n return ret;\n }",
"getCurrentLineIndentation() {\n return this.currentLine.length - Utils.ltrim(this.currentLine, ' ').length;\n }",
"function isStatementOrBlock() {\n if (this.parentPath.isLabeledStatement() || t.isBlockStatement(this.container)) {\n return false;\n } else {\n return _lodashCollectionIncludes2[\"default\"](t.STATEMENT_OR_BLOCK_KEYS, this.key);\n }\n}",
"continue() {\n let parent = this.node.parent;\n return parent ? indentFrom(parent, this.pos, this.base) : 0;\n }",
"startBlock()\n {\n this.indent++;\n }",
"function isStatementOrBlock() {\n\t if (this.parentPath.isLabeledStatement() || t.isBlockStatement(this.container)) {\n\t return false;\n\t } else {\n\t return _lodashCollectionIncludes2[\"default\"](t.STATEMENT_OR_BLOCK_KEYS, this.key);\n\t }\n\t}",
"function isStatementOrBlock() {\n\t if (this.parentPath.isLabeledStatement() || t.isBlockStatement(this.container)) {\n\t return false;\n\t } else {\n\t return _lodashCollectionIncludes2[\"default\"](t.STATEMENT_OR_BLOCK_KEYS, this.key);\n\t }\n\t}",
"function isStatementOrBlock() {\n\t if (this.parentPath.isLabeledStatement() || t.isBlockStatement(this.container)) {\n\t return false;\n\t } else {\n\t return _lodashCollectionIncludes2[\"default\"](t.STATEMENT_OR_BLOCK_KEYS, this.key);\n\t }\n\t}",
"function isStatementOrBlock() {\n\t if (this.parentPath.isLabeledStatement() || t.isBlockStatement(this.container)) {\n\t return false;\n\t } else {\n\t return _lodashCollectionIncludes2[\"default\"](t.STATEMENT_OR_BLOCK_KEYS, this.key);\n\t }\n\t}",
"function isStatementOrBlock() {\n\t if (this.parentPath.isLabeledStatement() || t.isBlockStatement(this.container)) {\n\t return false;\n\t } else {\n\t return _lodashCollectionIncludes2[\"default\"](t.STATEMENT_OR_BLOCK_KEYS, this.key);\n\t }\n\t}",
"function notBlockUseCaseMultilineBlock() { console.log('Not an block use case - Block - Multine');}",
"isNextLineUnIndentedCollection(currentIndentation = null) {\n var notEOF, ret;\n if (currentIndentation == null) {\n currentIndentation = this.getCurrentLineIndentation();\n }\n notEOF = this.moveToNextLine();\n while (notEOF && this.isCurrentLineEmpty()) {\n notEOF = this.moveToNextLine();\n }\n if (false === notEOF) {\n return false;\n }\n ret = false;\n if (this.getCurrentLineIndentation() === currentIndentation && this.isStringUnIndentedCollectionItem(this.currentLine)) {\n ret = true;\n }\n this.moveToPreviousLine();\n return ret;\n }",
"function syntaxIndentation(cx, ast, pos) {\n return indentFrom(ast.resolveInner(pos).enterUnfinishedNodesBefore(pos), pos, cx);\n}",
"function indention() {\n return parser(function (ps) {\n var snapshot = ps.snapshot();\n\n if (ps.indent === 0) {\n return ps.succeed(0);\n }\n\n var satisy = function (ch, pos) {\n return pos < ps.indent && ch === 0x09;\n };\n var tabs = ps.skipAdvance(satisy);\n\n if (tabs !== ps.indent) {\n ps.restore(snapshot);\n return ps.fail();\n }\n\n return ps.succeed(tabs);\n });\n }",
"function testIfElseIndentationNoBraces(v)\n{\n /**\n * comment\n */\n if (v.isNull() == true) return fun(v);\n\n if (v.isNull() == true)\n return false;\n\n if (v.isNull() == true)\n return false;\n else\n {\n if (v.endsWith(\"(\"))\n return false;\n else if (v.endsWith(\")\"))\n return true;\n else if (v.endsWith(\"\\\"\"))\n return true;\n else if (v.endsWith(\"\\\\\"))\n return true;\n else if (v.endsWith('('))\n return false;\n else if (v.endsWith(')'))\n return true;\n else if (v.endsWith('\\''))\n return true;\n else if (v.endsWith('\\\\'))\n return true;\n else\n return false;\n\n if (v.endsWith(\"baz\"))\n return false;\n return true;\n }\n}",
"function findIndentation(input)\n{\n\tvar count = 0;\n\n\tif (input.length === 0)\n\t{\n\t\treturn 0;\n\t}\n\n\treturn input.split(/[^ \\t\\r\\n]/)[0].length; //**returns the number of tabs as well as the number of spaces!!!\n}",
"function incrementsIndent(token) {\n return token.type.label == \"{\"\n || token.isArrayLiteral\n || token.type.keyword == \"switch\";\n }",
"_hasSpacing() {\n if (this.accordion) {\n return this.expanded && this.accordion.displayMode === 'default';\n }\n return false;\n }",
"blockIndent() {\n var rows = this.$getSelectedRows();\n this.session.indentRows(rows.first, rows.last, \"\\t\");\n }",
"isBlock() {\n const parentNode = this.parentNode\n return (parentNode && parentNode.isContainer())\n }",
"function code(state, startLine, endLine/*, silent*/) {\n\t var nextLine, last;\n\n\t if (state.tShift[startLine] - state.blkIndent < 4) { return false; }\n\n\t last = nextLine = startLine + 1;\n\n\t while (nextLine < endLine) {\n\t if (state.isEmpty(nextLine)) {\n\t nextLine++;\n\t continue;\n\t }\n\t if (state.tShift[nextLine] - state.blkIndent >= 4) {\n\t nextLine++;\n\t last = nextLine;\n\t continue;\n\t }\n\t break;\n\t }\n\n\t state.line = nextLine;\n\t state.tokens.push({\n\t type: 'code',\n\t content: state.getLines(startLine, last, 4 + state.blkIndent, true),\n\t block: true,\n\t lines: [ startLine, state.line ],\n\t level: state.level\n\t });\n\n\t return true;\n\t}",
"function code(state, startLine, endLine/*, silent*/) {\n var nextLine, last;\n\n if (state.tShift[startLine] - state.blkIndent < 4) { return false; }\n\n last = nextLine = startLine + 1;\n\n while (nextLine < endLine) {\n if (state.isEmpty(nextLine)) {\n nextLine++;\n continue;\n }\n if (state.tShift[nextLine] - state.blkIndent >= 4) {\n nextLine++;\n last = nextLine;\n continue;\n }\n break;\n }\n\n state.line = nextLine;\n state.tokens.push({\n type: 'code',\n content: state.getLines(startLine, last, 4 + state.blkIndent, true),\n block: true,\n lines: [ startLine, state.line ],\n level: state.level\n });\n\n return true;\n}",
"baseIndentFor(node) {\n let line = this.state.doc.lineAt(node.from);\n // Skip line starts that are covered by a sibling (or cousin, etc)\n for (;;) {\n let atBreak = node.resolve(line.from);\n while (atBreak.parent && atBreak.parent.from == atBreak.from)\n atBreak = atBreak.parent;\n if (isParent(atBreak, node))\n break;\n line = this.state.doc.lineAt(atBreak.from);\n }\n return this.lineIndent(line.from);\n }",
"function hasSign( block ){\n if (block && block.state && block.state.setLine)\n return block.state;\n return false;\n}",
"function redundantBlock(statement) {\n if (statement === true) {\n return true;\n } else {\n return false;\n }\n }",
"function blockHeader$1(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator$1(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n\t var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n\t // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n\t var clip = string[string.length - 1] === '\\n';\n\t var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n\t var chomp = keep ? '+' : (clip ? '' : '-');\n\n\t return indentIndicator + chomp + '\\n';\n\t}",
"function blockHeader(string, indentPerLevel) {\n\t var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n\t // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n\t var clip = string[string.length - 1] === '\\n';\n\t var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n\t var chomp = keep ? '+' : (clip ? '' : '-');\n\n\t return indentIndicator + chomp + '\\n';\n\t}",
"function blockHeader(string, indentPerLevel) {\n\t var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n\t // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n\t var clip = string[string.length - 1] === '\\n';\n\t var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n\t var chomp = keep ? '+' : (clip ? '' : '-');\n\n\t return indentIndicator + chomp + '\\n';\n\t}",
"function shouldSkipCurrentInstruction(state) {\n if (state.ifElseStack.length) {\n var ifElseState = state.ifElseStack[state.ifElseStack.length - 1];\n return !(ifElseState & IfElseStateFlags.ExecutingBlock)\n && !isConditionalDirective(state.line);\n }\n return false;\n}",
"function decrementsIndent(tokenType, stack) {\n return (tokenType == \"}\" && stack[stack.length - 1] != \"${\")\n || (tokenType == \"]\" && stack[stack.length - 1] == \"[\\n\");\n }",
"isStringUnIndentedCollectionItem() {\n return this.currentLine === '-' || this.currentLine.slice(0, 2) === '- ';\n }",
"function anyIndention() {\n return skipSatisfyMany(satisyTab);\n }",
"isBalanced() {\n return this.findMinHeight() >= this.findMinHeight() - 1;\n }",
"function indentLevel(linea) {\n var level = 0;\n for ( i in linea ) {\n if ( linea[i] != ' ' ) { break;}\n level += 1;\n }\n return (level);\n}",
"function getIndent (line) {\n return line.match(/^\\s*/)[0].length\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function tryComputeIndentationForListItem(startPos, endPos, parentStartLine, range, inheritedIndentation) {\n if (ts.rangeOverlapsWithStartEnd(range, startPos, endPos) ||\n ts.rangeContainsStartEnd(range, startPos, endPos) /* Not to miss zero-range nodes e.g. JsxText */) {\n if (inheritedIndentation !== -1 /* Unknown */) {\n return inheritedIndentation;\n }\n }\n else {\n var startLine = sourceFile.getLineAndCharacterOfPosition(startPos).line;\n var startLinePosition = ts.getLineStartPositionForPosition(startPos, sourceFile);\n var column = formatting.SmartIndenter.findFirstNonWhitespaceColumn(startLinePosition, startPos, sourceFile, options);\n if (startLine !== parentStartLine || startPos === column) {\n // Use the base indent size if it is greater than\n // the indentation of the inherited predecessor.\n var baseIndentSize = formatting.SmartIndenter.getBaseIndentation(options);\n return baseIndentSize > column ? baseIndentSize : column;\n }\n }\n return -1 /* Unknown */;\n }",
"get firstLineIndent() {\n return this.firstLineIndentIn;\n }",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function getActualIndentationForNode(current, parent, currentLineAndChar, parentAndChildShareLine, sourceFile, options) {\n // actual indentation is used for statements\\declarations if one of cases below is true:\n // - parent is SourceFile - by default immediate children of SourceFile are not indented except when user indents them manually\n // - parent and child are not on the same line\n var useActualIndentation = (ts.isDeclaration(current) || ts.isStatement(current)) &&\n (parent.kind === 256 /* SourceFile */ || !parentAndChildShareLine);\n if (!useActualIndentation) {\n return -1 /* Unknown */;\n }\n return findColumnForFirstNonWhitespaceCharacterInLine(currentLineAndChar, sourceFile, options);\n }",
"indentation(origin) {\r\n\t\t\t\t\tvar indent, outdent;\r\n\t\t\t\t\tindent = ['INDENT', 2];\r\n\t\t\t\t\toutdent = ['OUTDENT', 2];\r\n\t\t\t\t\tif (origin) {\r\n\t\t\t\t\t\tindent.generated = outdent.generated = true;\r\n\t\t\t\t\t\tindent.origin = outdent.origin = origin;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tindent.explicit = outdent.explicit = true;\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn [indent, outdent];\r\n\t\t\t\t}",
"function isCodeBlock(s) {\n s = s.trim();\n return s[s.length - 1] == ':';\n}",
"lineToken({chunk = this.chunk, offset = 0} = {}) {\r\n\t\t\t\tvar backslash, diff, endsContinuationLineIndentation, indent, match, minLiteralLength, newIndentLiteral, noNewlines, prev, ref, size;\r\n\t\t\t\tif (!(match = MULTI_DENT.exec(chunk))) {\r\n\t\t\t\t\treturn 0;\r\n\t\t\t\t}\r\n\t\t\t\tindent = match[0];\r\n\t\t\t\tprev = this.prev();\r\n\t\t\t\tbackslash = (prev != null ? prev[0] : void 0) === '\\\\';\r\n\t\t\t\tif (!((backslash || ((ref = this.seenFor) != null ? ref.endsLength : void 0) < this.ends.length) && this.seenFor)) {\r\n\t\t\t\t\tthis.seenFor = false;\r\n\t\t\t\t}\r\n\t\t\t\tif (!((backslash && this.seenImport) || this.importSpecifierList)) {\r\n\t\t\t\t\tthis.seenImport = false;\r\n\t\t\t\t}\r\n\t\t\t\tif (!((backslash && this.seenExport) || this.exportSpecifierList)) {\r\n\t\t\t\t\tthis.seenExport = false;\r\n\t\t\t\t}\r\n\t\t\t\tsize = indent.length - 1 - indent.lastIndexOf('\\n');\r\n\t\t\t\tnoNewlines = this.unfinished();\r\n\t\t\t\tnewIndentLiteral = size > 0 ? indent.slice(-size) : '';\r\n\t\t\t\tif (!/^(.?)\\1*$/.exec(newIndentLiteral)) {\r\n\t\t\t\t\tthis.error('mixed indentation', {\r\n\t\t\t\t\t\toffset: indent.length\r\n\t\t\t\t\t});\r\n\t\t\t\t\treturn indent.length;\r\n\t\t\t\t}\r\n\t\t\t\tminLiteralLength = Math.min(newIndentLiteral.length, this.indentLiteral.length);\r\n\t\t\t\tif (newIndentLiteral.slice(0, minLiteralLength) !== this.indentLiteral.slice(0, minLiteralLength)) {\r\n\t\t\t\t\tthis.error('indentation mismatch', {\r\n\t\t\t\t\t\toffset: indent.length\r\n\t\t\t\t\t});\r\n\t\t\t\t\treturn indent.length;\r\n\t\t\t\t}\r\n\t\t\t\tif (size - this.continuationLineAdditionalIndent === this.indent) {\r\n\t\t\t\t\tif (noNewlines) {\r\n\t\t\t\t\t\tthis.suppressNewlines();\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tthis.newlineToken(offset);\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn indent.length;\r\n\t\t\t\t}\r\n\t\t\t\tif (size > this.indent) {\r\n\t\t\t\t\tif (noNewlines) {\r\n\t\t\t\t\t\tif (!backslash) {\r\n\t\t\t\t\t\t\tthis.continuationLineAdditionalIndent = size - this.indent;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (this.continuationLineAdditionalIndent) {\r\n\t\t\t\t\t\t\tprev.continuationLineIndent = this.indent + this.continuationLineAdditionalIndent;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tthis.suppressNewlines();\r\n\t\t\t\t\t\treturn indent.length;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (!this.tokens.length) {\r\n\t\t\t\t\t\tthis.baseIndent = this.indent = size;\r\n\t\t\t\t\t\tthis.indentLiteral = newIndentLiteral;\r\n\t\t\t\t\t\treturn indent.length;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tdiff = size - this.indent + this.outdebt;\r\n\t\t\t\t\tthis.token('INDENT', diff, {\r\n\t\t\t\t\t\toffset: offset + indent.length - size,\r\n\t\t\t\t\t\tlength: size\r\n\t\t\t\t\t});\r\n\t\t\t\t\tthis.indents.push(diff);\r\n\t\t\t\t\tthis.ends.push({\r\n\t\t\t\t\t\ttag: 'OUTDENT'\r\n\t\t\t\t\t});\r\n\t\t\t\t\tthis.outdebt = this.continuationLineAdditionalIndent = 0;\r\n\t\t\t\t\tthis.indent = size;\r\n\t\t\t\t\tthis.indentLiteral = newIndentLiteral;\r\n\t\t\t\t} else if (size < this.baseIndent) {\r\n\t\t\t\t\tthis.error('missing indentation', {\r\n\t\t\t\t\t\toffset: offset + indent.length\r\n\t\t\t\t\t});\r\n\t\t\t\t} else {\r\n\t\t\t\t\tendsContinuationLineIndentation = this.continuationLineAdditionalIndent > 0;\r\n\t\t\t\t\tthis.continuationLineAdditionalIndent = 0;\r\n\t\t\t\t\tthis.outdentToken({\r\n\t\t\t\t\t\tmoveOut: this.indent - size,\r\n\t\t\t\t\t\tnoNewlines,\r\n\t\t\t\t\t\toutdentLength: indent.length,\r\n\t\t\t\t\t\toffset,\r\n\t\t\t\t\t\tindentSize: size,\r\n\t\t\t\t\t\tendsContinuationLineIndentation\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t\treturn indent.length;\r\n\t\t\t}",
"function canStartMarkup(type) {\n\t\treturn (\n\t\t\t(!code[i-2] || char_in(code[i-2], \" \\t\\n({'\\\"\")) && //prev char is one of these (or start of text)\n\t\t\t!char_in(c, \" \\t\\n,'\\\"\") && //next char is not one of these\n\t\t\t!stackContains(type)\n\t\t);\n\t}",
"function is_node_block(node) {\n if (node.nodeType != 1)\n return false;\n return (Pattern.NodeName.line.test(node.nodeName) ||\n Pattern.NodeName.li.test(node.nodeName) ||\n Pattern.NodeName.pre.test(node.nodeName));\n }",
"function isCodeBlockDesc(overallSpec) {\n let spacesBefore = overallSpec.indexOf(\" \");\n // PLUS TWO TO INCLUDE THE SPACE AFTER COLON\n // LIMITS TO ONLY ONE, CURRENT POSSIBLE CODE BLOCK\n let limited = overallSpec.substring(overallSpec.indexOf(\"\\n\"), overallSpec.indexOf(\"\\n\") + 9);\n //let firstCheck = limited.indexOf(\"\\n\\n\") === 0;\n let followingBlock = limited.indexOf(\"\\n\\n ```\");\n return spacesBefore === 0 && followingBlock === 0;\n }",
"function ensureBlock() {\n\t return t.ensureBlock(this.node);\n\t}",
"function ensureBlock() {\n\t return t.ensureBlock(this.node);\n\t}",
"function isBlock() {\n return !rElem && rBlock;\n}",
"function indentIfOnDifferentLines(parent, node1, node2, valueToWriteWhenNotIndenting) {\n var realNodesAreOnDifferentLines = !ts.nodeIsSynthesized(parent) && !nodeEndIsOnSameLineAsNodeStart(node1, node2);\n // Always use a newline for synthesized code if the synthesizer desires it.\n var synthesizedNodeIsOnDifferentLine = synthesizedNodeStartsOnNewLine(node2);\n if (realNodesAreOnDifferentLines || synthesizedNodeIsOnDifferentLine) {\n increaseIndent();\n writeLine();\n return true;\n }\n else {\n if (valueToWriteWhenNotIndenting) {\n write(valueToWriteWhenNotIndenting);\n }\n return false;\n }\n }",
"separatorBefore() {\n\t\tif (this.separator === Separator.BEFORE) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}",
"indent() {\n var session = this.session;\n var range = this.getSelectionRange();\n\n if (range.start.row < range.end.row) {\n var rows = this.$getSelectedRows();\n session.indentRows(rows.first, rows.last, \"\\t\");\n return;\n } else if (range.start.column < range.end.column) {\n var text = session.getTextRange(range);\n if (!/^\\s+$/.test(text)) {\n var rows = this.$getSelectedRows();\n session.indentRows(rows.first, rows.last, \"\\t\");\n return;\n }\n }\n \n var line = session.getLine(range.start.row);\n var position = range.start;\n var size = session.getTabSize();\n var column = session.documentToScreenColumn(position.row, position.column);\n\n if (this.session.getUseSoftTabs()) {\n var count = (size - column % size);\n var indentString = lang.stringRepeat(\" \", count);\n } else {\n var count = column % size;\n while (line[range.start.column - 1] == \" \" && count) {\n range.start.column--;\n count--;\n }\n this.selection.setSelectionRange(range);\n indentString = \"\\t\";\n }\n return this.insert(indentString);\n }",
"layoutHorizontalAlign () {\n return false;\n //return this.content.layout &&\n // this.content.layout.alignment == createjs_ui.LayoutAlignment.HORIZONTAL_ALIGNMENT\n }"
] |
[
"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.5242257",
"0.52146095",
"0.519276",
"0.51711005",
"0.5168823",
"0.5163232",
"0.51383984",
"0.50795114",
"0.50795114",
"0.50795114",
"0.5077526",
"0.5066606",
"0.50550205",
"0.5043564",
"0.50287426",
"0.50235873",
"0.5022314",
"0.50089455",
"0.49970028",
"0.4974322",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.4963249",
"0.49570867",
"0.49472794",
"0.4910038",
"0.49066967",
"0.48892996",
"0.48892057",
"0.48589078",
"0.4850738",
"0.4850738",
"0.48495558",
"0.48490244",
"0.4834227",
"0.48096213",
"0.47885"
] |
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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth, testAmbiguousType) {\n var i;\n var char;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (string[0] === ' ' && indentPerLevel > 9) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth, testAmbiguousType) {\n\t var i;\n\t var char;\n\t var hasLineBreak = false;\n\t var hasFoldableLine = false; // only checked if shouldTrackWidth\n\t var shouldTrackWidth = lineWidth !== -1;\n\t var previousLineBreak = -1; // count the first line correctly\n\t var plain = isPlainSafeFirst(string.charCodeAt(0))\n\t && !isWhitespace(string.charCodeAt(string.length - 1));\n\n\t if (singleLineOnly) {\n\t // Case: no block styles.\n\t // Check for disallowed characters to rule out plain and single.\n\t for (i = 0; i < string.length; i++) {\n\t char = string.charCodeAt(i);\n\t if (!isPrintable(char)) {\n\t return STYLE_DOUBLE;\n\t }\n\t plain = plain && isPlainSafe(char);\n\t }\n\t } else {\n\t // Case: block styles permitted.\n\t for (i = 0; i < string.length; i++) {\n\t char = string.charCodeAt(i);\n\t if (char === CHAR_LINE_FEED) {\n\t hasLineBreak = true;\n\t // Check if any line can be folded.\n\t if (shouldTrackWidth) {\n\t hasFoldableLine = hasFoldableLine ||\n\t // Foldable line = too long, and not more-indented.\n\t (i - previousLineBreak - 1 > lineWidth &&\n\t string[previousLineBreak + 1] !== ' ');\n\t previousLineBreak = i;\n\t }\n\t } else if (!isPrintable(char)) {\n\t return STYLE_DOUBLE;\n\t }\n\t plain = plain && isPlainSafe(char);\n\t }\n\t // in case the end is missing a \\n\n\t hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n\t (i - previousLineBreak - 1 > lineWidth &&\n\t string[previousLineBreak + 1] !== ' '));\n\t }\n\t // Although every style can represent \\n without escaping, prefer block styles\n\t // for multiline, since they're more readable and they don't add empty lines.\n\t // Also prefer folding a super-long line.\n\t if (!hasLineBreak && !hasFoldableLine) {\n\t // Strings interpretable as another type have to be quoted;\n\t // e.g. the string 'true' vs. the boolean true.\n\t return plain && !testAmbiguousType(string)\n\t ? STYLE_PLAIN : STYLE_SINGLE;\n\t }\n\t // Edge case: block indentation indicator can only have one digit.\n\t if (string[0] === ' ' && indentPerLevel > 9) {\n\t return STYLE_DOUBLE;\n\t }\n\t // At this point we know block styles are valid.\n\t // Prefer literal style unless we want to fold.\n\t return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n\t}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth, testAmbiguousType) {\n\t var i;\n\t var char;\n\t var hasLineBreak = false;\n\t var hasFoldableLine = false; // only checked if shouldTrackWidth\n\t var shouldTrackWidth = lineWidth !== -1;\n\t var previousLineBreak = -1; // count the first line correctly\n\t var plain = isPlainSafeFirst(string.charCodeAt(0))\n\t && !isWhitespace(string.charCodeAt(string.length - 1));\n\n\t if (singleLineOnly) {\n\t // Case: no block styles.\n\t // Check for disallowed characters to rule out plain and single.\n\t for (i = 0; i < string.length; i++) {\n\t char = string.charCodeAt(i);\n\t if (!isPrintable(char)) {\n\t return STYLE_DOUBLE;\n\t }\n\t plain = plain && isPlainSafe(char);\n\t }\n\t } else {\n\t // Case: block styles permitted.\n\t for (i = 0; i < string.length; i++) {\n\t char = string.charCodeAt(i);\n\t if (char === CHAR_LINE_FEED) {\n\t hasLineBreak = true;\n\t // Check if any line can be folded.\n\t if (shouldTrackWidth) {\n\t hasFoldableLine = hasFoldableLine ||\n\t // Foldable line = too long, and not more-indented.\n\t (i - previousLineBreak - 1 > lineWidth &&\n\t string[previousLineBreak + 1] !== ' ');\n\t previousLineBreak = i;\n\t }\n\t } else if (!isPrintable(char)) {\n\t return STYLE_DOUBLE;\n\t }\n\t plain = plain && isPlainSafe(char);\n\t }\n\t // in case the end is missing a \\n\n\t hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n\t (i - previousLineBreak - 1 > lineWidth &&\n\t string[previousLineBreak + 1] !== ' '));\n\t }\n\t // Although every style can represent \\n without escaping, prefer block styles\n\t // for multiline, since they're more readable and they don't add empty lines.\n\t // Also prefer folding a super-long line.\n\t if (!hasLineBreak && !hasFoldableLine) {\n\t // Strings interpretable as another type have to be quoted;\n\t // e.g. the string 'true' vs. the boolean true.\n\t return plain && !testAmbiguousType(string)\n\t ? STYLE_PLAIN : STYLE_SINGLE;\n\t }\n\t // Edge case: block indentation indicator can only have one digit.\n\t if (string[0] === ' ' && indentPerLevel > 9) {\n\t return STYLE_DOUBLE;\n\t }\n\t // At this point we know block styles are valid.\n\t // Prefer literal style unless we want to fold.\n\t return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n\t}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth, testAmbiguousType) {\n\t var i;\n\t var char;\n\t var hasLineBreak = false;\n\t var hasFoldableLine = false; // only checked if shouldTrackWidth\n\t var shouldTrackWidth = lineWidth !== -1;\n\t var previousLineBreak = -1; // count the first line correctly\n\t var plain = isPlainSafeFirst(string.charCodeAt(0))\n\t && !isWhitespace(string.charCodeAt(string.length - 1));\n\n\t if (singleLineOnly) {\n\t // Case: no block styles.\n\t // Check for disallowed characters to rule out plain and single.\n\t for (i = 0; i < string.length; i++) {\n\t char = string.charCodeAt(i);\n\t if (!isPrintable(char)) {\n\t return STYLE_DOUBLE;\n\t }\n\t plain = plain && isPlainSafe(char);\n\t }\n\t } else {\n\t // Case: block styles permitted.\n\t for (i = 0; i < string.length; i++) {\n\t char = string.charCodeAt(i);\n\t if (char === CHAR_LINE_FEED) {\n\t hasLineBreak = true;\n\t // Check if any line can be folded.\n\t if (shouldTrackWidth) {\n\t hasFoldableLine = hasFoldableLine ||\n\t // Foldable line = too long, and not more-indented.\n\t (i - previousLineBreak - 1 > lineWidth &&\n\t string[previousLineBreak + 1] !== ' ');\n\t previousLineBreak = i;\n\t }\n\t } else if (!isPrintable(char)) {\n\t return STYLE_DOUBLE;\n\t }\n\t plain = plain && isPlainSafe(char);\n\t }\n\t // in case the end is missing a \\n\n\t hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n\t (i - previousLineBreak - 1 > lineWidth &&\n\t string[previousLineBreak + 1] !== ' '));\n\t }\n\t // Although every style can represent \\n without escaping, prefer block styles\n\t // for multiline, since they're more readable and they don't add empty lines.\n\t // Also prefer folding a super-long line.\n\t if (!hasLineBreak && !hasFoldableLine) {\n\t // Strings interpretable as another type have to be quoted;\n\t // e.g. the string 'true' vs. the boolean true.\n\t return plain && !testAmbiguousType(string)\n\t ? STYLE_PLAIN : STYLE_SINGLE;\n\t }\n\t // Edge case: block indentation indicator can only have one digit.\n\t if (string[0] === ' ' && indentPerLevel > 9) {\n\t return STYLE_DOUBLE;\n\t }\n\t // At this point we know block styles are valid.\n\t // Prefer literal style unless we want to fold.\n\t return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n\t}",
"function chooseScalarStyle$1(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 the first line correctly\n var plain = isPlainSafeFirst$1(string.charCodeAt(0))\n && !isWhitespace$1(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable$1(char)) {\n return STYLE_DOUBLE$1;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe$1(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED$1) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable$1(char)) {\n return STYLE_DOUBLE$1;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe$1(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN$1 : STYLE_SINGLE$1;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator$1(string)) {\n return STYLE_DOUBLE$1;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED$1 : STYLE_LITERAL$1;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function stylize(str, style) {\n \n // define the styles\n var styles = {\n //styles\n 'bold' : [1, 22], 'italic' : [3, 23],\n 'underline' : [4, 24], 'inverse' : [7, 27],\n //grayscales\n 'white' : [37, 39], 'grey' : [90, 39],\n 'black' : [90, 39],\n //colors\n 'blue' : [34, 39], 'cyan' : [36, 39],\n 'green' : [32, 39], 'magenta' : [35, 39],\n 'red' : [31, 39], 'yellow' : [33, 39]\n };\n return '\\033[' + styles[style][0] + 'm' + str + '\\033[' + styles[style][1] + 'm';\n}",
"function computeStyle(str) {\n return computeRTEPluginStyle(str);\n }",
"function stylizeWithColor (str, styleType) {\n\t const style = util.inspect.styles[styleType];\n\t if (style !== undefined) {\n\t const color = util.inspect.colors[style];\n\t return `\\u001b[${color[0]}m${str}\\u001b[${color[1]}m`\n\t }\n\t return str\n\t}",
"function processStyleSheet(styleString){\r\n\t\tstyleString = styleString.replace('only screen and (max-width: 0px)', 'only screen and (max-width:' + sliderLeft + 'px)')\r\n\t\tvar styleToAdd = ''\r\n\t\tfor (h=0; h<headers.length; h++){\r\n\t\t\tvar styleIndex = h+1\r\n\t\t\tvar newStyleString = '\\t' + 'td:nth-of-type(' + styleIndex + '):before { content: \"' + headers[h] +'\"; }'\r\n\t\t\tstyleToAdd = styleToAdd + '\\n' + newStyleString\r\n\t\t}\r\n\t\tstyleString = styleString.replace('/*Insert data labels here*/', styleToAdd)\r\n\t\treturn styleString\r\n\t}",
"function returnStyle(val) {\n\t\tif (val < 0.3) {\n\t\t\treturn 'blank';\n\t\t} else if (val < 0.6) {\n\t\t\treturn 'grid';\n\t\t} else {\n\t\t\treturn 'sliced';\n\t\t}\n\t}",
"function tokenize(str, maxWidth) {\n\t var result = [];\n\t /* first tokenization pass - split texts and color formatting commands */\n\n\t var offset = 0;\n\t str.replace(RE_COLORS, function (match, type, name, index) {\n\t /* string before */\n\t var part = str.substring(offset, index);\n\n\t if (part.length) {\n\t result.push({\n\t type: TYPE_TEXT,\n\t value: part\n\t });\n\t }\n\t /* color command */\n\n\n\t result.push({\n\t type: type == \"c\" ? TYPE_FG : TYPE_BG,\n\t value: name.trim()\n\t });\n\t offset = index + match.length;\n\t return \"\";\n\t });\n\t /* last remaining part */\n\n\t var part = str.substring(offset);\n\n\t if (part.length) {\n\t result.push({\n\t type: TYPE_TEXT,\n\t value: part\n\t });\n\t }\n\n\t return breakLines(result, maxWidth);\n\t }",
"function colorize(str, style) {\n return colorizeStart(style) + str + colorizeEnd(style);\n}",
"function colorize (str, style) {\n return colorizeStart(style) + str + colorizeEnd(style);\n}",
"function measure(str, maxWidth) {\n\t var result = {\n\t width: 0,\n\t height: 1\n\t };\n\t var tokens = tokenize(str, maxWidth);\n\t var lineWidth = 0;\n\n\t for (var i = 0; i < tokens.length; i++) {\n\t var token = tokens[i];\n\n\t switch (token.type) {\n\t case TYPE_TEXT:\n\t lineWidth += token.value.length;\n\t break;\n\n\t case TYPE_NEWLINE:\n\t result.height++;\n\t result.width = Math.max(result.width, lineWidth);\n\t lineWidth = 0;\n\t break;\n\t }\n\t }\n\n\t result.width = Math.max(result.width, lineWidth);\n\t return result;\n\t }",
"function normalizeStyle(styleStr) {\n var serialized = (0,stylis__WEBPACK_IMPORTED_MODULE_8__.serialize)((0,stylis__WEBPACK_IMPORTED_MODULE_9__.compile)(styleStr), stylis__WEBPACK_IMPORTED_MODULE_8__.stringify);\n return serialized.replace(/\\{%%%\\:[^;];}/g, ';');\n}",
"getLineWidth() {\n return this.props.lineWidth || '50px';\n }",
"static wrap(str, targetWidth, opts={}) {\n\t\tconst words = str.split(' ')\n\t\tconst lines = []\n\t\tconst lineHeight = 1.1\n\n\t\tlet line = []\n\t\tlet lineBounds = Bounds.empty()\n\t\t_.each(words, (word, i) => {\n\t\t\tlet nextLine = line.concat([word])\n\t\t\tlet nextBounds = Bounds.forText(nextLine.join(' '), opts)\n\n\t\t\tif (nextBounds.width > targetWidth && line.length >= 1) {\n\t\t\t\tlines.push({ str: line.join(' '), width: lineBounds.width, height: lineBounds.height })\n\t\t\t\tline = [word]\n\t\t\t\tlineBounds = Bounds.forText(word, opts)\n\t\t\t} else {\n\t\t\t\tline = nextLine\n\t\t\t\tlineBounds = nextBounds\n\t\t\t}\n\t\t})\n\t\tif (line.length > 0)\n\t\t\tlines.push({ str: line.join(' '), width: lineBounds.width, height: lineBounds.height })\n\n\t\tlet height = 0\n\t\tlet width = 0\n\t\t_.each(lines, (line) => {\n\t\t\theight += line.height\n\t\t\twidth = Math.max(width, line.width)\n\t\t})\n\n\t\treturn {\n\t\t\tlines: lines,\n\t\t\tlineHeight: lineHeight,\n\t\t\twidth: width,\n\t\t\theight: height\n\t\t}\n\t}",
"stringWidth(_string, _length, _elemId, _customStyle) {\n return this.stringSize(_string, _length, _elemId, false, _customStyle)[0];\n }",
"drawSplitLine(lineI, commentStart, selectStart, selectEnd){\n let strParts = []; // List of lists of string indexes and colors\n\n if(Math.max(commentStart, selectStart) > 0)\n strParts.push([0, DIM_WHITE]);\n if(commentStart !== -1 && selectStart === -1){\n strParts.push([commentStart, COMMENT_GRAY]);\n }else if(commentStart === -1 && selectStart !== -1){\n strParts.push([selectStart, WHITE]);\n if(selectEnd < this.lines.strLen(lineI))\n strParts.push([selectEnd, DIM_WHITE]);\n }else{\n if(commentStart <= selectStart){\n if(commentStart < selectStart)\n strParts.push([commentStart, COMMENT_GRAY]);\n strParts.push([selectStart, DIM_WHITE]);\n if(selectEnd < this.lines.strLen(lineI))\n strParts.push([selectEnd, COMMENT_GRAY]);\n }else if(selectStart < commentStart && commentStart < selectEnd){\n strParts.push([selectStart, WHITE]);\n strParts.push([commentStart, DIM_WHITE]);\n if(selectEnd < this.lines.strLen(lineI))\n strParts.push([selectEnd, COMMENT_GRAY]);\n }else if(commentStart >= selectEnd){\n strParts.push([selectStart, WHITE]);\n if(commentStart > selectEnd)\n strParts.push([selectEnd, DIM_WHITE]);\n strParts.push([commentStart, COMMENT_GRAY]);\n }\n }\n\n strParts.push([this.lines.strLen(lineI), null]);\n for(let i=0; i<strParts.length-1; i++){\n ctx.fillStyle = strParts[i][1];\n ctx.fillText(\n this.lines.strGet(lineI).substring(\n strParts[i][0], strParts[i+1][0]),\n this.x+CHAR_GAP + CHAR_WIDTH*strParts[i][0],\n this.y+CHAR_GAP + (lineI+1)*LINE_HEIGHT + this.offsetY\n );\n }\n }",
"function LineStyle() {\n\tthis.thickness=1.5;\n\tthis.endCap = 'round';\n\tthis.setThickness = function(thickness) {\n\t\tthis.thickness = thickness;\n\t\treturn this;\n\t};\n\tthis.setEndCap = function(endCap) {\n\t\tthis.endCap = endCap;\n\t\treturn this;\n\t};\n}",
"stringSize(_string, _length, _elemId, _wrap, _customStyle) {\n if (!_customStyle) {\n _customStyle = {};\n }\n if (this.isString(_customStyle)) {\n console.warn('HView#stringSize: use style objects instead of css text!');\n _customStyle = {};\n }\n if (_length || _length === 0) {\n _string = _string.substring(0, _length);\n }\n if (!_elemId && _elemId !== 0) {\n _elemId = this.elemId || 0;\n }\n _customStyle.visibility = 'hidden';\n if (!_wrap) {\n _customStyle.whiteSpace = 'nowrap';\n }\n this._stringSizeImportantAttrs.forEach(_attr => {\n if (!_customStyle[_attr]) {\n _customStyle[_attr] = ELEM.getStyle(_elemId, _attr);\n }\n });\n const _stringParent = ELEM.make(_elemId, 'div');\n const _stringElem = ELEM.make(_stringParent, 'span');\n ELEM.setStyles(_stringElem, _customStyle);\n ELEM.setHTML(_stringElem, _string);\n ELEM.flushElem([_stringParent, _stringElem]);\n ELEM.flush();\n const [_width, _height] = ELEM.getSize(_stringElem);\n ELEM.del(_stringElem); ELEM.del(_stringParent);\n const _paddedWidth = _width - _width % 2 + 2;\n const _paddedHeight = _height - _height % 2 + 2;\n return [_paddedWidth, _paddedHeight];\n }",
"createStyle(styleString) {\n this.createStyleIn(styleString);\n }",
"function string (str, index){\n var str = String(typeof str == 'object' && str.text ? str.text : str)\n , length = utils.strlen(str)\n , width = colWidths[index]\n - (style['padding-left'] || 0)\n - (style['padding-right'] || 0)\n , align = options.colAligns[index] || 'left';\n \n return repeat(' ', style['padding-left'] || 0)\n + (length == width ? str :\n (length < width\n ? pad(str, ( width + (str.length - length) ), ' ', align == 'left' ? 'right' :\n (align == 'middle' ? 'both' : 'left'))\n : (truncater ? truncate(str, width, truncater) : str))\n )\n + repeat(' ', style['padding-right'] || 0);\n }",
"function renderLinestringGeometry(olGeom, olStyle, lineGeom) {\n if (!olStyle || !olStyle.getStroke()) {\n return;\n }\n\n const ends = olGeom.getEnds();\n if (ends.length === 0) {\n return null;\n }\n\n const stride = olGeom.getStride();\n const flatCoordinates = olGeom.getFlatCoordinates();\n\n const color = olcolor.asArray(olStyle.getStroke().getColor());\n const join = olStyle.getStroke().getLineJoin();\n const width = olStyle.getStroke().getWidth();\n const cap = olStyle.getStroke().getLineCap();\n const miterLimit =\n join === 'bevel' ? 0 : olStyle.getStroke().getMiterLimit() || 10.0;\n\n const params = {\n join,\n cap,\n miterLimit\n };\n // loop on ends: create a new line everytime\n for (let i = 0; i < ends.length; i++) {\n if (ends[i] === ends[i - 1]) {\n continue;\n }\n\n lineGeom.pushLine(\n params,\n width,\n color,\n flatCoordinates,\n i === 0 ? 0 : ends[i - 1],\n ends[i],\n stride\n );\n }\n}",
"function lineWidth(w) {\n if (isDef(w))\n _g.lineWidth = w;\n return _g.lineWidth;\n }",
"function createText(str, fmt, width) {\n \n if (!str) {\n str = \" \";\n }\n \n var lineSpace = 8;\n\n if (str === undefined || str === null) {\n str = \" \";\n }\n\n var ctx = textCtx;\n var words = [];\n var lines = [];\n \n ctx.save();\n \n // update canvas2d font state based on fmt object\n var setFontFromFormat = function(fmt) {\n \n ctx.fillStyle = 'hsl(' + 360 * (30 / 60) + ',100%,50%)';\n \n var font = fmt && fmt.font || \"\";\n //if (font.toLowerCase().indexOf(\"soma\") === -1) {\n font = \"SoMARegular\"; // default font\n //}\n\n font = font.split(\".ttf\").join(\"\");\n font = \"\" + fmt.size + \"px \" + font;\n\n var color = fmt && fmt.color || [1,1,1,1];\n color = [color[0] * 255, color[1] * 255, color[2] * 255, color[3]];\n color = \"rgba(\" + color + \")\";\n \n ctx.fillStyle = color;\n ctx.lineWidth = 2.5;\n ctx.strokeStyle = color;\n ctx.font = font;\n }\n \n // Add a list of words that share the same formatting \n var addWords = function(wordList, format) {\n wordList.forEach(function(strWord, i, wordList) {\n \n strWord.split(\"\\n\").forEach(function(strWord, i) {\n if (i>0) {\n words.push({\n text: \"\\n\", // make newline it's own word (helps with layout)\n format: format\n }); \n }\n words.push({\n text: strWord,\n format: format\n });\n });\n \n \n });\n };\n \n // Create a line object and append it to lines array\n var addLine = function() {\n \n var prevLine = lines[lines.length-1];\n var yPos = 0;\n \n if (prevLine) {\n yPos = prevLine.y + prevLine.height + lineSpace;\n }\n \n lines.push({\n x:0,\n y:yPos,\n text:\"\",\n height: 0,\n width: 0,\n words: []\n })\n }\n \n // Try adding a word to current last line. \n // (returns true on success)\n var addToLastLine = function(word) {\n var line = lines[lines.length-1];\n \n setFontFromFormat(word.format);\n var addedWidth = ctx.measureText(word.text+\" \").width;\n \n if ((line.words.length > 0 && line.width+addedWidth > width) || word.text == \"\\n\") {\n line.text = line.text.slice(0,-1);\n return false;\n } else {\n word.x = line.width;\n line.words.push(word);\n line.text += word.text+\" \";\n line.width += addedWidth;\n if (word.format.size > line.height) {\n line.height = word.format.size;\n }\n return true;\n }\n \n };\n \n // Create words from input\n if (Array.isArray(str) && Array.isArray(fmt) && str.length === fmt.length) {\n str.forEach(function(span, i, spans) {\n addWords(span.split(\" \"), fmt[i]);\n });\n } else {\n if (Array.isArray(fmt)) {\n fmt = fmt[0];\n }\n if (Array.isArray(str)) {\n str = str.join(\"\");\n }\n addWords(str.split(\" \"), fmt);\n }\n\n // Add first line object\n addLine();\n \n // Add words to text block \n // and creates a concatenated string of words to be rendered \n // (fmt object may limit lines for example)\n words = words.filter(function(word) {\n var addedWord = true;\n if (!addToLastLine(word)) {\n addLine();\n addedWord = addToLastLine(word);\n }\n return addedWord;\n }).map(function(word) {\n return word.text;\n }).reduce(function(a,b) {\n return a+\" \"+b;\n })\n \n var lastLine = lines[lines.length-1];\n \n // get max texture width of text block\n var maxWidth = (lines.length > 1) ? lines.reduce(function(a,b){\n return (a.width > b.width) ? a.width : b.width;\n }) : lines[0].width;\n \n textCanvas.width = maxWidth;\n textCanvas.height = lastLine.height + lastLine.y;\n //textCanvas.height = -lineSpace + (size + lineSpace) * lines.length + size*.3;\n \n // Draw text lines to canvas2d\n lines.forEach(function(line, i) {\n line.words.forEach(function(word) {\n setFontFromFormat(word.format);\n ctx.fillText(word.text, word.x, line.y+line.height);\n });\n });\n\n\n ctx.restore();\n \n ctx = gl;\n \n\n // Create a texture from canvas2d\n // Use that texture to create an Image node\n var textBlockNode = new Li.Image(handleLoadedTexture(ctx.createTexture(), textCanvas), textCanvas.width, textCanvas.height, true);\n texture = null;\n \n \n // Decorate Image node with Text node methods\n \n Object.defineProperty(textBlockNode, \"numLines\", {\n get: function() {\n return lines.length;\n }\n })\n \n Object.defineProperty(textBlockNode, \"text\", {\n get: function() {\n return words\n }\n })\n \n //getTextBoundsFor(lineNumber, [offset], [length]) // {text: \"foobar\", bounds:{x:20, y:10, width: 70, height: 10}}\n \n textBlockNode.getTextBoundsFor = function(lineNumber, offset, length) {\n \n var ctx = textCtx;\n var line = lines[lineNumber];\n \n if (offset !== undefined && offset !== null && length !== undefined && length !== null) {\n // sub metric\n \n ctx.save();\n \n var tempLine = {\n text: \"\", \n bounds:{\n x:0,\n y:line.y,\n width: 0,\n height: 0\n }\n };\n \n var getSubWords = function(line, start, end) {\n \n return line.words.map(function(word) {\n \n var newWord = { \n text:word.text.slice(start, end),\n format:word.format\n };\n end = Math.max(end-word.text.length,1)\n start = Math.max(start-word.text.length,1);\n return newWord;\n \n }).filter(function(word) {\n \n return word.text.length;\n \n });\n\n };\n \n getSubWords(line, 0, offset).forEach(function(word) {\n setFontFromFormat(word.format);\n var addedWidth = ctx.measureText(word.text+\" \").width;\n tempLine.bounds.x += addedWidth;\n });\n \n getSubWords(line, offset, length + offset).forEach(function(word) {\n \n setFontFromFormat(word.format);\n\n var addedWidth = ctx.measureText(word.text+\" \").width;\n tempLine.text += word.text+\" \";\n tempLine.bounds.width += addedWidth;\n if (word.format.size > tempLine.bounds.height) {\n tempLine.bounds.height = word.format.size;\n }\n \n });\n \n ctx.restore();\n \n return tempLine;\n \n \n } else {\n return {\n text: line.text, \n bounds:{\n x:0,\n y:line.y,\n width: line.width,\n height: line.height\n }\n }\n }\n \n \n }\n \n // myTextBlock.getLineNumberOffset(x,y); // { lineNumber:2, offset:30 } \n \n textBlockNode.getLineNumberOffset = function(x,y) {\n \n for (var i=0,l=lines.length;i<l;i++) {\n var bot = lines[i].y + lines[i].height;\n if (y <= bot) {\n break;\n }\n }\n \n var line = lines[i];\n var lineNumber = i;\n \n for (var n=0,l=line.words.length;n<l;n++) {\n \n if (line.words[n].x >= x) {\n break;\n }\n \n }\n \n var offset = line.words.slice(n).map(function(word) {\n return word.text;\n }).join(\" \").length;\n \n \n return { lineNumber:lineNumber, offset:offset } \n }\n \n return textBlockNode;\n\n }",
"static format(string, stringLength, rowNumber, formatType) {\n\n if(!string) {\n return null;\n }\n\n if(!stringLength && !rowNumber && !formatType) {\n return TextFormatter._defaultFormat(string);\n }\n\n if(stringLength && !rowNumber && !formatType) {\n return TextFormatter._formatWithLength(string, stringLength);\n }\n\n if(stringLength && rowNumber && !formatType) {\n return TextFormatter._formatWithLengthAndRow(string, stringLength, rowNumber);\n }\n\n if(stringLength && !rowNumber && formatType) {\n return TextFormatter._formatWithLengthAndType(string, stringLength, formatType);\n }\n\n if(!stringLength && rowNumber && !formatType) {\n return TextFormatter._formatWithRow(string, rowNumber);\n }\n\n if(!stringLength && rowNumber && formatType) {\n return TextFormatter._formatWithRowAndType(string, rowNumber, formatType);\n }\n\n if(!stringLength && !rowNumber && formatType) {\n return TextFormatter._formatWithType(string, formatType);\n }\n\n stringLength = parseInt(stringLength);\n rowNumber = parseInt(rowNumber);\n\n if( typeof string !== \"string\" && typeof stringLength !== \"number\" && \n typeof rowNumber !== \"number\" && typeof formatType !== \"string\" ) {\n return null;\n }\n\n const formatted = TextFormatter._getMatch(string, formatType);\n if(formatted == null) {\n return null;\n } \n \n let result = \"\";\n let lengthCounter = 0;\n let rowsCounter = 0;\n\n for(let substring of formatted) {\n substring = substring.trim();\n\n for(let i in substring) {\n result += substring[i];\n lengthCounter++;\n\n if(lengthCounter == stringLength) {\n lengthCounter = 0;\n result += \"<br\\/>\";\n rowsCounter++;\n }\n }\n if(lengthCounter != 0) {\n result += `<br\\/>`;\n rowsCounter++;\n }\n lengthCounter = 0;\n\n if(rowsCounter == rowNumber) {\n break;\n }\n }\n\n return result;\n }",
"function validStyles(styleAttr){\n\tvar result = '';\n\tvar styleArray = styleAttr.split(';');\n\tangular.forEach(styleArray, function(value){\n\t\tvar v = value.split(':');\n\t\tif(v.length == 2){\n\t\t\tvar key = trim(angular.lowercase(v[0]));\n\t\t\tvar value = trim(angular.lowercase(v[1]));\n\t\t\tif(\n\t\t\t\t(key === 'color' || key === 'background-color') && (\n\t\t\t\t\tvalue.match(/^rgb\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^rgba\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsl\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsla\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^#[0-9a-f]{3,6}$/i)\n\t\t\t\t\t|| value.match(/^[a-z]*$/i)\n\t\t\t\t)\n\t\t\t||\n\t\t\t\tkey === 'text-align' && (\n\t\t\t\t\tvalue === 'left'\n\t\t\t\t\t|| value === 'right'\n\t\t\t\t\t|| value === 'center'\n\t\t\t\t\t|| value === 'justify'\n\t\t\t\t)\n\t\t\t||\n key === 'text-decoration' && (\n value === 'underline'\n || value === 'line-through'\n )\n || \n key === 'font-weight' && (\n value === 'bold'\n )\n ||\n key === 'font-style' && (\n value === 'italic'\n )\n ||\n key === 'float' && (\n value === 'left'\n || value === 'right'\n || value === 'none'\n )\n ||\n key === 'vertical-align' && (\n value === 'baseline'\n || value === 'sub'\n || value === 'super'\n || value === 'test-top'\n || value === 'text-bottom'\n || value === 'middle'\n || value === 'top'\n || value === 'bottom'\n || value.match(/[0-9]*(px|em)/)\n || value.match(/[0-9]+?%/)\n )\n ||\n key === 'font-size' && (\n value === 'xx-small'\n || value === 'x-small'\n || value === 'small'\n || value === 'medium'\n || value === 'large'\n || value === 'x-large'\n || value === 'xx-large'\n || value === 'larger'\n || value === 'smaller'\n || value.match(/[0-9]*\\.?[0-9]*(px|em|rem|mm|q|cm|in|pt|pc|%)/)\n )\n\t\t\t||\n\t\t\t\t(key === 'width' || key === 'height') && (\n\t\t\t\t\tvalue.match(/[0-9\\.]*(px|em|rem|%)/)\n\t\t\t\t)\n\t\t\t|| // Reference #520\n\t\t\t\t(key === 'direction' && value.match(/^ltr|rtl|initial|inherit$/))\n\t\t\t) result += key + ': ' + value + ';';\n\t\t}\n\t});\n\treturn result;\n}",
"function lineBreakString(str, metrics, maxWidth, lineDelimiter)\r\n{\r\n if (!lineDelimiter)\r\n lineDelimiter = '\\n';\r\n\r\n var width = metrics.getWidth(str);\r\n if (width < maxWidth)\r\n return str;\r\n\r\n var rb = [];\r\n var sp = 0;\r\n var sb = [str.charAt(0)];\r\n var wordFragment;\r\n\r\n for (var i = 1; i < str.length; i++)\r\n {\r\n var c = str.charAt(i);\r\n sb.push(c);\r\n if (c == ' ')\r\n sp = i;\r\n\r\n if (metrics.getWidth(sb.join('')) < maxWidth)\r\n continue;\r\n\r\n if (c != ' ' && sp > 0)\r\n {\r\n // Don't put a line break in the middle of a word\r\n var i1 = i+1;\r\n if (i1 > str.length)\r\n i1 = str.length;\r\n wordFragment = str.substring(sp+1,i1);\r\n sb = sb.slice(0,sp);\r\n }\r\n else\r\n {\r\n wordFragment = sb.pop();\r\n }\r\n\r\n rb.push(sb.join(''));\r\n sp = 0;\r\n sb = [];\r\n sb.push(wordFragment);\r\n }\r\n\r\n if (sb.length > 0)\r\n rb.push(sb.join(''));\r\n\r\n return rb.join(lineDelimiter);\r\n}",
"function string (str, index){\n var str = String(typeof str == 'object' && str.text ? str.text : str)\n , length = utils.strlen(str)\n , width = colWidths[index]\n - (style['padding-left'] || 0)\n - (style['padding-right'] || 0)\n , align = options.colAligns[index] || 'left';\n\n return repeat(' ', style['padding-left'] || 0)\n + (length == width ? str :\n (length < width\n ? pad(str, ( width + (str.length - length) ), ' ', align == 'left' ? 'right' :\n (align == 'middle' ? 'both' : 'left'))\n : (truncater ? truncate(str, width, truncater) : str))\n )\n + repeat(' ', style['padding-right'] || 0);\n }",
"function strWidth(str){\n\t\tif(str.length == 0)return 0;\n\t\t//We need to calculate how long our string will be in pixels\n\t\tvar strWidths = {\" \":9,\"!\":10,\"\\\"\":15,\"#\":17,\"$\":17,\"%\":27,\"&\":22,\"'\":8,\"(\":10,\")\":10,\"*\":12,\"+\":18,\",\":9,\"-\":10,\".\":9,\"/\":9,\"0\":17,\"1\":17,\"2\":17,\"3\":17,\"4\":17,\"5\":17,\"6\":17,\"7\":17,\"8\":17,\"9\":17,\":\":10,\";\":10,\"<\":18,\"=\":18,\">\":18,\"?\":19,\"@\":30,\"A\":22,\"B\":22,\"C\":22,\"D\":22,\"E\":21,\"F\":19,\"G\":24,\"H\":22,\"I\":9,\"J\":17,\"K\":22,\"L\":19,\"M\":25,\"N\":22,\"O\":24,\"P\":21,\"Q\":24,\"R\":22,\"S\":21,\"T\":19,\"U\":22,\"V\":21,\"W\":29,\"X\":21,\"Y\":21,\"Z\":19,\"[\":10,\"]\":10,\"^\":18,\"_\":17,\"`\":10,\"a\":17,\"b\":19,\"c\":17,\"d\":19,\"e\":17,\"f\":10,\"g\":19,\"h\":19,\"i\":9,\"j\":9,\"k\":17,\"l\":9,\"m\":27,\"n\":19,\"o\":19,\"p\":19,\"q\":19,\"r\":12,\"s\":17,\"t\":10,\"u\":19,\"v\":17,\"w\":24,\"x\":17,\"y\":17,\"z\":15,\"{\":12,\"|\":9,\"}\":12,\"~\":18};\n\t\tvar w = 0;\n\t\tfor(var i = 0; i<str.length; i++){\n\t\t\t//If we dont know how wide the char is, set it to 28.5 that is the width of W and no char is wider than that.\n\t\t\tw += fontSize/30*(strWidths[str[i]]?strWidths[str[i]]:28.5);\n\t\t}\n\t\t//This is for the space between the text and the symbol.\n\t\tw += spaceTextIcon;\n\t\treturn w;\n\t}",
"addStyleString(str) {\n\t\tlet node = document.getElementById(\"codestream-style-tag\") || document.createElement(\"style\");\n\t\tnode.id = \"codestream-style-tag\";\n\t\tnode.innerHTML = str;\n\t\tdocument.body.appendChild(node);\n\t}",
"function getStyle( val, id ) {\n let style = val;\n\n // Strings\n if ( style.constructor === String ) {\n return `[data-modular-id=\"${ id }\"]{${ style }}`;\n }\n\n // Functions\n if ( style instanceof Function ) style = style();\n\n // Style-objects\n if ( style instanceof Object ) {\n const rules = Object.entries( style );\n\n if ( !rules.length ) {\n console.warn( err( 6 ) );\n return \"\";\n }\n\n // If style-object contains css rules:\n if ( rules[0][1] instanceof Object ) {\n style = \"\";\n\n rules.map( rule => {\n style += `[data-modular-id=\"${ id }\"] ${ rule[0] }{${ makeStyle( rule[1] ) }}`;\n } );\n\n } else {\n style = makeStyle( style, id );\n }\n }\n\n // Return if style is valid\n if ( style.constructor === String ) {\n return style;\n }\n\n // Warn about invalid style\n console.warn( err( 6 ) );\n return;\n }",
"function consumeStyleValue(text, startIndex, endIndex) {\n var ch1 = -1; // 1st previous character\n\n var ch2 = -1; // 2nd previous character\n\n var ch3 = -1; // 3rd previous character\n\n var i = startIndex;\n var lastChIndex = i;\n\n while (i < endIndex) {\n var ch = text.charCodeAt(i++);\n\n if (ch === 59\n /* SEMI_COLON */\n ) {\n return lastChIndex;\n } else if (ch === 34\n /* DOUBLE_QUOTE */\n || ch === 39\n /* SINGLE_QUOTE */\n ) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n } else if (startIndex === i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85\n /* U */\n && ch2 === 82\n /* R */\n && ch1 === 76\n /* L */\n && ch === 40\n /* OPEN_PAREN */\n ) {\n lastChIndex = i = consumeQuotedText(text, 41\n /* CLOSE_PAREN */\n , i, endIndex);\n } else if (ch > 32\n /* SPACE */\n ) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33\n /* UPPER_CASE */\n ;\n }\n\n return lastChIndex;\n}",
"function parseStyle(text) {\n\tconst result = [];\n\tlet start = 0;\n\tlet position = 0;\n\n\t// At any given time, these carry style information since last time a styling\n\t// control code was met.\n\tlet colorCodes, bold, textColor, bgColor, hexColor, hexBgColor, italic, underline, strikethrough, monospace;\n\n\tconst resetStyle = () => {\n\t\tbold = false;\n\t\ttextColor = undefined;\n\t\tbgColor = undefined;\n\t\thexColor = undefined;\n\t\thexBgColor = undefined;\n\t\titalic = false;\n\t\tunderline = false;\n\t\tstrikethrough = false;\n\t\tmonospace = false;\n\t};\n\n\tresetStyle();\n\n\t// When called, this \"closes\" the current fragment by adding an entry to the\n\t// `result` array using the styling information set last time a control code\n\t// was met.\n\tconst emitFragment = () => {\n\t\t// Uses the text fragment starting from the last control code position up to\n\t\t// the current position\n\t\tconst textPart = text.slice(start, position);\n\n\t\t// Filters out all non-style related control codes present in this text\n\t\tconst processedText = textPart.replace(controlCodesRx, \"\");\n\n\t\tif (processedText.length) {\n\t\t\t// Current fragment starts where the previous one ends, or at 0 if none\n\t\t\tconst fragmentStart = result.length ? result[result.length - 1].end : 0;\n\n\t\t\tresult.push({\n\t\t\t\tbold,\n\t\t\t\ttextColor,\n\t\t\t\tbgColor,\n\t\t\t\thexColor,\n\t\t\t\thexBgColor,\n\t\t\t\titalic,\n\t\t\t\tunderline,\n\t\t\t\tstrikethrough,\n\t\t\t\tmonospace,\n\t\t\t\ttext: processedText,\n\t\t\t\tstart: fragmentStart,\n\t\t\t\tend: fragmentStart + processedText.length,\n\t\t\t});\n\t\t}\n\n\t\t// Now that a fragment has been \"closed\", the next one will start after that\n\t\tstart = position + 1;\n\t};\n\n\t// This loop goes through each character of the given text one by one by\n\t// bumping the `position` cursor. Every time a new special \"styling\" character\n\t// is met, an object gets created (with `emitFragment()`)information on text\n\t// encountered since the previous styling character.\n\twhile (position < text.length) {\n\t\tswitch (text[position]) {\n\t\tcase RESET:\n\t\t\temitFragment();\n\t\t\tresetStyle();\n\t\t\tbreak;\n\n\t\t// Meeting a BOLD character means that the ongoing text is either going to\n\t\t// be in bold or that the previous one was in bold and the following one\n\t\t// must be reset.\n\t\t// This same behavior applies to COLOR, REVERSE, ITALIC, and UNDERLINE.\n\t\tcase BOLD:\n\t\t\temitFragment();\n\t\t\tbold = !bold;\n\t\t\tbreak;\n\n\t\tcase COLOR:\n\t\t\temitFragment();\n\n\t\t\t// Go one step further to find the corresponding color\n\t\t\tcolorCodes = text.slice(position + 1).match(colorRx);\n\n\t\t\tif (colorCodes) {\n\t\t\t\ttextColor = Number(colorCodes[1]);\n\n\t\t\t\tif (colorCodes[2]) {\n\t\t\t\t\tbgColor = Number(colorCodes[2]);\n\t\t\t\t}\n\n\t\t\t\t// Color code length is > 1, so bump the current position cursor by as\n\t\t\t\t// much (and reset the start cursor for the current text block as well)\n\t\t\t\tposition += colorCodes[0].length;\n\t\t\t\tstart = position + 1;\n\t\t\t} else {\n\t\t\t\t// If no color codes were found, toggles back to no colors (like BOLD).\n\t\t\t\ttextColor = undefined;\n\t\t\t\tbgColor = undefined;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase HEX_COLOR:\n\t\t\temitFragment();\n\n\t\t\tcolorCodes = text.slice(position + 1).match(hexColorRx);\n\n\t\t\tif (colorCodes) {\n\t\t\t\thexColor = colorCodes[1].toUpperCase();\n\n\t\t\t\tif (colorCodes[2]) {\n\t\t\t\t\thexBgColor = colorCodes[2].toUpperCase();\n\t\t\t\t}\n\n\t\t\t\t// Color code length is > 1, so bump the current position cursor by as\n\t\t\t\t// much (and reset the start cursor for the current text block as well)\n\t\t\t\tposition += colorCodes[0].length;\n\t\t\t\tstart = position + 1;\n\t\t\t} else {\n\t\t\t\t// If no color codes were found, toggles back to no colors (like BOLD).\n\t\t\t\thexColor = undefined;\n\t\t\t\thexBgColor = undefined;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase REVERSE: {\n\t\t\temitFragment();\n\t\t\tconst tmp = bgColor;\n\t\t\tbgColor = textColor;\n\t\t\ttextColor = tmp;\n\t\t\tbreak;\n\t\t}\n\n\t\tcase ITALIC:\n\t\t\temitFragment();\n\t\t\titalic = !italic;\n\t\t\tbreak;\n\n\t\tcase UNDERLINE:\n\t\t\temitFragment();\n\t\t\tunderline = !underline;\n\t\t\tbreak;\n\n\t\tcase STRIKETHROUGH:\n\t\t\temitFragment();\n\t\t\tstrikethrough = !strikethrough;\n\t\t\tbreak;\n\n\t\tcase MONOSPACE:\n\t\t\temitFragment();\n\t\t\tmonospace = !monospace;\n\t\t\tbreak;\n\t\t}\n\n\t\t// Evaluate the next character at the next iteration\n\t\tposition += 1;\n\t}\n\n\t// The entire text has been parsed, so we finalize the current text fragment.\n\temitFragment();\n\n\treturn result;\n}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"setStyle() {\n // Default style\n this.style = this.getStyle(this.styleKey)\n\n // Override Style\n if (this.styleKey === 'style_zone_urbaines') {\n this.style = { ...this.style, ...this.getStyle(`style_zone_urbaines__${this.feature.properties.typezone.toLowerCase()}`) }\n }\n else if (['style_ocsge_couverture', 'style_ocsge_usage'].includes(this.styleKey)) {\n let leaf\n\n if (this.styleKey === 'style_ocsge_couverture')\n leaf = this.couv_leafs.find(el => el.code_couverture == this.feature.properties.code_couverture.replaceAll('.', '_'))\n\n if (this.styleKey === 'style_ocsge_usage')\n leaf = this.usa_leafs.find(el => el.code_usage == this.feature.properties.code_usage.replaceAll('.', '_'))\n \n this.style = { ...this.style, ...{ fillColor: leaf?.map_color, color: leaf?.map_color } }\n }\n else if (this.styleKey === 'style_ocsge_diff') {\n if (this.feature.properties.is_new_artif)\n this.style = { ...this.style, ...this.getStyle('style_ocsge_diff__new_artif') }\n \n if (this.feature.properties.is_new_natural)\n this.style = { ...this.style, ...this.getStyle('style_ocsge_diff__new_natural') }\n }\n\n return this.style\n }",
"function consumeStyleValue(text, startIndex, endIndex) {\n let ch1 = -1; // 1st previous character\n let ch2 = -1; // 2nd previous character\n let ch3 = -1; // 3rd previous character\n let i = startIndex;\n let lastChIndex = i;\n while (i < endIndex) {\n const ch = text.charCodeAt(i++);\n if (ch === 59 /* SEMI_COLON */) {\n return lastChIndex;\n }\n else if (ch === 34 /* DOUBLE_QUOTE */ || ch === 39 /* SINGLE_QUOTE */) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n }\n else if (startIndex ===\n i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85 /* U */ &&\n ch2 === 82 /* R */ && ch1 === 76 /* L */ && ch === 40 /* OPEN_PAREN */) {\n lastChIndex = i = consumeQuotedText(text, 41 /* CLOSE_PAREN */, i, endIndex);\n }\n else if (ch > 32 /* SPACE */) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33 /* UPPER_CASE */;\n }\n return lastChIndex;\n}",
"function consumeStyleValue(text, startIndex, endIndex) {\n let ch1 = -1; // 1st previous character\n let ch2 = -1; // 2nd previous character\n let ch3 = -1; // 3rd previous character\n let i = startIndex;\n let lastChIndex = i;\n while (i < endIndex) {\n const ch = text.charCodeAt(i++);\n if (ch === 59 /* SEMI_COLON */) {\n return lastChIndex;\n }\n else if (ch === 34 /* DOUBLE_QUOTE */ || ch === 39 /* SINGLE_QUOTE */) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n }\n else if (startIndex ===\n i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85 /* U */ &&\n ch2 === 82 /* R */ && ch1 === 76 /* L */ && ch === 40 /* OPEN_PAREN */) {\n lastChIndex = i = consumeQuotedText(text, 41 /* CLOSE_PAREN */, i, endIndex);\n }\n else if (ch > 32 /* SPACE */) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33 /* UPPER_CASE */;\n }\n return lastChIndex;\n}",
"function consumeStyleValue(text, startIndex, endIndex) {\n let ch1 = -1; // 1st previous character\n let ch2 = -1; // 2nd previous character\n let ch3 = -1; // 3rd previous character\n let i = startIndex;\n let lastChIndex = i;\n while (i < endIndex) {\n const ch = text.charCodeAt(i++);\n if (ch === 59 /* SEMI_COLON */) {\n return lastChIndex;\n }\n else if (ch === 34 /* DOUBLE_QUOTE */ || ch === 39 /* SINGLE_QUOTE */) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n }\n else if (startIndex ===\n i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85 /* U */ &&\n ch2 === 82 /* R */ && ch1 === 76 /* L */ && ch === 40 /* OPEN_PAREN */) {\n lastChIndex = i = consumeQuotedText(text, 41 /* CLOSE_PAREN */, i, endIndex);\n }\n else if (ch > 32 /* SPACE */) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33 /* UPPER_CASE */;\n }\n return lastChIndex;\n}",
"function consumeStyleValue(text, startIndex, endIndex) {\n let ch1 = -1; // 1st previous character\n let ch2 = -1; // 2nd previous character\n let ch3 = -1; // 3rd previous character\n let i = startIndex;\n let lastChIndex = i;\n while (i < endIndex) {\n const ch = text.charCodeAt(i++);\n if (ch === 59 /* SEMI_COLON */) {\n return lastChIndex;\n }\n else if (ch === 34 /* DOUBLE_QUOTE */ || ch === 39 /* SINGLE_QUOTE */) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n }\n else if (startIndex ===\n i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85 /* U */ &&\n ch2 === 82 /* R */ && ch1 === 76 /* L */ && ch === 40 /* OPEN_PAREN */) {\n lastChIndex = i = consumeQuotedText(text, 41 /* CLOSE_PAREN */, i, endIndex);\n }\n else if (ch > 32 /* SPACE */) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33 /* UPPER_CASE */;\n }\n return lastChIndex;\n}",
"function consumeStyleValue(text, startIndex, endIndex) {\n let ch1 = -1; // 1st previous character\n let ch2 = -1; // 2nd previous character\n let ch3 = -1; // 3rd previous character\n let i = startIndex;\n let lastChIndex = i;\n while (i < endIndex) {\n const ch = text.charCodeAt(i++);\n if (ch === 59 /* SEMI_COLON */) {\n return lastChIndex;\n }\n else if (ch === 34 /* DOUBLE_QUOTE */ || ch === 39 /* SINGLE_QUOTE */) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n }\n else if (startIndex ===\n i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85 /* U */ &&\n ch2 === 82 /* R */ && ch1 === 76 /* L */ && ch === 40 /* OPEN_PAREN */) {\n lastChIndex = i = consumeQuotedText(text, 41 /* CLOSE_PAREN */, i, endIndex);\n }\n else if (ch > 32 /* SPACE */) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33 /* UPPER_CASE */;\n }\n return lastChIndex;\n}",
"function consumeStyleValue(text, startIndex, endIndex) {\n let ch1 = -1; // 1st previous character\n let ch2 = -1; // 2nd previous character\n let ch3 = -1; // 3rd previous character\n let i = startIndex;\n let lastChIndex = i;\n while (i < endIndex) {\n const ch = text.charCodeAt(i++);\n if (ch === 59 /* SEMI_COLON */) {\n return lastChIndex;\n }\n else if (ch === 34 /* DOUBLE_QUOTE */ || ch === 39 /* SINGLE_QUOTE */) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n }\n else if (startIndex ===\n i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85 /* U */ &&\n ch2 === 82 /* R */ && ch1 === 76 /* L */ && ch === 40 /* OPEN_PAREN */) {\n lastChIndex = i = consumeQuotedText(text, 41 /* CLOSE_PAREN */, i, endIndex);\n }\n else if (ch > 32 /* SPACE */) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33 /* UPPER_CASE */;\n }\n return lastChIndex;\n}",
"style (data) {\n return _style(data)\n }",
"getBorderStyle(borderStyle) {\n switch (borderStyle) {\n case 'Cleared':\n return 'cleared';\n case 'DashSmallGap':\n return 'dashSmallGap';\n case 'Triple':\n return 'triple';\n case 'Dot':\n return 'dotted';\n case 'DashDot':\n return 'dotDash';\n case 'DashLargeGap':\n return 'dashed';\n case 'DashDotDot':\n return 'dotDotDash';\n case 'Double':\n return 'double';\n case 'ThinThickSmallGap':\n return 'thinThickSmallGap';\n case 'ThickThinSmallGap':\n return 'thickThinSmallGap';\n case 'ThinThickThinSmallGap':\n return 'thinThickThinSmallGap';\n case 'ThickThinMediumGap':\n return 'thickThinMediumGap';\n case 'ThinThickMediumGap':\n return 'thinThickMediumGap';\n case 'ThinThickThinMediumGap':\n return 'thinThickThinMediumGap';\n case 'ThickThinLargeGap':\n return 'thickThinLargeGap';\n case 'ThinThickLargeGap':\n return 'thinThickLargeGap';\n case 'ThinThickThinLargeGap':\n return 'thinThickThinLargeGap';\n case 'Thick':\n return 'thick';\n case 'SingleWavy':\n return 'wave';\n case 'DoubleWavy':\n return 'doubleWave';\n case 'DashDotStroked':\n return 'dashDotStroked';\n case 'Engrave3D':\n return 'threeDEngrave';\n case 'Emboss3D':\n return 'threeDEmboss';\n case 'Outset':\n return 'outset';\n case 'Inset':\n return 'inset';\n // case 'None':\n // return 'none';\n default:\n return 'single';\n }\n }",
"function hstyle(st) {\n\t\t\t// Prepare string\n\t\t\tvar s = '';\n\t\t\tfor(var key in st) {\n\t\t\t\ts += '<'+key;\n\t\t\t\tfor(var attr in st[key]) {\n\t\t\t\t\ts += ' ';\n\t\t\t\t\tif(attr.substr(0,2) == 'x:') {\n\t\t\t\t\t\ts += attr;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts += 'ss:';\n\t\t\t\t\t}\n\t\t\t\t\ts += attr+'=\"'+st[key][attr]+'\"';\n\t\t\t\t}\n\t\t\t\ts += '/>';\n\t\t\t}\n\t\t\t\n\t\t\tvar hh = hash(s);\n\t\t\t// Store in hash\n\t\t\tif(styles[hh]) {\n\t\t\t} else {\n\t\t\t\tstyles[hh] = {styleid:stylesn};\n\t\t\t\ts2 += '<Style ss:ID=\"s'+stylesn+'\">';\n\t\t\t\ts2 += s;\n\t\t\t\ts2 += '</Style>';\n\t\t\t\tstylesn++;\n\t\t\t}\n\t\t\treturn 's'+styles[hh].styleid;\n\t\t}",
"function drawCapsForSet(set, capStyle, fillStyle, lineWidth) {\n var i = -1, x, y, w;\n\n while (++i < set.length) {\n x = getXForIndex(i, set.length);\n y = getYForValue(set[i]);\n\n if (capStyle === \"square\") {\n w = Math.max(2, lineWidth) * 2.5;\n drawRect(fillStyle, x - (w / 2), y + (w / 2), w, w);\n }\n else {\n w = lineWidth + 1;\n drawCircle(fillStyle, x, y, w);\n }\n }\n }",
"function consumeStyleValue(text, startIndex, endIndex) {\n var ch1 = -1; // 1st previous character\n\n var ch2 = -1; // 2nd previous character\n\n var ch3 = -1; // 3rd previous character\n\n var i = startIndex;\n var lastChIndex = i;\n\n while (i < endIndex) {\n var ch = text.charCodeAt(i++);\n\n if (ch === 59\n /* SEMI_COLON */\n ) {\n return lastChIndex;\n } else if (ch === 34\n /* DOUBLE_QUOTE */\n || ch === 39\n /* SINGLE_QUOTE */\n ) {\n lastChIndex = i = consumeQuotedText(text, ch, i, endIndex);\n } else if (startIndex === i - 4 && // We have seen only 4 characters so far \"URL(\" (Ignore \"foo_URL()\")\n ch3 === 85\n /* U */\n && ch2 === 82\n /* R */\n && ch1 === 76\n /* L */\n && ch === 40\n /* OPEN_PAREN */\n ) {\n lastChIndex = i = consumeQuotedText(text, 41\n /* CLOSE_PAREN */\n , i, endIndex);\n } else if (ch > 32\n /* SPACE */\n ) {\n // if we have a non-whitespace character then capture its location\n lastChIndex = i;\n }\n\n ch3 = ch2;\n ch2 = ch1;\n ch1 = ch & -33\n /* UPPER_CASE */\n ;\n }\n\n return lastChIndex;\n }",
"function splitLine(ctx, str, font, width){\n\tvar words = str.split(\" \")\n\tctx.font = font\n\tvar l=1\n\tvar r=words.length+1\n\twhile (r-l>1){\n\t\tvar m = Math.floor((l+r)/2)\n\t\tif (ctx.measureText(words.slice(0, 0+m).join(\" \")).width <= width){\n\t\t\tl=m\n\t\t} else {\n\t\t\tr=m\n\t\t}\n\t}\n\treturn new Array(words.slice(0,0+l).join(\" \"), words.slice(0+l,words.length).join(\" \"))\n}",
"static toStyleClass(str) {\n return str\n .replace(/(\\w)([A-Z])/g, (_m, m1, m2) => m1 + \"-\" + m2)\n .toLowerCase();\n }",
"function hstyle(st) {\n\t\t\t// Prepare string\n\t\t\tvar s = '';\n\t\t\tfor(var key in st) {\n\t\t\t\ts += '<'+key;\n\t\t\t\tfor(var attr in st[key]) {\n\t\t\t\t\ts += ' ';\n\t\t\t\t\tif(attr.substr(0,2) == 'x:') {\n\t\t\t\t\t\ts += attr;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts += 'ss:';\n\t\t\t\t\t}\n\t\t\t\t\ts += attr+'=\"'+st[key][attr]+'\"';\n\t\t\t\t}\n\t\t\t\ts += '/>';\n\t\t\t}\n\n\t\t\tvar hh = hash(s);\n\t\t\t// Store in hash\n\t\t\tif(styles[hh]) {\n\t\t\t} else {\n\t\t\t\tstyles[hh] = {styleid:stylesn};\n\t\t\t\ts2 += '<Style ss:ID=\"s'+stylesn+'\">';\n\t\t\t\ts2 += s;\n\t\t\t\ts2 += '</Style>';\n\t\t\t\tstylesn++;\n\t\t\t}\n\t\t\treturn 's'+styles[hh].styleid;\n\t\t}",
"function get_formatted_lines(str, length) {\n var result = [];\n var re_full = /(\\[\\[[biu]*;[^;]*;\\][^\\]\\[]*\\]?)/g;\n var re_begin = /(\\[\\[[biu]*;[^;]*;\\])/;\n var array = str.split(/\\n/g);\n var prev_format = ''; // string from previous unclosed formating\n for (var i = 0, len = array.length; i < len; ++i) {\n if (prev_format !== '') {\n if (array[i] === '') {\n result.push(prev_format + ']');\n continue;\n } else {\n array[i] = prev_format + array[i];\n prev_format = '';\n }\n }\n for (var j = 0, jlen = array[i].length; j < jlen; j += length) {\n var line = array[i].substring(j, j + length);\n if (prev_format !== '') {\n line = prev_format + line;\n }\n var format = line.match(re_full);\n //shorter lines if tabs are present\n var tabs = line.match(/\\t/g);\n var num_tabs = tabs ? tabs.length : 0;\n if (num_tabs > 0) {\n var remove_chars = num_tabs*3;\n line = array[i].substring(j, j+length-remove_chars); \n j -= remove_chars;\n //console.log(remove_chars);\n }\n // TODO: this don't work on checker box\n // \n if (format && format.length > 0) {\n var format_count = 0;\n //calculate number of characters that belong to formating\n for (var k=0, klen=format.length; k<klen; ++k) {\n format_count += format[k].match(re_begin)[1].length;\n if (format[k][format[k].length-1] == \"]\") {\n format_count += 1;\n }\n }\n if (prev_format !== '') {\n format_count -= prev_format.length;\n }\n var end = j + length + format_count;\n //recalculate line\n line = prev_format + array[i].substring(j, end);\n format = line.match(re_full);\n var last = format[format.length-1];\n j += format_count;\n if (last[last.length-1] != \"]\") {\n //last formating string string is not closed\n line += \"]\";\n prev_format = last.match(re_begin)[1];\n } else {\n prev_format = '';\n }\n } else {\n prev_format = '';\n }\n // shorter lines when html entities\n var entities = line.match(/(&(?:#[0-9]+|[A-Za-z]+);)/g);\n if (entities) {\n var count = 0;\n $.each(entities, function(i, entity) {\n count += entity.length-1;\n });\n line = array[i].substring(j, j+length-count);\n j -= count;\n }\n result.push(line);\n }\n }\n return result;\n }",
"function style(n, style) {\n if (style.constructor == String) {\n return n.style[style];\n }\n else if (style.constructor == Object) {\n for (var prop in style)\n n.style[prop] = style[prop];\n return n;\n }\n return null;\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized +=\n delimiter +\n (isCustomProperty\n ? styleName\n : hyphenateStyleName(styleName)) +\n ':';\n serialized += dangerousStyleValue(\n styleName,\n styleValue,\n isCustomProperty,\n );\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n }",
"function evaluateStyle(styleProperties_)\n{\n\tlet s = \"\";\n\tfor(let i = 0; i < styleProperties_.length; ++i)\n\t{\n\t\tif (i != 0)\n\t\t\ts += \";\";\n\t\ts += evaluateStyleRule(styleProperties_[i]);\n\t}\n\treturn s;\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n}"
] |
[
"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.54536957",
"0.53544986",
"0.53381675",
"0.5331906",
"0.5330593",
"0.53178966",
"0.5210824",
"0.52029276",
"0.5187296",
"0.5089442",
"0.5045794",
"0.49951464",
"0.49448687",
"0.49371254",
"0.4898908",
"0.48960507",
"0.48684373",
"0.48533395",
"0.4848748",
"0.483094",
"0.4823224",
"0.4819978",
"0.47800356",
"0.47640035",
"0.47624448",
"0.47618544",
"0.4719155",
"0.47136304",
"0.47064593",
"0.47064593",
"0.47064593",
"0.47064593",
"0.47064593",
"0.47064593",
"0.47064593",
"0.470504",
"0.470504",
"0.470504",
"0.470504",
"0.470504",
"0.47048655",
"0.47048655",
"0.47048655",
"0.46904644",
"0.46820444",
"0.46820444",
"0.46820444",
"0.46820444",
"0.46820444",
"0.46820444",
"0.46769515",
"0.4674707",
"0.46657857",
"0.4664459",
"0.4655488",
"0.46551034",
"0.465254",
"0.46506682",
"0.46470606",
"0.46390003",
"0.4638654",
"0.4635976",
"0.4635976",
"0.4635976",
"0.4633712",
"0.4631535",
"0.4631535",
"0.46303996",
"0.46303996",
"0.46303996",
"0.46303996"
] |
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 var indent = leadingWhitespace(line);\n\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"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 var indent = leadingWhitespace(line);\n\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new ast[\"b\" /* Token */](TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, Object(blockString[\"a\" /* dedentBlockStringValue */])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw syntaxError(source, position, 'Unterminated string.');\n}",
"function blockHeader(string, indentPerLevel) {\n var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockStringValue__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n } // Escape Triple-Quote (\\\"\"\")\n\n\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_1__[\"Token\"](_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_2__[\"TokenKind\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_1__[\"Token\"](_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_3__[\"TokenKind\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString_mjs__WEBPACK_IMPORTED_MODULE_2__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function blockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g);\n\n // Remove common indentation from all lines but first.\n var commonIndent = null;\n for (var i = 1; i < lines.length; i++) {\n var line = lines[i];\n var indent = leadingWhitespace(line);\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n }\n\n // Remove leading and trailing blank lines.\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n }\n\n // Return a string of the lines joined with U+000A.\n return lines.join('\\n');\n}",
"function blockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g);\n\n // Remove common indentation from all lines but first.\n var commonIndent = null;\n for (var i = 1; i < lines.length; i++) {\n var line = lines[i];\n var indent = leadingWhitespace(line);\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n }\n\n // Remove leading and trailing blank lines.\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n }\n\n // Return a string of the lines joined with U+000A.\n return lines.join('\\n');\n}",
"function blockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g);\n\n // Remove common indentation from all lines but first.\n var commonIndent = null;\n for (var i = 1; i < lines.length; i++) {\n var line = lines[i];\n var indent = leadingWhitespace(line);\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n }\n\n // Remove leading and trailing blank lines.\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n }\n\n // Return a string of the lines joined with U+000A.\n return lines.join('\\n');\n}",
"function blockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g);\n\n // Remove common indentation from all lines but first.\n var commonIndent = null;\n for (var i = 1; i < lines.length; i++) {\n var line = lines[i];\n var indent = leadingWhitespace(line);\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n }\n\n // Remove leading and trailing blank lines.\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n }\n\n // Return a string of the lines joined with U+000A.\n return lines.join('\\n');\n}",
"function blockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g);\n\n // Remove common indentation from all lines but first.\n var commonIndent = null;\n for (var i = 1; i < lines.length; i++) {\n var line = lines[i];\n var indent = leadingWhitespace(line);\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n }\n\n // Remove leading and trailing blank lines.\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n }\n\n // Return a string of the lines joined with U+000A.\n return lines.join('\\n');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_0__.Token(_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_1__.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0,_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_0__.Token(_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_1__.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0,_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, 'Unterminated string.');\n}",
"function blockHeader(string, indentPerLevel) {\n\t var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n\t // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n\t var clip = string[string.length - 1] === '\\n';\n\t var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n\t var chomp = keep ? '+' : (clip ? '' : '-');\n\n\t return indentIndicator + chomp + '\\n';\n\t}",
"function blockHeader(string, indentPerLevel) {\n\t var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n\t // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n\t var clip = string[string.length - 1] === '\\n';\n\t var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n\t var chomp = keep ? '+' : (clip ? '' : '-');\n\n\t return indentIndicator + chomp + '\\n';\n\t}",
"function blockHeader(string, indentPerLevel) {\n\t var indentIndicator = (string[0] === ' ') ? String(indentPerLevel) : '';\n\n\t // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n\t var clip = string[string.length - 1] === '\\n';\n\t var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n\t var chomp = keep ? '+' : (clip ? '' : '-');\n\n\t return indentIndicator + chomp + '\\n';\n\t}",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue.default)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _error.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n } // Escape Triple-Quote (\\\"\"\")\n\n\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _error.syntaxError)(source, position, 'Unterminated string.');\n}",
"function blockStringValue(rawString) {\n\t // Expand a block string's raw value into independent lines.\n\t var lines = rawString.split(/\\r\\n|[\\n\\r]/g);\n\n\t // Remove common indentation from all lines but first.\n\t var commonIndent = null;\n\t for (var i = 1; i < lines.length; i++) {\n\t var line = lines[i];\n\t var indent = leadingWhitespace(line);\n\t if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n\t commonIndent = indent;\n\t if (commonIndent === 0) {\n\t break;\n\t }\n\t }\n\t }\n\n\t if (commonIndent) {\n\t for (var _i = 1; _i < lines.length; _i++) {\n\t lines[_i] = lines[_i].slice(commonIndent);\n\t }\n\t }\n\n\t // Remove leading and trailing blank lines.\n\t while (lines.length > 0 && isBlank(lines[0])) {\n\t lines.shift();\n\t }\n\t while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n\t lines.pop();\n\t }\n\n\t // Return a string of the lines joined with U+000A.\n\t return lines.join('\\n');\n\t}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, dedentBlockStringValue(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw syntaxError(source, position, 'Unterminated string.');\n }",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue2.default)(rawValue));\n }\n\n // SourceCharacter\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, error.syntaxError)(source, position, 'Invalid character within String: ' + printCharCode(code) + '.');\n }\n\n // Escape Triple-Quote (\\\"\"\")\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, error.syntaxError)(source, position, 'Unterminated string.');\n}",
"parseBlock(s, currentRehearsalGroup, latest_variables){\n // parase until block boundary is found\n // block boundary = \"[\" or 2 successive NL or NOL\n try{\n var r = null;\n var loop_cnt = 0;\n\n var block = new common.Block();\n var current_align = \"expand\";\n\n this.context.contiguous_line_break = 0; // This should be done only if NL is really consumed.\n\n let num_meas_row = 0;\n\n let MAX_LOOP = 1000;\n\n let end_of_rg = false;\n\n // eslint-disable-next-line no-constant-condition\n while (true) {\n r = this.nextToken(s);\n if (r.type == TOKEN_END){\n s = r.s; // explicitly consume the last spaces if any.\n end_of_rg = true;\n break;\n }else if (r.type == TOKEN_NL) {\n this.context.line += 1;\n this.context.contiguous_line_break += 1;\n current_align = \"expand\"; // default is expand\n //if(this.context.contiguous_line_break >= 2) break; Do not break here. If the first non NL element is found, then break.\n } else if(r.type == TOKEN_BACK_SLASH){\n if(this.context.contiguous_line_break >= 2) break;\n // Expect TOKEN_NL \n r = this.nextToken(r.s);\n if(r.type != TOKEN_NL) this.onParseError(\"INVALID CODE DETECTED AFTER BACK SLASH\");\n this.context.line += 1;\n //block.appendChild(new common.RawSpaces(r.sss));\n //block.appendChild(new common.RawSpaces(r.token)); \n // Does not count as line break\n }else if(r.type == TOKEN_BRACKET_RA){\n if(this.context.contiguous_line_break >= 2) break;\n // Right aligh indicoator > which is outside measure\n current_align = \"right\";\n }else if(r.type == TOKEN_BRACKET_LA){\n if(this.context.contiguous_line_break >= 2) break;\n // Right aligh indicoator > which is outside measure\n current_align = \"left\";\n } else if (r.type == TOKEN_BRACKET_LS) {\n // Next rehearsal mark detected.\n // Do not consume.\n end_of_rg = true;\n break;\n } else if (\n [\n TOKEN_MB,\n TOKEN_MB_DBL,\n TOKEN_MB_LOOP_BEGIN,\n TOKEN_MB_LOOP_END,\n TOKEN_MB_LOOP_BOTH,\n TOKEN_MB_FIN,\n TOKEN_MB_DBL_SIMILE\n ].indexOf(r.type) >= 0\n ) {\n if(this.context.contiguous_line_break >= 2) break;\n\n let is_new_line_middle_of_block = num_meas_row > 0 && this.context.contiguous_line_break == 1;\n\n this.context.contiguous_line_break = 0;\n \n r = this.parseMeasures(r, r.s); // the last NL has not been consumed.\n // Apply the variables valid at this point for each measures\n //r.measures.forEach(m=>{ m.variables = common.shallowcopy(latest_variables);});\n r.measures.forEach(m=>{\n for(let key in latest_variables){\n m.setVariable(latest_variables[key]);\n }\n });\n\n // For the first measure, set align and new line mark.\n r.measures[0].align = current_align;\n r.measures[0].raw_new_line = is_new_line_middle_of_block; // mark to the first measure\n block.concat(r.measures);\n\n ++num_meas_row;\n\n } else if (r.type == TOKEN_PERCENT) {\n if(this.context.contiguous_line_break >= 2) break;\n // Expression\n r = this.parseVariable(r.s); // last NL would not be consumed\n let variable = new common.Variable(r.key, r.value);\n //block.setVariable(r.key, r.value); Do not do this as with this, only the last variable will be valid.\n latest_variables[r.key] = variable;\n block.appendChild(variable);\n this.context.contiguous_line_break = 0; // -= 1; // Does not reset to 0, but cancell the new line in the same row as this variable\n } else {\n console.log(r.token);\n this.onParseError(\"ERROR_WHILE_PARSE_MOST_OUTSIDER\");\n }\n s = r.s;\n loop_cnt++;\n if (loop_cnt >= MAX_LOOP){\n throw \"Too much elements or infnite loop detected with unkown reason\";\n }\n }\n return { block:block, s:s, end_of_rg:end_of_rg};\n }catch(e){\n console.error(e);\n return null;\n }\n }",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(_tokenKind__WEBPACK_IMPORTED_MODULE_1__[\"TokenKind\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString__WEBPACK_IMPORTED_MODULE_3__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error_syntaxError__WEBPACK_IMPORTED_MODULE_2__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error_syntaxError__WEBPACK_IMPORTED_MODULE_2__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(_tokenKind__WEBPACK_IMPORTED_MODULE_3__[\"TokenKind\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString__WEBPACK_IMPORTED_MODULE_2__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error_syntaxError__WEBPACK_IMPORTED_MODULE_1__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error_syntaxError__WEBPACK_IMPORTED_MODULE_1__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function readBlockString(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n const startLine = lexer.line;\n const startColumn = 1 + start - lexer.lineStart;\n let position = start + 3;\n let chunkStart = position;\n let rawValue = '';\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // Closing Triple-Quote (\"\"\")\n\n if (\n code === 0x0022 &&\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022\n ) {\n rawValue += body.slice(chunkStart, position);\n return new Token(\n TokenKind.BLOCK_STRING,\n start,\n position + 3,\n startLine,\n startColumn,\n dedentBlockStringValue(rawValue),\n );\n } // Escaped Triple-Quote (\\\"\"\")\n\n if (\n code === 0x005c &&\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022 &&\n body.charCodeAt(position + 3) === 0x0022\n ) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n continue;\n } // LineTerminator\n\n if (code === 0x000a || code === 0x000d) {\n if (code === 0x000d && body.charCodeAt(position + 1) === 0x000a) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n continue;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character within String: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n }\n\n throw syntaxError(lexer.source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, dedentBlockStringValue(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw syntaxError(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString__WEBPACK_IMPORTED_MODULE_2__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error__WEBPACK_IMPORTED_MODULE_1__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error__WEBPACK_IMPORTED_MODULE_1__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString__WEBPACK_IMPORTED_MODULE_2__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error__WEBPACK_IMPORTED_MODULE_1__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error__WEBPACK_IMPORTED_MODULE_1__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue2.default)(rawValue));\n }\n\n // SourceCharacter\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _error.syntaxError)(source, position, 'Invalid character within String: ' + printCharCode(code) + '.');\n }\n\n // Escape Triple-Quote (\\\"\"\")\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _error.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue2.default)(rawValue));\n }\n\n // SourceCharacter\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _error.syntaxError)(source, position, 'Invalid character within String: ' + printCharCode(code) + '.');\n }\n\n // Escape Triple-Quote (\\\"\"\")\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _error.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue2.default)(rawValue));\n }\n\n // SourceCharacter\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _error.syntaxError)(source, position, 'Invalid character within String: ' + printCharCode(code) + '.');\n }\n\n // Escape Triple-Quote (\\\"\"\")\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _error.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n rawValue += slice.call(body, chunkStart, position);\n return new Tok(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue2.default)(rawValue));\n }\n\n // SourceCharacter\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _error.syntaxError)(source, position, 'Invalid character within String: ' + printCharCode(code) + '.');\n }\n\n // Escape Triple-Quote (\\\"\"\")\n if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _error.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev) {\n\t var body = source.body;\n\t var position = start + 3;\n\t var chunkStart = position;\n\t var code = 0;\n\t var rawValue = '';\n\n\t while (position < body.length && (code = charCodeAt.call(body, position)) !== null) {\n\t // Closing Triple-Quote (\"\"\")\n\t if (code === 34 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34) {\n\t rawValue += slice.call(body, chunkStart, position);\n\t return new Tok(BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockStringValue2.default)(rawValue));\n\t }\n\n\t // SourceCharacter\n\t if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n\t throw (0, _error.syntaxError)(source, position, 'Invalid character within String: ' + printCharCode(code) + '.');\n\t }\n\n\t // Escape Triple-Quote (\\\"\"\")\n\t if (code === 92 && charCodeAt.call(body, position + 1) === 34 && charCodeAt.call(body, position + 2) === 34 && charCodeAt.call(body, position + 3) === 34) {\n\t rawValue += slice.call(body, chunkStart, position) + '\"\"\"';\n\t position += 4;\n\t chunkStart = position;\n\t } else {\n\t ++position;\n\t }\n\t }\n\n\t throw (0, _error.syntaxError)(source, position, 'Unterminated string.');\n\t}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast.Token(_tokenKind.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockString.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _syntaxError.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _syntaxError.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast.Token(_tokenKind.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockString.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _syntaxError.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _syntaxError.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast.Token(_tokenKind.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockString.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _syntaxError.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _syntaxError.syntaxError)(source, position, 'Unterminated string.');\n}",
"function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Tok(_tokenKind.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0, _blockString.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0, _syntaxError.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0, _syntaxError.syntaxError)(source, position, 'Unterminated string.');\n}",
"function blockHeader$1(string, indentPerLevel) {\n var indentIndicator = needIndentIndicator$1(string) ? String(indentPerLevel) : '';\n\n // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n var clip = string[string.length - 1] === '\\n';\n var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n var chomp = keep ? '+' : (clip ? '' : '-');\n\n return indentIndicator + chomp + '\\n';\n}",
"function dedentBlockStringValue(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 var indent = leadingWhitespace(line);\n\n if (indent < line.length && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n\n if (commonIndent === 0) {\n break;\n }\n }\n }\n\n if (commonIndent) {\n for (var _i = 1; _i < lines.length; _i++) {\n lines[_i] = lines[_i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"function parseBlock(code) {\n var lines = code.split(/\\r\\n|\\r|\\n/);\n var tree = [];\n\n var stringNode = {\n type: 'string',\n code: ''\n };\n var blockNode = {};\n var blockDepth = 0;\n\n\n while (lines.length) {\n parseInBlock();\n }\n\n function pushStringNode() {\n if (!stringNode.code) return;\n var text = stringNode.code.replace(/^\\n+/, '');\n text = text.replace(/\\n+$/, '');\n if (text) {\n stringNode.code = text;\n tree.push(stringNode);\n }\n stringNode = {\n type: 'string',\n code: ''\n };\n }\n\n function parseLine() {\n if (blockDepth !== 0) return;\n\n var text = lines.shift();\n var re = /^@import\\s+(?:url\\()?(\\'|\\\")?([^\\)]+)\\1\\)?;?\\s*$/;\n\n var m = match(text, 'import');\n if (!m) {\n m = text.match(re);\n m = m ? m[2]: null;\n }\n if (m) {\n pushStringNode();\n tree.push({\n id: m,\n type: 'import'\n });\n } else {\n stringNode.code = [stringNode.code, text].join('\\n');\n }\n }\n\n function parseInBlock() {\n var text = lines[0];\n var start = match(text, 'block');\n if (start) {\n lines = lines.slice(1);\n if (blockDepth === 0) {\n pushStringNode();\n blockNode.id = start;\n blockNode.type = 'block';\n blockNode.code = '';\n } else {\n blockNode.code = [blockNode.code, text].join('\\n');\n }\n blockDepth++;\n return;\n }\n /*! endblock id */\n var re = /\\/\\*!\\s*endblock(\\s+[^\\*]*)?\\s*\\*\\/$/;\n var end = text.match(re);\n if (end) {\n blockDepth--;\n if (blockDepth < 0) {\n throw new Error('block indent error.');\n }\n\n lines = lines.slice(1);\n if (blockDepth === 0) {\n blockNode.code = parseBlock(blockNode.code);\n tree.push(blockNode);\n // reset block node\n blockNode = {};\n } else {\n blockNode.code = [blockNode.code, text].join('\\n');\n }\n return;\n }\n if (blockDepth > 0) {\n lines = lines.slice(1);\n blockNode.code = [blockNode.code, text].join('\\n');\n } else {\n parseLine();\n }\n }\n\n if (blockDepth !== 0) {\n throw new Error('block not finished.');\n }\n\n pushStringNode();\n return tree;\n}",
"function parseNextString()\r\n{\r\n\tvar t, n\r\n\tvar blocklevel\r\n\t\r\n\tn = \"\"\r\n\tblocklevel = 0\r\n\t\r\n\tt = parseNextWord()\r\n\tif (stop) return \"N0pe.\" // +++ STOP +++\r\n\tif (t != delimiterBlockBegin)\r\n\t{\r\n\t\terror(invalidImmediateStringValue, true)\r\n\t\treturn \"N0pe.\"\r\n\t}\r\n\tt = parseNextWord()\r\n\tif (stop) return \"N0pe.\" // +++ STOP +++\r\n\twhile (true)\r\n\t{\r\n\t\tif (t == delimiterBlockEnd && !blocklevel) break\r\n\r\n\t\tif (stop) return // +++ STOP +++\r\n\t\tif (t == delimiterBlockBegin) blocklevel++\r\n\t\tif (t == delimiterBlockEnd) blocklevel--\r\n\t\tif (n == \"\") n = t\r\n\t\telse n += \" \" + t\r\n\t\tt = parseNextWord()\r\n\t\tif (stop) return \"N0pe.\" // +++ STOP +++\r\n\t}\r\n\treturn n\r\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? \"\\\"\\\"\\\"\".concat(escaped.replace(/\"$/, '\"\\n'), \"\\\"\\\"\\\"\") : \"\\\"\\\"\\\"\\n\".concat(isDescription ? escaped : indent(escaped), \"\\n\\\"\\\"\\\"\");\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}",
"makeStringBlock(block) {\n return block[0] + '-' + block[1]\n }",
"function printBlockString(value, isDescription) {\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + value.replace(/\"\"\"/g, '\\\\\"\"\"') + '\"\"\"' : isDescription ? '\"\"\"\\n' + value.replace(/\"\"\"/g, '\\\\\"\"\"') + '\\n\"\"\"' : indent('\"\"\"\\n' + value.replace(/\"\"\"/g, '\\\\\"\"\"')) + '\\n\"\"\"';\n}",
"function recursivelyBuildCodeTree(strBlock) {\n //console.log(\"recursivelyBuildCodeTree called with: \");\n //console.log(strBlock);\n if (strBlock.length>0) {\n var subBlocks = [];\n var startIndex = 0;\n var bracketCount = 0;\n \n //initial brackets\n if (strBlock[0] ===\"(\" && strBlock[strBlock.length-1] ===\")\") {\n startIndex = 1;\n bracketCount++;\n \n //tracking expressions\n //this time tried traditional for-loop with indexes for applying recursion to strBlock \n for (var i=1; i< strBlock.length-1; ++i) {\n //subexpression\n if (strBlock[i] ===\"(\") {\n \n //console.log(\"Subexpression!\");\n bracketCount++;\n \n var closedBracketCount = bracketCount-1;\n \n //searches for closing bracket, then slices and recurses\n for (var j=i+1; j< strBlock.length; ++j) {\n //console.log(\"i:\"+ i + \", j:\" +j);\n if (strBlock[j] ===\"(\")\n bracketCount++;\n else if (strBlock[j] ===\")\"){\n bracketCount--;\n if (closedBracketCount == bracketCount) {\n //console.log(\"Found closing bracket!\");\n var subExpression = recursivelyBuildCodeTree(strBlock.slice(startIndex,j+1));\n subBlocks.push(subExpression);\n startIndex =j+1;\n i=j; //i++ is done everytime\n j = strBlock.length; //exit inner loop\n }\n }\n }\n if (closedBracketCount < bracketCount) {\n console.log(\"Missing brackets\");\n return null;\n }\n }\n else if (strBlock[j] ===\")\"){\n bracketCount--;\n }\n //singleton, directly add to exp tree\n else {\n var singleton = strBlock.slice(startIndex,i+1)[0];\n //console.log(\"Singleton: \");\n //console.log(singleton);\n subBlocks.push(singleton);\n startIndex=i+1;\n }\n }\n \n // decrement for closing brackets here \n bracketCount--;\n }\n else {\n console.log(\"Bracket-less array code block!\");\n return null;\n }\n if (bracketCount !== 0)\n console.log(\"Bracket count failed, produced :\" + bracketCount + \" instead of expected value 0\");\n return subBlocks;\n }\n else if (strBlock.length == 0)\n //should not be brackets\n return strBlock[0];\n else \n console.log(\"Null element!!!\");\n return null;\n \n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n } // @internal",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n var i;\n var char = 0;\n var prevChar = null;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count the first line correctly\n var plain = isPlainSafeFirst(codePointAt(string, 0))\n && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n if (singleLineOnly || forceQuotes) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n char = codePointAt(string, i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n plain = plain && isPlainSafe(char, prevChar, inblock);\n prevChar = char;\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n if (plain && !forceQuotes && !testAmbiguousType(string)) {\n return STYLE_PLAIN;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n if (!forceQuotes) {\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n }\n return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + escaped.replace(/\"$/, '\"\\n') + '\"\"\"' : '\"\"\"\\n' + (isDescription ? escaped : indent(escaped)) + '\\n\"\"\"';\n }",
"function printBlockString(value, isDescription) {\n\t return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + value.replace(/\"\"\"/g, '\\\\\"\"\"') + '\"\"\"' : isDescription ? '\"\"\"\\n' + value.replace(/\"\"\"/g, '\\\\\"\"\"') + '\\n\"\"\"' : indent('\"\"\"\\n' + value.replace(/\"\"\"/g, '\\\\\"\"\"')) + '\\n\"\"\"';\n\t}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + escaped.replace(/\"$/, '\"\\n') + '\"\"\"' : '\"\"\"\\n' + (isDescription ? escaped : indent(escaped)) + '\\n\"\"\"';\n}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + escaped.replace(/\"$/, '\"\\n') + '\"\"\"' : '\"\"\"\\n' + (isDescription ? escaped : indent(escaped)) + '\\n\"\"\"';\n}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + escaped.replace(/\"$/, '\"\\n') + '\"\"\"' : '\"\"\"\\n' + (isDescription ? escaped : indent(escaped)) + '\\n\"\"\"';\n}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + escaped.replace(/\"$/, '\"\\n') + '\"\"\"' : '\"\"\"\\n' + (isDescription ? escaped : indent(escaped)) + '\\n\"\"\"';\n}",
"function printBlockString(value, isDescription) {\n var escaped = value.replace(/\"\"\"/g, '\\\\\"\"\"');\n return (value[0] === ' ' || value[0] === '\\t') && value.indexOf('\\n') === -1 ? '\"\"\"' + escaped.replace(/\"$/, '\"\\n') + '\"\"\"' : '\"\"\"\\n' + (isDescription ? escaped : indent(escaped)) + '\\n\"\"\"';\n}",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n} // @internal",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n} // @internal",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n} // @internal",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n} // @internal",
"function dedentBlockStringValue(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 = getBlockStringIndentation(lines);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n while (lines.length > 0 && isBlank(lines[0])) {\n lines.shift();\n }\n\n while (lines.length > 0 && isBlank(lines[lines.length - 1])) {\n lines.pop();\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.join('\\n');\n} // @internal",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n}",
"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 the first line correctly\n var plain = isPlainSafeFirst(string.charCodeAt(0))\n && !isWhitespace(string.charCodeAt(string.length - 1));\n\n if (singleLineOnly) {\n // Case: no block styles.\n // Check for disallowed characters to rule out plain and single.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n } else {\n // Case: block styles permitted.\n for (i = 0; i < string.length; i++) {\n char = string.charCodeAt(i);\n if (char === CHAR_LINE_FEED) {\n hasLineBreak = true;\n // Check if any line can be folded.\n if (shouldTrackWidth) {\n hasFoldableLine = hasFoldableLine ||\n // Foldable line = too long, and not more-indented.\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' ');\n previousLineBreak = i;\n }\n } else if (!isPrintable(char)) {\n return STYLE_DOUBLE;\n }\n prev_char = i > 0 ? string.charCodeAt(i - 1) : null;\n plain = plain && isPlainSafe(char, prev_char);\n }\n // in case the end is missing a \\n\n hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n (i - previousLineBreak - 1 > lineWidth &&\n string[previousLineBreak + 1] !== ' '));\n }\n // Although every style can represent \\n without escaping, prefer block styles\n // for multiline, since they're more readable and they don't add empty lines.\n // Also prefer folding a super-long line.\n if (!hasLineBreak && !hasFoldableLine) {\n // Strings interpretable as another type have to be quoted;\n // e.g. the string 'true' vs. the boolean true.\n return plain && !testAmbiguousType(string)\n ? STYLE_PLAIN : STYLE_SINGLE;\n }\n // Edge case: block indentation indicator can only have one digit.\n if (indentPerLevel > 9 && needIndentIndicator(string)) {\n return STYLE_DOUBLE;\n }\n // At this point we know block styles are valid.\n // Prefer literal style unless we want to fold.\n return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\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.5972885",
"0.59646964",
"0.596292",
"0.5959185",
"0.59550726",
"0.5954645",
"0.5954645",
"0.5944691",
"0.5944691",
"0.5944691",
"0.5944691",
"0.5943482",
"0.59155846",
"0.59155846",
"0.59155846",
"0.5878019",
"0.5852701",
"0.57885945",
"0.56911445",
"0.5679361",
"0.5674919",
"0.5674919",
"0.5674919",
"0.5674919",
"0.5663286",
"0.5617211",
"0.5617211",
"0.5617211",
"0.5617211",
"0.5617211",
"0.5617211",
"0.5605441",
"0.55909264",
"0.55901444",
"0.55843645",
"0.55595756",
"0.55595756",
"0.55595756",
"0.55595756",
"0.55589867",
"0.555142",
"0.55441064",
"0.55441064",
"0.55441064",
"0.55441064",
"0.55441064",
"0.55357677",
"0.55357677",
"0.55357677",
"0.55357677",
"0.55357677",
"0.5534262",
"0.5534262",
"0.5534262",
"0.5534262",
"0.5534262",
"0.5534262"
] |
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 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 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 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 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 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 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 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 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 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}",
"writeValue() { }",
"function createScalarToken(value, context) {\n const { implicitKey = false, indent, inFlow = false, offset = -1, type = 'PLAIN' } = context;\n const source = stringifyString.stringifyString({ type, value }, {\n implicitKey,\n indent: indent > 0 ? ' '.repeat(indent) : '',\n inFlow,\n options: { blockQuote: true, lineWidth: -1 }\n });\n const end = context.end ?? [\n { type: 'newline', offset: -1, indent, source: '\\n' }\n ];\n switch (source[0]) {\n case '|':\n case '>': {\n const he = source.indexOf('\\n');\n const head = source.substring(0, he);\n const body = source.substring(he + 1) + '\\n';\n const props = [\n { type: 'block-scalar-header', offset, indent, source: head }\n ];\n if (!addEndtoBlockProps(props, end))\n props.push({ type: 'newline', offset: -1, indent, source: '\\n' });\n return { type: 'block-scalar', offset, indent, props, source: body };\n }\n case '\"':\n return { type: 'double-quoted-scalar', offset, indent, source, end };\n case \"'\":\n return { type: 'single-quoted-scalar', offset, indent, source, end };\n default:\n return { type: 'scalar', offset, indent, source, end };\n }\n}",
"function setScalarValue(token, value, context = {}) {\n let { afterKey = false, implicitKey = false, inFlow = false, type } = context;\n let indent = 'indent' in token ? token.indent : null;\n if (afterKey && typeof indent === 'number')\n indent += 2;\n if (!type)\n switch (token.type) {\n case 'single-quoted-scalar':\n type = 'QUOTE_SINGLE';\n break;\n case 'double-quoted-scalar':\n type = 'QUOTE_DOUBLE';\n break;\n case 'block-scalar': {\n const header = token.props[0];\n if (header.type !== 'block-scalar-header')\n throw new Error('Invalid block scalar header');\n type = header.source[0] === '>' ? 'BLOCK_FOLDED' : 'BLOCK_LITERAL';\n break;\n }\n default:\n type = 'PLAIN';\n }\n const source = stringifyString.stringifyString({ type, value }, {\n implicitKey: implicitKey || indent === null,\n indent: indent !== null && indent > 0 ? ' '.repeat(indent) : '',\n inFlow,\n options: { blockQuote: true, lineWidth: -1 }\n });\n switch (source[0]) {\n case '|':\n case '>':\n setBlockScalarValue(token, source);\n break;\n case '\"':\n setFlowScalarValue(token, source, 'double-quoted-scalar');\n break;\n case \"'\":\n setFlowScalarValue(token, source, 'single-quoted-scalar');\n break;\n default:\n setFlowScalarValue(token, source, 'scalar');\n }\n}",
"function scalar(value) {\n var result = new Observable(function (subscriber) {\n subscriber.next(value);\n subscriber.complete();\n });\n result._isScalar = true;\n result.value = value;\n return result;\n }",
"function TypedObjectSetScalar(descr, typedObj, offset, fromValue) {\n assert(DESCR_KIND(descr) === JS_TYPEREPR_SCALAR_KIND,\n \"Expected scalar type descriptor\");\n var type = DESCR_TYPE(descr);\n switch (type) {\n case JS_SCALARTYPEREPR_INT8:\n return Store_int8(typedObj, offset,\n TO_INT32(fromValue) & 0xFF);\n\n case JS_SCALARTYPEREPR_UINT8:\n return Store_uint8(typedObj, offset,\n TO_UINT32(fromValue) & 0xFF);\n\n case JS_SCALARTYPEREPR_UINT8_CLAMPED:\n var v = ClampToUint8(+fromValue);\n return Store_int8(typedObj, offset, v);\n\n case JS_SCALARTYPEREPR_INT16:\n return Store_int16(typedObj, offset,\n TO_INT32(fromValue) & 0xFFFF);\n\n case JS_SCALARTYPEREPR_UINT16:\n return Store_uint16(typedObj, offset,\n TO_UINT32(fromValue) & 0xFFFF);\n\n case JS_SCALARTYPEREPR_INT32:\n return Store_int32(typedObj, offset,\n TO_INT32(fromValue));\n\n case JS_SCALARTYPEREPR_UINT32:\n return Store_uint32(typedObj, offset,\n TO_UINT32(fromValue));\n\n case JS_SCALARTYPEREPR_FLOAT32:\n return Store_float32(typedObj, offset, +fromValue);\n\n case JS_SCALARTYPEREPR_FLOAT64:\n return Store_float64(typedObj, offset, +fromValue);\n }\n\n assert(false, \"Unhandled scalar type: \" + type);\n return undefined;\n}",
"function formatScalar(value, units) {\n return units.conversion(value).toFixed(units.precision);\n }",
"function floatScalar(val) {\n if (typeof val === 'number') {\n return val;\n }\n if (typeof val === 'boolean') {\n return val ? 1 : 0;\n }\n if (typeof val === 'string') {\n return parseFloat(val);\n }\n if (val instanceof Char) {\n return val.code;\n }\n }",
"function scalar(value) {\n var result = new Observable_Observable(function (subscriber) {\n subscriber.next(value);\n subscriber.complete();\n });\n result._isScalar = true;\n result.value = value;\n return result;\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"function scalarScalar(a, b) {\n var x = a + b\n var bv = x - a\n var av = x - bv\n var br = b - bv\n var ar = a - av\n var y = ar + br\n if(y) {\n return [y, x]\n }\n return [x]\n}",
"get type() {\n return 'Scalar';\n }",
"function formatScalar(value, units) {\n return units.conversion(value).toFixed(units.precision);\n }",
"function _scalar( mixed ) {\n\t\treturn\ttypeof mixed == 'number' && 'number' ||\n\t\t\t\t\t\ttypeof mixed == 'string' && 'string' ||\n\t\t\t\t\t\ttypeof mixed == 'boolean' && 'boolean' ||\n\t\t\t\t\t\ttypeof mixed == 'undefined' && 'undefined' ||\n\t\t\t\t\t\tfalse;\n\t}",
"function intScalar(raw) {\n \tformatted = \"\";\n \t\n \tif(raw > 999999) {\n \t\tmod = (raw / 1000000).toFixed(2);\n \t\tformatted = mod + \"MB\";\n \t} else if(raw > 999) {\n \t\tmod = (raw / 1000).toFixed(2);\n \t\tformatted = mod + \"KB\";\n \t} else {\n \t\tformatted = raw.toString();\n }\n \t\n \treturn formatted;\n }",
"multiplyScalar(s) {\n\t\tthis.x *= s;\n\t\tthis.y *= s;\n\t\treturn this;\n\t}",
"writeExpr(outExpr) {\n return this._generate(\"Write\",this._extract(outExpr),\"Integer\");\n }",
"function multiplyScalar(matrix, scalar) {\n for (var i = 0; i < matrix.length; i++) {\n matrix[i] *= scalar;\n }\n\n return matrix;\n}",
"parseScalarTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('scalar');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.SCALAR_TYPE_DEFINITION,\n description,\n name,\n directives,\n });\n }",
"readScalar(propertyName, record, data, required) {\n if (!hasOwnProperty.call(record, propertyName)) {\n if (required !== false) {\n this.markMissing();\n return;\n }\n this.checkIfChanged(undefined);\n return;\n }\n this.assignScalar(propertyName, data, record[propertyName]);\n }",
"function s2d(scalar){\n\t\treturn JSBigInt.parse(swapEndian(scalar), 16).toString();\n\t}",
"function Scalar(bigInt /* BN */, curve /* Curve */){\n this._scalar = bigInt;\n this._curve = curve;\n}",
"function origin2PhysicsScalar(coordinate, value){\n var value = parseFloat(value);\n return coordinate == \"x\"? value + Globals.origin[0]: value + Globals.origin[1];\n}",
"function hash_to_scalar(points){\n var hash = sha256.create();\n for (var i = 0; i < points.length; i++){\n hash.update(to_hex(points[i].to_bytes()));\n }\n var points_hash = hash.digest(); \n var b1 = new BN(points_hash);\n var b2 = new BN(1);\n return new Scalar(b1.add(b2)); \n}",
"function write() {}",
"parseScalarTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('scalar');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n\n if (directives.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.SCALAR_TYPE_EXTENSION,\n name,\n directives,\n });\n }",
"function parseScalarTypeDefinition(lexer) {\n\t var start = lexer.token;\n\t expectKeyword(lexer, 'scalar');\n\t var name = parseName(lexer);\n\t var directives = parseDirectives(lexer);\n\t return {\n\t kind: _kinds.SCALAR_TYPE_DEFINITION,\n\t name: name,\n\t directives: directives,\n\t loc: loc(lexer, start)\n\t };\n\t}",
"addMat4Scalar(m, s, dest) {\n if (!dest) {\n dest = m;\n }\n dest[0] = m[0] + s;\n dest[1] = m[1] + s;\n dest[2] = m[2] + s;\n dest[3] = m[3] + s;\n dest[4] = m[4] + s;\n dest[5] = m[5] + s;\n dest[6] = m[6] + s;\n dest[7] = m[7] + s;\n dest[8] = m[8] + s;\n dest[9] = m[9] + s;\n dest[10] = m[10] + s;\n dest[11] = m[11] + s;\n dest[12] = m[12] + s;\n dest[13] = m[13] + s;\n dest[14] = m[14] + s;\n dest[15] = m[15] + s;\n return dest;\n }",
"function parseScalarTypeDefinition(lexer$$1) {\n var start = lexer$$1.token;\n var description = parseDescription(lexer$$1);\n expectKeyword(lexer$$1, 'scalar');\n var name = parseName(lexer$$1);\n var directives = parseDirectives(lexer$$1, true);\n return {\n kind: kinds.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer$$1, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n\t var start = lexer.token;\n\t expectKeyword(lexer, 'extend');\n\t expectKeyword(lexer, 'scalar');\n\t var name = parseName(lexer);\n\t var directives = parseDirectives(lexer, true);\n\t if (directives.length === 0) {\n\t throw unexpected(lexer);\n\t }\n\t return {\n\t kind: _kinds.SCALAR_TYPE_EXTENSION,\n\t name: name,\n\t directives: directives,\n\t loc: loc(lexer, start)\n\t };\n\t}",
"function parseScalarTypeDefinition(lexer) {\n\t var start = lexer.token;\n\t var description = parseDescription(lexer);\n\t expectKeyword(lexer, 'scalar');\n\t var name = parseName(lexer);\n\t var directives = parseDirectives(lexer, true);\n\t return {\n\t kind: _kinds.SCALAR_TYPE_DEFINITION,\n\t description: description,\n\t name: name,\n\t directives: directives,\n\t loc: loc(lexer, start)\n\t };\n\t}",
"function parseScalarTypeExtension(lexer$$1) {\n var start = lexer$$1.token;\n expectKeyword(lexer$$1, 'extend');\n expectKeyword(lexer$$1, 'scalar');\n var name = parseName(lexer$$1);\n var directives = parseDirectives(lexer$$1, true);\n if (directives.length === 0) {\n throw unexpected(lexer$$1);\n }\n return {\n kind: kinds.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer$$1, start)\n };\n}",
"scale(scalar)\n\t{\n\t\treturn new Quaternion(this._w * scalar, this._x * scalar, this._y * scalar, this._z * scalar);\n\t}",
"function parseScalarTypeDefinition(parser) {\n\t var start = parser.token.start;\n\t expectKeyword(parser, 'scalar');\n\t var name = parseName(parser);\n\t return {\n\t kind: _kinds.SCALAR_TYPE_DEFINITION,\n\t name: name,\n\t loc: loc(parser, start)\n\t };\n\t}",
"function randnScalar() {\n\n var x1;\n var x2;\n var w;\n var y1;\n var y2;\n \tdo {\n\t x1 = 2.0 * Math.random() - 1.0;\n\t x2 = 2.0 * Math.random() - 1.0;\n\t w = x1 * x1 + x2 * x2;\n\t } while ( w >= 1.0 );\n\n\t w = Math.sqrt( (-2.0 * Math.log( w ) ) / w );\n\t y1 = x1 * w;\n\t y2 = x2 * w;\n\t \n\t return y1;\n}",
"function scalar(scalar, vector){\r\n return {x: vector.x * scalar, y: vector.y * scalar}; \r\n}",
"static multiplyScalar(v, s) {\n\t\treturn new vector(v.x*s, v.y*s);\n\t}",
"writeRaw(pos, value) {\n // TODO: Grow?\n this.vec[pos] = value;\n }",
"writeRaw(pos, value) {\n // TODO: Grow?\n this.vec[pos] = value;\n }",
"writeRaw(pos, value) {\n // TODO: Grow?\n this.vec[pos] = value;\n }",
"function writeFixedPoint32(writer, value) {\n writeInt32(writer, value * (1 << 16));\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n\n return {\n kind: Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"writeValue(value) {\n return this._writeData(this._getValue(value));\n }",
"writeValue(value) {\n return this._writeData(this._getValue(value));\n }",
"writeValue(value) {\n return this._writeData(this._getValue(value));\n }",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n\n return {\n kind: _kinds__WEBPACK_IMPORTED_MODULE_6__[\"Kind\"].SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n\n return {\n kind: _kinds__WEBPACK_IMPORTED_MODULE_5__[\"Kind\"].SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n\n return {\n kind: _kinds__WEBPACK_IMPORTED_MODULE_5__[\"Kind\"].SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer);\n return {\n kind: _kinds.SCALAR_TYPE_DEFINITION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer);\n return {\n kind: _kinds.SCALAR_TYPE_DEFINITION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer);\n return {\n kind: _kinds.SCALAR_TYPE_DEFINITION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer);\n return {\n kind: _kinds.SCALAR_TYPE_DEFINITION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer);\n return {\n kind: _kinds.SCALAR_TYPE_DEFINITION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer);\n return {\n kind: _kinds.SCALAR_TYPE_DEFINITION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n return {\n kind: _kinds.Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n return {\n kind: _kinds.Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n return {\n kind: _kinds.Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n return {\n kind: _kinds.Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"addScalarMat4(s, m, dest) {\n return math.addMat4Scalar(m, s, dest);\n }",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n\n return {\n kind: _kinds__WEBPACK_IMPORTED_MODULE_4__[\"Kind\"].SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeExtension(lexer) {\n var start = lexer.token;\n expectKeyword(lexer, 'extend');\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n\n if (directives.length === 0) {\n throw unexpected(lexer);\n }\n\n return {\n kind: _kinds.Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds.Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds.Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds.Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds.Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds.Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function random_scalar() {\n return primitive_ops_1.sc_reduce32(rand_32());\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds__WEBPACK_IMPORTED_MODULE_5__[\"Kind\"].SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}",
"function parseScalarTypeDefinition(lexer) {\n var start = lexer.token;\n var description = parseDescription(lexer);\n expectKeyword(lexer, 'scalar');\n var name = parseName(lexer);\n var directives = parseDirectives(lexer, true);\n return {\n kind: _kinds__WEBPACK_IMPORTED_MODULE_5__[\"Kind\"].SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: loc(lexer, start)\n };\n}"
] |
[
"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.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.5507258",
"0.54730266",
"0.5439732",
"0.5434037",
"0.5366273",
"0.5349581",
"0.53374493",
"0.53303695",
"0.5262413",
"0.5239329",
"0.52272916",
"0.5197911",
"0.519203",
"0.5165693",
"0.51650786",
"0.51249576",
"0.51138705",
"0.51127464",
"0.5103132",
"0.5101824",
"0.50922817",
"0.5080593",
"0.50611526",
"0.5049827",
"0.5039859",
"0.50304645",
"0.500721",
"0.50067997",
"0.50067997",
"0.50067997",
"0.500283",
"0.49896708",
"0.49893177",
"0.49893177",
"0.49893177",
"0.49728566",
"0.49662068",
"0.49662068",
"0.4964464",
"0.4964464",
"0.4964464",
"0.4964464",
"0.4964464",
"0.4964464",
"0.49641472",
"0.49641472",
"0.49641472",
"0.49641472",
"0.4963324",
"0.49618885",
"0.49535507",
"0.49477553",
"0.49477553",
"0.49477553",
"0.49477553",
"0.49477553",
"0.49462697",
"0.4928168",
"0.49117905",
"0.49117905"
] |
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\");\n\t\t\t\tcount = 0;\n\t\t\t} else {\n\t\t\t\tnewStr.push(char);\n\t\t\t}\n\t\t}\n\t\treturn newStr.join(\"\");\n\t}",
"function wrapAfter40Chars(str) {\n let line = str.length;\n let i = 0;\n let maxChar = 40;\n while (line > maxChar) {\n line = line - maxChar;\n i = i + maxChar;\n str = str.substring(0, maxChar) + \"\\n\" + str.substring(maxChar);\n }\n return str;\n}",
"function lineBreakString(str, metrics, maxWidth, lineDelimiter)\r\n{\r\n if (!lineDelimiter)\r\n lineDelimiter = '\\n';\r\n\r\n var width = metrics.getWidth(str);\r\n if (width < maxWidth)\r\n return str;\r\n\r\n var rb = [];\r\n var sp = 0;\r\n var sb = [str.charAt(0)];\r\n var wordFragment;\r\n\r\n for (var i = 1; i < str.length; i++)\r\n {\r\n var c = str.charAt(i);\r\n sb.push(c);\r\n if (c == ' ')\r\n sp = i;\r\n\r\n if (metrics.getWidth(sb.join('')) < maxWidth)\r\n continue;\r\n\r\n if (c != ' ' && sp > 0)\r\n {\r\n // Don't put a line break in the middle of a word\r\n var i1 = i+1;\r\n if (i1 > str.length)\r\n i1 = str.length;\r\n wordFragment = str.substring(sp+1,i1);\r\n sb = sb.slice(0,sp);\r\n }\r\n else\r\n {\r\n wordFragment = sb.pop();\r\n }\r\n\r\n rb.push(sb.join(''));\r\n sp = 0;\r\n sb = [];\r\n sb.push(wordFragment);\r\n }\r\n\r\n if (sb.length > 0)\r\n rb.push(sb.join(''));\r\n\r\n return rb.join(lineDelimiter);\r\n}",
"_writeLine(str) {\n var line, lineContent, lineContentLength, remaining, roomLeft, toAppend, toAppendLength, toPrepend, toPrependLength;\n // we'll be cutting from our string as we go\n remaining = new SpecialString(str);\n while (true) {\n // left margin...\n // this will continue until nothing is left of our block.\n toPrepend = this._toPrependToLine();\n // ... and its length\n toPrependLength = new SpecialString(toPrepend).length;\n // right margin...\n toAppend = this._toAppendToLine();\n // ... and its length\n toAppendLength = new SpecialString(toAppend).length;\n // how much room is left for content\n roomLeft = this._layout._config.terminalWidth - (toPrependLength + toAppendLength);\n // how much room each line of content will have\n lineContentLength = Math.min(this._config.width, roomLeft);\n // cut line content, only for the amount needed\n lineContent = remaining.cut(0, lineContentLength, true);\n // line will consist of both margins and the content\n line = toPrepend + lineContent.str + toAppend;\n // send it off to layout\n this._layout._appendLine(line);\n if (remaining.isEmpty()) {\n break;\n }\n }\n }",
"function textwrap(s, width) {\n var words = s.trim().split(/\\s+/);\n var lines = [];\n var line = '';\n words.forEach(function (w) {\n var newLength = line.length + w.length;\n if (line.length > 0)\n newLength += 1;\n if (newLength > width) {\n lines.push(line);\n line = '';\n }\n if (line.length > 0)\n line += ' ';\n line += w;\n });\n lines.push(line);\n return lines;\n}",
"function wrapAfter40Chars(str) {\n if(typeof str !== \"string\"){\n return undefined;\n } else {\n let charArray = str.split(\"\");\n for(let i = 0; i <= charArray.length - 1; i++){\n if(i > 0 && i % 40 === 0){\n if (charArray[i] === \" \"){\n charArray.splice(i,1,\"\\n\");\n } else {\n charArray.splice(i,0,\"\\n\");\n }\n }\n }\n return charArray.join(\"\");\n }\n}",
"function foldLine(line, width) {\n\t if (line === '' || line[0] === ' ') return line;\n\n\t // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n\t var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n\t var match;\n\t // start is an inclusive index. end, curr, and next are exclusive.\n\t var start = 0, end, curr = 0, next = 0;\n\t var result = '';\n\n\t // Invariants: 0 <= start <= length-1.\n\t // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n\t // Inside the loop:\n\t // A match implies length >= 2, so curr and next are <= length-2.\n\t while ((match = breakRe.exec(line))) {\n\t next = match.index;\n\t // maintain invariant: curr - start <= width\n\t if (next - start > width) {\n\t end = (curr > start) ? curr : next; // derive end <= length-2\n\t result += '\\n' + line.slice(start, end);\n\t // skip the space that was output as \\n\n\t start = end + 1; // derive start <= length-1\n\t }\n\t curr = next;\n\t }\n\n\t // By the invariants, start <= length-1, so there is something left over.\n\t // It is either the whole string or a part starting from non-whitespace.\n\t result += '\\n';\n\t // Insert a break if the remainder is too long and there is a break available.\n\t if (line.length - start > width && curr > start) {\n\t result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n\t } else {\n\t result += line.slice(start);\n\t }\n\n\t return result.slice(1); // drop extra \\n joiner\n\t}",
"function foldLine(line, width) {\n\t if (line === '' || line[0] === ' ') return line;\n\n\t // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n\t var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n\t var match;\n\t // start is an inclusive index. end, curr, and next are exclusive.\n\t var start = 0, end, curr = 0, next = 0;\n\t var result = '';\n\n\t // Invariants: 0 <= start <= length-1.\n\t // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n\t // Inside the loop:\n\t // A match implies length >= 2, so curr and next are <= length-2.\n\t while ((match = breakRe.exec(line))) {\n\t next = match.index;\n\t // maintain invariant: curr - start <= width\n\t if (next - start > width) {\n\t end = (curr > start) ? curr : next; // derive end <= length-2\n\t result += '\\n' + line.slice(start, end);\n\t // skip the space that was output as \\n\n\t start = end + 1; // derive start <= length-1\n\t }\n\t curr = next;\n\t }\n\n\t // By the invariants, start <= length-1, so there is something left over.\n\t // It is either the whole string or a part starting from non-whitespace.\n\t result += '\\n';\n\t // Insert a break if the remainder is too long and there is a break available.\n\t if (line.length - start > width && curr > start) {\n\t result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n\t } else {\n\t result += line.slice(start);\n\t }\n\n\t return result.slice(1); // drop extra \\n joiner\n\t}",
"function foldLine(line, width) {\n\t if (line === '' || line[0] === ' ') return line;\n\n\t // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n\t var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n\t var match;\n\t // start is an inclusive index. end, curr, and next are exclusive.\n\t var start = 0, end, curr = 0, next = 0;\n\t var result = '';\n\n\t // Invariants: 0 <= start <= length-1.\n\t // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n\t // Inside the loop:\n\t // A match implies length >= 2, so curr and next are <= length-2.\n\t while ((match = breakRe.exec(line))) {\n\t next = match.index;\n\t // maintain invariant: curr - start <= width\n\t if (next - start > width) {\n\t end = (curr > start) ? curr : next; // derive end <= length-2\n\t result += '\\n' + line.slice(start, end);\n\t // skip the space that was output as \\n\n\t start = end + 1; // derive start <= length-1\n\t }\n\t curr = next;\n\t }\n\n\t // By the invariants, start <= length-1, so there is something left over.\n\t // It is either the whole string or a part starting from non-whitespace.\n\t result += '\\n';\n\t // Insert a break if the remainder is too long and there is a break available.\n\t if (line.length - start > width && curr > start) {\n\t result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n\t } else {\n\t result += line.slice(start);\n\t }\n\n\t return result.slice(1); // drop extra \\n joiner\n\t}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function splitLine(ctx, str, font, width){\n\tvar words = str.split(\" \")\n\tctx.font = font\n\tvar l=1\n\tvar r=words.length+1\n\twhile (r-l>1){\n\t\tvar m = Math.floor((l+r)/2)\n\t\tif (ctx.measureText(words.slice(0, 0+m).join(\" \")).width <= width){\n\t\t\tl=m\n\t\t} else {\n\t\t\tr=m\n\t\t}\n\t}\n\treturn new Array(words.slice(0,0+l).join(\" \"), words.slice(0+l,words.length).join(\" \"))\n}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') { return line; }\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine$1(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function wordwrap (str, int_width, str_break, cut) {\n // Wraps buffer to selected number of characters using string break char \n // version: 909.322\n // discuss at: http://phpjs.org/functions/wordwrap\n // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)\n // + improved by: Nick Callen\n // + revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)\n // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\n // + improved by: Sakimori // + bugfixed by: Michael Grier\n // * example 1: wordwrap('Kevin van Zonneveld', 6, '|', true);\n // * returns 1: 'Kevin |van |Zonnev|eld'\n // * example 2: wordwrap('The quick brown fox jumped over the lazy dog.', 20, '\\n');\n // * returns 2: 'The quick brown fox \\njumped over the lazy\\n dog.'\n // * example 3: wordwrap('Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.');\n // * returns 3: 'Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod \\ntempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim \\nveniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea \\ncommodo consequat.'\n // PHP Defaults\n var m = ((arguments.length >= 2) ? arguments[1] : 75 );\n var b = ((arguments.length >= 3) ? arguments[2] : \"\\n\" );\n var c = ((arguments.length >= 4) ? arguments[3] : false);\n \n var i, j, l, s, r;\n \n str += ''; \n if (m < 1) {\n return str;\n }\n for (i = -1, l = (r = str.split(/\\r\\n|\\n|\\r/)).length; ++i < l; r[i] += s) {\n for (s = r[i], r[i] = \"\"; s.length > m; r[i] += s.slice(0, j) + ((s = s.slice(j)).length ? b : \"\")){\n j = c == 2 || (j = s.slice(0, m + 1).match(/\\S*(\\s)?$/))[1] ? m : j.input.length - j[0].length ||\n c == 1 && m || j.input.length + (j = s.slice(m).match(/^\\S*/)).input.length;\n }\n } \n return r.join(\"\\n\");\n}",
"static wrap(str, targetWidth, opts={}) {\n\t\tconst words = str.split(' ')\n\t\tconst lines = []\n\t\tconst lineHeight = 1.1\n\n\t\tlet line = []\n\t\tlet lineBounds = Bounds.empty()\n\t\t_.each(words, (word, i) => {\n\t\t\tlet nextLine = line.concat([word])\n\t\t\tlet nextBounds = Bounds.forText(nextLine.join(' '), opts)\n\n\t\t\tif (nextBounds.width > targetWidth && line.length >= 1) {\n\t\t\t\tlines.push({ str: line.join(' '), width: lineBounds.width, height: lineBounds.height })\n\t\t\t\tline = [word]\n\t\t\t\tlineBounds = Bounds.forText(word, opts)\n\t\t\t} else {\n\t\t\t\tline = nextLine\n\t\t\t\tlineBounds = nextBounds\n\t\t\t}\n\t\t})\n\t\tif (line.length > 0)\n\t\t\tlines.push({ str: line.join(' '), width: lineBounds.width, height: lineBounds.height })\n\n\t\tlet height = 0\n\t\tlet width = 0\n\t\t_.each(lines, (line) => {\n\t\t\theight += line.height\n\t\t\twidth = Math.max(width, line.width)\n\t\t})\n\n\t\treturn {\n\t\t\tlines: lines,\n\t\t\tlineHeight: lineHeight,\n\t\t\twidth: width,\n\t\t\theight: height\n\t\t}\n\t}",
"_padToWidth(s, width, c) {\n c = c || \" \";\n while (s.length < width) s += c;\n return s;\n }",
"function strTruncate(string, width) {\n\tstring = string.replace(/[\\s\\r\\n]+/, ' ');\n\tif (string.length >= width) {\n var result = string[width - 1] === ' ' ? string.substr(0, width - 1) : string.substr(0, string.substr(0, width).lastIndexOf(' '));\n if (result.length === 0)\n result = string.substr(0, width - 1);\n return result;\n\t}\n\treturn string;\n}",
"function fitText(ctx, str, font, style, width){\n\tvar l=36\n\tvar r=100\n\twhile (r-l>1){\n\t\tvar m=Math.floor((l+r)/2)\n\t\tctx.font = style + \" \" + m.toString()+\"px \"+font\n\t\tif (ctx.measureText(str).width <= width){\n\t\t\tl=m\n\t\t} else {\n\t\t\tr=m\n\t\t}\n\t}\n\treturn l\n}",
"function longString(str) {\n if (str.length <= 20) {\n return str + str;\n } else return str.slice(0, Math.floor(str.length / 2));\n}",
"function flowText(ctx, text, width) {\n const breakChars = [\"\\n\", \" \", \"-\", \".\", \",\", \"(\", \")\", \"/\", \";\", \":\"];\n let output = \"\";\n while (text) { // Loop while text remains\n let line = \"\"; // Current line fits in here\n let next = false; // true = stop trying\n let c = 0;\n while (c < breakChars.length) { // Try many breaking characters in order\n next = false;\n while (!next) {\n let measured = ctx.measureText(line+text.split(breakChars[c])[0]+(breakChars[c] == \"\\n\" ? \"\" : breakChars[c])).actualBoundingBoxRight;\n if (measured <= width) { // If next word is narrower than width,\n line += text.split(breakChars[c])[0]+breakChars[c]; // Add word to line\n //console.log(`> ${line}`);\n text = text.split(breakChars[c]).slice(1).join(breakChars[c]); // Remove word from text;\n if (breakChars[c] == \"\\n\") {\n c = breakChars.length;\n next = true;\n } else {\n c = 0;\n }\n } else { // Otherwise,\n next = true; // stop trying;\n //console.log(`Can't fit \"${text.split(breakChars[c])[0]+breakChars[c]}\" onto \"${line}\". (${measured} > ${width})`);\n }\n if (text == \"\") { // Quit once out of text\n next = true;\n c = breakChars.length;\n }\n }\n c++;\n }\n if (line == \"\") { // If nothing fit in\n next = false;\n while (!next) {\n if (ctx.measureText(line+text.charAt(0)).actualBoundingBoxRight <= width) { // If next letter is narrower than width,\n line += text.charAt(0); // Add letter to line\n text = text.slice(1); // Remove letter from text\n } else { // Otherwise,\n next = true; // stop trying\n }\n }\n }\n line = line.split(\"\\n\").filter(l => l).join(\"\\n\");\n output += line+\"\\n\"; // Add line to output\n }\n console.log(\"Finished:\\n\"+output);\n return output;\n}",
"function measure(str, maxWidth) {\n\t var result = {\n\t width: 0,\n\t height: 1\n\t };\n\t var tokens = tokenize(str, maxWidth);\n\t var lineWidth = 0;\n\n\t for (var i = 0; i < tokens.length; i++) {\n\t var token = tokens[i];\n\n\t switch (token.type) {\n\t case TYPE_TEXT:\n\t lineWidth += token.value.length;\n\t break;\n\n\t case TYPE_NEWLINE:\n\t result.height++;\n\t result.width = Math.max(result.width, lineWidth);\n\t lineWidth = 0;\n\t break;\n\t }\n\t }\n\n\t result.width = Math.max(result.width, lineWidth);\n\t return result;\n\t }",
"function realLength(value) {\n var length = value.indexOf('\\n')\n return width(length === -1 ? value : value.slice(0, length))\n}",
"function ensureLength(str, maxLength) {\n var targetLength = Math.max(4, maxLength);\n if (str && str.trim().length >= targetLength / 2) return str;\n str = str || '';\n for (var i = targetLength - str.length; i > 0; i--) str += ' ';\n return str;\n}",
"function wordWrap(str, approxLen, breakStr) {\r\n if (str.length <= approxLen) { // then nothing to do\r\n return str;\r\n }\r\n\r\n var lines = [];\r\n var start = 0;\r\n var end = start + approxLen;\r\n while (end < str.length) {\r\n // find previous space closest to approxLen characters out\r\n while (end > start && str.charAt(end) != ' ') {\r\n --end;\r\n }\r\n\r\n if (end > start) {\r\n lines.push(str.substring(start, end));\r\n start = end + 1;\r\n end = start + approxLen;\r\n\r\n } else { // text contains word longer than approxLen ... punt\r\n //alert(\"wordWrap: string contains word longer than line length \" + approxLen + \"\\n\" + str);\r\n return str;\r\n }\r\n }\r\n lines.push(str.substring(start)); // remember the remnant!\r\n\r\n return lines.join(breakStr);\r\n}",
"function pad(str, width) {\n const len = Math.max(0, width - str.length);\n return str + Array(len + 1).join(' ');\n}",
"function charactersLong(str){\n if( str.length <= 20){\n return str + str;\n } else {\n return str.slice(0,str.length/2);\n } \n }",
"function strWidth(str){\n\t\tif(str.length == 0)return 0;\n\t\t//We need to calculate how long our string will be in pixels\n\t\tvar strWidths = {\" \":9,\"!\":10,\"\\\"\":15,\"#\":17,\"$\":17,\"%\":27,\"&\":22,\"'\":8,\"(\":10,\")\":10,\"*\":12,\"+\":18,\",\":9,\"-\":10,\".\":9,\"/\":9,\"0\":17,\"1\":17,\"2\":17,\"3\":17,\"4\":17,\"5\":17,\"6\":17,\"7\":17,\"8\":17,\"9\":17,\":\":10,\";\":10,\"<\":18,\"=\":18,\">\":18,\"?\":19,\"@\":30,\"A\":22,\"B\":22,\"C\":22,\"D\":22,\"E\":21,\"F\":19,\"G\":24,\"H\":22,\"I\":9,\"J\":17,\"K\":22,\"L\":19,\"M\":25,\"N\":22,\"O\":24,\"P\":21,\"Q\":24,\"R\":22,\"S\":21,\"T\":19,\"U\":22,\"V\":21,\"W\":29,\"X\":21,\"Y\":21,\"Z\":19,\"[\":10,\"]\":10,\"^\":18,\"_\":17,\"`\":10,\"a\":17,\"b\":19,\"c\":17,\"d\":19,\"e\":17,\"f\":10,\"g\":19,\"h\":19,\"i\":9,\"j\":9,\"k\":17,\"l\":9,\"m\":27,\"n\":19,\"o\":19,\"p\":19,\"q\":19,\"r\":12,\"s\":17,\"t\":10,\"u\":19,\"v\":17,\"w\":24,\"x\":17,\"y\":17,\"z\":15,\"{\":12,\"|\":9,\"}\":12,\"~\":18};\n\t\tvar w = 0;\n\t\tfor(var i = 0; i<str.length; i++){\n\t\t\t//If we dont know how wide the char is, set it to 28.5 that is the width of W and no char is wider than that.\n\t\t\tw += fontSize/30*(strWidths[str[i]]?strWidths[str[i]]:28.5);\n\t\t}\n\t\t//This is for the space between the text and the symbol.\n\t\tw += spaceTextIcon;\n\t\treturn w;\n\t}",
"_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.text.length + CLEARANCE) *\n this.cm.defaultCharWidth();\n // Force the size using the actual character count.\n // May result in too much horizontal scrolling, but that is\n // better than the alternative.\n }\n }",
"function checkNumOfLines (text, font, lineWidth,limit) {\n\t\ttext=text.split(' ')\n\t\tlet sumLine=1\n\t\tlet j=0\n\t\tfor (let i=0; i<text.length; i++) {\n\t\t\tfragment=text.slice(j,i+1).join(' ')\n\t\t\tif(getTextWidth(fragment,font)>lineWidth) {\n\t\t\t\tsumLine++\n\t\t\t\tif (sumLine===limit) {break}\n\t\t\t\tj=i\n\t\t\t\ti--\n\t\t\t}\n\t\t}\n\t\treturn sumLine\n\t}",
"static rightAlign(s, width) {\n \tvar columnLen = width;\n \tvar stringLen = s.length;\n \tif (stringLen > columnLen)\n \t\treturn s.substr(0,columnLen-3) + '...';\n \telse\n \t\treturn ' '.repeat(columnLen+1 - stringLen) + s;\n }",
"function longest(str) {\r\n rectMode(CENTER);\r\n words = str.split(\"\\n\");\r\n let longestSize = 0\r\n for (let word of words) {\r\n if (longestSize < textWidth(word)) {\r\n longestSize = textWidth(word);\r\n }\r\n }\r\n let height = 2 * textAscent() * max(words.length - 1, 0.5);\r\n return [longestSize + 50, height + 50];\r\n}",
"function HtmlPlaceString(cad, longMax) {\n if (!longMax) {\n longMax = 50;\n }\n if (cad.length > longMax) {\n arr = splitString(cad, longMax);\n cad = '';\n $.each(arr, function (i, item) {\n cad = cad + item + '<br>';\n });\n }\n return cad;\n}",
"function textWrap(maxLength, input) {\n let lines = [];\n let line = '';\n function pushLine(str, ws) {\n if (line.length && ws) line += ws;\n line += str;\n while (line.length > maxLength) {\n lines.push(line.slice(0, maxLength));\n line = line.slice(maxLength);\n }\n }\n let split = input.split(/(\\s+)/g);\n for (let i = 0; i < split.length; i += 2) {\n pushLine(split[i], i && split[i - 1]);\n }\n if (line.length) lines.push(line);\n return lines;\n}",
"function addSoftLinebreaks(str, encoding){\n var lineLengthMax = 76;\n\n encoding = (encoding || \"base64\").toString().toLowerCase().trim();\n \n if(encoding == \"qp\"){\n return addQPSoftLinebreaks(str, lineLengthMax);\n }else{\n return addBase64SoftLinebreaks(str, lineLengthMax);\n }\n}",
"function paraString(str,dcl,blen) {\n\tif (str == undefined) str = 'undefined';\n\tif (blen == undefined) blen = 80;\n\tvar lines = str.split('\\n');\n\tvar allparas = [];\n\tvar thispara = [];\n\tvar tab = String.fromCharCode(160); tab = tab+tab; tab=tab+tab; tab=tab+tab;\n\tvar breakUpLine = function(line) {\n\t\tif(line.length < blen) {\n\t\t\tprocLine(line);\n\t\t\treturn;\n\t\t}\n\t\tvar nextJ = function(j) {\n\t\t\tif(j > blen) return (j < line.length) ? j+1 : -1\n\t\t\telse if(j == 0) return blen+1;\n\t\t\telse return j-1;\n\t\t}\n\t\tfor(var j=blen;j!=-1;j=nextJ(j)) {\n\t\t\tif(line.substr(j,1) == ' ' || line.substr(j,1) == '\\t') {\n\t\t\t\tprocLine(line.substring(0,j));\n\t\t\t\tbreakUpLine(line.substring(j+1,line.length));\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\tvar procLine = function(line) {\n\t\tvar lblank = true;\n\t\tvar lout = '';\n\t\tif(blen && line.length > blen+20) {\n\t\t\tbreakUpLine(line);\n\t\t\treturn;\n\t\t}\n\t\tfor(var j=0;j<line.length;j++) {\n\t\t\tif (line.substring(j,j+1) == ' ') {\n\t\t\t\tif((j>0 && line.substring(j-1,j) == ' ') || (j<line.length && line.substring(j+1,j+2) == ' '))\n\t\t\t\t\tlout += String.fromCharCode(160);\n\t\t\t\telse\n\t\t\t\t\tlout += ' ';\n\t\t\t}\n\t\t\telse if(line.substring(j,j+1) == '\\t')\n\t\t\t\tlout += tab;\n\t\t\telse if(line.substring(j,j+1) == '\\r');\n\t\t\telse {\n\t\t\t\tlblank = false;\n\t\t\t\tlout += line.substring(j,j+1);\n\t\t\t}\n\t\t}\n\t\tif(!lblank) {\n\t\t\tthispara.push(lout);\n\t\t\tthispara.push(BR());\n\t\t\t}\n\t\telse if (thispara.length > 0) {\n\t\t\tallparas.push(P(thispara));\n\t\t\tthispara = [];\n\t\t}\n\t}\n\tfor(var i=0;i<lines.length;i++) {\n\t\tprocLine(lines[i]);\n\t}\n\tif (thispara.length > 0)\n\t\tallparas.push(P(thispara))\n\treturn DIV({className:dcl},allparas);\n}",
"function truncate_text(textObj, textString, width) {\n var bbox,\n position = 0;\n\n textObj.textContent = textString;\n bbox = textObj.getBBox();\n\n while (bbox.width > width) {\n textObj.textContent = textString.slice(0, --position) + '...';\n bbox = textObj.getBBox();\n\n if (textObj.textContent === '...') {\n break;\n }\n }\n}",
"function truncate_text(textObj, textString, width) {\n var bbox,\n position = 0;\n\n textObj.textContent = textString;\n bbox = textObj.getBBox();\n\n while (bbox.width > width) {\n textObj.textContent = textString.slice(0, --position) + '...';\n bbox = textObj.getBBox();\n\n if (textObj.textContent === '...') {\n break;\n }\n }\n}",
"function ellipsize(text, width, styles, ellipsizeStr) {\n ellipsizeStr = typeof ellipsizeStr !== 'undefined' ? ellipsizeStr : '...';\n\n if (Array.isArray(text)) {\n text.forEach(function (str, i) {\n text[i] = ellipsize(str, width, styles, ellipsizeStr);\n });\n return text;\n }\n\n if (width >= getStringWidth(text, styles)) {\n return text;\n }\n while (width < getStringWidth(text + ellipsizeStr, styles)) {\n if (text.length < 2) {\n break;\n }\n text = text.substring(0, text.length - 1);\n }\n return text.trim() + ellipsizeStr;\n }",
"function repeat(string, width) {\n var result = '';\n var n = width;\n do {\n if (n % 2) {\n result += string;\n }\n n = Math.floor(n / 2);\n /*eslint no-self-assign: 0*/\n string += string;\n } while (n && stringWidth(result) < width);\n\n return wideTruncate(result, width);\n}",
"function ellipsize(text, width, styles, ellipsizeStr) {\n if (ellipsizeStr === void 0) { ellipsizeStr = '...'; }\n if (Array.isArray(text)) {\n var value_1 = [];\n text.forEach(function (str, i) {\n value_1[i] = ellipsize(str, width, styles, ellipsizeStr);\n });\n return value_1;\n }\n var precision = 10000 * config_1.Config.scaleFactor();\n width = Math.ceil(width * precision) / precision;\n if (width >= getStringWidth(text, styles)) {\n return text;\n }\n while (width < getStringWidth(text + ellipsizeStr, styles)) {\n if (text.length <= 1) {\n break;\n }\n text = text.substring(0, text.length - 1);\n }\n return text.trim() + ellipsizeStr;\n}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function foldString(string, width) {\n\t // In folded style, $k$ consecutive newlines output as $k+1$ newlines—\n\t // unless they're before or after a more-indented line, or at the very\n\t // beginning or end, in which case $k$ maps to $k$.\n\t // Therefore, parse each chunk as newline(s) followed by a content line.\n\t var lineRe = /(\\n+)([^\\n]*)/g;\n\n\t // first line (possibly an empty line)\n\t var result = (function () {\n\t var nextLF = string.indexOf('\\n');\n\t nextLF = nextLF !== -1 ? nextLF : string.length;\n\t lineRe.lastIndex = nextLF;\n\t return foldLine(string.slice(0, nextLF), width);\n\t }());\n\t // If we haven't reached the first content line yet, don't add an extra \\n.\n\t var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n\t var moreIndented;\n\n\t // rest of the lines\n\t var match;\n\t while ((match = lineRe.exec(string))) {\n\t var prefix = match[1], line = match[2];\n\t moreIndented = (line[0] === ' ');\n\t result += prefix\n\t + (!prevMoreIndented && !moreIndented && line !== ''\n\t ? '\\n' : '')\n\t + foldLine(line, width);\n\t prevMoreIndented = moreIndented;\n\t }\n\n\t return result;\n\t}",
"function fittingString(canvas, str, maxWidth) {\r\n let minWidth=100\r\n let width = canvas.measureText(str).width;\r\n let ellipsis = \"…\";\r\n let ellipsisWidth = canvas.measureText(ellipsis).width;\r\n//判斷圖形是直式還是橫式，目前想法是x-y，如過小於0就是直式，等於0就是正方形，大於0就是橫式\r\n//橫式和正方形文字就照原本的方式顯示，如果是直式，文字就要以直式的方式顯示，但是目前要怎麼做還沒有想法\r\n// 做法1:把每個文字都拆成一個fillText\r\n// 做法二:看看可不可以設定寬度就可以overflow往下擠 \r\n \r\n if (width <= maxWidth || width <= ellipsisWidth) {\r\n return str;\r\n } else {\r\n let len = str.length;\r\n while (width >= maxWidth - ellipsisWidth && len-- > 0) {\r\n str = str.substring(0, len);\r\n width = canvas.measureText(str).width;\r\n }\r\n return str + ellipsis;\r\n }\r\n}",
"function ellipsize(text, width, styles, ellipsizeStr) {\n if (ellipsizeStr === void 0) { ellipsizeStr = '...'; }\n if (Array.isArray(text)) {\n var value_1 = [];\n text.forEach(function (str, i) {\n value_1[i] = ellipsize(str, width, styles, ellipsizeStr);\n });\n return value_1;\n }\n var precision = 10000 * state_1.default().scaleFactor();\n width = Math.ceil(width * precision) / precision;\n if (width >= getStringWidth(text, styles)) {\n return text;\n }\n while (width < getStringWidth(text + ellipsizeStr, styles)) {\n if (text.length <= 1) {\n break;\n }\n text = text.substring(0, text.length - 1);\n }\n return text.trim() + ellipsizeStr;\n}",
"function ellipsize(text, width, styles, ellipsizeStr) {\n if (ellipsizeStr === void 0) { ellipsizeStr = '...'; }\n if (Array.isArray(text)) {\n var value_1 = [];\n text.forEach(function (str, i) {\n value_1[i] = ellipsize(str, width, styles, ellipsizeStr);\n });\n return value_1;\n }\n var precision = 10000 * state_1.default().scaleFactor();\n width = Math.ceil(width * precision) / precision;\n if (width >= getStringWidth(text, styles)) {\n return text;\n }\n while (width < getStringWidth(text + ellipsizeStr, styles)) {\n if (text.length <= 1) {\n break;\n }\n text = text.substring(0, text.length - 1);\n }\n return text.trim() + ellipsizeStr;\n}",
"function f(str) {\n const textToArray = str.split(\"\");\n let firstLine = [];\n let secondLine = [];\n const tab = [\"\\n\"];\n textToArray.forEach(letter => {\n if (firstLine.length <= 40) {\n firstLine.push(letter);\n } else {\n secondLine.push(letter);\n }\n });\n\n return firstLine.join(\"\").trim() + tab + secondLine.join(\"\").trim();\n}",
"function fitStringToWidth(str, width, className) {\n /**\n * A helper to escape 'less than' and 'greater than'\n * @param s the string\n */\n function _escTag(s){ return s.replace(\"<\",\"<\").replace(\">\",\">\");}\n\n // Create a span element that will be used to get the width\n var span = document.createElement(\"span\");\n // Allow a classname to be set to get the right font-size.\n if (className) span.className=className;\n span.style.display='inline';\n span.style.visibility = 'hidden';\n span.style.padding = '0px';\n document.body.appendChild(span);\n\n var result = _escTag(str); // default to the whole string\n span.innerHTML = result;\n // Check if the string will fit in the allowed width. NOTE: if the width\n // can't be determined (offsetWidth==0) the whole string will be returned.\n if (span.offsetWidth > width) {\n var posStart = 0, posMid, posEnd = str.length, posLength;\n // Calculate (posEnd - posStart) integer division by 2 and\n // assign it to posLength. Repeat until posLength is zero.\n while (posLength = (posEnd - posStart) >> 1) {\n posMid = posStart + posLength;\n //Get the string from the begining up to posMid;\n span.innerHTML = _escTag(str.substring(0,posMid)) + '…';\n\n // Check if the current width is too wide (set new end)\n // or too narrow (set new start)\n if ( span.offsetWidth > width ) posEnd = posMid; else posStart=posMid;\n }\n\n result = '<abbr title=\"' + str.replace(/\\\"/g, \""\") + '\">' +\n _escTag(str.substring(0, Math.floor(posStart / 2))) +\n '…' +\n _escTag(str.substring(str.length - Math.ceil(posStart / 2), str.length)) + '<\\/abbr>';\n }\n document.body.removeChild(span);\n return result;\n}",
"reduceDescLength(str, maxChars) {\r\n\t\tif(str !== undefined){\r\n\t\t\treturn (\r\n\t\t\t\tstr.length > maxChars\r\n\t\t\t\t\t? str.substring(0, maxChars - 3) + \"...\" \r\n\t\t\t\t\t: str.substring(0, maxChars)\r\n\t\t\t);\r\n\t\t}\telse {\r\n\t\t\treturn \"This book currently has no description listed.\";\r\n\t\t}\r\n\t}",
"function longText(ctx, text, x, y, maxWidth, lineHeight){\n for(var p = 0; p < text.length; p++){\n var words = text[p].split(' ');\n var line = '';\n for(var n = 0; n < words.length; n++) {\n var testLine = line + words[n] + ' ';\n var metrics = ctx.measureText(testLine);\n var testWidth = metrics.width;\n if (testWidth > maxWidth && n > 0) {\n ctx.fillText(line, x, y);\n line = words[n] + ' ';\n y += lineHeight;\n }\n else {\n line = testLine;\n }\n }\n ctx.fillText(line, x, y);\n y += (lineHeight*1.5);\n }\n }",
"function wrapText (text, maxLineLength) \n {\n const words = text.replace(/[\\r\\n]+/g, ' ').split(' ');\n let lineLength = 0;\n \n // use functional reduce, instead of for loop \n return words.reduce((result, word) => {\n if (lineLength + word.length >= maxLineLength) {\n lineLength = word.length;\n return result + `\\n${word}`; // don't add spaces upfront\n } else {\n lineLength += word.length + (result ? 1 : 0);\n return result ? result + ` ${word}` : `${word}`; // add space only when needed\n }\n }, '');\n }",
"function getMaxLineLength(stringVal) {\n var fieldLength = 0;\n var i = 0;\n var lineStart = 0;\n while (i < stringVal.length) {\n if (stringVal[i] === \"\\n\") {\n fieldLength = Math.max(i - lineStart, fieldLength);\n lineStart = i + 1;\n }\n i++;\n }\n return Math.max(i - lineStart, fieldLength);\n }",
"function wrapAfter40Chars(str) {\n let wrapString = [];\n\n while (str.length > 0 ){\nif (str[0] === ' '){\nstr = str.slice(1);\n}\nlet wraping = str.slice(0,10);\nwrapString.push(wraping);\nstr = str.slice(10);\n }\n return wrapString.join('$')\n}",
"function splitIntoLines(str) {\n\tvar strs = new Array();\n\tvar space = str.indexOf(' ', 60);\n\tstrs[0] = str.substring(0, space);\n\tstrs[1] = str.substring(space + 1);\n\tif (strs[1].length > 60) {\n\t\tspace = strs[1].indexOf(' ', 60);\n\t\tstrs[1] = strs[1].substring(space + 1);\n\t\tstrs[2] = strs[1].substring(0, space);\n\t}\n\treturn strs;\n}",
"function padPrint(val, width, useUnicode) {\n var out = useUnicode? '\\u2502 ' : '| ';\n var padding = out.length + 1 /* for the extra space on the end */;\n out += val.toString();\n while (out.length < width + padding) {\n out += ' ';\n }\n return out;\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.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.61780214",
"0.61651194",
"0.6133084",
"0.6051052",
"0.60483503",
"0.59221095",
"0.59042203",
"0.58610654",
"0.5853202",
"0.58461654",
"0.58104545",
"0.58101314",
"0.5805913",
"0.58013225",
"0.5798232",
"0.5725896",
"0.5724039",
"0.5697902",
"0.56793636",
"0.5599266",
"0.55937713",
"0.55802494",
"0.5570994",
"0.55630493",
"0.5549727",
"0.5540072",
"0.55348676",
"0.5510201",
"0.55056745",
"0.5491004",
"0.54700184",
"0.54700184",
"0.54700184",
"0.5461955",
"0.5456466",
"0.5456466",
"0.54515",
"0.54502034",
"0.542488",
"0.54177964",
"0.54090405",
"0.53950655",
"0.53916985",
"0.5388503",
"0.5386723"
] |
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.text.length + CLEARANCE) *\n this.cm.defaultCharWidth();\n // Force the size using the actual character count.\n // May result in too much horizontal scrolling, but that is\n // better than the alternative.\n }\n }",
"function breakLines(tokens, maxWidth) {\n\t if (!maxWidth) {\n\t maxWidth = Infinity;\n\t }\n\n\t var i = 0;\n\t var lineLength = 0;\n\t var lastTokenWithSpace = -1;\n\n\t while (i < tokens.length) {\n\t /* take all text tokens, remove space, apply linebreaks */\n\t var token = tokens[i];\n\n\t if (token.type == TYPE_NEWLINE) {\n\t /* reset */\n\t lineLength = 0;\n\t lastTokenWithSpace = -1;\n\t }\n\n\t if (token.type != TYPE_TEXT) {\n\t /* skip non-text tokens */\n\t i++;\n\t continue;\n\t }\n\t /* remove spaces at the beginning of line */\n\n\n\t while (lineLength == 0 && token.value.charAt(0) == \" \") {\n\t token.value = token.value.substring(1);\n\t }\n\t /* forced newline? insert two new tokens after this one */\n\n\n\t var _index2 = token.value.indexOf(\"\\n\");\n\n\t if (_index2 != -1) {\n\t token.value = breakInsideToken(tokens, i, _index2, true);\n\t /* if there are spaces at the end, we must remove them (we do not want the line too long) */\n\n\t var arr = token.value.split(\"\");\n\n\t while (arr.length && arr[arr.length - 1] == \" \") {\n\t arr.pop();\n\t }\n\n\t token.value = arr.join(\"\");\n\t }\n\t /* token degenerated? */\n\n\n\t if (!token.value.length) {\n\t tokens.splice(i, 1);\n\t continue;\n\t }\n\n\t if (lineLength + token.value.length > maxWidth) {\n\t /* line too long, find a suitable breaking spot */\n\n\t /* is it possible to break within this token? */\n\t var _index3 = -1;\n\n\t while (1) {\n\t var nextIndex = token.value.indexOf(\" \", _index3 + 1);\n\n\t if (nextIndex == -1) {\n\t break;\n\t }\n\n\t if (lineLength + nextIndex > maxWidth) {\n\t break;\n\t }\n\n\t _index3 = nextIndex;\n\t }\n\n\t if (_index3 != -1) {\n\t /* break at space within this one */\n\t token.value = breakInsideToken(tokens, i, _index3, true);\n\t } else if (lastTokenWithSpace != -1) {\n\t /* is there a previous token where a break can occur? */\n\t var _token = tokens[lastTokenWithSpace];\n\n\t var breakIndex = _token.value.lastIndexOf(\" \");\n\n\t _token.value = breakInsideToken(tokens, lastTokenWithSpace, breakIndex, true);\n\t i = lastTokenWithSpace;\n\t } else {\n\t /* force break in this token */\n\t token.value = breakInsideToken(tokens, i, maxWidth - lineLength, false);\n\t }\n\t } else {\n\t /* line not long, continue */\n\t lineLength += token.value.length;\n\n\t if (token.value.indexOf(\" \") != -1) {\n\t lastTokenWithSpace = i;\n\t }\n\t }\n\n\t i++;\n\t /* advance to next token */\n\t }\n\n\t tokens.push({\n\t type: TYPE_NEWLINE\n\t });\n\t /* insert fake newline to fix the last text line */\n\n\t /* remove trailing space from text tokens before newlines */\n\n\t var lastTextToken = null;\n\n\t for (var _i = 0; _i < tokens.length; _i++) {\n\t var _token2 = tokens[_i];\n\n\t switch (_token2.type) {\n\t case TYPE_TEXT:\n\t lastTextToken = _token2;\n\t break;\n\n\t case TYPE_NEWLINE:\n\t if (lastTextToken) {\n\t /* remove trailing space */\n\t var _arr = lastTextToken.value.split(\"\");\n\n\t while (_arr.length && _arr[_arr.length - 1] == \" \") {\n\t _arr.pop();\n\t }\n\n\t lastTextToken.value = _arr.join(\"\");\n\t }\n\n\t lastTextToken = null;\n\t break;\n\t }\n\t }\n\n\t tokens.pop();\n\t /* remove fake token */\n\n\t return tokens;\n\t }",
"function wrap(text, limit) {\n let lines = Math.ceil(text.length / limit),\n str = \"\";\n for (let i = 1; i <= lines; i++) {\n str += text.slice((i - 1) * limit, i * limit) + \"\\n\";\n }\n return str;\n}",
"function replaceEmptyLines(max, str, isSpecialCase = false) {\n\t\t\tconst repeatTimes = isSpecialCase ? max : max + 1;\n\n\t\t\tif (repeatTimes === 0 || typeof str !== 'string') {\n\t\t\t\treturn '';\n\t\t\t}\n\n\t\t\tconst emptyLFLines = '\\n'.repeat(repeatTimes);\n\t\t\tconst emptyCRLFLines = '\\r\\n'.repeat(repeatTimes);\n\n\t\t\t// TODO: Issue #4985\n\t\t\t// eslint-disable-next-line no-shadow\n\t\t\tlet result;\n\n\t\t\tif (/(\\r\\n)+/g.test(str)) {\n\t\t\t\tresult = str.replace(/(\\r\\n)+/g, ($1) => {\n\t\t\t\t\tif ($1.length / 2 > repeatTimes) {\n\t\t\t\t\t\treturn emptyCRLFLines;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn $1;\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tresult = str.replace(/(\\n)+/g, ($1) => {\n\t\t\t\t\tif ($1.length > repeatTimes) {\n\t\t\t\t\t\treturn emptyLFLines;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn $1;\n\t\t\t\t});\n\t\t\t}\n\n\t\t\treturn result;\n\t\t}",
"function wrapText(limit, strText, fontSize) {\n\n // check if the text is too long for the length limit\n // take into account whether a line break has already been inserted or not\n if (strText.split(\"</br>\")[0].width(fontSize + 'px arial') > limit) {\n\n // get all the words from the first line\n var words = strText.split(\"</br>\")[0].split(\" \");\n\n // put the first line back together except the last word\n var strModifiedText = words[0];\n for (word=1; word<words.length-1; word++) { strModifiedText += \" \" + words[word]; }\n\n // add the last word after re-inserting the break\n strModifiedText += \"</br>\" + words[words.length-1];\n\n // add whatever else may have already been wrapped on the second line\n if (strText.split(\"</br>\").length > 1) strModifiedText += \" \" + strText.split(\"</br>\")[1];\n\n // keep wrapping as needed\n return wrapText(limit, strModifiedText, fontSize);\n\n // no wrapping needed\n } else {\n\n // if there is a second line and it's only got 2-3 characters (likely a number) shorten the length to bring down one more word\n if (strText.split(\"</br>\").length > 1 && strText.split(\"</br>\")[1].length <= 3) return wrapText(limit-15, strText, fontSize);\n else return strText;\n }\n}",
"function wrapAfter40Chars(str) {\n let line = str.length;\n let i = 0;\n let maxChar = 40;\n while (line > maxChar) {\n line = line - maxChar;\n i = i + maxChar;\n str = str.substring(0, maxChar) + \"\\n\" + str.substring(maxChar);\n }\n return str;\n}",
"function foldLine(line, width) {\n\t if (line === '' || line[0] === ' ') return line;\n\n\t // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n\t var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n\t var match;\n\t // start is an inclusive index. end, curr, and next are exclusive.\n\t var start = 0, end, curr = 0, next = 0;\n\t var result = '';\n\n\t // Invariants: 0 <= start <= length-1.\n\t // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n\t // Inside the loop:\n\t // A match implies length >= 2, so curr and next are <= length-2.\n\t while ((match = breakRe.exec(line))) {\n\t next = match.index;\n\t // maintain invariant: curr - start <= width\n\t if (next - start > width) {\n\t end = (curr > start) ? curr : next; // derive end <= length-2\n\t result += '\\n' + line.slice(start, end);\n\t // skip the space that was output as \\n\n\t start = end + 1; // derive start <= length-1\n\t }\n\t curr = next;\n\t }\n\n\t // By the invariants, start <= length-1, so there is something left over.\n\t // It is either the whole string or a part starting from non-whitespace.\n\t result += '\\n';\n\t // Insert a break if the remainder is too long and there is a break available.\n\t if (line.length - start > width && curr > start) {\n\t result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n\t } else {\n\t result += line.slice(start);\n\t }\n\n\t return result.slice(1); // drop extra \\n joiner\n\t}",
"function foldLine(line, width) {\n\t if (line === '' || line[0] === ' ') return line;\n\n\t // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n\t var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n\t var match;\n\t // start is an inclusive index. end, curr, and next are exclusive.\n\t var start = 0, end, curr = 0, next = 0;\n\t var result = '';\n\n\t // Invariants: 0 <= start <= length-1.\n\t // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n\t // Inside the loop:\n\t // A match implies length >= 2, so curr and next are <= length-2.\n\t while ((match = breakRe.exec(line))) {\n\t next = match.index;\n\t // maintain invariant: curr - start <= width\n\t if (next - start > width) {\n\t end = (curr > start) ? curr : next; // derive end <= length-2\n\t result += '\\n' + line.slice(start, end);\n\t // skip the space that was output as \\n\n\t start = end + 1; // derive start <= length-1\n\t }\n\t curr = next;\n\t }\n\n\t // By the invariants, start <= length-1, so there is something left over.\n\t // It is either the whole string or a part starting from non-whitespace.\n\t result += '\\n';\n\t // Insert a break if the remainder is too long and there is a break available.\n\t if (line.length - start > width && curr > start) {\n\t result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n\t } else {\n\t result += line.slice(start);\n\t }\n\n\t return result.slice(1); // drop extra \\n joiner\n\t}",
"function foldLine(line, width) {\n\t if (line === '' || line[0] === ' ') return line;\n\n\t // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n\t var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n\t var match;\n\t // start is an inclusive index. end, curr, and next are exclusive.\n\t var start = 0, end, curr = 0, next = 0;\n\t var result = '';\n\n\t // Invariants: 0 <= start <= length-1.\n\t // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n\t // Inside the loop:\n\t // A match implies length >= 2, so curr and next are <= length-2.\n\t while ((match = breakRe.exec(line))) {\n\t next = match.index;\n\t // maintain invariant: curr - start <= width\n\t if (next - start > width) {\n\t end = (curr > start) ? curr : next; // derive end <= length-2\n\t result += '\\n' + line.slice(start, end);\n\t // skip the space that was output as \\n\n\t start = end + 1; // derive start <= length-1\n\t }\n\t curr = next;\n\t }\n\n\t // By the invariants, start <= length-1, so there is something left over.\n\t // It is either the whole string or a part starting from non-whitespace.\n\t result += '\\n';\n\t // Insert a break if the remainder is too long and there is a break available.\n\t if (line.length - start > width && curr > start) {\n\t result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n\t } else {\n\t result += line.slice(start);\n\t }\n\n\t return result.slice(1); // drop extra \\n joiner\n\t}",
"function foldLine(line, width) {\n if (line === '' || line[0] === ' ') { return line; }\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function foldLine$1(line, width) {\n if (line === '' || line[0] === ' ') return line;\n\n // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n var match;\n // start is an inclusive index. end, curr, and next are exclusive.\n var start = 0, end, curr = 0, next = 0;\n var result = '';\n\n // Invariants: 0 <= start <= length-1.\n // 0 <= curr <= next <= max(0, length-2). curr - start <= width.\n // Inside the loop:\n // A match implies length >= 2, so curr and next are <= length-2.\n while ((match = breakRe.exec(line))) {\n next = match.index;\n // maintain invariant: curr - start <= width\n if (next - start > width) {\n end = (curr > start) ? curr : next; // derive end <= length-2\n result += '\\n' + line.slice(start, end);\n // skip the space that was output as \\n\n start = end + 1; // derive start <= length-1\n }\n curr = next;\n }\n\n // By the invariants, start <= length-1, so there is something left over.\n // It is either the whole string or a part starting from non-whitespace.\n result += '\\n';\n // Insert a break if the remainder is too long and there is a break available.\n if (line.length - start > width && curr > start) {\n result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n } else {\n result += line.slice(start);\n }\n\n return result.slice(1); // drop extra \\n joiner\n}",
"function pollLineStuff() {\n\n var bufsz = 97, // maximum line length\n bufptr = 0x8046, // start at LINBF\n thrufl = 0x81de, // line input done flag\n len = 0;\n\n if (ccemu.rd(thrufl) === 0) { // buffer is in accepting state\n // leading zero\n ccemu.wr(bufptr, 0x00);\n // stuff until we run out message, or hit a carriage return,\n // or the buffer size limit\n while ((len < bufsz) &&\n (offset < text.length) &&\n (nextCharCode() !== 0x0D)\n ) {\n ccemu.wr(bufptr + 1 + len, nextCharCode());\n offset++; // skip carriage returns between lines\n len++;\n }\n // trailing zero\n ccemu.wr(bufptr + 1 + len, 0x00);\n // set THRUFL to indicate the line is complete\n ccemu.wr(thrufl, 0x0D);\n // check why we ended\n if ((len === bufsz) &&\n (offset < text.length) &&\n (nextCharCode() !== 0x0D)) {\n alert('Input line was too long and got split\\r\\n' +\n '(max length is ' + bufsz + ' characters)');\n }\n if (nextCharCode() === 0x0D) {\n offset++; // skip carriage returns between lines\n }\n if (offset === text.length) {\n offset = -1; // signal that we are done\n }\n }\n }",
"autoBreak(arr) {\n let [firstLineLimit, secondLineLimit] = this.limitLetter;\n let middle = firstLineLimit;\n let end = firstLineLimit + secondLineLimit;\n \n const firstLine = arr.slice(0, middle).join(' ').trim();\n const secondLine = arr.slice(middle, end).join(' ').trim();\n \n const brokeLine = `${firstLine}<br/>${secondLine}`;\n return brokeLine;\n }",
"ensureLineGaps(current, mayMeasure) {\n let wrapping = this.heightOracle.lineWrapping;\n let margin = wrapping ? 10000 /* MarginWrap */ : 2000 /* Margin */, halfMargin = margin >> 1, doubleMargin = margin << 1;\n // The non-wrapping logic won't work at all in predominantly right-to-left text.\n if (this.defaultTextDirection != exports.Direction.LTR && !wrapping)\n return [];\n let gaps = [];\n let addGap = (from, to, line, structure) => {\n if (to - from < halfMargin)\n return;\n let sel = this.state.selection.main, avoid = [sel.from];\n if (!sel.empty)\n avoid.push(sel.to);\n for (let pos of avoid) {\n if (pos > from && pos < to) {\n addGap(from, pos - 10 /* SelectionMargin */, line, structure);\n addGap(pos + 10 /* SelectionMargin */, to, line, structure);\n return;\n }\n }\n let gap = find(current, gap => gap.from >= line.from && gap.to <= line.to &&\n Math.abs(gap.from - from) < halfMargin && Math.abs(gap.to - to) < halfMargin &&\n !avoid.some(pos => gap.from < pos && gap.to > pos));\n if (!gap) {\n // When scrolling down, snap gap ends to line starts to avoid shifts in wrapping\n if (to < line.to && mayMeasure && wrapping &&\n mayMeasure.visibleRanges.some(r => r.from <= to && r.to >= to)) {\n let lineStart = mayMeasure.moveToLineBoundary(state.EditorSelection.cursor(to), false, true).head;\n if (lineStart > from)\n to = lineStart;\n }\n gap = new LineGap(from, to, this.gapSize(line, from, to, structure));\n }\n gaps.push(gap);\n };\n for (let line of this.viewportLines) {\n if (line.length < doubleMargin)\n continue;\n let structure = lineStructure(line.from, line.to, this.stateDeco);\n if (structure.total < doubleMargin)\n continue;\n let target = this.scrollTarget ? this.scrollTarget.range.head : null;\n let viewFrom, viewTo;\n if (wrapping) {\n let marginHeight = (margin / this.heightOracle.lineLength) * this.heightOracle.lineHeight;\n let top, bot;\n if (target != null) {\n let targetFrac = findFraction(structure, target);\n let spaceFrac = ((this.visibleBottom - this.visibleTop) / 2 + marginHeight) / line.height;\n top = targetFrac - spaceFrac;\n bot = targetFrac + spaceFrac;\n }\n else {\n top = (this.visibleTop - line.top - marginHeight) / line.height;\n bot = (this.visibleBottom - line.top + marginHeight) / line.height;\n }\n viewFrom = findPosition(structure, top);\n viewTo = findPosition(structure, bot);\n }\n else {\n let totalWidth = structure.total * this.heightOracle.charWidth;\n let marginWidth = margin * this.heightOracle.charWidth;\n let left, right;\n if (target != null) {\n let targetFrac = findFraction(structure, target);\n let spaceFrac = ((this.pixelViewport.right - this.pixelViewport.left) / 2 + marginWidth) / totalWidth;\n left = targetFrac - spaceFrac;\n right = targetFrac + spaceFrac;\n }\n else {\n left = (this.pixelViewport.left - marginWidth) / totalWidth;\n right = (this.pixelViewport.right + marginWidth) / totalWidth;\n }\n viewFrom = findPosition(structure, left);\n viewTo = findPosition(structure, right);\n }\n if (viewFrom > line.from)\n addGap(line.from, viewFrom, line, structure);\n if (viewTo < line.to)\n addGap(viewTo, line.to, line, structure);\n }\n return gaps;\n }",
"function\n/*istanbul ignore start*/\n_default\n/*istanbul ignore end*/\n(start, minLine, maxLine) {\n var wantForward = true,\n backwardExhausted = false,\n forwardExhausted = false,\n localOffset = 1;\n return function iterator() {\n if (wantForward && !forwardExhausted) {\n if (backwardExhausted) {\n localOffset++;\n } else {\n wantForward = false;\n } // Check if trying to fit beyond text length, and if not, check it fits\n // after offset location (or desired location on first iteration)\n\n\n if (start + localOffset <= maxLine) {\n return localOffset;\n }\n\n forwardExhausted = true;\n }\n\n if (!backwardExhausted) {\n if (!forwardExhausted) {\n wantForward = true;\n } // Check if trying to fit before text beginning, and if not, check it fits\n // before offset location\n\n\n if (minLine <= start - localOffset) {\n return -localOffset++;\n }\n\n backwardExhausted = true;\n return iterator();\n } // We tried to fit hunk before text beginning and beyond text length, then\n // hunk can't fit on the text. Return undefined\n\n };\n}",
"function computeMaxLine(level,maxHeightLine,numLine){\n return maxHeightLine/level * numLine;\n}",
"function fold(object, max) {\n\t var result = '',\n\t position = 0,\n\t length = object.length,\n\t trailing = /\\n+$/.exec(object),\n\t newLine;\n\n\t if (trailing) {\n\t length = trailing.index + 1;\n\t }\n\n\t while (position < length) {\n\t newLine = object.indexOf('\\n', position);\n\t if (newLine > length || newLine === -1) {\n\t if (result) result += '\\n\\n';\n\t result += foldLine(object.slice(position, length), max);\n\t position = length;\n\n\t } else {\n\t if (result) result += '\\n\\n';\n\t result += foldLine(object.slice(position, newLine), max);\n\t position = newLine + 1;\n\t }\n\t }\n\n\t if (trailing && trailing[0] !== '\\n') result += trailing[0];\n\n\t return result;\n\t}",
"function wrapLines(text, cols) {\n var oldLines = text.split(\"\\n\"),\n newLines = [],\n line;\n while (typeof (line = oldLines.shift()) !== \"undefined\") {\n if (line.length > cols) {\n var lastSpaceIdx = line.lastIndexOf(' ', cols);\n if (lastSpaceIdx !== -1) {\n newLines.push(line.slice(0, lastSpaceIdx));\n oldLines.unshift(line.slice(lastSpaceIdx + 1));\n } else {\n //newLines.push(line.slice(0, cols));\n //oldLines.unshift(line.slice(cols));\n newLines.push(line);\n }\n } else {\n newLines.push(line);\n }\n }\n return newLines.join('\\n');\n }",
"function textWrap(maxLength, input) {\n let lines = [];\n let line = '';\n function pushLine(str, ws) {\n if (line.length && ws) line += ws;\n line += str;\n while (line.length > maxLength) {\n lines.push(line.slice(0, maxLength));\n line = line.slice(maxLength);\n }\n }\n let split = input.split(/(\\s+)/g);\n for (let i = 0; i < split.length; i += 2) {\n pushLine(split[i], i && split[i - 1]);\n }\n if (line.length) lines.push(line);\n return lines;\n}",
"function checkNumOfLines (text, font, lineWidth,limit) {\n\t\ttext=text.split(' ')\n\t\tlet sumLine=1\n\t\tlet j=0\n\t\tfor (let i=0; i<text.length; i++) {\n\t\t\tfragment=text.slice(j,i+1).join(' ')\n\t\t\tif(getTextWidth(fragment,font)>lineWidth) {\n\t\t\t\tsumLine++\n\t\t\t\tif (sumLine===limit) {break}\n\t\t\t\tj=i\n\t\t\t\ti--\n\t\t\t}\n\t\t}\n\t\treturn sumLine\n\t}",
"function fold(object, max) {\n var result = '',\n position = 0,\n length = object.length,\n trailing = /\\n+$/.exec(object),\n newLine;\n\n if (trailing) {\n length = trailing.index + 1;\n }\n\n while (position < length) {\n newLine = object.indexOf('\\n', position);\n if (newLine > length || newLine === -1) {\n if (result) {\n result += '\\n\\n';\n }\n result += foldLine(object.slice(position, length), max);\n position = length;\n } else {\n if (result) {\n result += '\\n\\n';\n }\n result += foldLine(object.slice(position, newLine), max);\n position = newLine + 1;\n }\n }\n if (trailing && trailing[0] !== '\\n') {\n result += trailing[0];\n }\n\n return result;\n}",
"function wrapText (text, maxLineLength) \n {\n const words = text.replace(/[\\r\\n]+/g, ' ').split(' ');\n let lineLength = 0;\n \n // use functional reduce, instead of for loop \n return words.reduce((result, word) => {\n if (lineLength + word.length >= maxLineLength) {\n lineLength = word.length;\n return result + `\\n${word}`; // don't add spaces upfront\n } else {\n lineLength += word.length + (result ? 1 : 0);\n return result ? result + ` ${word}` : `${word}`; // add space only when needed\n }\n }, '');\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function(line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n }",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc\n d.maxLine = getLine(doc, doc.first)\n d.maxLineLength = lineLength(d.maxLine)\n d.maxLineChanged = true\n doc.iter(function (line) {\n var len = lineLength(line)\n if (len > d.maxLineLength) {\n d.maxLineLength = len\n d.maxLine = line\n }\n })\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc\n d.maxLine = getLine(doc, doc.first)\n d.maxLineLength = lineLength(d.maxLine)\n d.maxLineChanged = true\n doc.iter(function (line) {\n var len = lineLength(line)\n if (len > d.maxLineLength) {\n d.maxLineLength = len\n d.maxLine = line\n }\n })\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function findMaxLine(cm) {\n var d = cm.display, doc = cm.doc;\n d.maxLine = getLine(doc, doc.first);\n d.maxLineLength = lineLength(d.maxLine);\n d.maxLineChanged = true;\n doc.iter(function (line) {\n var len = lineLength(line);\n if (len > d.maxLineLength) {\n d.maxLineLength = len;\n d.maxLine = line;\n }\n });\n}",
"function linebreaker(d) {\n if (d.length >= 6 && d.length <= 12) {\n return d.slice(0,6) + \"<br/>\" + d.slice(6,12) + \"<br/>\"\n } else if (d.length > 12) {\n return d.slice(0,6) + \"<br/>\" + d.slice(6,12) + \"<br/>\" + d.slice(12,18) + \"<br/>\"\n } else {\n return d.slice(0,6) + \"<br/>\"\n }\n }",
"function lf() { return wrap('lf', literal('\\n')()); }",
"function lf() { return wrap('lf', literal('\\n')()); }",
"function lf() { return wrap('lf', literal('\\n')()); }",
"function lf() { return wrap('lf', literal('\\n')()); }",
"function findMaxLine(cm) {\r\n var d = cm.display, doc = cm.doc;\r\n d.maxLine = getLine(doc, doc.first);\r\n d.maxLineLength = lineLength(d.maxLine);\r\n d.maxLineChanged = true;\r\n doc.iter(function(line) {\r\n var len = lineLength(line);\r\n if (len > d.maxLineLength) {\r\n d.maxLineLength = len;\r\n d.maxLine = line;\r\n }\r\n });\r\n }",
"function wrapText(\n ctx,\n text,\n x,\n y,\n max_width,\n line_height = threat_line_height,\n do_stroke = false,\n get_num_lines = false\n ) {\n let words = text.split(' ');\n let line = '';\n let num_lines = 0;\n\n for (let n = 0; n < words.length; n++) {\n let new_line = line + words[n] + ' ';\n let new_width = ctx.measureText(new_line).width;\n if (new_width > max_width && n > 0) {\n if (!get_num_lines) {\n if (do_stroke) ctx.strokeText(line.trim(), x, y);\n ctx.fillText(line.trim(), x, y);\n } //if\n num_lines += 1;\n line = words[n] + ' ';\n y += line_height;\n } else line = new_line;\n } //for n\n if (!get_num_lines) {\n if (do_stroke) ctx.strokeText(line.trim(), x, y);\n ctx.fillText(line.trim(), x, y);\n } //if\n num_lines += 1;\n\n if (get_num_lines) return num_lines;\n } //function wrapText",
"function wrapText(ctx, text, x, y, max_width) {\n var line_height = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : threat_line_height;\n var do_stroke = arguments.length > 6 && arguments[6] !== undefined ? arguments[6] : false;\n var get_num_lines = arguments.length > 7 && arguments[7] !== undefined ? arguments[7] : false;\n var words = text.split(' ');\n var line = '';\n var num_lines = 0;\n\n for (var n = 0; n < words.length; n++) {\n var new_line = line + words[n] + ' ';\n var new_width = ctx.measureText(new_line).width;\n\n if (new_width > max_width && n > 0) {\n if (!get_num_lines) {\n if (do_stroke) ctx.strokeText(line.trim(), x, y);\n ctx.fillText(line.trim(), x, y);\n } //if\n\n\n num_lines += 1;\n line = words[n] + ' ';\n y += line_height;\n } else line = new_line;\n } //for n\n\n\n if (!get_num_lines) {\n if (do_stroke) ctx.strokeText(line.trim(), x, y);\n ctx.fillText(line.trim(), x, y);\n } //if\n\n\n num_lines += 1;\n if (get_num_lines) return num_lines;\n } //function wrapText",
"function wrapText(ctx, text, x, y, max_width) {\n var line_height = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : threat_line_height;\n var do_stroke = arguments.length > 6 && arguments[6] !== undefined ? arguments[6] : false;\n var get_num_lines = arguments.length > 7 && arguments[7] !== undefined ? arguments[7] : false;\n var words = text.split(' ');\n var line = '';\n var num_lines = 0;\n\n for (var n = 0; n < words.length; n++) {\n var new_line = line + words[n] + ' ';\n var new_width = ctx.measureText(new_line).width;\n\n if (new_width > max_width && n > 0) {\n if (!get_num_lines) {\n if (do_stroke) ctx.strokeText(line.trim(), x, y);\n ctx.fillText(line.trim(), x, y);\n } //if\n\n\n num_lines += 1;\n line = words[n] + ' ';\n y += line_height;\n } else line = new_line;\n } //for n\n\n\n if (!get_num_lines) {\n if (do_stroke) ctx.strokeText(line.trim(), x, y);\n ctx.fillText(line.trim(), x, y);\n } //if\n\n\n num_lines += 1;\n if (get_num_lines) return num_lines;\n } //function wrapText",
"function reflowSmallerGetNewLineLengths(wrappedLines, oldCols, newCols) {\n const newLineLengths = [];\n const cellsNeeded = wrappedLines.map((l, i) => getWrappedLineTrimmedLength(wrappedLines, i, oldCols)).reduce((p, c) => p + c);\n // Use srcCol and srcLine to find the new wrapping point, use that to get the cellsAvailable and\n // linesNeeded\n let srcCol = 0;\n let srcLine = 0;\n let cellsAvailable = 0;\n while (cellsAvailable < cellsNeeded) {\n if (cellsNeeded - cellsAvailable < newCols) {\n // Add the final line and exit the loop\n newLineLengths.push(cellsNeeded - cellsAvailable);\n break;\n }\n srcCol += newCols;\n const oldTrimmedLength = getWrappedLineTrimmedLength(wrappedLines, srcLine, oldCols);\n if (srcCol > oldTrimmedLength) {\n srcCol -= oldTrimmedLength;\n srcLine++;\n }\n const endsWithWide = wrappedLines[srcLine].getWidth(srcCol - 1) === 2;\n if (endsWithWide) {\n srcCol--;\n }\n const lineLength = endsWithWide ? newCols - 1 : newCols;\n newLineLengths.push(lineLength);\n cellsAvailable += lineLength;\n }\n return newLineLengths;\n}",
"function findMaxLine(cm) {\n\t\t var d = cm.display, doc = cm.doc;\n\t\t d.maxLine = getLine(doc, doc.first);\n\t\t d.maxLineLength = lineLength(d.maxLine);\n\t\t d.maxLineChanged = true;\n\t\t doc.iter(function (line) {\n\t\t var len = lineLength(line);\n\t\t if (len > d.maxLineLength) {\n\t\t d.maxLineLength = len;\n\t\t d.maxLine = line;\n\t\t }\n\t\t });\n\t\t }",
"function findMaxLine(cm) {\n\t\t var d = cm.display, doc = cm.doc;\n\t\t d.maxLine = getLine(doc, doc.first);\n\t\t d.maxLineLength = lineLength(d.maxLine);\n\t\t d.maxLineChanged = true;\n\t\t doc.iter(function(line) {\n\t\t var len = lineLength(line);\n\t\t if (len > d.maxLineLength) {\n\t\t d.maxLineLength = len;\n\t\t d.maxLine = line;\n\t\t }\n\t\t });\n\t\t }",
"function findMaxLine(cm) {\r\n var d = cm.display, doc = cm.doc;\r\n d.maxLine = getLine(doc, doc.first);\r\n d.maxLineLength = lineLength(d.maxLine);\r\n d.maxLineChanged = true;\r\n doc.iter(function (line) {\r\n var len = lineLength(line);\r\n if (len > d.maxLineLength) {\r\n d.maxLineLength = len;\r\n d.maxLine = line;\r\n }\r\n });\r\n}",
"getLineLimit(n_item) {\n const view = this.app.workspace.activeLeaf.view;\n let line_limit;\n if (view instanceof obsidian.MarkdownView) {\n const cm = view.sourceMode.cmEditor;\n if (n_item > 0) {\n line_limit = cm.lastLine();\n }\n else {\n line_limit = cm.firstLine();\n }\n }\n return line_limit;\n }",
"lineBreakSetter() {\n return {\n needles: ['(','esq.'],\n options: {\n small: true\n }\n }\n }",
"function findMaxLine(cm) {\n\t var d = cm.display, doc = cm.doc;\n\t d.maxLine = getLine(doc, doc.first);\n\t d.maxLineLength = lineLength(d.maxLine);\n\t d.maxLineChanged = true;\n\t doc.iter(function(line) {\n\t var len = lineLength(line);\n\t if (len > d.maxLineLength) {\n\t d.maxLineLength = len;\n\t d.maxLine = line;\n\t }\n\t });\n\t }",
"function findMaxLine(cm) {\n\t var d = cm.display, doc = cm.doc;\n\t d.maxLine = getLine(doc, doc.first);\n\t d.maxLineLength = lineLength(d.maxLine);\n\t d.maxLineChanged = true;\n\t doc.iter(function(line) {\n\t var len = lineLength(line);\n\t if (len > d.maxLineLength) {\n\t d.maxLineLength = len;\n\t d.maxLine = line;\n\t }\n\t });\n\t }",
"function findMaxLine(cm) {\n\t var d = cm.display, doc = cm.doc;\n\t d.maxLine = getLine(doc, doc.first);\n\t d.maxLineLength = lineLength(d.maxLine);\n\t d.maxLineChanged = true;\n\t doc.iter(function(line) {\n\t var len = lineLength(line);\n\t if (len > d.maxLineLength) {\n\t d.maxLineLength = len;\n\t d.maxLine = line;\n\t }\n\t });\n\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.5497965",
"0.5444942",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5420075",
"0.5416444",
"0.5416444",
"0.5416444",
"0.5416444",
"0.5416444",
"0.5416444",
"0.5416444",
"0.5416444",
"0.5374698",
"0.5374698",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.5362994",
"0.53462034",
"0.5342928",
"0.5342928",
"0.5342928",
"0.5342928",
"0.5334259",
"0.53068644",
"0.5304107",
"0.5304107",
"0.53016174",
"0.5298111",
"0.5296361",
"0.52920765",
"0.52835524",
"0.5278007",
"0.5273851",
"0.5273851",
"0.5273851"
] |
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, \"\\\\\\\"\") + \"\\\"\"; }",
"function esc(v) { return \"\\\"\" + v.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, \"\\\\\\\"\") + \"\\\"\"; }",
"function esc(v) { return \"\\\"\" + v.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, \"\\\\\\\"\") + \"\\\"\"; }",
"function _escape(s) {\n return s.replace(_escapeRegex, function (match) {\n switch (match) {\n case '\"':\n return '\\\\\"';\n case '\\\\':\n return '\\\\\\\\';\n case '\\n':\n return '\\\\n';\n case '\\r':\n return '\\\\r';\n }\n });\n}",
"function escapeDoubleQuotes(str) {\n return str.replace(/\\\\([\\s\\S])|(\")/g, \"\\\\$1$2\");\n}",
"stringEscape( s ) {\n\n return sourceEscape(\n s\n .replace( /\\\\/g, \"\\\\\\\\\" ) // backslash\n .replace( /\"/g, \"\\\\\\\"\" ), // closing double quote\n );\n\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function quote(s) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace(/\\\\/g, '\\\\\\\\') // backslash\n .replace(/\"/g, '\\\\\"') // closing quote character\n .replace(/\\x08/g, '\\\\b') // backspace\n .replace(/\\t/g, '\\\\t') // horizontal tab\n .replace(/\\n/g, '\\\\n') // line feed\n .replace(/\\f/g, '\\\\f') // form feed\n .replace(/\\r/g, '\\\\r') // carriage return\n .replace(/[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape)\n + '\"';\n }",
"function escapeQuotes(instr) {\n // if the type is not a string, just return the input as it is.\n if (typeof(instr) !== \"string\") return instr;\n\n // escape double quotes\n let out = instr.replace(/\"/g, '%22');\n // escape backslashes\n out = out.replace(/\\\\/g, '\\\\\\\\');\n return out;\n}",
"function basicEscape(string) {\n return string.replace(/\\\\/g, '\\\\\\\\');\n}",
"function db_escape(str){\n\t'use strict';\n\treturn str.replace(/\\\\/g, \"\\\\\\\\\")\n\t .replace(/\\$/g, \"\\\\$\")\n\t .replace(/'/g, \"\\\\'\")\n\t .replace(/\"/g, \"\\\\\\\"\");\n}",
"function escapeString(str){\n\tvar str = new String(str);\n\treturn str.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n}",
"function esc(str) {\n\t return str.replace(escapeRegExp, '\\\\$&');\n\t}",
"function quote( s ) {\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a\n * string literal except for the closing quote character, backslash,\n * carriage return, line separator, paragraph separator, and line feed.\n * Any character may appear in the form of an escape sequence.\n *\n * For portability, we also escape escape all control and non-ASCII\n * characters. Note that \"\\0\" and \"\\v\" escape sequences are not used\n * because JSHint does not like the first and IE the second.\n */\n return '\"' + s\n .replace( /\\\\/g, '\\\\\\\\' ) // backslash\n .replace( /\"/g, '\\\\\"' ) // closing quote character\n .replace( /\\x08/g, '\\\\b' ) // backspace\n .replace( /\\t/g, '\\\\t' ) // horizontal tab\n .replace( /\\n/g, '\\\\n' ) // line feed\n .replace( /\\f/g, '\\\\f' ) // form feed\n .replace( /\\r/g, '\\\\r' ) // carriage return\n .replace( /[\\x00-\\x07\\x0B\\x0E-\\x1F\\x80-\\uFFFF]/g, escape )\n + '\"';\n }",
"function escSglQuote(str) {\r\n return str.toString().replace(/'/g,\"\\\\'\");\r\n}",
"function escapeQuotes(str) {\n return str.replace(/\\\"/g,'\\\\\"');\n }",
"function quote(s)\n{\n return s.replace(/[\\^\\$\\\\\\.\\*\\+\\?\\(\\)\\[\\]\\{\\}\\|]/g, '\\\\$&');\n}",
"escapeString(str) {\n return str\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(new RegExp(this.options.quoteChar, 'g'), `\\\\` + this.options.quoteChar);\n }",
"function escapeString(str) {\n return str.replace('\"', '\\\"');\n }",
"function dquote$1(s) {\n var sq = s.indexOf('\\'') >= 0;\n var dq = s.indexOf('\"') >= 0;\n if (sq && dq) {\n s = s.replace(/\"/g, '\\\\\"');\n dq = false;\n }\n if (dq) {\n s = '\\'' + s + '\\'';\n } else {\n s = '\"' + s + '\"';\n }\n return s;\n}",
"function quote(s) {\n\t return '\\\\Q' + s.replace('\\\\E', '\\\\E\\\\\\\\E\\\\Q') + '\\\\E';\n\t}",
"function quote(s) {\n // eslint-disable-next-line no-useless-escape\n if (/[\"\\s#!$&'()*,:;<=>?@\\[\\\\\\]^`{|}]/.test(s)) {\n if (/['\\n]/.test(s))\n return '\"' +\n s\n .replace(/([\"\\\\$`!])/g, '\\\\$1')\n .replace(/\\n/g, '\\\\n') +\n '\"';\n return \"'\" + s.replace(/(['\\\\])/g, '\\\\$1') + \"'\";\n }\n return s;\n}",
"function escapeString(string, {\n preprocessor,\n ignoreEscaping\n}) {\n if (ignoreEscaping) return string;else if (preprocessor && preprocessor.name === 'scriptPreprocessor') return string.replace(/\"/g, \"'\");else return (0, _stringEscape.default)(string);\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, '\\\\$1');\n}",
"set DoubleQuote(value) {}",
"function dquote() { return wrap('dquote', literal('\"')()); }",
"function dquote() { return wrap('dquote', literal('\"')()); }",
"function dquote() { return wrap('dquote', literal('\"')()); }",
"function dquote() { return wrap('dquote', literal('\"')()); }",
"function esc(str) {\n return \"\\001\" + str + \"\\002\";\n}",
"function escapeScript(s, escapeSingleQuotes, escapeDoubleQuotes){\n\tif (typeof(s) != \"string\") return \"\";\n\t\n\tvar result = \"\";\n\tfor (var i = 0; i < s.length; i++) {\n\t\tvar ch = s.charAt(i);\n\t\tswitch (ch) {\n\t\tcase '\\'':\n\t\t\tif (escapeSingleQuotes == null || escapeSingleQuotes)\n\t\t\t\tresult += \"\\\\\\'\";\n\t\t\tbreak;\n\t\tcase '\\\"':\n\t\t\tif (escapeDoubleQuotes == null || escapeDoubleQuotes)\n\t\t\t\tresult += \"\\\\\\\"\";\n\t\t\tbreak;\n\t\tcase '\\\\':\n\t\t\tresult += \"\\\\\\\\\";\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tresult += ch;\n\t\t}\n\t}\n\treturn result;\n}",
"function escapeScript(s, escapeSingleQuotes, escapeDoubleQuotes){\n\tif (typeof(s) != \"string\") return \"\";\n\t\n\tvar result = \"\";\n\tfor (var i = 0; i < s.length; i++) {\n\t\tvar ch = s.charAt(i);\n\t\tswitch (ch) {\n\t\tcase '\\'':\n\t\t\tif (escapeSingleQuotes == null || escapeSingleQuotes)\n\t\t\t\tresult += \"\\\\\\'\";\n\t\t\tbreak;\n\t\tcase '\\\"':\n\t\t\tif (escapeDoubleQuotes == null || escapeDoubleQuotes)\n\t\t\t\tresult += \"\\\\\\\"\";\n\t\t\tbreak;\n\t\tcase '\\\\':\n\t\t\tresult += \"\\\\\\\\\";\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tresult += ch;\n\t\t}\n\t}\n\treturn result;\n}",
"function escape(str) {\n if (!str) {\n return '';\n }\n return str\n .replace(/\\|/g, \"||\")\n .replace(/\\n/g, \"|n\")\n .replace(/\\r/g, \"|r\")\n .replace(/\\[/g, \"|[\")\n .replace(/\\]/g, \"|]\")\n .replace(/\\u0085/g, \"|x\")\n .replace(/\\u2028/g, \"|l\")\n .replace(/\\u2029/g, \"|p\")\n .replace(/'/g, \"|'\");\n}",
"function reescape(str){\n\tfor(var i=0; i<str.length; i++){\n\t\tif(isEscapeable(str[i]) && str[i-1] != '\\\\'){\n\t\t\tstr = str.substring(0,i) + \"\\\\\" + str.substring(i);\n\t\t\ti++;\n\t\t}\n\t}\n\treturn str;\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function utils_escape(text) {\n return String(text).replace(ESCAPE_REGEX, function (match) {\n return ESCAPE_LOOKUP[match];\n });\n}",
"function utils_escape(text) {\n return String(text).replace(ESCAPE_REGEX, function (match) {\n return ESCAPE_LOOKUP[match];\n });\n}",
"function utils_escape(text) {\n return String(text).replace(ESCAPE_REGEX, function (match) {\n return ESCAPE_LOOKUP[match];\n });\n}",
"function escapeChars(str){\n return String(str).replace(/'/g, '\\'\\'');\n}",
"function escape(value) {\n if (value === null || _.isUndefined(value)) {\n value = \"\";\n } else {\n value = String(value);\n }\n if (specialChars.test(value)) {\n value = '\"' + value.replace(/\"/g, '\"\"') + '\"';\n }\n return value;\n }",
"function quoteString(string) {\n return '\"' + string + '\"';\n}",
"function escape(str) {\n return str.replace(/[ !#$%&()*+,./;<=>?@[\\]^`{|}~\"'\\\\]/g, \"\\\\$&\");\n}",
"function escape(str) {\n return str.replace(/[ !#$%&()*+,./;<=>?@[\\]^`{|}~\"'\\\\]/g, \"\\\\$&\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function di_strEscapeSpclchar(str) {\n\t//return str.replace(\"'\", \"\\\\'\");\n\treturn str;\n}",
"function escapeString$1(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n}",
"function escapeAllQuotes ( pattern ) {\n var escaped_pattern = pattern.replace(/\\'/g,\"\\\\'\");\n return escaped_pattern.replace(/\\\"/g,'\\\\\"');\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function escape(data) {\n return data.replace(reEscapeChars, singleCharReplacer);\n}",
"function mysql_real_escape_string (str) {\n return str.replace(/[\\0\\x08\\x09\\x1a\\n\\r\"'\\\\\\%]/g, function (char) {\n switch (char) {\n case \"\\0\":\n return \"\\\\0\";\n case \"\\x08\":\n return \"\\\\b\";\n case \"\\x09\":\n return \"\\\\t\";\n case \"\\x1a\":\n return \"\\\\z\";\n case \"\\n\":\n return \"\\\\n\";\n case \"\\r\":\n return \"\\\\r\";\n case \"\\\"\":\n case \"'\":\n case \"\\\\\":\n case \"%\":\n return \"\\\\\"+char; // prepends a backslash to backslash, percent,\n // and double/single quotes\n }\n });\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n }",
"function escapeSpecialCharacters(str) {\n // Replace \" with two ' b/c \" cannot be escaped properly in output onto DOM\n // Search for special characters \\, ', (, ) globally in string\n // and insert a forward slash \\ to escape those characters\n str = str.replace(/\\\"/gi,'\\'\\'').replace(/[\\\\\\'()]/gi, '\\\\$&');\n return str;\n}",
"function escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n }",
"set BackQuote(value) {}",
"function regEsc(str) {\n return str.replace(new RegExp('[.\\\\\\\\+*?\\\\[\\\\^\\\\]$(){}=!<>|:\\\\-]', 'g'), '\\\\$&')\n }",
"function escapeString(str) {\n if (charsToEscape.test(str)) {\n for (var i = 0; i < escapeCharacters.length; i++) {\n str = str.replace(escapeCharacters[i][0], escapeCharacters[i][1]);\n }\n }\n return str;\n}"
] |
[
"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.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.71326077",
"0.71264166",
"0.71213037",
"0.71140885",
"0.7107794",
"0.7032021",
"0.70007414",
"0.6996635",
"0.6966971",
"0.69495285",
"0.6914087",
"0.6857172",
"0.6844463",
"0.6823865",
"0.67844814",
"0.676107",
"0.67441666",
"0.6650694",
"0.66501164",
"0.6626242",
"0.6626242",
"0.6626242",
"0.6626242",
"0.6600548",
"0.6564956",
"0.6564956",
"0.655358",
"0.65442556",
"0.6535901",
"0.65258867",
"0.65258867",
"0.65258867",
"0.65201825",
"0.6515456",
"0.65103203",
"0.65088767",
"0.65088767",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.6497563",
"0.64874977",
"0.64799887",
"0.6469578",
"0.6439316",
"0.64391017",
"0.64391017",
"0.64391017",
"0.64391017",
"0.64391017",
"0.64391017",
"0.6435899",
"0.6430078",
"0.64296097",
"0.64216197",
"0.6389133",
"0.63852805",
"0.6375694"
] |
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' ? options.serializeFunctions : false;\n const ignoreUndefined = typeof options.ignoreUndefined === 'boolean' ? options.ignoreUndefined : true;\n const minInternalBufferSize = typeof options.minInternalBufferSize === 'number' ? options.minInternalBufferSize : MAXSIZE;\n // Resize the internal serialization buffer if needed\n if (buffer$1.length < minInternalBufferSize) {\n buffer$1 = buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.alloc(minInternalBufferSize);\n }\n // Attempt to serialize\n const serializationIndex = serializer.serializeInto(buffer$1, object, checkKeys, 0, 0, serializeFunctions, ignoreUndefined, []);\n // Create the final buffer\n const finishedBuffer = buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.alloc(serializationIndex);\n // Copy into the finished buffer\n buffer$1.copy(finishedBuffer, 0, 0, finishedBuffer.length);\n // Return the buffer\n return finishedBuffer;\n}",
"set serializedObject(value) {}",
"get serializedObject() {}",
"function serialize (object) {\n var type = typeof object;\n if ('object' == type) {\n if (Array == object.constructor)\n type = 'array';\n else if (RegExp == object.constructor)\n type = 'regexp';\n else\n type = 'object';\n }\n switch (type) {\n case 'undefined':\n case 'unknown':\n return;\n break;\n case 'function':\n case 'boolean':\n case 'regexp':\n return object.toString();\n break;\n case 'number':\n return isFinite(object) ? object.toString() : 'null';\n break;\n case 'string':\n return '\"' + object.replace(/(\\\\|\\\")/g, \"\\\\$1\").replace(/\\n|\\r|\\t/g,\n function() {\n var a = arguments[0];\n return (a == '\\n') ? '\\\\n' :(a == '\\r') ? '\\\\r' :(a == '\\t') ? '\\\\t' : \"\";\n }) + '\"';\n break;\n case 'object':\n if (object === null) return 'null';\n var results = [];\n for (var property in object) {\n \tif(!isNull(object[property])){\n var value = serialize(object[property]);\n\t if (value !== undefined){\n\t results.push(serialize(property) + ':' + value);\n\t }\n \t}\n }\n return '{' + results.join(',') + '}';\n break;\n case 'array':\n var results = [];\n for (var i = 0; i < object.length; i++) {\n \tif(!isNull(object[i])){\n\t var value = serialize(object[i]);\n\t if (value !== undefined) results.push(value);\n \t}\n }\n return '[' + results.join(',') + ']';\n break;\n }\n}",
"function serializeObject(value) {\n if (_typeof(value) === 'object' && value !== null) {\n if (typeof value.valueOf === 'function') {\n var valueOfResult = value.valueOf();\n\n if (_typeof(valueOfResult) !== 'object') {\n return valueOfResult;\n }\n }\n\n if (typeof value.toJSON === 'function') {\n // $FlowFixMe(>=0.90.0)\n return value.toJSON();\n }\n }\n\n return value;\n}",
"function saveObjectIntoDB(Object){\r\n\r\nconsole.log(\"saved: \"+Object);\r\nObject.save(function(error) {\r\n if (error) {\r\n console.error(error);\r\n return false;\r\n }\r\n })\r\n return true;\r\n \r\n}",
"function saveObjectIntoDB(Object){\r\n\r\nconsole.log(\"saved: \"+Object);\r\nObject.save(function(error) {\r\n if (error) {\r\n console.error(error);\r\n return false;\r\n }\r\n })\r\n return true;\r\n \r\n}",
"create(object, cb){\n let _self = this;\n //result object on succes\n let result = {\n result: true,\n object: null,\n message: \"Succesfully created \" + this.collection\n };\n //validate object\n this.validate(object, [], function(validationResult){\n if(validationResult.object.valid){\n object.id = Helper.GenerateRandomString(20);\n fs.writeFile(path.join(_self.collectionFolder, object.id + \".json\"), JSON.stringify(object), function(err){\n if(err){\n result.result = false;\n result.object = err;\n result.message = \"Failed to create \" + _self.collection;\n }else{\n result.object = object;\n }\n cb(result);\n });\n }else{\n result.result = false;\n result.object = validationResult.object;\n result.message = \"Object is not valid\"\n cb(result);\n }\n });\n }",
"_encodeObject(object) {\n return object.termType === 'Literal' ? this._encodeLiteral(object) : this._encodeIriOrBlank(object);\n }",
"static jsonWriter(object){\n\t\treturn JSON.stringify(object, \n\t\t(key, value)=>{\n\t\t\tif (typeof value === 'function') {\t\n\t\t\t\tvar name = \"corrupt\";\n\t\t\t\tif(value.hasOwnProperty(\"getName\")){\n\t\t\t\t\tname = value.getName();\n\t\t\t\t}\n\t\t\t\treturn {\"isFunction\": true, \"name\":name};\n\t\t\t} \n\t\t\telse {\n\t\t\t\treturn value;\n\t\t\t}\n\t\t});\n\t}",
"_encodeObject(object) {\n switch (object.termType) {\n case 'Quad':\n return this._encodeQuad(object);\n case 'Literal':\n return this._encodeLiteral(object);\n default:\n return this._encodeIriOrBlank(object);\n }\n }",
"function serializeObject(outputValue) {\n if (Object(_jsutils_isObjectLike_mjs__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(outputValue)) {\n if (typeof outputValue.valueOf === 'function') {\n var valueOfResult = outputValue.valueOf();\n\n if (!Object(_jsutils_isObjectLike_mjs__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(valueOfResult)) {\n return valueOfResult;\n }\n }\n\n if (typeof outputValue.toJSON === 'function') {\n // $FlowFixMe[incompatible-use]\n return outputValue.toJSON();\n }\n }\n\n return outputValue;\n}",
"serializeUpdate(roomName, object, options) {\n let world = this.gameEngine.world;\n let diffUpdate = Boolean(options && options.diffUpdate);\n let objId = object.id;\n let obj = world.objects[objId];\n let prevObject = this.objMemory[objId];\n\n // if the object (in serialized form) hasn't changed, move on\n if (diffUpdate) {\n let s = obj.serialize(this.serializer);\n if (prevObject && Utils.arrayBuffersEqual(s.dataBuffer, prevObject))\n return;\n else\n this.objMemory[objId] = s.dataBuffer;\n\n // prune strings which haven't changed\n obj = obj.prunedStringsClone(this.serializer, prevObject);\n }\n\n this.networkTransmitter.addNetworkedEvent(roomName, 'objectUpdate', {\n stepCount: world.stepCount,\n objectInstance: obj\n });\n }",
"function serializeObject(outputValue) {\n if (Object(_jsutils_isObjectLike_mjs__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(outputValue)) {\n if (typeof outputValue.valueOf === 'function') {\n var valueOfResult = outputValue.valueOf();\n\n if (!Object(_jsutils_isObjectLike_mjs__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(valueOfResult)) {\n return valueOfResult;\n }\n }\n\n if (typeof outputValue.toJSON === 'function') {\n // $FlowFixMe(>=0.90.0)\n return outputValue.toJSON();\n }\n }\n\n return outputValue;\n}",
"function encode(object) {\n if (object === undefined) {\n return {\"%\": \"undefined\"};\n } else if (Object(object) !== object) {\n if (typeof object == \"number\") {\n if (object === Number.POSITIVE_INFINITY) {\n return {\"%\": \"+Infinity\"};\n } else if (object === Number.NEGATIVE_INFINITY) {\n return {\"%\": \"-Infinity\"};\n } else if (isNaN(object)) {\n return {\"%\": \"NaN\"};\n }\n }\n return object;\n } else if (Q.isPromise(object) || typeof object === \"function\") {\n var id = makeId();\n makeLocal(id);\n dispatchLocal(id, 'resolve', object);\n return {\"@\": id, \"type\": typeof object};\n } else if (Array.isArray(object)) {\n return object.map(encode);\n } else if (typeof object === \"object\") {\n var result = {};\n if (object instanceof Error) {\n result.message = object.message;\n result.stack = object.stack;\n }\n for (var key in object) {\n if (has.call(object, key)) {\n var newKey = key.replace(/[@!%\\\\]/, function ($0) {\n return \"\\\\\" + $0;\n });\n result[newKey] = encode(object[key]);\n }\n }\n return result;\n } else {\n return object;\n }\n }",
"serialize(obj, buf) {\n this._flushBitfield();\n return this.serializer.serialize(obj, buf);\n }",
"static writeObject(obj) {\n return [];\n }",
"function object (data) {\n return assigned(data) && Object.prototype.toString.call(data) === '[object Object]';\n }",
"serialize(jsObject) {\n return JSON.stringify(jsObject);\n }",
"function ok(obj){\n logger.simple(\"res OK: \", obj);\n this.send(obj);\n}",
"function ensureStringObj(object) {\n /** The final result we will return */\n var result = {};\n var debugName = '';\n for (var key in object) {\n /** Grab the value upfront */\n var val = object[key];\n /** TypeStyle configuration options */\n if (key === '$unique') {\n result[__WEBPACK_IMPORTED_MODULE_0_free_style__[\"IS_UNIQUE\"]] = val;\n }\n else if (key === '$nest') {\n var nested = val;\n for (var selector in nested) {\n var subproperties = nested[selector];\n result[selector] = ensureStringObj(subproperties).result;\n }\n }\n else if (key === '$debugName') {\n debugName = val;\n }\n else {\n result[key] = val;\n }\n }\n return { result: result, debugName: debugName };\n}",
"function ensureStringObj(object) {\n /** The final result we will return */\n var result = {};\n var debugName = '';\n for (var key in object) {\n /** Grab the value upfront */\n var val = object[key];\n /** TypeStyle configuration options */\n if (key === '$unique') {\n result[__WEBPACK_IMPORTED_MODULE_0_free_style__[\"IS_UNIQUE\"]] = val;\n }\n else if (key === '$nest') {\n var nested = val;\n for (var selector in nested) {\n var subproperties = nested[selector];\n result[selector] = ensureStringObj(subproperties).result;\n }\n }\n else if (key === '$debugName') {\n debugName = val;\n }\n else {\n result[key] = val;\n }\n }\n return { result: result, debugName: debugName };\n}",
"function serialize(obj) {\n return eserialize(obj, SERIALIZATION_OPTIONS);\n}",
"function serializeObject(obj) { // 2265\n var seen = []; // 2266\n // 2267\n return JSON.stringify(obj, function(key, val) { // 2268\n val = toJsonReplacer(key, val); // 2269\n if (isObject(val)) { // 2270\n // 2271\n if (seen.indexOf(val) >= 0) return '...'; // 2272\n // 2273\n seen.push(val); // 2274\n } // 2275\n return val; // 2276\n }); // 2277\n} // 2278",
"function saveObj() {\n\tlet objString = getObjString();\n\n\tconst stringToBlob = new Blob([objString], { type: 'text/plain' });\n\treturn stringToBlob;\n}",
"function ensureStringObj(object) {\n /** The final result we will return */\n var result = {};\n var debugName = '';\n for (var key in object) {\n /** Grab the value upfront */\n var val = object[key];\n /** TypeStyle configuration options */\n if (key === '$unique') {\n result[FreeStyle.IS_UNIQUE] = val;\n }\n else if (key === '$nest') {\n var nested = val;\n for (var selector in nested) {\n var subproperties = nested[selector];\n result[selector] = ensureStringObj(subproperties).result;\n }\n }\n else if (key === '$debugName') {\n debugName = val;\n }\n else {\n result[key] = val;\n }\n }\n return { result: result, debugName: debugName };\n}",
"function object (data) {\n return Object.prototype.toString.call(data) === '[object Object]';\n }",
"serialize(mapper, object, objectName, options = {}) {\n var _a, _b, _c;\n const updatedOptions = {\n rootName: (_a = options.rootName) !== null && _a !== void 0 ? _a : \"\",\n includeRoot: (_b = options.includeRoot) !== null && _b !== void 0 ? _b : false,\n xmlCharKey: (_c = options.xmlCharKey) !== null && _c !== void 0 ? _c : XML_CHARKEY,\n };\n let payload = {};\n const mapperType = mapper.type.name;\n if (!objectName) {\n objectName = mapper.serializedName;\n }\n if (mapperType.match(/^Sequence$/i) !== null) {\n payload = [];\n }\n if (mapper.isConstant) {\n object = mapper.defaultValue;\n }\n // This table of allowed values should help explain\n // the mapper.required and mapper.nullable properties.\n // X means \"neither undefined or null are allowed\".\n // || required\n // || true | false\n // nullable || ==========================\n // true || null | undefined/null\n // false || X | undefined\n // undefined || X | undefined/null\n const { required, nullable } = mapper;\n if (required && nullable && object === undefined) {\n throw new Error(`${objectName} cannot be undefined.`);\n }\n if (required && !nullable && object == undefined) {\n throw new Error(`${objectName} cannot be null or undefined.`);\n }\n if (!required && nullable === false && object === null) {\n throw new Error(`${objectName} cannot be null.`);\n }\n if (object == undefined) {\n payload = object;\n }\n else {\n if (mapperType.match(/^any$/i) !== null) {\n payload = object;\n }\n else if (mapperType.match(/^(Number|String|Boolean|Object|Stream|Uuid)$/i) !== null) {\n payload = serializeBasicTypes(mapperType, objectName, object);\n }\n else if (mapperType.match(/^Enum$/i) !== null) {\n const enumMapper = mapper;\n payload = serializeEnumType(objectName, enumMapper.type.allowedValues, object);\n }\n else if (mapperType.match(/^(Date|DateTime|TimeSpan|DateTimeRfc1123|UnixTime)$/i) !== null) {\n payload = serializeDateTypes(mapperType, object, objectName);\n }\n else if (mapperType.match(/^ByteArray$/i) !== null) {\n payload = serializeByteArrayType(objectName, object);\n }\n else if (mapperType.match(/^Base64Url$/i) !== null) {\n payload = serializeBase64UrlType(objectName, object);\n }\n else if (mapperType.match(/^Sequence$/i) !== null) {\n payload = serializeSequenceType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n else if (mapperType.match(/^Dictionary$/i) !== null) {\n payload = serializeDictionaryType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n else if (mapperType.match(/^Composite$/i) !== null) {\n payload = serializeCompositeType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n }\n return payload;\n }",
"serialize(mapper, object, objectName, options = {}) {\n var _a, _b, _c;\n const updatedOptions = {\n rootName: (_a = options.rootName) !== null && _a !== void 0 ? _a : \"\",\n includeRoot: (_b = options.includeRoot) !== null && _b !== void 0 ? _b : false,\n xmlCharKey: (_c = options.xmlCharKey) !== null && _c !== void 0 ? _c : XML_CHARKEY,\n };\n let payload = {};\n const mapperType = mapper.type.name;\n if (!objectName) {\n objectName = mapper.serializedName;\n }\n if (mapperType.match(/^Sequence$/i) !== null) {\n payload = [];\n }\n if (mapper.isConstant) {\n object = mapper.defaultValue;\n }\n // This table of allowed values should help explain\n // the mapper.required and mapper.nullable properties.\n // X means \"neither undefined or null are allowed\".\n // || required\n // || true | false\n // nullable || ==========================\n // true || null | undefined/null\n // false || X | undefined\n // undefined || X | undefined/null\n const { required, nullable } = mapper;\n if (required && nullable && object === undefined) {\n throw new Error(`${objectName} cannot be undefined.`);\n }\n if (required && !nullable && object == undefined) {\n throw new Error(`${objectName} cannot be null or undefined.`);\n }\n if (!required && nullable === false && object === null) {\n throw new Error(`${objectName} cannot be null.`);\n }\n if (object == undefined) {\n payload = object;\n }\n else {\n if (mapperType.match(/^any$/i) !== null) {\n payload = object;\n }\n else if (mapperType.match(/^(Number|String|Boolean|Object|Stream|Uuid)$/i) !== null) {\n payload = serializeBasicTypes(mapperType, objectName, object);\n }\n else if (mapperType.match(/^Enum$/i) !== null) {\n const enumMapper = mapper;\n payload = serializeEnumType(objectName, enumMapper.type.allowedValues, object);\n }\n else if (mapperType.match(/^(Date|DateTime|TimeSpan|DateTimeRfc1123|UnixTime)$/i) !== null) {\n payload = serializeDateTypes(mapperType, object, objectName);\n }\n else if (mapperType.match(/^ByteArray$/i) !== null) {\n payload = serializeByteArrayType(objectName, object);\n }\n else if (mapperType.match(/^Base64Url$/i) !== null) {\n payload = serializeBase64UrlType(objectName, object);\n }\n else if (mapperType.match(/^Sequence$/i) !== null) {\n payload = serializeSequenceType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n else if (mapperType.match(/^Dictionary$/i) !== null) {\n payload = serializeDictionaryType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n else if (mapperType.match(/^Composite$/i) !== null) {\n payload = serializeCompositeType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n }\n return payload;\n }",
"function respond(obj) {\n try {\n print(Couch.toJSON(obj));\n } catch(e) {\n log(\"Error converting object to JSON: \" + e.toString());\n log(\"error on obj: \"+ obj.toSource());\n }\n}",
"function stringify($object) {\r\n try {\r\n if (this['uneval']) return uneval($object); //Firefox\r\n else if (this['JSON']) {\r\n if (typeof $object == 'object') return '('+JSON.stringify($object)+')';\r\n else return JSON.stringify($object);\r\n } //Chrome/Opera\r\n }\r\n catch (ex) { ; }\r\n}",
"encode(obj) {\n logger_1.Logger.log.debug(\"JsonEncoder.encode: start.\");\n return JSON.stringify(obj);\n }",
"serialize(mapper, object, objectName, options = { xml: {} }) {\n var _a, _b, _c;\n const updatedOptions = {\n xml: {\n rootName: (_a = options.xml.rootName) !== null && _a !== void 0 ? _a : \"\",\n includeRoot: (_b = options.xml.includeRoot) !== null && _b !== void 0 ? _b : false,\n xmlCharKey: (_c = options.xml.xmlCharKey) !== null && _c !== void 0 ? _c : XML_CHARKEY,\n },\n };\n let payload = {};\n const mapperType = mapper.type.name;\n if (!objectName) {\n objectName = mapper.serializedName;\n }\n if (mapperType.match(/^Sequence$/i) !== null) {\n payload = [];\n }\n if (mapper.isConstant) {\n object = mapper.defaultValue;\n }\n // This table of allowed values should help explain\n // the mapper.required and mapper.nullable properties.\n // X means \"neither undefined or null are allowed\".\n // || required\n // || true | false\n // nullable || ==========================\n // true || null | undefined/null\n // false || X | undefined\n // undefined || X | undefined/null\n const { required, nullable } = mapper;\n if (required && nullable && object === undefined) {\n throw new Error(`${objectName} cannot be undefined.`);\n }\n if (required && !nullable && (object === undefined || object === null)) {\n throw new Error(`${objectName} cannot be null or undefined.`);\n }\n if (!required && nullable === false && object === null) {\n throw new Error(`${objectName} cannot be null.`);\n }\n if (object === undefined || object === null) {\n payload = object;\n }\n else {\n if (mapperType.match(/^any$/i) !== null) {\n payload = object;\n }\n else if (mapperType.match(/^(Number|String|Boolean|Object|Stream|Uuid)$/i) !== null) {\n payload = serializeBasicTypes(mapperType, objectName, object);\n }\n else if (mapperType.match(/^Enum$/i) !== null) {\n const enumMapper = mapper;\n payload = serializeEnumType(objectName, enumMapper.type.allowedValues, object);\n }\n else if (mapperType.match(/^(Date|DateTime|TimeSpan|DateTimeRfc1123|UnixTime)$/i) !== null) {\n payload = serializeDateTypes(mapperType, object, objectName);\n }\n else if (mapperType.match(/^ByteArray$/i) !== null) {\n payload = serializeByteArrayType(objectName, object);\n }\n else if (mapperType.match(/^Base64Url$/i) !== null) {\n payload = serializeBase64UrlType(objectName, object);\n }\n else if (mapperType.match(/^Sequence$/i) !== null) {\n payload = serializeSequenceType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n else if (mapperType.match(/^Dictionary$/i) !== null) {\n payload = serializeDictionaryType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n else if (mapperType.match(/^Composite$/i) !== null) {\n payload = serializeCompositeType(this, mapper, object, objectName, Boolean(this.isXML), updatedOptions);\n }\n }\n return payload;\n }",
"function saveLS(obj_name,obj){\n\tif(obj === \"null\" || typeof(obj) === \"object\"){\n\t\tobj_to_json = JSON.stringify(obj);\n\t\twindow.localStorage.setItem(obj_name,obj_to_json);\n\t\tconsole.log(\"Mise à jour localStorage de l'objet '\"+obj_name+\"' :\");\n\t\tconsole.log(obj);\n\t\treturn true;\n\t}\n\tconsole.log(\"Erreur lors de l'enregistrement en storageLocal de l'objet '\"+obj_name+\"'\");\n\tconsole.log(\"Contenu de l'objet : \"+obj);\n\treturn false;\n}",
"function encode(object) {\n return cbor.encode(exchangeKeys(object, true));\n}",
"function ok(obj) {\n response({ status: 'ok', response: obj });\n }",
"function doSerialize(obj, header) {\n if (header) {\n return bidar.serialize(obj);\n } else {\n return bidar.serializeNoHead(obj);\n }\n}",
"static create(object) {\n let type = getType(object);\n let result;\n\n // this object has objectify?\n if (Objectify.hasObjectify(object)) {\n result = object.objectify();\n\n } else {\n // nope, we can force to get the public properties then:\n result = JSON.parse(JSON.stringify(object));\n }\n\n result._otype = type;\n\n return result;\n }",
"function setShowResultObject(obj)\r\n{\r\n\tshowResultObject=obj;\t\r\n}",
"function encode(obj, func) {\n var ret;\n try {\n // eslint-disable-next-line node/no-sync\n ret = typeson.stringifySync(obj);\n }\n catch (err) {\n // SCA in typeson-registry using `DOMException` which is not defined (e.g., in Node)\n if (typeson_registry_1.default.hasConstructorOf(err, ReferenceError) ||\n // SCA in typeson-registry threw a cloning error and we are in a\n // supporting environment (e.g., the browser) where `ShimDOMException` is\n // an alias for `DOMException`; if typeson-registry ever uses our shim\n // to throw, we can use this condition alone.\n typeson_registry_1.default.hasConstructorOf(err, DOMException_js_1.ShimDOMException)) {\n throw (0, DOMException_js_1.createDOMException)('DataCloneError', 'The object cannot be cloned.');\n }\n // We should rethrow non-cloning exceptions like from\n // throwing getters (as in the W3C test, key-conversion-exceptions.htm)\n throw err;\n }\n if (func)\n func(ret);\n return ret;\n}",
"function COPY(object) {\n if (object) {\n return JSON.parse(JSON.stringify(object));\n }\n return null;\n }",
"function serializeObject(obj, eol) {\r\n\t\tif (!obj) {\r\n\t\t\treturn 'null';\r\n\t\t} else if (parents.indexOf(obj) >= 0 && mode !== CIRCULAR_MODE) {\r\n\t\t\tthrow new TypeError(\"Sermat.ser: Circular reference detected!\");\r\n\t\t}\r\n\t\tvar output = '',\r\n\t\t\ti, len;\r\n\t\t/** If `visited` is `null`, means the mode is `REPEAT_MODE` and repeated references do\r\n\t\tnot have to be checked. This is only an optimization.\r\n\t\t*/\r\n\t\tif (visited) {\r\n\t\t\ti = visited.indexOf(obj);\r\n\t\t\tif (i >= 0) {\r\n\t\t\t\tif (mode & BINDING_MODE) {\r\n\t\t\t\t\treturn '$'+ i;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tthrow new TypeError(\"Sermat.ser: Repeated reference detected!\");\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\ti = visited.push(obj) - 1;\r\n\t\t\t\tif (mode & BINDING_MODE) {\r\n\t\t\t\t\toutput = '$'+ i + _equal;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tparents.push(obj);\r\n\t\tvar eol2 = eol && eol +'\\t';\r\n\t\tif (_isArray(obj)) { // Arrays.\r\n\t\t\toutput += serializeArray(obj, eol, eol2);\r\n\t\t} else {\r\n\t\t\t/** An object literal is serialized as a sequence of key-value pairs separated by commas\r\n\t\t\t\tbetween braces. Each pair is joined by a colon. This is the same syntax that\r\n\t\t\t\tJavascript's object literals follow.\r\n\t\t\t*/\r\n\t\t\tvar objProto = _getProto(obj),\r\n\t\t\t\telems = '';\r\n\t\t\tif (obj.constructor === Object || !useConstructions ||\r\n\t\t\t\t\tclimbPrototypes && !objProto.hasOwnProperty('constructor')) {\r\n\t\t\t\telems = serializeElements(obj, eol, eol2);\r\n\t\t\t/** The object's prototype not having its constructor as an own property is understood\r\n\t\t\t\tas an indication that the prototype has been altered, and hence needs to be\r\n\t\t\t\tserialized. If the `climbPrototypes` modifier is `true`, the object's prototype is\r\n\t\t\t\tadded to the serialization as the `__proto__` property.\r\n\t\t\t*/\r\n\t\t\t\tif (climbPrototypes && !objProto.hasOwnProperty('constructor')) {\r\n\t\t\t\t\telems += (elems ? ','+ eol2 : '') +'__proto__'+ _colon\r\n\t\t\t\t\t\t+ serializeObject(objProto, eol);\r\n\t\t\t\t}\r\n\t\t\t\toutput += '{'+ eol2 + elems + eol +'}';\r\n\t\t\t} else {\r\n\t\t\t/** Constructions is the term used to custom serializations registered by the user for\r\n\t\t\t\tspecific types. They are serialized as an identifier, followed by a sequence of\r\n\t\t\t\tvalues \tseparated by commas between parenthesis. It ressembles a call to a function\r\n\t\t\t\tin Javascript.\r\n\t\t\t*/\r\n\t\t\t\tvar record = sermat.record(obj.constructor)\r\n\t\t\t\t\t|| autoInclude && sermat.include(obj.constructor);\r\n\t\t\t\tif (!record) {\r\n\t\t\t\t\tthrow new TypeError(\"Sermat.ser: Unknown type \\\"\"+\r\n\t\t\t\t\t\tsermat.identifier(obj.constructor) +\"\\\"!\");\r\n\t\t\t\t}\r\n\t\t\t\tvar args = record.serializer.call(sermat, obj),\r\n\t\t\t\t\tid = record.identifier;\r\n\t\t\t\tif (Array.isArray(args)) {\r\n\t\t\t\t\toutput += (ID_REGEXP.exec(id) ? id : serializeString(id)) +'('+ eol2\r\n\t\t\t\t\t\t+ serializeElements(args, eol, eol2) + eol +')';\r\n\t\t\t\t} else {\r\n\t\t\t\t\toutput += serializeObject(args, eol);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tparents.pop();\r\n\t\treturn output;\r\n\t}",
"function is_object(object) {\n\t\treturn exists(object) && object !== null && object.constructor === object_constructor;\n\t}",
"function serialize(object) {\n return JSON.stringify(object, Object.keys(object).sort())\n}",
"serialize_object(obj) {\n if (!this.is_object(obj)) return false;\n var props = [];\n if (![null, undefined].includes(obj)) {\n for (const [prop, val] of Object.entries(obj)) {\n if (['apikey','secret','password'].includes(prop.toLowerCase())) {\n var newval = '********';\n } else {\n var newval = this.serialize(val);\n }\n props.push(prop + ': ' + newval);\n }\n return '{' + props.join(', ') + '}';\n }\n return 'null';\n }",
"function SaveObject() {\n var oDuplicated = JSON.parse(JSON.stringify(o));\n DeleteBlocTemplateFromAssembly();\n AllUndefinedNullToNothing();\n if (ConfiguratorMode == 'CBC') {\n o.BlocAssembly[\"@LastModifiedFromConf\"] = \"true\";\n }\n window.GetCurrentStampAppVersion()\n .then(function (version) {\n o.BlocAssembly[\"@StampAppVersion\"] = version;\n xmlDoc = json2xml(o);\n return SaveToXml((ConfiguratorMode == 'assembly') ? url.pathToXML : url.pathToXMLCBC)\n }).then(function () {\n alertify.success(translations.GENERAL_SAVING);\n window.setTimeout(RechargeAfterSaving, 3000);\n document.getElementById('disablingDiv').style.display = 'block';\n aux = \"\";\n aux += \"<div class='w3-progress-container'>\";\n aux += \" <div id='myBar' class='w3-progressbar w3-green' style='width:1%'></div>\";\n aux += \"</div>\";\n document.getElementById('disablingDiv').innerHTML = aux;\n MoveProgressBar();\n o = oDuplicated;\n });\n}",
"static async isValidObject (object) {\n return Station.validator.validate('station.schema.json', object);\n }",
"function createObject(object) {\r\n try {\r\n if(folder && folder !==null) {\r\n if(!fs.existsSync(folder)) {\r\n fs.mkdirSync(folder);\r\n }\r\n }\r\n if(object && object !== null) {\r\n fs.mkdirSync(folder + object);\r\n } else {\r\n rtn = exception(\"SimpleStorage: [\"+object+\"]\", \"unable to create object\", 400);\r\n }\r\n } catch(ex) {\r\n rtn = exception(\"SimpleStorage: [\"+object+\"]\", ex.message, 400);\r\n }\r\n}",
"function operateOnObject(o) {\n return;\n}",
"toString() {\n return (JSON.stringify(this.object));\n }",
"function createJSON(object){\n\n\ttry{\n\n\t\t// save vertices as arrays for x, y and z\n\t\tlet x = [];\n\t\tlet y = [];\n\t\tlet z = [];\n\n\t\t// get vertices\n\t\tlet vertices = object.geometry.getAttribute('position');\n\n\t\t// get number of vertices\n\t\tlet count = object.geometry.getAttribute('position').count;\n\n\t\t// add coordinates to arrays\n\t\tfor(let i = 0; i < count; i++){\n\t\t\tx.push(vertices.getX(i));\n\t\t\ty.push(vertices.getY(i));\n\t\t\tz.push(vertices.getZ(i));\n\t\t}\n\n\t\t// save vertex indices\n\t\tlet faces = [];\n\n\t\t// get vertices as array\n\t\tlet array = object.geometry.getIndex().array;\n\t\tlet length = array.length;\n\n\t\t// store indices for each point in an array and add array to indices array\n\t\tfor(let i = 0; i < length;){\n\t\t\tlet row = [];\n\t\t\trow.push(array[i++],array[i++],array[i++]);\n\t\t\tfaces.push(row);\n\t\t}\n\n\t\t// create JSON\n\t\tlet json = {\n\t\t\tobjID: object.name.toString(),\n\t\t\tobjClass: object.userData[0].toString(),\n\t\t\tcolor: \"\",\n\t\t\tsanding: \"\",\n\t\t\tvertex_indices: faces,\n\t\t\tx: x,\n\t\t\ty: y,\n\t\t\tz: z\n\t\t};\n\n\t\t// return object as json\n\t\treturn json;\n\n\t}catch(error){\n\n // update display\n status = 'Fehler bei JSON-Erstellung';\n\n\t\t// return null\n\t\treturn null;\n\t}\n}",
"function saveObj(object) {\n var search = db.collection('search');\n search.insert(object.data);\n console.log(\"Object was saved successfully!!!\");\n createHistory();\n }",
"function is_object(object) {\n\treturn exists(object) && object !== null && object.constructor === object_constructor;\n}",
"function ro(t){return Object.prototype.toString.call(t)===\"[object Object]\"}",
"function Check(object) {\n if((!object) || (object === null) || (object === undefined)) {\n console.error((object.constructor.name || object.name) + \" was not created!\");\n return true;\n } else {\n console.log((object.constructor.name || object.name) + \" has been created.\");\n return false;\n }\n}",
"function safeSerialize(obj) {\r\n var str;\r\n try {\r\n var seenObjects_1 = [];\r\n str = JSON.stringify(obj, function (key, value) {\r\n if (value === window) {\r\n return '[window]';\r\n }\r\n else if (value instanceof HTMLElement) {\r\n return '[HTMLElement]';\r\n }\r\n else if (typeof value === 'function') {\r\n return '[function]';\r\n }\r\n else if (typeof value === 'object') {\r\n if (value === null) {\r\n return value;\r\n }\r\n else if (seenObjects_1.indexOf(value) === -1) {\r\n seenObjects_1.push(value);\r\n return value;\r\n }\r\n else {\r\n return '[circular]';\r\n }\r\n }\r\n else {\r\n return value;\r\n }\r\n });\r\n }\r\n catch (err) {\r\n // Note: we make this be a JSON string, so that consumers\r\n // can always call JSON.parse.\r\n str = JSON.stringify('[object]');\r\n }\r\n return str;\r\n}",
"function safeSerialize(obj) {\r\n var str;\r\n try {\r\n var seenObjects_1 = [];\r\n str = JSON.stringify(obj, function (key, value) {\r\n if (value === window) {\r\n return '[window]';\r\n }\r\n else if (value instanceof HTMLElement) {\r\n return '[HTMLElement]';\r\n }\r\n else if (typeof value === 'function') {\r\n return '[function]';\r\n }\r\n else if (typeof value === 'object') {\r\n if (value === null) {\r\n return value;\r\n }\r\n else if (seenObjects_1.indexOf(value) === -1) {\r\n seenObjects_1.push(value);\r\n return value;\r\n }\r\n else {\r\n return '[circular]';\r\n }\r\n }\r\n else {\r\n return value;\r\n }\r\n });\r\n }\r\n catch (err) {\r\n // Note: we make this be a JSON string, so that consumers\r\n // can always call JSON.parse.\r\n str = JSON.stringify('[object]');\r\n }\r\n return str;\r\n}",
"json(obj) {\n return this.string(JSON.stringify(obj));\n }",
"validateObject(object, rules) {\n return this.validator.validateObject(object, rules).then(results => {\n this.cb(results);\n return results;\n });\n }",
"encode(obj) {\n let encoder = new Encoder(this);\n encoder.encode(obj);\n return encoder.output();\n }",
"async function jsonChecksum (object) {\n const inString = JSON.stringify(object);\n const inBuffer = binaryStringToArrayBuffer(inString);\n // this does not need to be cryptographically secure, SHA-1 is fine\n const outBuffer = await crypto.subtle.digest('SHA-1', inBuffer);\n const outBinString = arrayBufferToBinaryString(outBuffer);\n const res = btoa(outBinString);\n return res\n}",
"objd(obj) {\n\n return toObject(obj);\n }",
"function serializeObject(value) {\n\tif (value === null) {\n\t\treturn '';\n\t}\n\tvar result;\n\tvar typeOf = typeof value;\n\n\tif (typeOf === 'object' && (value !== null)) {\n\t\tresult = '{';\n\t\tif (Array.isArray(value)) {\n\t\t\tvalue.forEach(function (arrayValue, i) {\n\t\t\t\tif (i !== 0) {\n\t\t\t\t\tresult += ',';\n\t\t\t\t}\n\t\t\t\tresult += serializeObject(arrayValue);\n\t\t\t});\n\t\t} else {\n\t\t\tObject.keys(value).forEach(function (key, i) {\n\t\t\t\tif (i !== 0) {\n\t\t\t\t\tresult += ',';\n\t\t\t\t}\n\t\t\t\tresult += key + ':' + serializeObject(value[key]);\n\t\t\t});\n\t\t}\n\n\t\tresult += '}';\n\t} else if (typeOf === 'string') {\n\t\tresult = '\"' + value + '\"';\n\t} else if (value === undefined) {\n\t\tresult = 'null';\n\t}\n\n\treturn result || value;\n}",
"function safeSerialize(obj) {\n var str;\n try {\n var seenObjects_1 = [];\n str = JSON.stringify(obj, function (key, value) {\n if (value === window) {\n return '[window]';\n }\n else if (value instanceof HTMLElement) {\n return '[HTMLElement]';\n }\n else if (typeof value === 'function') {\n return '[function]';\n }\n else if (typeof value === 'object') {\n if (value === null) {\n return value;\n }\n else if (seenObjects_1.indexOf(value) === -1) {\n seenObjects_1.push(value);\n return value;\n }\n else {\n return '[circular]';\n }\n }\n else {\n return value;\n }\n });\n }\n catch (err) {\n // Note: we make this be a JSON string, so that consumers\n // can always call JSON.parse.\n str = JSON.stringify('[object]');\n }\n return str;\n}",
"function vet(object) {\n if (typeof object == \"undefined\") {\n console.error(\"vet: object is undefined.\");\n return false;\n }\n if (object == null) {\n console.error(\"vet: object == null.\");\n return false;\n }\n if (object == NaN) {\n console.error(\"vet: object == NaN.\");\n return false;\n } \n return true;\n}",
"function serializeObject(object, opts) {\n if (opts === void 0) { opts = {}; }\n var prefix = opts.prefix, suffix = opts.suffix, _a = opts.signingFieldsOnly, signingFieldsOnly = _a === void 0 ? false : _a;\n var bytesList = new binary_serializer_1.BytesList();\n if (prefix) {\n bytesList.put(prefix);\n }\n var filter = signingFieldsOnly\n ? function (f) { return f.isSigningField; }\n : undefined;\n types_1.coreTypes.STObject.from(object, filter).toBytesSink(bytesList);\n if (suffix) {\n bytesList.put(suffix);\n }\n return bytesList.toBytes();\n}",
"function stringifyJson (object) {\n try {\n var json_string = JSON.stringify(object);\n return json_string;\n } catch (e) {\n return JSON.stringify({});\n }\n }",
"function copy(object) {\n if (object !== null && typeof object === 'object') {\n return JSON.parse(JSON.stringify(object));\n }\n return null;\n}",
"function is_object(param){\n\t\tif(Object.prototype.toString.call(param) == \"[object Object]\" || param.constructor == Object){\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function _isAlternativeRecognitionResult(obj) {\r\n return obj && typeof obj === 'object';\r\n}",
"function safeSerialize(obj) {\n var str;\n try {\n var seenObjects_1 = [];\n str = JSON.stringify(obj, (function (key, value) {\n if (value === window) {\n return \"[window]\";\n }\n else if (value instanceof HTMLElement) {\n return \"[HTMLElement]\";\n }\n else if (typeof value === \"function\") {\n return \"[function]\";\n }\n else if (typeof value === \"object\") {\n if (value === null) {\n return value;\n }\n else if (seenObjects_1.indexOf(value) === -1) {\n seenObjects_1.push(value);\n return value;\n }\n else {\n return \"[circular]\";\n }\n }\n else {\n return value;\n }\n }));\n }\n catch (err) {\n // Note: we make this be a JSON string, so that consumers\n // can always call JSON.parse.\n str = JSON.stringify(\"[object]\");\n }\n return str;\n}",
"function serialize(obj) {\n if (generic_1.isOrder(obj))\n return marshall_1.binary.serializeOrder(obj);\n return marshall_1.binary.serializeTx(obj);\n}",
"function resultObj(){\n\n\t\tthis.nsid = false\n\t\tthis.source = false\n\t\tthis.value = false\n\t\tthis.differentiated = true\t//default is to be differentiated \n\t\tthis.sparse = false\n\t}",
"function toJSON(object) {\r\n var type = typeof object;\r\n if ('object' == type) {\r\n if (Array == object.constructor) type = 'array';\r\n else if (RegExp == object.constructor) type = 'regexp';\r\n else type = 'object';\r\n }\r\n switch (type) {\r\n case 'undefined':\r\n case 'unknown':\r\n return;\r\n break;\r\n case 'function':\r\n case 'boolean':\r\n case 'regexp':\r\n return object.toString();\r\n break;\r\n case 'number':\r\n return isFinite(object) ? object.toString() : 'null';\r\n break;\r\n case 'string':\r\n return '\"' + object.replace(/(\\\\|\\\")/g, \"\\\\$1\").replace(/\\n|\\r|\\t/g,\r\n function() {\r\n var a = arguments[0];\r\n return (a == '\\n') ? '\\\\n': (a == '\\r') ? '\\\\r': (a == '\\t') ? '\\\\t': \"\"\r\n }) + '\"';\r\n break;\r\n case 'object':\r\n if (object === null) return 'null';\r\n var results = [];\r\n for (var property in object) {\r\n if (property == \"parent\") continue;\r\n var value = toJSON(object[property]);\r\n if (value !== undefined) results.push(toJSON(property) + ':' + value);\r\n }\r\n return '{' + results.join(',') + '}';\r\n break;\r\n case 'array':\r\n var results = [];\r\n for (var i = 0; i < object.length; i++) {\r\n var value = toJSON(object[i]);\r\n if (value !== undefined) results.push(value);\r\n }\r\n return '[' + results.join(',') + ']';\r\n break;\r\n }\r\n }",
"validateObject(\n className: string,\n object: any,\n query: any,\n runOptions: QueryOptions,\n maintenance: boolean\n ): Promise<boolean> {\n let schema;\n const acl = runOptions.acl;\n const isMaster = acl === undefined;\n var aclGroup: string[] = acl || [];\n return this.loadSchema()\n .then(s => {\n schema = s;\n if (isMaster) {\n return Promise.resolve();\n }\n return this.canAddField(schema, className, object, aclGroup, runOptions);\n })\n .then(() => {\n return schema.validateObject(className, object, query, maintenance);\n });\n }",
"function isobj(item){\n if(typeof(item) === 'object'){\n return true;\n }else{\n return false;\n }\n }",
"async putObject() {\n const { ContentLength } = this.object;\n this.resultData = await this.cosSdkInstance.putObjectRetry({\n ...this.object,\n GetBody: () => readStreamAddPassThrough(this.getReadStream(0, ContentLength)),\n });\n this.manageGlobalCacheData('remove');\n }",
"function write_object_to_temp(obj, fname, callback) {\n var target = 'jsonify.php';\n var data = {\n 'id': proj_id,\n 'fname': fname,\n 'json': JSON.stringify(obj, null, 4)\n };\n send_ajax_request(target, data, callback, false);\n}",
"static hasObjectify(object) {\n return isObjectAssigned(object) && isFunction(object.objectify);\n }",
"function validObject(A) {\n return A === Object(A);\n}",
"function createBuildResult(output, object) {\n var result = object || { };\n result.output = output.toString();\n result.logLines = parseLines(output);\n result.warnings = result.logLines.filter(function (line) {\n return line.logLevel === 'WARN';\n });\n result.errors = result.logLines.filter(function (line) {\n return line.logLevel === 'ERROR';\n });\n return result;\n}",
"addLocal(object) {\n return new Promise((resolve, reject) => {\n chrome.storage.sync.get(this.name, (res) => {\n for (var key in object) {\n object[key] = JSON.stringify(object[key]);\n }\n if (res[this.name] != undefined) {\n res[this.name].push(object);\n chrome.storage.sync.set({ [this.name]: res[this.name] }, () => {\n resolve(true);\n });\n }\n else {\n reject(`Error finding collection ${this.name}`);\n }\n });\n });\n }",
"function logResult(result)\n{\n if (result === null) {\n log(\"result: null\");\n return;\n }\n if (typeof result == 'object') {\n log(\"result size: \" + result.byteLength);\n result = new Uint8Array(result, 0, result.byteLength);\n } else\n log(\"result size: \" + result.length);\n\n var resultOutput = _isASCIIString(result) ? _toString(result) : _toHexadecimal(result);\n log(\"result: \" + resultOutput);\n}",
"function insertObject(object) {\n return function(dispatch) {\n socket.emit('insert-object', object, function(data) {\n if(data.type == \"error\") {\n dispatch({\n type: ERROR,\n message: data.message\n });\n } else {\n dispatch({\n type: OBJECT_INSERTED,\n object: data.data\n });\n }\n });\n }\n}",
"function store(obj) {\n var json = JSON.stringify(obj);\n return localStorage.setItem(storageKey, json);\n }",
"save (result = null, releaseTemporaries = false) {\n\t\t\tresult = result || new Complex;\n\t\t\tresult.copy (this);\n\t\t\tif (releaseTemporaries) Complex.ReleaseTemporaries ();\n\t\t\treturn result;\n\t\t}",
"function write() {\n fs.writeFileSync(wordLength + filename, JSON.stringify(object), 'utf8');\n}",
"function serialize (obj) {\r\n var res;\r\n \r\n res = JSON.stringify(obj, function (k, v) {\r\n checkKey(k, v);\r\n \r\n if (v === undefined) { return undefined; }\r\n if (v === null) { return null; }\r\n\r\n // Hackish way of checking if object is Date (this way it works between execution contexts in node-webkit).\r\n // We can't use value directly because for dates it is already string in this function (date.toJSON was already called), so we use this\r\n if (typeof this[k].getTime === 'function') { return { $$date: this[k].getTime() }; }\r\n\r\n return v;\r\n });\r\n\r\n return res;\r\n}",
"get resultObj() {\n return this._resultObj;\n }",
"function calculateObjectSize(object, options = {}) {\n options = options || {};\n const serializeFunctions = typeof options.serializeFunctions === 'boolean' ? options.serializeFunctions : false;\n const ignoreUndefined = typeof options.ignoreUndefined === 'boolean' ? options.ignoreUndefined : true;\n return calculate_size.calculateObjectSize(object, serializeFunctions, ignoreUndefined);\n}",
"function isWebResourceLike(object) {\n if (object && typeof object === \"object\") {\n const castObject = object;\n if (typeof castObject.url === \"string\" &&\n typeof castObject.method === \"string\" &&\n typeof castObject.headers === \"object\" &&\n isHttpHeadersLike(castObject.headers) &&\n typeof castObject.validateRequestProperties === \"function\" &&\n typeof castObject.prepare === \"function\" &&\n typeof castObject.clone === \"function\") {\n return true;\n }\n }\n return false;\n}",
"function isWebResourceLike(object) {\n if (object && typeof object === \"object\") {\n const castObject = object;\n if (typeof castObject.url === \"string\" &&\n typeof castObject.method === \"string\" &&\n typeof castObject.headers === \"object\" &&\n isHttpHeadersLike(castObject.headers) &&\n typeof castObject.validateRequestProperties === \"function\" &&\n typeof castObject.prepare === \"function\" &&\n typeof castObject.clone === \"function\") {\n return true;\n }\n }\n return false;\n}",
"function JSBridgeObj_AddObject(id, obj) {\n var result = JSBridgeObj_AddObjectAuxiliar(id, obj);\n if (result != \"\") {\n if (this.objectJson != \"\") {\n this.objectJson += \", \";\n }\n this.objectJson += result;\n }\n}"
] |
[
"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.51060605",
"0.51060605",
"0.50954795",
"0.50803554",
"0.50618684",
"0.5058216",
"0.50538397",
"0.5045101",
"0.5045101",
"0.5037349",
"0.5018549",
"0.50127304",
"0.49981797",
"0.49933624",
"0.49909216",
"0.4986107",
"0.49509367",
"0.49329478",
"0.4901324",
"0.4897094",
"0.48853225",
"0.4883577",
"0.48792493",
"0.48745245",
"0.48661688",
"0.48537245",
"0.48342606",
"0.48341912",
"0.48226717",
"0.48222664",
"0.48005673",
"0.47938156",
"0.47841564",
"0.47769463",
"0.477448",
"0.47698593",
"0.47698593",
"0.4760215",
"0.47502884",
"0.473033",
"0.4727111",
"0.47239068",
"0.47218257",
"0.47198984",
"0.47180957",
"0.471028",
"0.47049433",
"0.46951947",
"0.46915594",
"0.4681591",
"0.4681591",
"0.4681591",
"0.4681591",
"0.4681591",
"0.4681591",
"0.4681591",
"0.46731225",
"0.46712315",
"0.46565166",
"0.4655791",
"0.4647045",
"0.46434462",
"0.46422568",
"0.46341744",
"0.46260983",
"0.46251002",
"0.4616295",
"0.459866",
"0.45973626",
"0.45883706",
"0.45867744",
"0.45849952",
"0.45833412",
"0.45801413",
"0.45782876",
"0.4572523",
"0.4572104",
"0.4566303",
"0.4566303",
"0.4565157"
] |
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(){};return b.prototype=a,new b}",
"function i(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach(function(n){a(t.prototype,e.prototype,n)}),Object.getOwnPropertyNames(e).forEach(function(n){a(t,e,n)})}",
"function i(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach(function(n){a(t.prototype,e.prototype,n)}),Object.getOwnPropertyNames(e).forEach(function(n){a(t,e,n)})}",
"function getFunctionParent() {\n\t return this.findParent(function (path) {\n\t return path.isFunction() || path.isProgram();\n\t });\n\t}",
"function getFunctionParent() {\n\t return this.findParent(function (path) {\n\t return path.isFunction() || path.isProgram();\n\t });\n\t}",
"function getFunctionParent() {\n\t return this.findParent(function (path) {\n\t return path.isFunction() || path.isProgram();\n\t });\n\t}",
"function getFunctionParent() {\n\t return this.findParent(function (path) {\n\t return path.isFunction() || path.isProgram();\n\t });\n\t}",
"function getFunctionParent() {\n\t return this.findParent(function (path) {\n\t return path.isFunction() || path.isProgram();\n\t });\n\t}",
"function i(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach((function(n){a(t.prototype,e.prototype,n)})),Object.getOwnPropertyNames(e).forEach((function(n){a(t,e,n)}))}",
"function i(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach((function(n){a(t.prototype,e.prototype,n)})),Object.getOwnPropertyNames(e).forEach((function(n){a(t,e,n)}))}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function F() {}",
"function r(e,t){s(e,t),Object.getOwnPropertyNames(t.prototype).forEach(function(o){s(e.prototype,t.prototype,o)}),Object.getOwnPropertyNames(t).forEach(function(o){s(e,t,o)})}",
"function inherit(){}",
"function a(e,t){function i(){this.constructor=e}o(e,t),e.prototype=null===t?RS(t):(i.prototype=t.prototype,new i)}",
"function A() {}",
"function getFunctionParent() {\n return this.findParent(function (path) {\n return path.isFunction() || path.isProgram();\n });\n}",
"function Nothing$prototype$chain(f) {\n return this;\n }",
"function R(e,t){function n(){this.constructor=e}A(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function Pf(a){return Qf(a||arguments.callee.caller,[])}",
"function F() { }",
"function i(t,e){function n(){this.constructor=t}s(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}",
"getPrototypeOf() {\n return null;\n }",
"function a(t,e){o(t,e),Object.getOwnPropertyNames(e.prototype).forEach((function(n){o(t.prototype,e.prototype,n)})),Object.getOwnPropertyNames(e).forEach((function(n){o(t,e,n)}))}",
"function functionPrototypeTest() {\n var ret;\n\n print(Object.prototype.toString.call(Function.prototype));\n print(Object.getPrototypeOf(Function.prototype) === Object.prototype);\n print(Object.isExtensible(Function.prototype));\n print('length' in Function.prototype, Function.prototype.length);\n print('constructor' in Function.prototype, Function.prototype.constructor === Function);\n\n ret = Function.prototype('foo', 'bar');\n print(typeof ret, ret);\n}",
"function a(e,t){function n(){}n.prototype=t.prototype,e.superClass_=t.prototype,e.prototype=new n,e.prototype.constructor=e}",
"function inderit(C, P) {\n function F() {};\n F.prototype = P.prototype;\n C.prototype = new F();\n}",
"function ef(e,t){function n(){this.constructor=e}Jd(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"constructor() {\n var prototype = Object.getPrototypeOf(this);\n }",
"function p(e,t){function n(){this.constructor=e}N(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function l(e,t){function r(){this.constructor=e}c(e,t),e.prototype=null===t?Object.create(t):(r.prototype=t.prototype,new r)}",
"function v37() {\n function v11() {\n function a() {\n }\n function v6() {\n a.prototype = this;\n var c = new a;\n return c\n }\n var v203 = {extend:v6};\n return v203\n }\n var ret = {};\n ret.A = v11();\n ret.B = ret.A.extend();\n return ret;\n}",
"function x(t){return\"function\"==typeof t?t:function(){return t}}",
"function Function$prototype$chain(f) {\n var chain = this;\n return function(x) { return f (chain (x)) (x); };\n }",
"function Function$prototype$chain(f) {\n var chain = this;\n return function(x) { return f(chain(x))(x); };\n }",
"constructor() {\n super(...arguments);\n var prototype = Object.getPrototypeOf(this);\n }",
"constructor() {\n super(...arguments);\n var prototype = Object.getPrototypeOf(this);\n }",
"function R(e,t){function n(){this.constructor=e}z(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function i(t,e){function n(){this.constructor=t}o(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}",
"function i(t,e){function n(){this.constructor=t}o(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}",
"function i(t,e){function n(){this.constructor=t}o(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}",
"function i(t,e){function r(){this.constructor=t}o(t,e),t.prototype=null===e?Object.create(e):(r.prototype=e.prototype,new r)}",
"function firstClass(base){\n //returns anonymous function evaluating the new paremeter to the power of whatever the base it set to\n return (q) => q ** base;\n}",
"function e(e,t){function n(){}n.prototype=t.prototype,e.superClass_=t.prototype,e.prototype=new n,e.prototype.constructor=e}",
"function superClass(...args) {}",
"function i(e,t){function i(){}i.prototype=t.prototype,e.superClass_=t.prototype,e.prototype=new i,e.prototype.constructor=e}",
"function Se(e,t){function n(){this.constructor=e}_e(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function r(e){return\"function\"===typeof e}",
"function r(e){return\"function\"===typeof e}",
"function C() {}",
"function C() {}",
"function n(e,t){function n(){}n.prototype=t.prototype,e.superClass_=t.prototype,e.prototype=new n,e.prototype.constructor=e}",
"function n(e,t){function n(){}n.prototype=t.prototype,e.superClass_=t.prototype,e.prototype=new n,e.prototype.constructor=e}",
"function n(e,t){function n(){}n.prototype=t.prototype,e.superClass_=t.prototype,e.prototype=new n,e.prototype.constructor=e}",
"function F(){}",
"set prototype(value) {}",
"function c(e){return\"undefined\"!==typeof Function&&e instanceof Function||\"[object Function]\"===Object.prototype.toString.call(e)}",
"function i(e){return\"function\"===typeof e}",
"function i(e,t){function n(){this.constructor=e}o(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function i(e,t){function n(){this.constructor=e}o(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function e(A){return\"undefined\"!==typeof Function&&A instanceof Function||\"[object Function]\"===Object.prototype.toString.call(A)}",
"function o(e,t){s(e,t),Object.getOwnPropertyNames(t.prototype).forEach((function(n){s(e.prototype,t.prototype,n)})),Object.getOwnPropertyNames(t).forEach((function(n){s(e,t,n)}))}",
"function o(e,t){a(e,t),Object.getOwnPropertyNames(t.prototype).forEach((function(r){a(e.prototype,t.prototype,r)})),Object.getOwnPropertyNames(t).forEach((function(r){a(e,t,r)}))}",
"function Nothing$prototype$extend(f) {\n return this;\n }",
"function primBeget(proto) {\n if (proto === null) { fail('Cannot beget from null.'); }\n if (proto === (void 0)) { fail('Cannot beget from undefined.'); }\n function F() {}\n F.prototype = proto;\n var result = new F();\n result.proto___ = proto;\n return result;\n }",
"function o(e,t){a(e,t),Object.getOwnPropertyNames(t.prototype).forEach(function(n){a(e.prototype,t.prototype,n)}),Object.getOwnPropertyNames(t).forEach(function(n){a(e,t,n)})}",
"function o(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach(function(n){a(t.prototype,e.prototype,n)}),Object.getOwnPropertyNames(e).forEach(function(n){a(t,e,n)})}",
"function o(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach(function(n){a(t.prototype,e.prototype,n)}),Object.getOwnPropertyNames(e).forEach(function(n){a(t,e,n)})}",
"function o(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach(function(n){a(t.prototype,e.prototype,n)}),Object.getOwnPropertyNames(e).forEach(function(n){a(t,e,n)})}",
"function o(t,e){a(t,e),Object.getOwnPropertyNames(e.prototype).forEach(function(n){a(t.prototype,e.prototype,n)}),Object.getOwnPropertyNames(e).forEach(function(n){a(t,e,n)})}",
"function Prototype() {\n }",
"function o(e,t){a(e,t),Object.getOwnPropertyNames(t.prototype).forEach((function(n){a(e.prototype,t.prototype,n)})),Object.getOwnPropertyNames(t).forEach((function(n){a(e,t,n)}))}",
"function o(e,t){a(e,t),Object.getOwnPropertyNames(t.prototype).forEach((function(n){a(e.prototype,t.prototype,n)})),Object.getOwnPropertyNames(t).forEach((function(n){a(e,t,n)}))}",
"function l(t,e){function o(){this.constructor=t}u(t,e),t.prototype=null===e?Object.create(e):(o.prototype=e.prototype,new o)}",
"function a(t,e){function a(){}a.prototype=e.prototype,t.superClass_=e.prototype,t.prototype=new a,t.prototype.constructor=t}",
"function I () {}",
"function printable(constructorFn) {\n constructorFn.prototype.print = function () {\n console.log(this);\n };\n}",
"function e(t,e){function o(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(o.prototype=e.prototype,new o)}",
"function y(){f.call(this)}",
"function y(){f.call(this)}",
"function y(){f.call(this)}",
"function C(e){return C=\"function\"===typeof Symbol&&\"symbol\"===typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&\"function\"===typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?\"symbol\":typeof e},C(e)}",
"function C(e){return C=\"function\"===typeof Symbol&&\"symbol\"===typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&\"function\"===typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?\"symbol\":typeof e},C(e)}",
"function E(e,t){function i(){this.constructor=e}T(e,t),e.prototype=null===t?Object.create(t):(i.prototype=t.prototype,new i)}",
"function getSuperCallInConstructor(constructor) {\n var links = getNodeLinks(constructor);\n // Only trying to find super-call if we haven't yet tried to find one. Once we try, we will record the result\n if (links.hasSuperCall === undefined) {\n links.superCall = findFirstSuperCall(constructor.body);\n links.hasSuperCall = links.superCall ? true : false;\n }\n return links.superCall;\n }",
"function Ac(e,t){function n(){this.constructor=e}Rc(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}",
"function uf(e,t){function i(){this.constructor=e}Af(e,t),e.prototype=null===t?Object.create(t):(i.prototype=t.prototype,new i)}"
] |
[
"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.5678385",
"0.5678385",
"0.5678385",
"0.5678385",
"0.5678385",
"0.565108",
"0.5645732",
"0.5637481",
"0.562449",
"0.5618365",
"0.56064737",
"0.55589443",
"0.55563325",
"0.55500287",
"0.554697",
"0.554212",
"0.5534147",
"0.5519004",
"0.5515882",
"0.5507772",
"0.55063623",
"0.54989374",
"0.54803085",
"0.54615164",
"0.54601544",
"0.5455233",
"0.54523265",
"0.5447913",
"0.5444744",
"0.5444744",
"0.5443466",
"0.54398596",
"0.54398596",
"0.54398596",
"0.5413922",
"0.5412412",
"0.54117656",
"0.5409369",
"0.539573",
"0.5390031",
"0.5387299",
"0.5387299",
"0.5373841",
"0.5373841",
"0.5372636",
"0.5372636",
"0.5372636",
"0.53725433",
"0.53619176",
"0.53541523",
"0.5343151",
"0.5337687",
"0.5337687",
"0.53370094",
"0.53273284",
"0.53254557",
"0.53230906",
"0.53177",
"0.5315517",
"0.5310741",
"0.5310741",
"0.5310741",
"0.5310741",
"0.5307316",
"0.5303272",
"0.5303272",
"0.52866334",
"0.5280505",
"0.527966",
"0.52786905",
"0.5278416",
"0.52688104",
"0.52688104",
"0.52688104",
"0.5264471",
"0.5264471",
"0.526303",
"0.52628493",
"0.52535075",
"0.5252369"
] |
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}",
"remove(key) {\r\n const hash = this.calculateHash(key);\r\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\r\n delete this.values[hash][key];\r\n this.numberOfValues--;\r\n }\r\n }",
"removeFromHash(hash, ...keys) {\n let hashObj = this.parseHash(hash);\n keys.forEach((key, i) => {\n delete hashObj[key]\n });\n return this.buildHash(hashObj);\n }",
"clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }",
"function _cleanupKeys()\n {\n if (this._count == this._keys.length) {\n return;\n }\n var srcIndex = 0;\n var destIndex = 0;\n var seen = {};\n while (srcIndex < this._keys.length) {\n var key = this._keys[srcIndex];\n if (_hasKey(this._map, key)\n && !_hasKey(seen, key)\n ) {\n this._keys[destIndex++] = key;\n seen[key] = true;\n }\n srcIndex++;\n }\n this._keys.length = destIndex;\n }",
"async clear() {\n return await keyv.clear();\n }",
"remove() {\n for (var key of this.keys) {\n this.elements[key].remove();\n }\n }",
"function clear () {\n keys().each(function (cookie) {\n remove(cookie);\n });\n }",
"function clearAll(){\r\n\tObject.keys(this.datastore).forEach((key)=>\r\n\t{\r\n\t\tdelete this.datastore[key];\r\n\t});\t\r\n}",
"function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t}",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"clear() {\n for (const key of Object.keys(this.datastore)) {\n delete this.datastore[key];\n // this.remove(key);\n }\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t }",
"function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t }",
"function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }",
"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\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.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.58648694",
"0.5862478",
"0.5862478",
"0.5849724",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314",
"0.58496314"
] |
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() {\n\t\t this.__data__ = [];\n\t\t}",
"function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t}",
"function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t }",
"function listCacheClear(){this.__data__=[];this.size=0}",
"function listCacheClear(){this.__data__=[];this.size=0}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear(){this.__data__=[];this.size=0;}",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t }",
"function listCacheClear() {\n\t this.__data__ = [];\n\t }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }",
"function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }"
] |
[
"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.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.7234546",
"0.72320706",
"0.7231067",
"0.7231067",
"0.7231067",
"0.7231067",
"0.7231067",
"0.7231067",
"0.7226719",
"0.7226719",
"0.7226719",
"0.7226719",
"0.7214961",
"0.7214961",
"0.7207822",
"0.7207822",
"0.7207822",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724",
"0.71798724"
] |
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 multiMapRemove(map, key, value) {\n const values = map.get(key);\n if (values) {\n array_1.removeUnordered(values, value);\n if (values.length === 0)\n map.delete(key);\n }\n}",
"function _cleanupKeys()\n {\n if (this._count == this._keys.length) {\n return;\n }\n var srcIndex = 0;\n var destIndex = 0;\n var seen = {};\n while (srcIndex < this._keys.length) {\n var key = this._keys[srcIndex];\n if (_hasKey(this._map, key)\n && !_hasKey(seen, key)\n ) {\n this._keys[destIndex++] = key;\n seen[key] = true;\n }\n srcIndex++;\n }\n this._keys.length = destIndex;\n }",
"function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}",
"remove() {\n for (var key of this.keys) {\n this.elements[key].remove();\n }\n }",
"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}",
"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}",
"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}",
"function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }",
"function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }",
"function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t }",
"remove(key) {\r\n const hash = this.calculateHash(key);\r\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\r\n delete this.values[hash][key];\r\n this.numberOfValues--;\r\n }\r\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash(),\n\t 'map': Map ? new Map() : [],\n\t 'string': new Hash()\n\t };\n\t}",
"function mapClear() {\n\t this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n\t}",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}",
"function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}",
"clear() {\n this.map = {};\n if (this.store) this.store.clear();\n }",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}",
"function clear()\r{\r\tvar end = mapping_names.length;\r\r\tfor(var i=end-1; i>=0; i--){\r\t\tremove(mapping_names[i]);\r\t}\r\twhile(mapping_names.pop());\r\twhile(mapping_sources.pop());\r\twhile(mapping_destinations.pop());\r\twhile(mapping_algorithms.pop());\r}",
"function filterMutateMap(map, predicate) {\n for (const [key, value] of map) {\n if (!predicate(key, value)) {\n map.delete(key);\n }\n }\n}",
"delete(key) {\n this.map[key] = undefined;\n if (this.store) this.store.removeItem(key);\n }",
"mapRemove() {\n\n\t\tthis.map.remove();\n\n\t}",
"garbageCollect() {\n // Q: Can we delete keys from the map while iterating over it?\n // A: The ECMA spec states that yes, keys may be deleted during forEach.\n // It is less clear for iterators.\n let deleteBefore = new Date().getTime() - MAX_GLOBAL_COOLDOWN;\n this._cooldowns.forEach((value, key) => {\n if (value < deleteBefore) {\n this._cooldowns.delete(key);\n }\n });\n }",
"function clearAll(){\r\n\tObject.keys(this.datastore).forEach((key)=>\r\n\t{\r\n\t\tdelete this.datastore[key];\r\n\t});\t\r\n}",
"async clear() {\n return await keyv.clear();\n }",
"clear() {\n for (const key of Object.keys(this.datastore)) {\n delete this.datastore[key];\n // this.remove(key);\n }\n }",
"function clearObjects() {\n setMapOnAll(null);\n}",
"clear() {\n const _ = this;\n _._map.clear();\n _._nameSet.clear();\n }",
"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function clear () {\n keys().each(function (cookie) {\n remove(cookie);\n });\n }",
"function clean_maps() {\n var count;\n list_maps();\n\n for (var k in maps) {\n for (var i = 0; i < maps[k].length; i++) {\n var map = maps[k][i];\n count++;\n\n // if map render job is idle and last render process is older than\n // an hour, remove map\n if (map.renderer_idle && (time() - map.renderer_stop > 3600000)) {\n console.log(k + '/' + i + ': garbage collector removes map');\n maps[k].splice(i, 1);\n i--;\n }\n }\n }\n}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map$1||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}",
"stopAll() {\n const _ = this;\n for (const entry of _._map.values()) {\n clearTimeout(entry.handle);\n }\n _._map.clear();\n }",
"function mapCacheClear() {\n\t\t this.size = 0;\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}",
"function mapCacheClear() {\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}",
"function mapCacheClear() {\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }",
"function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map$1 || ListCache)(),\n 'string': new Hash()\n };\n }",
"function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map$1 || ListCache)(),\n 'string': new Hash()\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash(),\n 'map': new (_Map || _ListCache)(),\n 'string': new _Hash()\n };\n }",
"clearance () {\n mapDoS.forEach((val, key, map) => {\n if (val.at < moment().utc().subtract(val.interval, 'seconds')) {\n map.delete(key)\n }\n })\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash.default(),\n 'map': new (_Map.default || _ListCache.default)(),\n 'string': new _Hash.default()\n };\n }",
"function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash(),\n\t 'map': new (_Map || _ListCache)(),\n\t 'string': new _Hash()\n\t };\n\t}",
"function clearEntry () {\n\n nextValue = null;\n}",
"remove(key) {\n let index = this._hash(key);\n if (this.keyMap[index] && this.keyMap[index].length) {\n this.keyMap[index] = undefined;\n this.size--;\n return true;\n } else {\n return false;\n }\n }",
"function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}",
"function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}",
"function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}",
"function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }",
"function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }",
"function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }",
"function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }",
"function clearAllMarkers() {\n setMarkersOnMap(null);\n}",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }",
"clear () {\n if (this.doc !== null) {\n transact(this.doc, transaction => {\n this.forEach(function (_value, key, map) {\n typeMapDelete(transaction, map, key)\n })\n })\n } else {\n /** @type {Map<string, any>} */ (this._prelimContent).clear()\n }\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }",
"function mapCacheClear() {\n\tthis.size = 0;\n\tthis.__data__ = {\n\t\thash: new _Hash(),\n\t\tmap: new ( _Map || _ListCache )(),\n\t\tstring: new _Hash(),\n\t};\n}",
"function mapCacheClear() {\n\t this.__data__ = {\n\t 'hash': new Hash(),\n\t 'map': new (Map || ListCache)(),\n\t 'string': new Hash()\n\t };\n\t }",
"function clearAllMarkers() {\n setAllMap(null);\n}",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }",
"function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }"
] |
[
"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.614778",
"0.614778",
"0.6128783",
"0.6107819",
"0.61020905",
"0.61020905",
"0.61020905",
"0.61020905",
"0.61020905",
"0.61020905",
"0.60481024",
"0.60264283",
"0.60264283",
"0.60264283",
"0.60264283",
"0.60264283",
"0.60264283",
"0.60264283",
"0.6025953",
"0.6008959",
"0.60038495",
"0.5983478",
"0.59401333",
"0.5922161",
"0.5904722",
"0.5903561",
"0.58624434",
"0.58589303",
"0.5847903",
"0.5847903",
"0.5847903",
"0.5847903",
"0.58467245",
"0.5841128",
"0.58262974",
"0.5723219",
"0.5723219",
"0.5723219",
"0.5723219",
"0.5723219",
"0.5723219",
"0.5723219",
"0.5723219",
"0.5723219",
"0.57226574",
"0.5719132",
"0.5708688",
"0.5708688",
"0.57040244",
"0.56992704",
"0.56992704",
"0.5689804",
"0.5685224",
"0.5684027",
"0.5682696",
"0.56815845",
"0.56811434",
"0.5673945",
"0.5673945",
"0.5673945",
"0.5673945",
"0.5673529",
"0.5673529",
"0.5672286",
"0.5672286",
"0.5672286",
"0.5660965",
"0.5659265",
"0.5659265",
"0.5655427",
"0.5655427",
"0.5655427",
"0.56540984",
"0.5646518",
"0.56439686",
"0.5634391",
"0.5630649",
"0.5630361",
"0.5630361",
"0.5630361"
] |
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.__data__ = { 'array': [], 'map': null };\n\t }",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }",
"function stackClear() {\n this.__data__ = new _ListCache.default();\n this.size = 0;\n }",
"function stackClear() {\n\tthis.__data__ = new _ListCache();\n\tthis.size = 0;\n}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}",
"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}",
"function stackClear() {\n\t this.__data__ = new _ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n\t\t this.__data__ = new ListCache;\n\t\t this.size = 0;\n\t\t}",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t}",
"function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }",
"function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }",
"function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t }",
"function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t }",
"function stackClear() {\n this.__data__ = new _ListCache.default();\n this.size = 0;\n}",
"function stackClear() {\n this.__data__ = new _ListCache.default();\n this.size = 0;\n}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}",
"function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}"
] |
[
"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.62171006",
"0.6124301",
"0.6123662",
"0.6117471",
"0.6117471",
"0.6117471",
"0.6117471",
"0.6117471",
"0.6117471",
"0.6113855",
"0.6109778",
"0.6109778",
"0.6104759",
"0.6104759",
"0.6104759",
"0.6104759",
"0.6104759",
"0.6104759",
"0.6101607",
"0.6101607",
"0.60982674",
"0.6098207",
"0.6098207",
"0.6098207",
"0.6098207",
"0.6078293",
"0.606845",
"0.6068411",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.606763",
"0.6067161",
"0.60666186",
"0.60604995",
"0.60451716",
"0.60451716",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735",
"0.60430735"
] |
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() {\n return this._has_value() ? this._value : undefined;\n }",
"get length(){return undefined;}",
"get length(){return undefined;}",
"get() {\n return null;\n }",
"function getFirstDefined() {\n for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n args[_key3] = arguments[_key3];\n }\n\n for (var _i3 = 0, _args = args; _i3 < _args.length; _i3++) {\n var arg = _args[_i3];\n\n if (arg !== undefined) {\n return arg;\n }\n }\n\n return undefined;\n } // variable used to generate id",
"getValue() {\n return this.defined ? this.value : \"None\";\n }",
"function firstDefined() {\n var i = -1;\n while (++i < arguments.length) {\n if (arguments[i] !== undefined) {\n return arguments[i];\n }\n }\n return undefined;\n }",
"_getPageMetadata() {\n return undefined;\n }",
"value() {return 0}",
"static get INVALID()\n\t{\n\t\treturn 2;\n\t}",
"static get NOT_OWNED() { return 200; }",
"_get () {\n throw new Error('_get not implemented')\n }",
"get() {\r\n // The node doesn't exist until the first update, which normally isn't an\r\n // issue but it can be for tests.\r\n return this.node && this.node.getValue();\r\n }",
"static get EMPTY()\n\t{\n\t\treturn 0;\n\t}",
"function nothing(){// parameters are optional within functions\n return undefined // will return undefined as a single value of the function\n}",
"size() { return 1; }",
"function isUndefined(value){return typeof value === 'undefined';}",
"isDefined() {\n return this.defined;\n }",
"isDefined() {\n return this.defined;\n }",
"get ifNoneExist() {\n\t\treturn this.__ifNoneExist;\n\t}",
"function isUndefined(value) {\n\n}",
"static get ERROR () { return 0 }",
"function Undefined$prototype$toString() {\n return 'undefined';\n }",
"function oreqUndefined () {\n var truthy = function truthy(v) {\n return v !== undefined;\n };\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n var val = args.filter(truthy)[0];\n return truthy(val) ? val : undefined;\n}",
"peek() {\n\t\treturn !this.isEmpty() ? this.items[0] : undefined;\n\t}",
"function returnUndef(){\n let x;\n return x;\n}",
"peek() {\n if(! this.isEmpty()) return this.items[0]\n else return undefined\n }",
"getState() {\n return undefined;\n }",
"IsDefined() {\n\n }",
"function loc() {\n\t return b.literal(-1);\n\t}",
"function loc() {\n\t return b.literal(-1);\n\t}",
"function _undefinedCoerce() {\n return '';\n}",
"function getFirstDefined(...args) {\n\t for (const arg of args) {\n\t if (arg !== undefined) {\n\t return arg;\n\t }\n\t }\n\t return undefined;\n\t}",
"get() {\n return this._internal[0].get();\n }",
"getWordFromPool() {\n // explicit return of undefined if no words remaining in array\n const nextWord = this.words.pop();\n return (nextWord) ? nextWord : undefined;\n }",
"function thisUndefined () {\n function inner() {\n return this;\n }\n return inner();\n}",
"get isDefined() {\n return !!fastRegistry.getByType(this.type);\n }",
"analyze(){ return null }",
"__is_undefined(value) {\n return typeof value === 'undefined';\n }",
"static get ERROR() { return 3 }",
"function isUndefined(o) {\n return typeof o === \"undefined\";\n }",
"get_isPresent()\n {\n return this.liveFunc._isPresent;\n }",
"function defined(obj) {\n return typeof obj !== 'undefined';\n }",
"private public function m246() {}",
"function checkUndefined(value) {\n if (JSON.stringify(value) === undefined) {\n return \"\";\n } else {\n return value;\n }\n }",
"function isUndefined (value) {\nreturn typeof value === 'undefined';\n}",
"function ignore() {\n return null\n }",
"first() {\n if (this.size <= 0)\n return undefined;\n let firstVal = this.values().next();\n return firstVal.value;\n }",
"getValue() {\n\t\treturn getLast( this.stack );\n\t}",
"function isUndefined(value) { return typeof value === \"undefined\"; }",
"function get_self(x) {\r\n return x;\r\n}",
"function IsUndefined(x) {\n\t return x === undefined;\n\t }",
"function isUndefined(mixElement)\n{\n return typeof mixElement == 'undefined';\n}",
"function defined () {\n for (var i=0; i<arguments.length; i++)\n if (typeof arguments[i] !== 'undefined') \n return arguments[i]\n}",
"getTopUnit(){return this.__topUnit}",
"get() {\n\t\tlet result = this.top.value;\n\t\treturn result;\n\t}",
"function loadNothing() {\n return null;\n }",
"function IsUndefined(x) {\r\n return x === undefined;\r\n }",
"function Failure() {\n return null;\n}",
"private internal function m248() {}",
"function defined(obj) {\n return typeof obj !== 'undefined';\n }",
"function ignore() {\n return null\n}",
"function extractUndefinedGlobal(error) {\n const match = error.message.match(/(window|document|localStorage|navigator|alert|location) is not defined/i);\n if (match && match[1]) {\n return match[1];\n }\n return ``;\n}",
"function ignore() {\n return null;\n}",
"get resolution() {}",
"_getResult() {\n\t\treturn null;\n\t}",
"static transient final protected internal function m47() {}",
"static transient final private internal function m43() {}",
"value() {\n if (!this.is_done()) {\n throw new Bug(\"this promise is not calculated yet\");\n }\n return this.box[1];\n }",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function r(e){return void 0===e||null===e}",
"function isUndefined(o) {\n return typeof o === \"undefined\";\n}",
"function isUndefined(o) {\n return typeof o === \"undefined\";\n}"
] |
[
"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.5699058",
"0.5680986",
"0.5662193",
"0.5651359",
"0.56413394",
"0.5638275",
"0.5638275",
"0.56363606",
"0.56305355",
"0.5628426",
"0.56225437",
"0.56160206",
"0.5606573",
"0.5605359",
"0.55846965",
"0.5581656",
"0.55600786",
"0.55577695",
"0.55577695",
"0.5545991",
"0.5508708",
"0.5483681",
"0.54693776",
"0.5460473",
"0.5459672",
"0.54545295",
"0.5445202",
"0.5444901",
"0.5431342",
"0.5429702",
"0.5429137",
"0.5428286",
"0.5425286",
"0.54227436",
"0.5413054",
"0.54085416",
"0.5407151",
"0.5406855",
"0.53976053",
"0.53938365",
"0.5389319",
"0.5382113",
"0.5379595",
"0.5371843",
"0.53536105",
"0.53482395",
"0.5341982",
"0.53387403",
"0.53371346",
"0.5337067",
"0.53356946",
"0.53292316",
"0.53223026",
"0.53194803",
"0.5318998",
"0.5310297",
"0.5307373",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.53005296",
"0.5298108",
"0.5298108"
] |
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;this.reference=reference;this.data=[];this.wantedBy=wantedBy;this.isComplete=this.dot===rule.symbols.length;}",
"function caml_lex_engine(tbl, start_state, lexbuf) {\n var lex_buffer = 2;\n var lex_buffer_len = 3;\n var lex_start_pos = 5;\n var lex_curr_pos = 6;\n var lex_last_pos = 7;\n var lex_last_action = 8;\n var lex_eof_reached = 9;\n var lex_base = 1;\n var lex_backtrk = 2;\n var lex_default = 3;\n var lex_trans = 4;\n var lex_check = 5;\n\n if (!tbl.lex_default) {\n tbl.lex_base = caml_lex_array (tbl[lex_base]);\n tbl.lex_backtrk = caml_lex_array (tbl[lex_backtrk]);\n tbl.lex_check = caml_lex_array (tbl[lex_check]);\n tbl.lex_trans = caml_lex_array (tbl[lex_trans]);\n tbl.lex_default = caml_lex_array (tbl[lex_default]);\n }\n\n var c, state = start_state;\n\n var buffer = lexbuf[lex_buffer].getArray();\n\n if (state >= 0) {\n /* First entry */\n lexbuf[lex_last_pos] = lexbuf[lex_start_pos] = lexbuf[lex_curr_pos];\n lexbuf[lex_last_action] = -1;\n } else {\n /* Reentry after refill */\n state = -state - 1;\n }\n for(;;) {\n /* Lookup base address or action number for current state */\n var base = tbl.lex_base[state];\n if (base < 0) return -base-1;\n /* See if it's a backtrack point */\n var backtrk = tbl.lex_backtrk[state];\n if (backtrk >= 0) {\n lexbuf[lex_last_pos] = lexbuf[lex_curr_pos];\n lexbuf[lex_last_action] = backtrk;\n }\n /* See if we need a refill */\n if (lexbuf[lex_curr_pos] >= lexbuf[lex_buffer_len]){\n if (lexbuf[lex_eof_reached] == 0)\n return -state - 1;\n else\n c = 256;\n }else{\n /* Read next input char */\n c = buffer[lexbuf[lex_curr_pos]];\n lexbuf[lex_curr_pos] ++;\n }\n /* Determine next state */\n if (tbl.lex_check[base + c] == state)\n state = tbl.lex_trans[base + c];\n else\n state = tbl.lex_default[state];\n /* If no transition on this char, return to last backtrack point */\n if (state < 0) {\n lexbuf[lex_curr_pos] = lexbuf[lex_last_pos];\n if (lexbuf[lex_last_action] == -1)\n caml_failwith(\"lexing: empty token\");\n else\n return lexbuf[lex_last_action];\n }else{\n /* Erase the EOF condition only if the EOF pseudo-character was\n consumed by the automaton (i.e. there was no backtrack above)\n */\n if (c == 256) lexbuf[lex_eof_reached] = 0;\n }\n }\n}",
"function State(xx,yy) {\n this.x = xx;\n this.y = yy;\n}",
"function StateMachine (stream, emit, emitError) {\nvar state = { state:'data', context:null, quotation:null, tagName:'', tagType:null }\nvar consume = stream.advance\nvar states = {\n\n// The `content` state doesn't occur in the html5 spec. It functions as\n// an intermediate state for implementing support for rawtext / rcdata\n// elements without requiring a full parser phase. \n\ncontent: function (peek) {\n\tthis.state = (this.tagName in content_map)\n\t\t? content_map[this.tagName]\n\t\t: 'data'\n},\n\ndata: function (peek) {\n\tif (peek === EOF)\n\t\temit('data')\n\telse if (peek === '<') {\n\t\temit('data')\n\t\tconsume()\n\t\tthis.state = 'tagOpen'\n\t}\n\telse if (peek === '&') {\n\t\temit('data')\n\t\tconsume()\n\t\tthis.state = 'charRefIn_'\n\t\t\tthis.context = 'data'\n\t}\n\telse {\n\t\tconsume()\n\t}\n},\n\n// The `tagOpen` state is reached after a `<` symbol in html-data. \ntagOpen: function (peek) {\n\tif (peek === '!') {\n\t\tthis.state = 'markupDeclarationOpen'\n\t\tconsume()\n\t}\n\telse if (peek === '/') {\n\t\tthis.state = 'endTagOpen'\n\t\tconsume()\n\t}\n\telse if (peek === EOF) {\n\t\temitError('unescaped less-than sign')\n\t\temit('lessThanSign')\n\t\tthis.state = 'content'\n\t}\n\telse if (ALPHA.test(peek)) {\n\t\temit('beginStartTag')\n\t\tthis.state = 'tagName'\n\t\t\tthis.tagType = 'startTag'\n\t\t\tthis.tagName = peek.toLowerCase()\n\t\tconsume()\n\t}\n\telse if (peek === '?') {\n\t\temitError('invalid comment opening')\n\t\tthis.state = 'bogusComment'\n\t\tconsume()\n\t}\n\telse {\n\t\temitError('unescaped less-than sign')\n\t\temit('lessThanSign')\n\t\t// Warning: branch does not consume\n\t\tthis.state = 'content'\n\t}\n},\n\n// The `tagName` state is reached after an alphabetic character\n// that trails `<` or `</`. The machine stays in this state until\n// whitespace, `/` or `>` is encountered. \n\ntagName: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'in tag name')\n\t\temit('tagName')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\temit('tagName')\n\t\tthis.state = 'beforeAttributeName'\n\t\tconsume()\n\t}\n\telse if (peek === \"/\") {\n\t\temit('tagName')\n\t\tthis.state = 'selfClosingStartTag'\n\t\tconsume()\n\t}\n\telse if (peek === '>') {\n\t\temit('tagName')\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\tconsume()\n\t\t// The following is a bit of a hack, used in `content`,\n\t\t// for supporting rcdata and rawtext elements\n\t\tif (this.tagType === 'startTag')\n\t\t\tthis.tagName = this.tagName+peek.toLowerCase();\n\t}\n},\n\n// The `selfClosingStartTag` state is reached after the\n// `/` symbol (in the appropriate contexts). \n\nselfClosingStartTag: function (peek) {\n\tif (peek === '>') {\n\t\tconsume()\n\t\temit('finishSelfClosingTag')\n\t\tthis.state = 'content'\n\t}\n\telse if (peek === EOF) {\n\t\t// This is the same as the EOF branch in 'beforeAttributeName'\n\t\temit('space')\n\t\temitError(eof_msg+'before attribute name')\n\t}\n\telse {\n\t\t// Warning: branch does not consume\n\t\tthis.state = 'beforeAttributeName'\n\t\t//states.beforeAttributeName.apply(this, arguments)\n\t}\n},\n\nendTagOpen: function (peek) {\n\tif (ALPHA.test(peek)) {\n\t\temit('beginEndTag')\n\t\tthis.state = 'tagName'\n\t\t\tthis.tagType = 'endTag'\n\t\t\tthis.tagName = ''\n\t\tconsume()\n\t}\n\telse if (peek === '>') {\n\t\temitError('invalid empty comment tag')\n\t\temit('beginBogusComment')\n\t\tconsume()\n\t\temit('finishBogusComment')\n\t\tthis.state = 'content'\n\t}\n\telse if (peek === EOF) {\n\t\temit('beginEndTag')\n\t\temitError(eof_msg+'before endtag name')\n\t}\n\telse {\n\t\temitError('invalid comment tag (may be a malformed end tag)')\n\t\temit('beginBogusComment')\n\t\tthis.state = 'bogusComment'\n\t\tconsume()\n\t}\n},\n\n// Attribute names may start with anything except space, `/`, `>`\n// subsequent characters may be anything except space, `/`, `=`, `>`.\t \n// e.g. ATTRNAME = `/^[^\\t\\n\\f />][^\\t\\n\\f /=>]*$/`\n\nbeforeAttributeName: function (peek) {\n\tif (peek === EOF) {\n\t\temit('space')\n\t\temitError(eof_msg+'before attribute name')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\tconsume()\n\t}\n\telse if (peek === \"/\") {\n\t\temit('space')\n\t\tthis.state = 'selfClosingStartTag'\n\t\tconsume()\n\t}\n\telse if (peek === '>') {\n\t\temit('space')\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\temit('space')\n\t\tthis.state = 'attributeName'\n\t\tconsume()\n\t}\n},\n\nattributeName: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'in attribute name')\n\t\temit('attributeName')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\temit('attributeName')\n\t\tthis.state = 'afterAttributeName'\n\t\tconsume()\n\t}\n\telse if (peek === \"/\") {\n\t\temit('attributeName') // Stand alone attribute\n\t\tthis.state = 'selfClosingStartTag'\n\t\tconsume()\n\t}\n\telse if (peek === \"=\") { // attribute with value\n\t\temit('attributeName')\n\t\tconsume()\n\t\tthis.state = 'beforeAttributeValue'\n\t}\n\telse if (peek === '>') {\n\t\temit('attributeName') // Stand alone attribute\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\tconsume()\n\t}\n},\n\nafterAttributeName: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'after attribute name')\n\t\temit('space')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\tconsume()\n\t}\n\telse if (peek === \"/\") {\n\t\temit('space') // was a stand alone attribute\n\t\tthis.state = 'selfClosingStartTag'\n\t\tconsume()\n\t}\n\telse if (peek === \"=\") { // attribute with value\n\t\tconsume()\n\t\tthis.state = 'beforeAttributeValue'\n\t}\n\telse if (peek === '>') {\n\t\temit('space') // it was a stand alone attribute\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\temit('space') // it was a stand alone attribute\n\t\tthis.state = 'attributeName'\n\t\tconsume()\n\t}\n},\n\nbeforeAttributeValue: function (peek) { // 'after equals'\n\tif (peek === EOF) {\n\t\temit('equals')\n\t\temitError(eof_msg+'before attribute value')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\tconsume()\n\t}\n\telse if (peek === '\"' || peek === \"'\") {\n\t\temit('equals')\n\t\tthis.state = 'attributeValue_Quoted'\n\t\tthis.quotation = peek\n\t\tconsume()\n\t\temit('beginAttributeValue')\n\t}\n\telse if (peek === '>') {\n\t\temit('equals')\n\t\temitError('missing attribute value')\n\t\temit('attributeValueMissing')\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\t// TODO should produce errors on <, =, `\n\t\temit('equals')\n\t\temit('beginAttributeValue')\n\t\tthis.state = 'attributeValueUnquoted'\n\t\tconsume()\n\t}\n},\n\nattributeValue_Quoted: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'in attribute value')\n\t\temit('attributeData')\n\t}\n\telse if (peek === this.quotation) {\n\t\temit('attributeData')\n\t\tconsume()\n\t\temit('finishAttributeValue')\n\t\tthis.state = 'afterAttributeValueQuoted'\n\t}\n\telse if (peek === '&') {\n\t\temit('attributeData')\n\t\tconsume()\n\t\tthis.state = 'charRefIn_'\n\t\t\tthis.context = 'attributeValue_Quoted'\n\t}\n\telse {\n\t\tconsume()\n\t}\n},\n\nattributeValueUnquoted: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'in attribute value')\n\t\temit('attributeData')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\temit('attributeData')\n\t\temit('finishAttributeValue')\n\t\tconsume()\n\t\tthis.state = 'beforeAttributeName'\n\t}\n\telse if (peek === '&') {\n\t\temit('attributeData')\n\t\tconsume()\n\t\tthis.state = 'charRefIn_'\n\t\t\tthis.context = 'attributeValueUnquoted'\n\t}\n\telse if (peek === '>') {\n\t\temit('attributeData')\n\t\temit('finishAttributeValue')\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\tconsume()\n\t}\n},\n\nafterAttributeValueQuoted: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'after attribute value')\n\t}\n\telse if (SPACE.test(peek)) {\n\t\tthis.state = 'beforeAttributeName'\n\t\tconsume()\n\t}\n\telse if (peek === \"/\") {\n\t\tconsume()\n\t\tthis.state = 'selfClosingStartTag'\n\t}\n\telse if (peek === '>') {\n\t\tconsume()\n\t\temit('finishTag')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\temitError('missing space after attribute')\n\t\temit('spaceMissing')\n\t\tthis.state = 'beforeAttributeName'\n\t\t// Warning: branch does not consume\n\t}\n},\n\n// Markup declaration\n\nmarkupDeclarationOpen: function (peek, stream) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'in markup declaration')\n\t\temit('beginBogusComment')\n\t}\n\telse if (stream.unsafePeek(2) === \"--\") {\n\t\tconsume()\n\t\tconsume()\n\t\temit('beginComment')\n\t\tthis.state = 'commentStart'\n\t}\n\t// TWO cases are omitted here: doctype tags and cdata sections\n\t//\tthose will be tokenized as bogus comments instead. \n\telse {\n\t\temit('beginBogusComment')\n\t\tthis.state = 'bogusComment'\n\t\temitError('invalid comment (may be an unhandled markup declaration)')\n\t\t// Warning: branch does not consume\n\t}\n},\n\n\n// Comments\n// This state is reached after an <!--\ncommentStart: function (peek) {\n\tif (peek === EOF) {\n\t\temitError(eof_msg+'in comment')\n\t}\n\telse if (peek === \"-\") {\n\t\tthis.state = 'commentStartDash'\n\t\tconsume()\n\t}\n\telse if (peek === '>') {\n\t\tconsume()\n\t\temit('finishComment')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\tthis.state = 'comment'\n\t\tconsume()\n\t}\n},\n\n// This state is reached after an <!---\ncommentStartDash: function (peek) {\n\tif (peek === EOF) {\n\t\temit('commentData')\n\t\temitError(eof_msg+'in comment')\n\t}\n\telse if (peek === \"-\") {\n\t\tconsume()\n\t\tthis.state = 'commentEnd'\n\t}\n\telse if (peek === '>') {\n\t\tconsume()\n\t\temit('finishComment')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\tthis.state = 'comment'\n\t\tconsume()\n\t}\n},\n\ncomment: function (peek) {\n\tif (peek === EOF) {\n\t\temit('commentData')\n\t\temitError(eof_msg+'in comment')\n\t}\n\telse if (peek === \"-\") {\n\t\temit('commentData')\n\t\tconsume()\n\t\tthis.state = 'commentEndDash'\n\t}\n\telse {\n\t\tconsume()\n\t}\n},\n\n// this state is reached after - in a comment\ncommentEndDash: function (peek) {\n\tif (peek === EOF) {\n\t\temit('commentData')\n\t\temitError(eof_msg+'in comment')\n\t}\n\telse if (peek === \"-\") {\n\t\tthis.state = 'commentEnd'\n\t\tconsume()\n\t}\n\telse {\n\t\tthis.state = 'comment'\n\t\tconsume()\n\t}\n},\n\n// this state is reached after -- in a comment\ncommentEnd: function (peek) {\n\tif (peek === EOF) {\n\t\temit('commentData')\n\t\temitError(eof_msg+'in comment')\n\t}\n\telse if (peek === '>') {\n\t\tconsume()\n\t\temit('finishComment')\n\t\tthis.state = 'content'\n\t}\n\telse if (peek === \"!\") {\n\t\t// This is a parse error, will be reported in the next state\n\t\tconsume()\n\t\tthis.state = 'commentEndBang'\n\t}\n\telse {\n\t\temitError('comment data should not contain --')\n\t\tthis.state = 'comment'\n\t\tconsume()\n\t}\n},\n\ncommentEndBang: function (peek) {\n\tif (peek === EOF) {\n\t\temitError('comment data should not contain --!')\n\t\temitError(eof_msg+'in comment')\n\t\temit('commentData')\n\t}\n\telse if (peek === \"-\") {\n\t\temitError('comment data should not contain --!')\n\t\tthis.state = 'commentEndDash'\n\t\tconsume()\n\t}\n\telse if (peek === '>') {\n\t\tconsume()\n\t\temitError('comment should end with -->')\n\t\temit('finishComment')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\temitError('comment data should not contain --!')\n\t\tthis.state = 'comment'\n\t\tconsume()\n\t}\n},\n\nbogusComment: function (peek) {\n\tif (peek === EOF) {\n\t\temit('bogusCommentData')\n\t\temitError(eof_msg+'in invalid comment')\n\t}\n\telse if (peek === '>') {\n\t\temit('bogusCommentData')\n\t\tconsume()\n\t\temit('finishBogusComment')\n\t\tthis.state = 'content'\n\t}\n\telse {\n\t\tconsume()\n\t}\n},\n\n\n// ### RAWTEXT, RCDATA and PLAINTEXT states\n// Raw text may contain anything except the beginnings of an\n// end tag for the current element. Raw text cannot be escaped. \n// The only rawtext elements in the html5 specification are\n// 'script' and 'style'. \n// Rcdata may contain anyting like rawtext, but can be escaped,\n// that is, it may contain character references. \n// Plaintext may contain anything, nothing can be escaped, and\n// does not have an endtag. \n\nplaintext: function (peek) {\n\tif (peek === EOF)\n\t\temit('plaintext')\n\telse\n\t\tconsume()\n},\n\nrawtext: function (peek) {\n\tif (peek === EOF) {\n\t\temit('rawtext')\n\t\temitError(eof_msg+'in '+this.tagName+' content')\n\t}\n\telse if (peek === '<') {\n\t\temit('rawtext')\n\t\tthis.state = 'lessThanSignIn_'\n\t\t\tthis.context = 'rawtext'\n\t\tconsume()\n\t}\n\telse\n\t\tconsume()\n},\n\nrcdata: function (peek) {\n\tif (peek === EOF) {\n\t\temit('rcdata')\n\t\temitError(eof_msg+'in '+this.tagName+' content')\n\t}\n\telse if (peek === '<') {\n\t\temit('rcdata')\n\t\tconsume()\n\t\tthis.state = 'lessThanSignIn_'\n\t\t\tthis.context = 'rcdata'\n\t}\n\telse if (peek === '&') {\n\t\temit('rcdata')\n\t\tconsume()\n\t\tthis.state = 'charRefIn_'\n\t\t\tthis.context = 'rcdata'\n\t}\n\telse\n\t\tconsume()\n},\n\n// This is different from, but equivalent to the specification, here\n// using a lookahead into the token stream to check if the `<` sign\n// starts an appropriate end tag token. \n\nlessThanSignIn_: function (peek) {\n\tif (peek === \"/\") {\n\t\tconsume()\n\t\tthis.state = 'endTagOpenIn_'\n\t}\n\telse {\n\t\t// Warning: branch does not consume\n\t\tthis.state = this.context\n\t}\n},\n\nendTagOpenIn_: function (peek) {\n\tvar l = this.tagName.length, look = stream.unsafePeek(l+1)\n\tif (peek !== EOF && ALPHA.test(peek) && TAGEND.test(look[l]) && look.substr(0,l).toLowerCase() === this.tagName) {\n\t\temit('beginEndTag')\n\t\tthis.state = 'tagName'\n\t\t\tthis.tagName = ''\n\t\tconsume()\n\t}\n\telse {\n\t\t// Warning: branch does not consume\n\t\tthis.state = this.context\n\t}\n},\n\n//endTagNameIn_:\n\n\n// ### Character References\n//\n// The character reference states as implemented below,\n// are not in the specification and in fact, the following is not\n// completely equivalent to the suggested behaviour (keep reading). \n//\n// The main difference is in the tokenization of named references. \n// A named character reference token with an unknown name **ought** to\n// have been interpreted as data, likewise for named references that aren't\n// terminated by a semicolon and occur in attribute values (IIRC). \n// Named references with an unknown name, a prefix of which **is** a known name,\n// **ought** to have been interpreted as a such named reference\n// followed by the rest of the unknown name as data. \n// Furthermore, numeric character references are not checked for\n// being 'out of range', so no 'out of range' errors are emitted for those. \n// \n// The above isn't needed for correct tokenization of the rest of the document\n// (for as far as I've understood the spec). I kind of feel that the suggested\n// behaviour shouldn't be implemented as part of the lexical analysis, but\n// should be handled higher up. \n// \n// Any sequence starting with an ampersand and which is not a lexically valid\n// character reference, is emitted as a `bogusCharRef` token. \n\ncharRefIn_: function (peek) { // after an &\n\tif (peek === '#') {\n\t\tconsume()\n\t\tthis.state = 'numericCharRef'\n\t}\n\telse if (peek !== EOF && ALPHANUM.test(peek)) {\n\t\tconsume()\n\t\tthis.state = 'namedCharRef'\n\t}\n\telse {\n\t\temit('bogusCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n},\n\nnumericCharRef: function (peek) {\n\tif (peek === 'x' || peek === 'X') {\n\t\tconsume()\n\t\tthis.state = 'hexadecimalCharRef'\n\t}\n\telse if (peek !== EOF && DIGITS.test(peek)) {\n\t\tconsume()\n\t\tthis.state = 'decimalCharRef'\n\t}\n\telse {\n\t\temit('bogusCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n},\n\ndecimalCharRef: function (peek) {\n\tif (peek !== EOF && DIGITS.test(peek)) {\n\t\tconsume()\n\t}\n\telse if (peek === ';') {\n\t\tconsume()\n\t\temit('decimalCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n\telse {\n\t\temitError('unterminated decimal character reference')\n\t\temit('decimalCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n},\n\nhexadecimalCharRef: function (peek) {\n\tif (peek !== EOF && HEXDIGITS.test(peek)) {\n\t\tconsume()\n\t\tthis.state = 'hexDigits'\n\t}\n\telse {\n\t\temit('bogusCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n},\n\nhexDigits: function (peek) {\n\tif (peek !== EOF && HEXDIGITS.test(peek))\n\t\tconsume()\n\telse if (peek === ';') {\n\t\tconsume()\n\t\temit('hexadecimalCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n\telse {\n\t\temitError('unterminated hexadecimal character reference')\n\t\temit('hexadecimalCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n},\n\nnamedCharRef: function (peek) {\n\tif (peek !== EOF && ALPHANUM.test(peek))\n\t\tconsume()\n\telse if (peek === ';') {\n\t\tconsume()\n\t\temit('namedCharRef', this.context)\n\t\tthis.state = this.context\n\t}\n\telse {\n\t\t// passing peek as a hack for further handling of CharRefs\n\t\temit('namedCharRef', this.context, peek)\n\t\tthis.state = this.context\n\t}\n}\n\n} /* end of states */\n\nfunction run () { states[state.state].call(state, stream.peek(), stream) }\nreturn { run:run, state:state, states:states }\n}",
"segmentToState(action, initialRASP){\n var nextRASP={}, delta={};\n // first convert the state info in the segment into real state properties\n let parts=action.segment.split(',');\n parts.forEach(part=>{\n if(part==='o') delta.open='open';\n if(part==='m') delta.minimize=true;\n })\n Object.assign(nextRASP,initialRASP,delta);\n // then calculate the derived state information\n nextRASP.shape= nextRASP.open==='open' ? 'open' : initialRASP.shape; \n // then recalculate the path, don't copy it and include stuff that wasn't understood. \n parts=[];\n if(nextRASP.open==='open') parts.push('o');\n if(nextRASP.minimize) parts.push('m');\n nextRASP.pathSegment= parts.join(',');\n return {nextRASP, setBeforeWait: true};\n }",
"state(s){if (s) this.memory.state = s; return this.memory.state;}",
"changeState(state) {\r\n if (!this.states[state]) throw new SyntaxError (\"there is no state\");\r\n\r\n if (!this.history[this.step+1] && this.history[this.step] !== state) {\r\n this.step++;\r\n this.history.push(state);\r\n }\r\n if (this.history[this.step+1] === state) ++this.step;\r\n this.currentState = state;\r\n }",
"applyTo(state) {\n let nextState = new State(state)\n\n //put the letter on the board\n nextState.board[this.movePosition] = state.turn\n\n if (state.turn === 'O') nextState.oMovesCount++\n\n nextState.advanceTurn()\n\n return nextState\n }",
"function parseStateRef(ref, current) {\n var preparsed = ref.match(/^\\s*({[^}]*})\\s*$/), parsed;\n if (preparsed) ref = current + '(' + preparsed[1] + ')';\n parsed = ref.replace(/\\n/g, \" \").match(/^([^(]+?)\\s*(\\((.*)\\))?$/);\n if (!parsed || parsed.length !== 4) throw new Error(\"Invalid state ref '\" + ref + \"'\");\n return { state: parsed[1], paramExpr: parsed[3] || null };\n } // jshint +W116, +W109",
"constructor(input, start){\n this.input = input\n this.start = start \n }",
"constructor(input, start){\n this.input = input\n this.start = start \n }",
"function $$route$recognizer$$State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t }",
"function input( v, state ){ \nvar newState = applsfn(v,state);\nreturn new State( applmfn(v,newState), newState ); \n}",
"function $$route$recognizer$$State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"function $$route$recognizer$$State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"defineStates() {\n // Maximum stack calls\n let maxStackCalls = 400;\n\n // Acquisition lambdas\n let queue = i => {\n return this.text.charAt(i);\n };\n let store = c => {\n this.buffer += c;\n };\n let flush = t => {\n if (this.buffer.length > 0) {\n // Special treatment for id tokens that contain only numbers\n let numberToken = t == Token.ID && !isNaN(this.buffer);\n this.list.push(\n new Token(numberToken ? Token.NUMBER : t, this.buffer, line)\n );\n }\n this.buffer = \"\";\n };\n\n // Line number updater\n let line = 0;\n let newline = i => {\n line++;\n };\n\n // State definitions\n let state = {\n // Transference function\n transference: (i, phase) => {\n if (i < this.text.length) {\n // Prevent stack overflow\n if (i % maxStackCalls == 0 && phase != true) {\n this.index = i;\n return;\n }\n\n // Transfer to the identifier state\n state.identifier(i);\n } else {\n flush(Token.ID);\n this.index = i;\n return;\n }\n },\n\n // For IDs\n identifier: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case '\"':\n case \"'\":\n flush(Token.ID);\n state.string(i + 1, c);\n return;\n case \"\\\\\":\n flush(Token.ID);\n state.extension(i);\n return;\n case \" \":\n case \";\":\n flush(Token.ID);\n state.delimiter(i);\n return;\n case \"#\":\n flush(Token.ID);\n state.comment(i + 1);\n return;\n case \"(\":\n case \")\":\n flush(Token.ID);\n state.parenthesis(i, c);\n return;\n default:\n store(c);\n state.transference(i + 1);\n }\n },\n\n // For strings\n string: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case phase:\n flush(Token.STRING);\n state.transference(i + 1, c);\n return;\n case \"\\\\\":\n state.extension(i + 1);\n return;\n default:\n store(c);\n state.string(i + 1, phase);\n }\n },\n\n // For escape characters\n extension: (i, phase) => {\n let c = queue(i);\n\n store(\"\\\\\" + c);\n state.transference(i + 1);\n },\n\n // For comments\n comment: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case \";\":\n newline();\n flush(Token.COMMENT);\n state.transference(i + 1);\n return;\n default:\n store(c);\n state.comment(i + 1);\n }\n },\n\n // For parenthesis\n parenthesis: (i, phase) => {\n let c = queue(i);\n\n store(c);\n if (phase == \"(\") flush(Token.OPEN);\n else if (phase == \")\") flush(Token.CLOSE);\n state.transference(i + 1);\n },\n\n // For whitespaces and linefeeds\n delimiter: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case \";\":\n newline();\n case \" \":\n store(c);\n state.delimiter(i + 1);\n return;\n default:\n flush(Token.SPACE);\n state.transference(i);\n }\n }\n };\n this.state = state;\n }",
"function start(c) {\n if(c == \"a\") {\n return stateA\n }else{\n return start\n }\n}",
"function Stream( line, start, pos )\n{\n var self = new String( line );\n self.start = start || 0;\n self.pos = pos || 0;\n \n // string start-of-line?\n self.sol = function( ) { \n return 0 === self.pos; \n };\n \n // string end-of-line?\n self.eol = function( ) { \n return self.pos >= self.length; \n };\n \n // skip to end\n self.end = function( ) {\n self.pos = self.length;\n return self;\n };\n\n // move pointer forward/backward n steps\n self.mov = function( n ) {\n self.pos = 0 > n ? MAX(0, self.pos+n) : MIN(self.length, self.pos+n);\n return self;\n };\n \n // move pointer back to pos\n self.bck = function( pos ) {\n self.pos = MAX(0, pos);\n return self;\n };\n \n // move/shift stream\n self.sft = function( ) {\n self.start = self.pos;\n return self;\n };\n \n // next char(s) or whole token\n self.nxt = function( num, re_token ) {\n var c, token = '', n;\n if ( true === num )\n {\n re_token = re_token || Stream.$NONSPC$;\n while ( self.pos<self.length && re_token.test(c=self[CHAR](self.pos++)) ) token += c;\n return token.length ? token : null;\n }\n else\n {\n num = num||1; n = 0;\n while ( n++ < num && self.pos<self.length ) token += self[CHAR](self.pos++);\n return token;\n }\n };\n \n // current stream selection\n self.cur = function( shift ) {\n var ret = self.slice(self.start, self.pos);\n if ( shift ) self.start = self.pos;\n return ret;\n };\n \n // stream selection\n self.sel = function( p0, p1 ) {\n return self.slice(p0, p1);\n };\n \n // eat \"space\"\n self.spc = function( eat, re_space ) {\n var m;\n if ( m = self.slice(self.pos).match( re_space||Stream.$SPC$ ) ) \n {\n if ( false !== eat ) self.mov( m[0].length );\n return m[0];\n }\n };\n return self;\n}",
"function Stream( line, start, pos )\n{\n var self = new String( line );\n self.start = start || 0;\n self.pos = pos || 0;\n \n // string start-of-line?\n self.sol = function( ) { \n return 0 === self.pos; \n };\n \n // string end-of-line?\n self.eol = function( ) { \n return self.pos >= self.length; \n };\n \n // skip to end\n self.end = function( ) {\n self.pos = self.length;\n return self;\n };\n\n // move pointer forward/backward n steps\n self.mov = function( n ) {\n self.pos = 0 > n ? MAX(0, self.pos+n) : MIN(self.length, self.pos+n);\n return self;\n };\n \n // move pointer back to pos\n self.bck = function( pos ) {\n self.pos = MAX(0, pos);\n return self;\n };\n \n // move/shift stream\n self.sft = function( ) {\n self.start = self.pos;\n return self;\n };\n \n // next char(s) or whole token\n self.nxt = function( num, re_token ) {\n var c, token = '', n;\n if ( true === num )\n {\n re_token = re_token || Stream.$NONSPC$;\n while ( self.pos<self.length && re_token.test(c=self[CHAR](self.pos++)) ) token += c;\n return token.length ? token : null;\n }\n else\n {\n num = num||1; n = 0;\n while ( n++ < num && self.pos<self.length ) token += self[CHAR](self.pos++);\n return token;\n }\n };\n \n // current stream selection\n self.cur = function( shift ) {\n var ret = self.slice(self.start, self.pos);\n if ( shift ) self.start = self.pos;\n return ret;\n };\n \n // stream selection\n self.sel = function( p0, p1 ) {\n return self.slice(p0, p1);\n };\n \n // eat \"space\"\n self.spc = function( eat, re_space ) {\n var m;\n if ( m = self.slice(self.pos).match( re_space||Stream.$SPC$ ) ) \n {\n if ( false !== eat ) self.mov( m[0].length );\n return m[0];\n }\n };\n return self;\n}",
"constructor({\n stateFactory, initialState, debug, debugFn,\n}) {\n /* Perform some sanity checking on arguments */\n// /* istanbul ignore if */\n// if (stateClasses == null || stateClasses.length === 0) {\n// throw new InvalidArgumentsError('stateClasses');\n// }\n /* Initialize instance junk that we can't do except through\n this method. */\n this._init();\n if (!debug) {\n debug = false;\n }\n if (debug && !debugFn) {\n // throw new Error(\"unexpected lack of debug function\");\n /* eslint-disable-next-line no-console */\n debugFn = console.log;\n }\n this.stateFactory = stateFactory;\n this.debugFn = debugFn;\n this.inputLines = undefined;\n this.inputOffset = 0;\n this.line = undefined;\n this.lineOffset = -1;\n this.debug = debug;\n this.initialState = initialState;\n this.currentState = initialState;\n this.states = {};\n if (!stateFactory) {\n throw new Error('need statefactory');\n }\n\n const stateClasses = stateFactory.getStateClasses();\n// console.log(typeof stateClasses);\n if (!isIterable(stateClasses)) {\n throw new Error(`expecting iterable, got ${stateClasses}`);\n }\n// console.log(stateClasses);\n this.addStates(stateClasses);\n this.observers = [];\n this._stderr = new ErrorOutput();\n }",
"run({\n inputLines, inputOffset, context, inputSource, initialState,\n}) {\n /*\n Run the state machine on `input_lines`. Return results (a list).\n\n Reset `self.line_offset` and `self.current_state`. Run the\n beginning-of-file transition. Input one line at a time and check for a\n matching transition. If a match is found, call the transition method\n and possibly change the state. Store the context returned by the\n transition method to be passed on to the next transition matched.\n Accumulate the results returned by the transition methods in a list.\n Run the end-of-file transition. Finally, return the accumulated\n results.\n\n Parameters:\n\n - `input_lines`: a list of strings without newlines, or `StringList`.\n - `input_offset`: the line offset of `input_lines` from the beginning\n of the file.\n - `context`: application-specific storage.\n - `input_source`: name or path of source of `input_lines`.\n - `initial_state`: name of initial state.\n */\n this.runtimeInit();\n if (inputLines instanceof StringList) {\n this.inputLines = inputLines;\n// console.log(inputLines);\n } else if (inputLines == null) {\n throw new InvalidArgumentsError('inputLines should not be null or undefined');\n } else {\n if (!isIterable(inputLines)) {\n inputLines = [inputLines];\n }\n /* note: construct stringist with inputSource */\n\n this.inputLines = new StringList(inputLines, inputSource);\n// console.log(this.inputLines);\n }\n this.inputOffset = inputOffset;\n this.lineOffset = -1;\n this.currentState = initialState || this.initialState;\n if (!this.currentState) {\n // console.log('No current state');\n }\n if (this.debug) {\n this.debugFn(`\\nStateMachine.run: input_lines (line_offset=${this.lineOffset}):\\n| ${this.inputLines.join('\\n| ')}`);\n }\n let transitions;\n const results = [];\n let state = this.getState();\n let nextState;\n let result;\n try {\n if (this.debug) {\n this.debugFn('\\nStateMachine.run: bof transition');\n }\n [context, result] = state.bof(context);\n if (!Array.isArray(context)) {\n throw new Error('expecting array');\n }\n// console.log(context);\n results.push(...result);\n /* eslint-disable-next-line no-constant-condition */\n while (true) {\n try {\n try {\n this.nextLine();\n if (this.debug) {\n if (Number.isNaN(this.lineOffset)) {\n /* istanbul ignore if */\n throw new Error();\n }\n\n const rinfo = this.inputLines.info(\n this.lineOffset,\n);\n if (!isIterable(rinfo)) {\n /* istanbul ignore if */\n throw new Error();\n }\n const [source, offset] = rinfo;\n this.debugFn(`\\nStateMachine.run: line (source=${source}, offset=${offset}):\\n| ${this.line}`);\n }\n// console.log(context);\n /* istanbul ignore if */\n if (!Array.isArray(context)) {\n throw new Error('context should be array');\n }\n\n const r = this.checkLine(context, state, transitions);\n /* istanbul ignore if */\n if (!isIterable(r)) {\n throw new Error(`Expect iterable result, got: ${r}`);\n }\n [context, nextState, result] = r;\n /* istanbul ignore if */\n if (!Array.isArray(context)) {\n throw new Error('context should be array');\n }\n /* istanbul ignore if */\n if (!isIterable(result)) {\n throw new Error(`Expect iterable result, got: ${result}`);\n }\n results.push(...result);\n } catch (error) {\n if (error instanceof EOFError) {\n if (this.debug) {\n this.debugFn(`\\nStateMachine.run: ${state.constructor.name}.eof transition`);\n }\n result = state.eof(context);\n results.push(...result);\n break;\n } else {\n throw error;\n }\n }\n } catch (error) {\n if (error instanceof TransitionCorrection) {\n this.previousLine();\n transitions = [error.args[0]];\n /* if self.debug:\n print >>self._stderr, (\n '\\nStateMachine.run: TransitionCorrection to '\n 'state \"%s\", transition %s.'\n % (state.__class__.__name__, transitions[0])) */\n /* Cant continue, makes no sense? ?? */\n /* eslint-disable-next-line no-continue */\n continue;\n } else if (error instanceof StateCorrection) {\n this.previousLine();\n nextState = error.args[0];\n if (error.args.length === 1) {\n transitions = null;\n } else {\n transitions = [error.args[1]];\n }\n /* if self.debug:\n print >>self._stderr, (\n '\\nStateMachine.run: StateCorrection to state '\n '\"%s\", transition %s.'\n % (next_state, transitions[0]))\n */\n } else {\n throw error;\n }\n }\n /* we need this somehow, its part of a try, except, else */\n // transitions = undefined\n state = this.getState(nextState);\n }\n } catch (error) {\n throw error;\n }\n this.observers = [];\n return results;\n }",
"_stateNamedCharacterReference(cp) {\n const matchResult = this._matchNamedCharacterReference(cp);\n //NOTE: Matching can be abrupted by hibernation. In that case, match\n //results are no longer valid and we will need to start over.\n if (this._ensureHibernation()) {\n // Stay in the state, try again.\n }\n else if (matchResult) {\n for (let i = 0; i < matchResult.length; i++) {\n this._flushCodePointConsumedAsCharacterReference(matchResult[i]);\n }\n this.state = this.returnState;\n }\n else {\n this._flushCodePointConsumedAsCharacterReference(CODE_POINTS.AMPERSAND);\n this.state = State.AMBIGUOUS_AMPERSAND;\n }\n }",
"init(input, start, end) {\n this.start = start || 0\n this.end = end || input.length\n if(typeof input === 'string') input = new Source(input)\n this.input = input\n this.back = false \n }",
"function State(factor) {\n\tthis.factor = factor || 1;\n\tthis.bump = 0;\n\tthis.time = null;\n}",
"function goesTo(state, chr) {\n\t\t\tvar output = []\n\n\t\t\tfor (var i = 0, ii = state.length; i < ii; ++i) {\n\t\t\t\tvar trans = frag.transitions[state[i]]\n\t\t\t\tfor (var j = 0, jj = trans.length; j < jj; j += 2) {\n\t\t\t\t\tif (trans[j] == chr) {\n\t\t\t\t\t\tvar dest = trans[j + 1]\n\t\t\t\t\t\t// push destination state onto output if it is new\n\t\t\t\t\t\tif (output.indexOf(dest) < 0) {\n\t\t\t\t\t\t\toutput.push(dest)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn closureOf2(output)\n\t\t}",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"function State() { }",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n this.regex = undefined;\n this.handlers = undefined;\n this.specificity = undefined;\n}",
"function lookAhead(input,stateInformation) {\n let totalLength = input.length;\n let state = stateInformation.state.currentState;\n let idx = stateInformation.currentIndex;\n var result = undefined;\n while (state === stateInformation.state.currentState && idx < totalLength){\n let c = input.charAt(idx);\n if (stateInformation.state.transitions[stateInformation.state.currentState].lookFor.has(c)){\n stateInformation.state.currentState = stateInformation.state.nextState;\n if (stateInformation.state.currentState != stateInformation.finalState){\n stateInformation.state.nextState++;\n stateInformation.currentIndex = idx;\n stateInformation.capturedInformation = c;\n }\n else{\n stateInformation.done = true;\n }\n result = stateInformation;\n\n } else {\n idx++; \n }\n }\n return result;\n}",
"static createState(start = 0) {\n return {count: start};\n }",
"set start(value) {}",
"setOffsets() {\n const startPt = this.startPt.minusPt(this.head);\n const endPt = this.endPt.minusPt(this.head);\n const controlPt = this.controlPt.minusPt(this.head);\n this.stateOffset = { startPt, endPt, controlPt };\n }",
"function State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t}",
"function State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t}",
"function State(charSpec) {\n this.charSpec = charSpec;\n this.nextStates = [];\n }",
"calcNextState() {\n\t\tlet liveN = this.countNeighbours();\n\t\tif( (liveN == 2 && this.state) || liveN == 3 ) {\n\t\t\tthis.nextState = true;\n\t\t} else {\n\t\t\tthis.nextState = false;\n\t\t}\n\t}",
"function start(initialStates, rule) {\n\t \n\t if (_stopFn) {\n\t \tthrow new Error(\"AutomatonDataSource.start: already running\");\n\t }\n\n\t var tmLastFrame = 0;\n\t var tmStart = 0;\n\t var ctFrame = 0, ctRows = 0;\n\t var states = initialStates; \n\t var shouldKeepRunning = true;\n\t var frameClock = null;\n\n\t run(BrowserUtils.now());\n\t \n\t function run(tmThisFrame) {\n\t \tif (tmThisFrame === undefined) tmThisFrame = BrowserUtils.now();\n\t if (!shouldKeepRunning) return;\n\t \n\t // compute elapsed time since last frame\n\t if (tmStart === 0) tmStart = tmThisFrame;\n\t var tmElapsed = Math.max(1, tmThisFrame - tmStart);\n\t \t \n\t // generate more rows if necessary, and render them\n\t var ctRowsStart = ctRows;\n\t var rows = [];\n\t while (1000 * (ctRows/tmElapsed) < _speed) {\n\t states = iterate(states, rule);\n\t rows.push(states);\n\t ctRows += 1;\n\t }\n\t \n\t if (rows.length) emitter.emit('data', rows);\n\t \n\t // increment frame counter and schedule next frame rendering\n\t ctFrame += 1;\n\t var frameClock = $timeout(run, 20);\n\t }\n\t \n\t function stop() {\n\t shouldKeepRunning = false;\n\t _stopFn = null;\n\t if (frameClock) {\n\t $timeout.cancel(frameClock);\n\t frameClock = null;\n\t }\n\t return states;\n\t }\n\n\t _stopFn = stop;\n\t return stop;\n\t}",
"function State(board, emitter) {\n var onitamaStringNotation = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'abcde.axbxcXdxex.uxvxwXxxyx.1';\n\n _classCallCheck(this, State);\n\n this.emitter = emitter;\n this.board = board;\n this.deserialize(onitamaStringNotation);\n }",
"move(predicate) {\n //console.log(predicate);\n const moveBy = this.moveMap[this.state.heading];\n // console.log(moveBy);\n const nextPos = { x: this.state.pos.x, y: this.state.pos.y };\n //console.log(nextPos);\n // Set next position\n nextPos[moveBy.plane] += moveBy.amount;\n\n // Check if move is legal\n const isLegal = predicate(nextPos);\n\n if (isLegal) {\n this.state.pos = nextPos;\n }\n }",
"parseAndAdd(line) {\n\n // WORKING HERE 9/14 (is this RiTa.this.tokenizer?)\n this.tokenizer.tokenize(line, ' ');\n let type = this.tokenizer.nextToken();\n\n if (type === \"S\" || type === \"P\") {\n this.stateMachine[this.numStates++] = this.createState(type, this.tokenizer);\n } else if (type === \"I\") {\n let index = parseInt(this.tokenizer.nextToken());\n if (index != this.numStates) {\n throw Error(\"Bad I in file.\");\n } else {\n let c = this.tokenizer.nextToken();\n this.letterIndex[c] = index;\n }\n //log(type+\" : \"+c+\" : \"+index + \" \"+this.letterIndex[c]);\n } else if (type == \"T\") {\n this.stateMachine = [];\n this.stateMachineSize = parseInt(this.tokenizer.nextToken());\n }\n }",
"function checkCurrentState(reading) {\n let result\n Rules.find().fetch().some(function(rule){\n if (reading >= rule.rule.from && reading <= rule.rule.to) {\n result = rule.rule.state\n return true\n } else {\n return false\n }\n });\n return result;\n}",
"function $$route$recognizer$$State(charSpec) {\n\t\t this.charSpec = charSpec;\n\t\t this.nextStates = [];\n\t\t this.charSpecs = {};\n\t\t this.regex = undefined;\n\t\t this.handlers = undefined;\n\t\t this.specificity = undefined;\n\t\t }",
"function InstructionState() {}",
"function InstructionState() {}",
"function State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t }",
"function State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t }",
"function State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t }",
"function State(charSpec) {\n\t this.charSpec = charSpec;\n\t this.nextStates = [];\n\t }",
"function state(name, norm_fn)\n{\n norm_fn = def(norm_fn, normalizeState);\n\n var value = norm_fn(name);\n require(typeof value !== 'undefined',\n \"Cannot create state from \" + repr(value));\n\n return new State(value);\n}",
"function TokensStartState() {\n\tDecisionState.call(this);\n\tthis.stateType = ATNState.TOKEN_START;\n\treturn this;\n}",
"function TokensStartState() {\n\tDecisionState.call(this);\n\tthis.stateType = ATNState.TOKEN_START;\n\treturn this;\n}",
"function findNewState(){\n\n let newState = new Array();\n let prev;\n let anc;\n let next;\n\n for(i = 0; i < cols; i++) {\n\n anc = state[i];\n\n if(i == 0){\n prev = state[state.length-1];\n next = state[i+1];\n }\n else if( i == state.length - 1) {\n prev = state[i-1];\n next = state[0];\n }\n else{\n prev = state[i-1];\n next = state[i+1];\n }\n\n if(prev == 1 && anc == 1 && next == 1) {\n newState[i] = 0;\n }\n else if (prev == 1 && anc == 1 && next == 0) {\n newState[i] = 0;\n }\n else if (prev == 1 && anc == 0 && next == 1) {\n newState[i] = 1;\n }\n else if (prev == 1 && anc == 0 && next == 0) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 1 && next == 1) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 1 && next == 0) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 0 && next == 1) {\n newState[i] = 0;\n }\n else if (prev == 0 && anc == 0 && next == 0) {\n newState[i] = 0;\n }\n }\n state = newState.slice();\n}",
"constructor(numStates, numInputs) {\n this.numStates = numStates;\n this.numInputs = numInputs;\n this.rule = this.randomRule();\n }",
"getPosition(absState) {\n return absState % (this._w + 1);\n }",
"changeState() {\n const newState = this.machineTable[this.state][this.lastRead].state;\n\n this.state = parseInt(newState, 10);\n }",
"function iterate(states, rule) {\n var nextStates = [];\n var size = states.length;\n for (var i = 0; i < size; ++i) {\n var left, ctr, right;\n left = states[(i - 1 + size) % size];\n right = states[(i + 1) % size];\n ctr = states[i];\n nextStates[i] = nextState(rule, left, ctr, right);\n }\n return nextStates;\n }",
"function IntervalState(start, end, state) {\n this.start = start\n this.end = end\n this.state = state\n}",
"function nextState() {\n // If go out of bounds, keep it at the last state\n stateIndex = Math.min(states.length - 1, stateIndex + 1);\n updateGraphState();\n}",
"get STATE_IDX() { return 0; }",
"function State() {\n\n }",
"function step(state, dir) {\n return Object.assign({}, state, {\n player: Object.assign({}, state.player, {\n position: getNewPos(state, dir)\n })\n })\n}",
"function getNewState(currentState, char) {\n let newState = null\n\n if (conversionTable[currentState] == null) { return null }\n\n conversionTable[currentState].forEach(conv => {\n if (conv.expression.test(char)) {\n newState = conv.newState\n }\n })\n return newState\n}",
"constructor({startPositionX, startPositionY}) {\n super()\n\n let startPosition = 0\n let axis = 0 // 0 is x axis, 1 is Y axis\n let coefficient = 1 // when 0, we have arrived at resting position\n if (startPositionX && startPositionY) {\n if (Math.random() < 0.5) {\n startPosition = startPositionX\n axis = 0\n } else {\n startPosition = startPositionY\n axis = 1\n }\n } else if (startPositionX) {\n startPosition = startPositionX\n axis = 0\n } else {\n startPosition = startPositionY\n axis = 1\n }\n\n this.state = {\n startPosition,\n axis,\n coefficient\n }\n }",
"function run()\n{\n var input = window.prompt(\"enter string\",\"\");\n var result = false; \n var currentState = 0;\n var lastState;\n\n for(var i=0; i<input.length; i++)\n {\n var found = 0;\n\n for(var k=0; k < transitions.length; k++)\n {\n\n if( transitions[k].from == currentState )\n {\n if( input.charAt(i) == transitions[k].input )\n {\n currentState = transitions[k].to;\n console.log(\"moved to: \"+transitions[k].to + \", from: \"+ transitions[k].from+\", on: \"+ transitions[k].input);\n }\n }\n\n \n }\n }\n\n for(i in states)\n {\n if(currentState == states[i].statenum && states[i].acceptState == true)\n result = true;\n }\n\n if(result == false)\n alert(\"false\");\n else if(result == true)\n alert(\"true\");\n}",
"function prevState() {\n // if go out of bounds, keep at first state\n stateIndex = Math.max(0, stateIndex - 1);\n updateGraphState();\n}",
"changeState(state) {\r\n if (this.config.states.hasOwnProperty(state)) {\r\n this.prev = this.state;\r\n this.state = state;\r\n this.possibleRedoCount--;\r\n }\r\n else throw new Error();\r\n }",
"match(input, start, end) {\n start = start || 0\n end = end || input.length\n if(typeof input === 'string') input = new Source(input)\n if(this.startsWith(input.get(start)))\n return this.token(input,start,start+1,input.get(start))\n else \n return this.error(input,start,start+1)\n }",
"function State(buffer) {\n // contains state of the buffer (i.e., buffer and offset)\n\n var offset = 0;\n\n this.readByte = function() {\n var c = buffer.readUInt8(offset);\n offset += 1;\n return c;\n }\n\n this.peekByte = function() {\n return buffer.readUInt8(offset);\n }\n\n this.writeByte = function(x) {\n buffer.writeUInt8(x, offset);\n offset += 1;\n }\n\n this.readInt = function() {\n var i = buffer.readUInt32BE(offset);\n offset += 4;\n return i;\n }\n\n this.writeInt = function(x) {\n buffer.writeUInt32BE(x, offset);\n offset += 4;\n }\n\n this.readBytes = function(n) {\n var bytes = buffer.slice(offset, offset + n);\n offset += n;\n return bytes;\n }\n\n this.writeBytes = function(x) {\n x.copy(buffer, offset);\n offset += x.length;\n }\n\n this.eof = function() {\n return (offset === buffer.length);\n }\n}",
"function SC_State(lat, lon, cur_time, step, thrust, orientation) {\n this.thrust = 0;\n this.orientation = 0;\n this.error = 0;\n this.busy = 0;\n switch (arguments.length) {\n case 0:\n this.latitude = 0;\n this.longitude = 0;\n this.armtime = 0;\n this.end_armtime = 0;\n this.stop_armtime = 0;\n this.thrust = 0;\n this.orientation = 0;\n this.solazi = 0.0;\n this.solele = 0.0;\n this.battery_energy = 0.0;\n this.surplus_energy = 0.0;\n this.solar_power = 0.0;\n this.drive_power = 0.0;\n break;\n case 1:\n this.latitude = lat.latitude;\n this.longitude = lat.longitude;\n this.armtime = lat.armtime;\n this.end_armtime = lat.end_armtime;\n this.stop_armtime = lat.end_armtime;\n this.thrust = lat.thrust;\n this.orientation = lat.orientation;\n this.solazi = lat.solazi;\n this.solele = lat.solele;\n this.battery_energy = lat.battery_energy;\n this.surplus_energy = lat.surplus_energy;\n this.solar_power = lat.solar_power;\n this.drive_power = lat.drive_power;\n break;\n case 6:\n this.orientation = orientation;\n case 5:\n this.thrust = thrust;\n case 4:\n this.latitude = lat;\n this.longitude = lon;\n this.armtime = cur_time;\n this.end_armtime = cur_time + step;\n this.stop_armtime = this.end_armtime;\n this.solazi = 0.0;\n this.solele = 0.0;\n this.battery_energy = 0.0;\n this.surplus_energy = 0.0;\n this.solar_power = 0.0;\n this.drive_power = 0.0;\n break;\n default:\n alert(\"Invalid number of arguments for SC_State(): \" + arguments.length);\n break;\n }\n}",
"parse() {\n while (this.shouldContinue()) {\n const c = this.buffer.charCodeAt(this.index - this.offset);\n switch (this.state) {\n case Tokenizer_State.Text: {\n this.stateText(c);\n break;\n }\n case Tokenizer_State.SpecialStartSequence: {\n this.stateSpecialStartSequence(c);\n break;\n }\n case Tokenizer_State.InSpecialTag: {\n this.stateInSpecialTag(c);\n break;\n }\n case Tokenizer_State.CDATASequence: {\n this.stateCDATASequence(c);\n break;\n }\n case Tokenizer_State.InAttributeValueDq: {\n this.stateInAttributeValueDoubleQuotes(c);\n break;\n }\n case Tokenizer_State.InAttributeName: {\n this.stateInAttributeName(c);\n break;\n }\n case Tokenizer_State.InCommentLike: {\n this.stateInCommentLike(c);\n break;\n }\n case Tokenizer_State.InSpecialComment: {\n this.stateInSpecialComment(c);\n break;\n }\n case Tokenizer_State.BeforeAttributeName: {\n this.stateBeforeAttributeName(c);\n break;\n }\n case Tokenizer_State.InTagName: {\n this.stateInTagName(c);\n break;\n }\n case Tokenizer_State.InClosingTagName: {\n this.stateInClosingTagName(c);\n break;\n }\n case Tokenizer_State.BeforeTagName: {\n this.stateBeforeTagName(c);\n break;\n }\n case Tokenizer_State.AfterAttributeName: {\n this.stateAfterAttributeName(c);\n break;\n }\n case Tokenizer_State.InAttributeValueSq: {\n this.stateInAttributeValueSingleQuotes(c);\n break;\n }\n case Tokenizer_State.BeforeAttributeValue: {\n this.stateBeforeAttributeValue(c);\n break;\n }\n case Tokenizer_State.BeforeClosingTagName: {\n this.stateBeforeClosingTagName(c);\n break;\n }\n case Tokenizer_State.AfterClosingTagName: {\n this.stateAfterClosingTagName(c);\n break;\n }\n case Tokenizer_State.BeforeSpecialS: {\n this.stateBeforeSpecialS(c);\n break;\n }\n case Tokenizer_State.InAttributeValueNq: {\n this.stateInAttributeValueNoQuotes(c);\n break;\n }\n case Tokenizer_State.InSelfClosingTag: {\n this.stateInSelfClosingTag(c);\n break;\n }\n case Tokenizer_State.InDeclaration: {\n this.stateInDeclaration(c);\n break;\n }\n case Tokenizer_State.BeforeDeclaration: {\n this.stateBeforeDeclaration(c);\n break;\n }\n case Tokenizer_State.BeforeComment: {\n this.stateBeforeComment(c);\n break;\n }\n case Tokenizer_State.InProcessingInstruction: {\n this.stateInProcessingInstruction(c);\n break;\n }\n case Tokenizer_State.InNamedEntity: {\n this.stateInNamedEntity(c);\n break;\n }\n case Tokenizer_State.BeforeEntity: {\n this.stateBeforeEntity(c);\n break;\n }\n case Tokenizer_State.InHexEntity: {\n this.stateInHexEntity(c);\n break;\n }\n case Tokenizer_State.InNumericEntity: {\n this.stateInNumericEntity(c);\n break;\n }\n default: {\n // `this._state === State.BeforeNumericEntity`\n this.stateBeforeNumericEntity(c);\n }\n }\n this.index++;\n }\n this.cleanup();\n }",
"function start(state) { \n service.goNext(state);\n }",
"function TrainState() {\n var last, lastcnt = 0;\n return {\n next: function (ce) {\n if (ce.event_type === 1) {\n if (last !== ce.content) {\n last = ce.content;\n lastcnt = 0;\n } else {\n\t\t\t\t\t\tlastcnt = lastcnt + 1;\n if (lastcnt === 3) {\n send(last);\n }\n }\n }\n }\n };\n }",
"constructor(config) {\r\n this.initial = config.initial;\r\n this.states = config.states;\r\n this.currentState = this.initial;\r\n this.history = [this.initial];\r\n this.step = 0;\r\n }",
"constructor(props) {\n super(props)\n\n this.state = {\n value: low,\n direction: 1\n }\n }",
"changeState(state) {\r\n let possibleStates = ['normal', 'busy', 'hungry', 'sleeping'];\r\n let errorCount = 0;\r\n for (let index = 0; index < possibleStates.length; index++) {\r\n const element = possibleStates[index];\r\n if (state === element) {\r\n errorCount++\r\n }\r\n }\r\n if(errorCount === 0) {\r\n throw new Error(\"State: fail check\");\r\n } \r\n this.config.initial = state\r\n this.undoArr.push(this.config.initial)\r\n return this.config.initial \r\n }",
"function InstructionState() { }",
"actionToState(action,rasp,source,initialRASP){\n var nextRASP={}, delta={}; // nextRASP will be the next state, delta is where all the changes to state are recorded. There may be other properties in the state, only change them deliberatly \n if(action.type===\"TOGGLE\") { // the user clicks on a subject which sends the toggle event, to either open or close the article\n if(rasp.open==='open') { // if the article was open close it, but \n this.toChild['open']({type: \"CLEAR_PATH\"}); // first clear the state of all the sub children, so when they are reopened they are back to their initial state.\n // this is good for 3 reasons: 1) reduces the number of items we need to save state for,\n // 2) reduces the state information we have to encode in to the URL path\n // 3) it fits many use cases that when something becomes visibile it consistently starts in the same state\n delta.open=null; // closed\n delta.minimize=null; // not minimized anymore\n this.qaction(()=>this.props.rasp.toParent({type: \"DESCENDANT_UNFOCUS\"}));\n } else { \n delta.open='open'; // was closed, now open\n delta.minimize=null; // not minimized\n this.qaction(()=>this.props.rasp.toParent({type: \"DESCENDANT_FOCUS\"}))\n }\n } else if(action.type===\"DESCENDANT_FOCUS\" && action.distance > 2 && !rasp.minimize ){\n // a 2+ distant sub child has chanaged to open, so minimize, but don't minimize if already minimized which will change the shape of the propogating message\n delta.minimize=true;\n } else if(action.type===\"DESCENDANT_UNFOCUS\" && action.distance >= 2 && rasp.minimize){\n // a 2+ distant sub child has changed from open, and we are minimized, so unminimize\n delta.minimize=false;\n } else\n return null; // if we don't understand the action, just pass it on\n // we did understand the action and so now calculate the computed state information\n Object.assign(nextRASP,rasp,delta); // calculate the new state based on the previous state and the delta. There may be other properties in the previous state (like depth). Don't clobber them.\n nextRASP.shape= nextRASP.open==='open' ? 'open' : initialRASP.shape; // shape is the piece of state information that all RASP components can understand\n // build the pathSegment out of parts for each state property\n var parts=[];\n if(nextRASP.open==='open') parts.push('o');\n if(nextRASP.minimize) parts.push('m');\n nextRASP.pathSegment= parts.join(','); // pathSegment is be incorporated into the URL path. It should be calculated and the minimal length necessary to do the job\n return nextRASP;\n }",
"next(ch) {\n // Skip whitespaces until we find something else.\n if (isWhitespace(ch)) {\n return this;\n }\n\n // Identify the the state to transition into based on the given character.\n // For tokens that consist of a single character, the token can be generated\n // immediately.\n switch (ch) {\n case '#': {\n return new DirectiveState(this._lexer, ch);\n }\n case '/': {\n return new CommentState(this._lexer, ch);\n }\n case '\"': {\n return new StringState(this._lexer, ch);\n }\n case ',': {\n this._lexer.storeToken(cred.tokenKind.comma, ch);\n return this;\n }\n case '|': {\n this._lexer.storeToken(cred.tokenKind.binaryOr, ch);\n return this;\n }\n case '(': {\n this._lexer.storeToken(cred.tokenKind.openParenthesis, ch);\n return this;\n }\n case ')': {\n this._lexer.storeToken(cred.tokenKind.closeParenthesis, ch);\n return this;\n }\n }\n\n if (isValidCharToStartNumber(ch)) {\n return new NumberState(this._lexer, ch);\n } else if (isValidCharToStartIdentifier(ch)) {\n return new IdentifierState(this._lexer, ch);\n }\n\n throw new Error(\n `Unexpected character \"${ch}\" in file ${this._lexer.fileName} on line ${\n this._lexer.lineNumber\n }.`\n );\n }",
"function PseudoState(name, parent, kind) {\n if (kind === void 0) { kind = PseudoStateKind_1.PseudoStateKind.Initial; }\n var _this = this;\n this.name = name;\n this.kind = kind;\n /**\n * The outgoing transitions available from this vertex.\n */\n this.outgoing = [];\n this.parent = parent instanceof State_1.State ? parent.getDefaultRegion() : parent;\n this.qualifiedName = this.parent + \".\" + this.name;\n // if this is a starting state (initial, deep or shallow history), record it against the parent region\n if (this.kind === PseudoStateKind_1.PseudoStateKind.Initial || this.isHistory()) {\n util_1.assert.ok(!this.parent.starting, function () { return \"Only one initial pseudo state is allowed in region \" + _this.parent; });\n this.parent.starting = this;\n }\n this.parent.children.unshift(this);\n util_1.log.info(function () { return \"Created \" + _this; }, util_1.log.Create);\n }",
"get position() {\n\t\treturn this.state.sourcePosition;\n\t}",
"goToNextState() {\n this.colors = this.nextStateColors\n this.lives = this.nextStateLives\n this.nextStateColors = new Array(COLS * ROWS).fill(COLOR.BLANK)\n this.nextStateLives = new Array(COLS * ROWS).fill(false)\n }",
"function nextState(rule, left, self, right) {\n\t var state = left << 2;\n\t state |= self << 1;\n\t state |= right;\n\t return ((rule & (1 << state)) === 0) ? 0 : 1;\n\t}",
"function whichState(coord) {\r\n ex = coord.x;\r\n why = coord.y;\r\n for (var i = 0; i < graph.states.length; i++) {\r\n var state = graph.states[i];\r\n var r = state.radius;\r\n //distance between two points, giving a little buffer room\r\n //between states close together\r\n if (r > (Math.sqrt(Math.pow(ex - state.location.x, 2) +\r\n Math.pow(why - state.location.y, 2))) - STATE_BUFFER) {\r\n return i;\r\n }\r\n }\r\n\r\n return -1;\r\n}",
"function step()\n {\n //Saving the current states and the previous state to use them in recoloring\n //their view on the graph in the nest step.\n $old_current_state = $current_state;\n $old_previous_state = $previous_state;\n $old_tape_index = $current_tape_index;\n $old_tape_head_value = at_index($current_tape_index);\n \n //If any object is undefined return error because it means that the there is no transition\n //for the current input char.\n $previous_state = $current_state;\n if($graph_table[$current_state] === undefined || $graph_table[$current_state] === null) { $error = true; return -1; }\n $trans = $graph_table[$current_state][at_index($current_tape_index)];\n if($graph_table[$current_state][at_index($current_tape_index)] === undefined || $graph_table[$current_state][at_index($current_tape_index)] === null) { $error = true; return -1; }\n at_index($current_tape_index, $trans.output);\n \n //Moving the tape head depending on the direction of the actual transition retrieved from the graph table.\n if($trans.direction == 'R') $current_tape_index++;\n if($trans.direction == 'L') $current_tape_index--;\n if($trans.direction == 'S') /* do nothing */;\n \n //Updating the current state.\n $current_state = $trans.target;\n \n //If the state is an end state, return seccess, or accept.\n if($end_states[$current_state]) return 2;\n \n return 1; //ok { Meaning that it is a normal step no errors and no accept. }\n \n }",
"function State() {\n\n }",
"function StreamStateMachine() {\n var _this = this;\n var __arguments = new Array(arguments.length);\n for (var __argumentIndex = 0; __argumentIndex < __arguments.length; ++__argumentIndex) {\n __arguments[__argumentIndex] = arguments[__argumentIndex];\n }\n if (__arguments.length == 0) {\n _this = _super.call(this, fm.liveswitch.StreamState.New) || this;\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.New, fm.liveswitch.StreamState.Initializing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.New, fm.liveswitch.StreamState.Failing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.New, fm.liveswitch.StreamState.Closing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Initializing, fm.liveswitch.StreamState.Connecting);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Initializing, fm.liveswitch.StreamState.Failing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Initializing, fm.liveswitch.StreamState.Closing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Connecting, fm.liveswitch.StreamState.Connected);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Connecting, fm.liveswitch.StreamState.Failing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Connecting, fm.liveswitch.StreamState.Closing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Connected, fm.liveswitch.StreamState.Failing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Connected, fm.liveswitch.StreamState.Closing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Closing, fm.liveswitch.StreamState.Failing);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Closing, fm.liveswitch.StreamState.Closed);\n _super.prototype.addTransition.call(_this, fm.liveswitch.StreamState.Failing, fm.liveswitch.StreamState.Failed);\n }\n else {\n throw new fm.liveswitch.Exception('Constructor overload does not exist with specified parameter count/type combination.');\n }\n return _this;\n }",
"function next(state) {\n state.index++;\n }",
"function next(state) {\n state.index++;\n }",
"function Reader(state) {\n stream.Stream.call(this);\n this.pipe = state;\n}",
"function Reader(state) {\n stream.Stream.call(this);\n this.pipe = state;\n}",
"function nextState(state) {\n if (--state == 0) state=3;\n return state;\n }",
"setAnimationPropertyRule(rule, state = HelperFunctions.requiredParameter`state`){\n\t\tconst index = this.animationProperties.findIndex(prop => prop.state === state);\n\t\tif(index !== -1){\n\t\t\tObject.assign(this.animationProperties[index], rule);\n\t\t}\n\t\telse {\n\t\t\tthis.animationProperties.push(Object.assign(rule, {state}));\n\t\t}\n\t\tthis.reAnimate();\n\t}",
"function InputState() {\n this.prefixRepeat = [];\n this.motionRepeat = [];\n\n this.operator = null;\n this.operatorArgs = null;\n this.motion = null;\n this.motionArgs = null;\n this.keyBuffer = []; // For matching multi-key commands.\n this.registerName = null; // Defaults to the unnamed register.\n }",
"function InputState() {\n this.prefixRepeat = [];\n this.motionRepeat = [];\n\n this.operator = null;\n this.operatorArgs = null;\n this.motion = null;\n this.motionArgs = null;\n this.keyBuffer = []; // For matching multi-key commands.\n this.registerName = null; // Defaults to the unnamed register.\n }"
] |
[
"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.534351",
"0.533935",
"0.5335064",
"0.5269152",
"0.5268304",
"0.5264261",
"0.525328",
"0.525328",
"0.525328",
"0.525328",
"0.525328",
"0.5247492",
"0.5241082",
"0.52385145",
"0.5219881",
"0.521419",
"0.52121186",
"0.5197753",
"0.5197753",
"0.518732",
"0.5185111",
"0.5174249",
"0.51734984",
"0.5156451",
"0.51320964",
"0.50961167",
"0.50891757",
"0.50877875",
"0.50877875",
"0.5075288",
"0.5075288",
"0.5075288",
"0.5075288",
"0.5070003",
"0.50591266",
"0.50591266",
"0.50583047",
"0.5057842",
"0.5053868",
"0.50287926",
"0.502844",
"0.5016476",
"0.50129044",
"0.50124013",
"0.49981317",
"0.4996396",
"0.49908912",
"0.49847445",
"0.49841702",
"0.49634233",
"0.49632534",
"0.49592462",
"0.49553585",
"0.49541175",
"0.4948651",
"0.4942395",
"0.4941818",
"0.4933206",
"0.49299055",
"0.49237007",
"0.4915303",
"0.49121892",
"0.49041885",
"0.48805445",
"0.48794252",
"0.48789883",
"0.48777822",
"0.48706794",
"0.48693466",
"0.48670805",
"0.48634797",
"0.4859749",
"0.4859749",
"0.4856834",
"0.4856834",
"0.48518378",
"0.4848242",
"0.4841261",
"0.4841261"
] |
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 if (each.score >= 0.4) {\n objectDescription = objectDescription + \", \" + each.class\n }\n })\n tj.speak(\"The objects I see are: \" + objectDescription)\n });\n}",
"function recommendNewPosts() {\n model.loadModel();\n getNewPosts(function (err, posts) {\n var label\n ;\n posts.forEach(function (post) {\n label = model.classifyPost(post);\n if (label == 'like') {\n console.log(post);\n }\n });\n });\n }",
"function BOT_onLike() {\r\n\tBOT_traceString += \"GOTO command judge\" + \"\\n\"; // change performative\r\n\tBOT_theReqJudgement = \"likeable\";\r\n\tBOT_onJudge(); \t\r\n\tif(BOT_reqSuccess) {\r\n\t\tvar ta = [BOT_theReqTopic,BOT_theReqAttribute]; \r\n\t\tBOT_del(BOT_theUserTopicId,\"distaste\",\"VAL\",ta);\r\n\t\tBOT_add(BOT_theUserTopicId,\"preference\",\"VAL\",ta);\r\n\t}\r\n}",
"function like (data, archetype) {\n var name;\n\n for (name in archetype) {\n if (archetype.hasOwnProperty(name)) {\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof archetype[name]) {\n return false;\n }\n\n if (object(data[name]) && like(data[name], archetype[name]) === false) {\n return false;\n }\n }\n }\n\n return true;\n }",
"function LanguageUnderstandingModel() {\n }",
"function guess() {\n classifier.predict(video.elt, 5, gotResult);\n}",
"function theBigBang() {\n\t\tinitLibs();\n\t\tinitFuncs();\n\t\tObject.setPrototypeOf(Universe.prototype, universe.kjsclasses._primitive_prototype);\n\t\tObject.setPrototypeOf(Object.prototype, universe); // [0]\n\t}",
"function readOwn(obj, name, pumpkin) {\n if (typeof obj !== 'object' || !obj) {\n if (typeOf(obj) !== 'object') {\n return pumpkin;\n }\n }\n if (typeof name === 'number' && name >= 0) {\n if (myOriginalHOP.call(obj, name)) { return obj[name]; }\n return pumpkin;\n }\n name = String(name);\n if (obj[name + '_canRead___'] === obj) { return obj[name]; }\n if (!myOriginalHOP.call(obj, name)) { return pumpkin; }\n // inline remaining relevant cases from canReadPub\n if (endsWith__.test(name)) { return pumpkin; }\n if (name === 'toString') { return pumpkin; }\n if (!isJSONContainer(obj)) { return pumpkin; }\n fastpathRead(obj, name);\n return obj[name];\n }",
"function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach(function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)})}",
"function NXObject() {}",
"function isPrimative(val) { return (typeof val !== 'object') }",
"function like (data, duck) {\n var name;\n\n assert.object(data);\n assert.object(duck);\n\n for (name in duck) {\n if (duck.hasOwnProperty(name)) {\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof duck[name]) {\n return false;\n }\n\n if (object(data[name]) && like(data[name], duck[name]) === false) {\n return false;\n }\n }\n }\n\n return true;\n }",
"static get observedAttributes() {\n return ['rainbow', 'lang'];\n }",
"function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach((function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)}))}",
"function testSimpleHole_prototype() {\n var theHole = Object.create({ x: \"in proto\" });\n var theReplacement = \"yay\";\n var serialized = bidar.serialize(theHole, holeFilter);\n var parsed = bidar.parse(serialized, holeFiller);\n\n assert.equal(parsed, theReplacement);\n\n function holeFilter(x) {\n assert.equal(x, theHole);\n return { data: \"blort\" };\n }\n\n function holeFiller(x) {\n assert.equal(x, \"blort\");\n return theReplacement;\n }\n}",
"function test() {\n\t// \"ex nihilo\" object creation using the literal\n\t// object notation {}.\n\tvar foo = {\n\t\tname : \"foo\",\n\t\tone : 1,\n\t\ttwo : 2\n\t};\n\n\t// Another \"ex nihilo\" object.\n\tvar bar = {\n\t\ttwo : \"two\",\n\t\tthree : 3\n\t};\n\n\t// Gecko and Webkit JavaScript engines can directly\n\t// manipulate the internal prototype link.\n\t// For the sake of simplicity, let us pretend\n\t// that the following line works regardless of the\n\t// engine used:\n\tbar.__proto__ = foo; // foo is now the prototype of bar.\n\n\t// If we try to access foo's properties from bar\n\t// from now on, we'll succeed.\n\tlog(bar.one) // Resolves to 1.\n\n\t// The child object's properties are also accessible.\n\tlog(bar.three) // Resolves to 3.\n\n\t// Own properties shadow prototype properties\n\tlog(bar.two); // Resolves to \"two\"\n\tlog(foo.name); // unaffected, resolves to \"foo\"\n\tlog(bar.name); // Resolves to \"foo\"\n log(foo.__proto__);\n}",
"function wrappedPrimitivePreviewer(className, classObj, objectActor, grip) {\r\n let {_obj} = objectActor;\r\n\r\n if (!_obj.proto || _obj.proto.class != className) {\r\n return false;\r\n }\r\n\r\n let raw = _obj.unsafeDereference();\r\n let v = null;\r\n try {\r\n v = classObj.prototype.valueOf.call(raw);\r\n } catch (ex) {\r\n // valueOf() can throw if the raw JS object is \"misbehaved\".\r\n return false;\r\n }\r\n\r\n if (v === null) {\r\n return false;\r\n }\r\n\r\n let canHandle = GenericObject(objectActor, grip, className === \"String\");\r\n if (!canHandle) {\r\n return false;\r\n }\r\n\r\n grip.preview.wrappedValue = objectActor.getGrip(makeDebuggeeValueIfNeeded(_obj, v));\r\n return true;\r\n}",
"function DartObject(o) {\n this.o = o;\n}",
"function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}",
"function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}",
"function likeVsLikes(toyLikeCount){\n\t\tif (toyLikeCount == 1){\n\t\t\treturn 'Like';\n\t\t} else {\n\t\t\treturn 'Likes';\n\t\t}\n\t}",
"constructor(spec) {\n this.cached = /* @__PURE__ */ Object.create(null);\n let instanceSpec = this.spec = {};\n for (let prop in spec)\n instanceSpec[prop] = spec[prop];\n instanceSpec.nodes = OrderedMap.from(spec.nodes), instanceSpec.marks = OrderedMap.from(spec.marks || {}), this.nodes = NodeType$1.compile(this.spec.nodes, this);\n this.marks = MarkType.compile(this.spec.marks, this);\n let contentExprCache = /* @__PURE__ */ Object.create(null);\n for (let prop in this.nodes) {\n if (prop in this.marks)\n throw new RangeError(prop + \" can not be both a node and a mark\");\n let type = this.nodes[prop], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n type.contentMatch = contentExprCache[contentExpr] || (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\n type.inlineContent = type.contentMatch.inlineContent;\n type.markSet = markExpr == \"_\" ? null : markExpr ? gatherMarks(this, markExpr.split(\" \")) : markExpr == \"\" || !type.inlineContent ? [] : null;\n }\n for (let prop in this.marks) {\n let type = this.marks[prop], excl = type.spec.excludes;\n type.excluded = excl == null ? [type] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"));\n }\n this.nodeFromJSON = this.nodeFromJSON.bind(this);\n this.markFromJSON = this.markFromJSON.bind(this);\n this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n this.cached.wrappings = /* @__PURE__ */ Object.create(null);\n }",
"wordClass(word) {\r\n return {\r\n der: word.artikel == \"der\",\r\n die: word.artikel == \"die\",\r\n das: word.artikel == \"das\",\r\n marked: word.marker\r\n }\r\n }",
"function dummyObjects(name, age){\n this.name = name\n this.age = age\n}",
"function handleLikes() {\n // Get a random number\n let randomNumber = Math.random();\n // To make it unpredictable, only change the likes if =>\n if (randomNumber < REVEAL_PROBABILITY) {\n defineLikes();\n }\n}",
"constructor() { \n \n Like.initialize(this);\n }",
"like() {\r\n return this.clone(Comment, \"Like\").postCore();\r\n }",
"like() {\r\n return this.getItem().then(i => {\r\n return i.like();\r\n });\r\n }",
"added(vrobject){}",
"classify(phrase) { return this.clf.classify(phrase) }",
"function badIdea(){\n this.idea = \"bad\";\n}",
"shouldSerialize(prop, dataKey) {\n const contains = (str, re) => (str.match(re) || []).length > 0;\n const a = contains(dataKey, /\\./g);\n const b = contains(dataKey, /\\[/g);\n return !!prop.object && !(a || b);\n }",
"static get observedAttributes(){this.finalize();const e=[];// Use forEach so this works even if for/of loops are compiled to for loops\n// expecting arrays\nreturn this._classProperties.forEach((t,n)=>{const r=this._attributeNameForProperty(n,t);void 0!==r&&(this._attributeToPropertyMap.set(r,n),e.push(r))}),e}",
"function oldAndLoud(object){\n\tobject.age++;\n\tobject.name = object.name.toUpperCase();\n}",
"like() {\r\n return this.clone(Item, \"like\").postCore();\r\n }",
"function classifyPose() {\n if (pose && working) {\n inputs = [];\n for (let i = 0; i < pose.landmarks.length; i++) {\n inputs.push(pose.landmarks[i][0]);\n inputs.push(pose.landmarks[i][1]);\n inputs.push(pose.landmarks[i][2]);\n }\n brain.classify(inputs, gotResult)\n }\n }",
"function PropertyDetection() {}",
"constructor()\n {\n this.likes = [];\n }",
"async TestLikeDoctorPost(){\n var response = await entity.Likes(6,28,true,true);\n //console.log(response)\n if(response != null){\n console.log(\"\\x1b[32m%s\\x1b[0m\",\"TestDOctorRating Passed\");\n }else{\n console.log(\"\\x1b[31m%s\\x1b[0m\",\"TestDOctorRating Failed\");\n }\n\n }",
"function classifyVideo() {\n classifier.predict(gotResult);\n}",
"function classifyVideo() {\n classifier.predict(gotResult);\n}",
"function classifyVideo() {\n classifier.predict(gotResult);\n}",
"function showLikes(likes) {\n\tconsole.log(`THINGS I LIKE:\\n`);\n\tfor(let like of likes) {\n\t\tconsole.log(like);\n\t}\n}",
"function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}",
"function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}",
"function Nevis() {}",
"function Nevis() {}",
"function Nevis() {}",
"test_primitivesExtended() {\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.primitivesExtended);\n let object = translator.decode(text).getRoot();\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.PrimitivesExtended\", object.constructor.__getClass());\n Assert.equals(\"alpha16\", object.string);\n }",
"function buildObjectsObj(gCloudV, azureCV, minScore = 0.0){\n let objects = [];\n\n if(gCloudV) {// gcloud vision results are available\n let gCloudObjects = gCloudV['localizedObjectAnnotations'];\n\n //apply standard bounding box to all the detected objects\n if(azureCV)// azure computer vision results are available\n gCloudVObjsToCogniBoundingBox(gCloudObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\n\n else//need to retrieve image sizes from gcloud (already done and put in the metadata tag of gcloudv with appropriate calls)\n gCloudVObjsToCogniBoundingBox(gCloudObjects, gCloudV['metadata']['width'], gCloudV['metadata']['height']);\n\n for (let gCloudObj of gCloudObjects) {\n if (gCloudObj['score'] > minScore) { //filter out unwanted tags\n objects.push({\n name: gCloudObj['name'],\n mid: (gCloudObj['mid'] && gCloudObj['mid']!= '')? gCloudObj['mid']: undefined,\n confidence: gCloudObj['score'],\n boundingBox: gCloudObj['boundingBox']\n });\n }\n }\n }\n\n if(azureCV){// azure computer vision results are available\n let azureObjects = azureCV['objects'];\n //apply standard bounding box to all the detected objects\n azureCVObjsToCogniBoundingBox(azureObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\n for(let aObj of azureObjects){\n if(aObj['confidence'] > minScore) { //filter out unwanted tags\n objects.push({\n name: aObj['object'],\n confidence: aObj['confidence'],\n boundingBox: aObj['boundingBox']\n });\n }\n }\n }\n\n objects = combineObjectsArray(objects);// build an array where labels regarding the same exact object are combined with averaged confidence\n\n objects.sort((a, b) => {\n if(a['confidence']>b['confidence'])\n return -1;\n else if(a['confidence']==b['confidence'])\n return 0;\n else\n return 1;\n });\n\n return objects;\n}",
"function V(e){if(null===e||\"[object Object]\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}",
"function classifyVideo() {\r\n classifier.classify(vid, gotResult);\r\n\r\n}",
"function test_nountag_does_not_think_it_has_watch_tag_when_it_does_not() {\n Assert.equal(TagNoun.fromJSON(\"watch\"), undefined);\n}",
"function v11(v12,v13) {\n const v15 = v11(Object,Function);\n // v15 = .unknown\n const v16 = Object(v13,v8,0,v6);\n // v16 = .object()\n const v17 = 0;\n // v17 = .integer\n const v18 = 1;\n // v18 = .integer\n const v19 = 512;\n // v19 = .integer\n const v20 = \"-1024\";\n // v20 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v21 = isFinite;\n // v21 = .function([.anything] => .boolean)\n const v23 = [1337];\n // v23 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v24 = {};\n // v24 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v25 = v23;\n const v26 = -29897853;\n // v26 = .integer\n const v27 = \"replace\";\n // v27 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v28 = Boolean;\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v30 = [13.37,13.37];\n // v30 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v31 = 1337;\n // v31 = .integer\n let v32 = 13.37;\n const v36 = [13.37,13.37,13.37];\n // v36 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v38 = [1337,1337];\n // v38 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v39 = [13.37,1337,v38,1337,\"-128\",13.37,\"-128\",\"-128\",2147483647,1337];\n // v39 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v40 = {__proto__:v36,length:v39};\n // v40 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"length\"])\n const v41 = \"0\";\n // v41 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v42 = -4130093409;\n // v42 = .integer\n const v44 = {b:2147483647,e:v38,valueOf:v36};\n // v44 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"b\", \"valueOf\", \"e\"])\n const v45 = \"k**baeaDif\";\n // v45 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v46 = 65536;\n // v46 = .integer\n const v47 = \"k**baeaDif\";\n // v47 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v48 = 13.37;\n // v48 = .float\n const v50 = [13.37,13.37];\n // v50 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v51 = ~v50;\n // v51 = .boolean\n const v53 = [13.37];\n // v53 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n let v54 = v53;\n const v55 = gc;\n // v55 = .function([] => .undefined)\n const v58 = [13.37,13.37,13.37,13.37];\n // v58 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v60 = [1337,1337,1337,1337];\n // v60 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v61 = [3697200800,v58,v60];\n // v61 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\n // v62 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"length\", \"constructor\", \"toString\", \"valueOf\"])\n const v65 = [13.37,13.37,13.37,13.37];\n // v65 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v67 = [1337,1337,1337,1337];\n // v67 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v68 = [3697200800,v65,v67];\n // v68 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\n // v69 = .object(ofGroup: Object, withProperties: [\"e\", \"constructor\", \"__proto__\", \"length\", \"toString\", \"valueOf\"])\n const v70 = Object;\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n function v71(v72) {\n }\n const v74 = [13.37];\n // v74 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v75 = 1337;\n // v75 = .integer\n const v76 = v44 ** 13.37;\n // v76 = .integer | .float | .bigint\n function v77(v78,v79,v80,v81,v82) {\n }\n let v83 = v74;\n const v84 = \"2\";\n // v84 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v85 = \"2\";\n // v85 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v88 = [13.37,13.37,1337,13.37];\n // v88 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v89(v90,v91,v92) {\n }\n const v94 = [1337,1337,1337,1337];\n // v94 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v95 = [3697200800,v88,v94];\n // v95 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v96(v97,v98) {\n }\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\n // v99 = .object(ofGroup: Object, withProperties: [\"toString\", \"length\", \"constructor\", \"__proto__\", \"e\", \"d\"])\n let v100 = 13.37;\n const v101 = typeof v74;\n // v101 = .string\n const v102 = \"symbol\";\n // v102 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v103 = 3697200800;\n // v103 = .integer\n const v104 = \"2\";\n // v104 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v105 = Boolean;\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v106 = Function;\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v107 = 13.37;\n // v107 = .float\n const v108 = 1337;\n // v108 = .integer\n const v109 = \"2\";\n // v109 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v110 = Function;\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v112 = [13.37,13.37,13.37,13.37];\n // v112 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v113 = 1337;\n // v113 = .integer\n let v114 = 13.37;\n const v116 = {...3697200800,...3697200800};\n // v116 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n const v117 = Object;\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v118 = Function;\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v119 = {};\n // v119 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v120 = v119;\n const v121 = (3697200800).constructor;\n // v121 = .unknown\n function v122(v123,v124) {\n }\n const v125 = Promise;\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\"prototype\"], withMethods: [\"race\", \"allSettled\", \"reject\", \"all\", \"resolve\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\"__proto__\"], withMethods: [\"finally\", \"then\", \"catch\"]))\n const v128 = 4;\n // v128 = .integer\n let v129 = 0;\n const v131 = [13.37,13.37,13.37,13.37];\n // v131 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v133 = [1337,1337,1337,1337];\n // v133 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v134 = [3697200800,v131,v133];\n // v134 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v135 = Object;\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v136 = -944747134;\n // v136 = .integer\n const v139 = [13.37,13.37,13.37,13.37];\n // v139 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v141 = [1337,1337,1337,1337];\n // v141 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v142 = [3697200800,v139,v141];\n // v142 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\n // v143 = .object(ofGroup: Object, withProperties: [\"toString\", \"constructor\", \"e\", \"__proto__\", \"valueOf\", \"length\"])\n let v144 = v143;\n const v145 = gc;\n // v145 = .function([] => .undefined)\n let v146 = 13.37;\n const v150 = [13.37,13.37,13.37,Function];\n // v150 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v152 = [1337,1337,1337,1337];\n // v152 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v153 = [3697200800,v150,v152];\n // v153 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v154 = v153 + 1;\n // v154 = .primitive\n let v155 = 0;\n const v156 = v155 + 1;\n // v156 = .primitive\n const v158 = \"2\";\n // v158 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v160 = [13.37,13.37,13.37,13.37];\n // v160 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v162 = 0;\n // v162 = .integer\n const v163 = [1337,1337,1337,1337];\n // v163 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v164 = [3697200800,1337,v163];\n // v164 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v166 = 1337;\n // v166 = .integer\n let v167 = 2594067260;\n const v169 = 4;\n // v169 = .integer\n let v170 = 0;\n const v171 = v167 + 1;\n // v171 = .primitive\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\n // v172 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"constructor\", \"valueOf\", \"length\", \"toString\"])\n const v173 = 0;\n // v173 = .integer\n const v174 = 5;\n // v174 = .integer\n const v175 = 2937513072;\n // v175 = .integer\n const v176 = Object;\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v177 = v172.constructor;\n // v177 = .unknown\n const v178 = 0;\n // v178 = .integer\n const v179 = 1;\n // v179 = .integer\n try {\n } catch(v180) {\n const v182 = [13.37,13.37,13.37,13.37];\n // v182 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v183 = v182.__proto__;\n // v183 = .object()\n function v185(v186) {\n }\n const v187 = Object >>> v183;\n // v187 = .integer | .bigint\n }\n function v188(v189,v190,v191,v192,...v193) {\n }\n}",
"function markRaw(obj) {\r\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\r\n return obj;\r\n }\r\n // set the vue observable flag at obj\r\n var ob = createObserver();\r\n ob.__raw__ = true;\r\n def(obj, '__ob__', ob);\r\n // mark as Raw\r\n rawSet.set(obj, true);\r\n return obj;\r\n}",
"function markRaw(obj) {\r\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\r\n return obj;\r\n }\r\n // set the vue observable flag at obj\r\n var ob = createObserver();\r\n ob.__raw__ = true;\r\n def(obj, '__ob__', ob);\r\n // mark as Raw\r\n rawSet.set(obj, true);\r\n return obj;\r\n}",
"transient private internal function m185() {}",
"function rekognizeLabels(bucket, key) {\n let params = {\n Image: {\n S3Object: {\n Bucket: bucket,\n Name: key\n }\n },\n MaxLabels: 3,\n MinConfidence: 80\n };\n\n return rekognition.detectLabels(params).promise()\n}",
"test_doNotRetainAnno(){\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.doNotRetainAnno);\n let object1 = translator.decode(text).getRoot();\n let object2 = translator.decode(text).getRoot();\n\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\", object1.constructor.__getClass());\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\", object2.constructor.__getClass());\n Assert.notEquals(object1, object2);\n }",
"function LK_likeIt(elem) {\n var likeGroup = elem.getAttribute(LK_LIKEGROUP);\n var likeValue = elem.getAttribute(LK_LIKEVALUE);\n localStorage[likeGroup] = likeValue;\n\n // Change the style of the liker nodes\n var siblings = elem.parentNode.childNodes;\n for (var i = 0; i < siblings.length; i++) {\n if (siblings[i].style) { \n LK_applyNormalStyle(siblings[i]);\n }\n }\n LK_applySelectedStyle(elem, likeValue);\n\n // Change the value of any mini likers\n var allSpans = document.getElementsByTagName('span');\n for (var i = 0; i < allSpans.length; i++) {\n var span = allSpans[i];\n if (span.getAttribute(LK_LIKEGROUP) == likeGroup) {\n if (span.getAttribute(LK_LIKETYPE) == 'mini') {\n span.innerHTML = LK_MAPPINGS[likeValue].label;\n LK_applySelectedStyle(allSpans[i], likeValue);\n }\n }\n }\n}",
"function OOPExample(who) {\n this.me = who;\n}",
"getLikes(state, data) {\n state.likes = data\n }",
"function _isAlternativeRecognitionResult(obj) {\r\n return obj && typeof obj === 'object';\r\n}",
"function addLikes() {\n if (propLike?.includes(user.username)) {\n let index = propLike.indexOf(user.username);\n let removeLike = [\n ...propLike.slice(0, index),\n ...propLike.slice(index + 1),\n ];\n setLikeGet(removeLike);\n setPropLike(removeLike);\n setRedLike(\"\");\n\n addToLike(eventid, removeLike);\n } else {\n let likesArr = [...propLike, `${user.username}`];\n\n setLikeGet(likesArr);\n setPropLike(likesArr);\n setRedLike(\"red\");\n addToLike(eventid, likesArr);\n }\n }",
"function LiteralObject() {\r\n}",
"function Komunalne() {}",
"function Bevy() {}",
"function Prediction() {\n this.score = {};\n}",
"function Object() {}",
"function Object() {}",
"function canEnumPub(obj, name) {\n if (obj === null) { return false; }\n if (obj === void 0) { return false; }\n name = String(name);\n if (obj[name + '_canEnum___']) { return true; }\n if (endsWith__.test(name)) { return false; }\n if (!isJSONContainer(obj)) { return false; }\n if (!myOriginalHOP.call(obj, name)) { return false; }\n fastpathEnum(obj, name);\n if (name === 'toString') { return true; }\n fastpathRead(obj, name);\n return true;\n }",
"function Obj(){ return Literal.apply(this,arguments) }",
"test_primitives() {\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.primitives);\n let object = translator.decode(text).getRoot();\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.Primitives\", object.constructor.__getClass());\n Assert.equals(\"alpha9\", object.string);\n }",
"function hello()\n{\n /* ATTRIBUTES */\n this.coolbeans = 'class';\n this.something = 'hello-class';\n\n}",
"function test_cluster_tagged_crosshair_op_vsphere65() {}",
"function classifyVideo() {\n classifier.classify(gotResult);\n}",
"function classifyVideo() {\n classifier.classify(gotResult);\n}",
"constructor(papa,mummy,sivlings,belongs,loving_bro,favs_bro){\n super(papa,mummy,sivlings,belongs)\n this.loving_bro=loving_bro\n this.favs_bro=favs_bro\n }",
"function v8(v9,v10) {\n const v16 = [1337,1337];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v17 = [\"536870912\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\n // v17 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = {constructor:13.37,e:v16};\n // v18 = .object(ofGroup: Object, withProperties: [\"constructor\", \"e\", \"__proto__\"])\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\n // v19 = .object(ofGroup: Object, withProperties: [\"d\", \"b\", \"a\", \"__proto__\", \"e\", \"constructor\", \"length\"])\n const v21 = new Float64Array(v19);\n // v21 = .object(ofGroup: Float64Array, withProperties: [\"byteOffset\", \"constructor\", \"buffer\", \"__proto__\", \"byteLength\", \"length\"], withMethods: [\"map\", \"values\", \"subarray\", \"find\", \"fill\", \"set\", \"findIndex\", \"some\", \"reduceRight\", \"reverse\", \"join\", \"includes\", \"entries\", \"reduce\", \"every\", \"copyWithin\", \"sort\", \"forEach\", \"lastIndexOf\", \"indexOf\", \"filter\", \"slice\", \"keys\"])\n v6[6] = v7;\n v7.toString = v9;\n }",
"function defineInspect(classObject) {\n var fn = classObject.prototype.toJSON;\n typeof fn === 'function' || invariant(0);\n classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n if (nodejsCustomInspectSymbol[\"a\" /* default */]) {\n classObject.prototype[nodejsCustomInspectSymbol[\"a\" /* default */]] = fn;\n }\n}",
"annotate(message: string, data: Object) {\n this.message = message;\n this.data = assign(this.data, data);\n }",
"function encodeObject(o) {\n if (_.isNumber(o)) {\n if (_.isNaN(o)) {\n return ['SPECIAL_FLOAT', 'NaN'];\n } else if (o === Infinity) {\n return ['SPECIAL_FLOAT', 'Infinity'];\n } else if (o === -Infinity) {\n return ['SPECIAL_FLOAT', '-Infinity'];\n } else {\n return o;\n }\n } else if (_.isString(o)) {\n return o;\n } else if (_.isBoolean(o) || _.isNull(o) || _.isUndefined(o)) {\n return ['JS_SPECIAL_VAL', String(o)];\n } else if (typeof o === 'symbol') {\n // ES6 symbol\n return ['JS_SPECIAL_VAL', String(o)];\n } else {\n // render these as heap objects\n\n // very important to use _.has since we don't want to\n // grab the property in your prototype, only in YOURSELF ... SUBTLE!\n if (!_.has(o, 'smallObjId_hidden_')) {\n // make this non-enumerable so that it doesn't show up in\n // console.log() or other inspector functions\n Object.defineProperty(o, 'smallObjId_hidden_', { value: smallObjId,\n enumerable: false });\n smallObjId++;\n }\n assert(o.smallObjId_hidden_ > 0);\n\n var ret = ['REF', o.smallObjId_hidden_];\n\n if (encodedHeapObjects[String(o.smallObjId_hidden_)] !== undefined) {\n return ret;\n }\n else {\n assert(_.isObject(o));\n\n var newEncodedObj = [];\n encodedHeapObjects[String(o.smallObjId_hidden_)] = newEncodedObj;\n\n var i;\n\n if (_.isFunction(o)) {\n var funcProperties = []; // each element is a pair of [name, encoded value]\n\n var encodedProto = null;\n if (_.isObject(o.prototype)) {\n // TRICKY TRICKY! for inheritance to be displayed properly, we\n // want to find the prototype of o.prototype and see if it's\n // non-empty. if that's true, then even if o.prototype is\n // empty (i.e., has no properties of its own), then we should\n // still encode it since its 'prototype' \"uber-hidden\n // property\" is non-empty\n var prototypeOfPrototype = Object.getPrototypeOf(o.prototype);\n if (!_.isEmpty(o.prototype) ||\n (_.isObject(prototypeOfPrototype) && !_.isEmpty(prototypeOfPrototype))) {\n encodedProto = encodeObject(o.prototype);\n }\n }\n\n if (encodedProto) {\n funcProperties.push(['prototype', encodedProto]);\n }\n\n // now get all of the normal properties out of this function\n // object (it's unusual to put properties in a function object,\n // but it's still legal!)\n var funcPropPairs = _.pairs(o);\n for (i = 0; i < funcPropPairs.length; i++) {\n funcProperties.push([funcPropPairs[i][0], encodeObject(funcPropPairs[i][1])]);\n }\n\n var funcCodeString = o.toString();\n\n /*\n\n #craftsmanship -- make nested functions look better by indenting\n the first line of a nested function definition by however much\n the LAST line is indented, ONLY if the last line is simply a\n single ending '}'. otherwise it will look ugly since the\n function definition doesn't start out indented, like so:\n\nfunction bar(x) {\n globalZ += 100;\n return x + y + globalZ;\n }\n\n */\n var codeLines = funcCodeString.split('\\n');\n if (codeLines.length > 1) {\n var lastLine = _.last(codeLines);\n if (lastLine.trim() === '}') {\n var lastLinePrefix = lastLine.slice(0, lastLine.indexOf('}'));\n funcCodeString = lastLinePrefix + funcCodeString; // prepend!\n }\n }\n\n newEncodedObj.push('JS_FUNCTION',\n o.name,\n funcCodeString, /* code string*/\n funcProperties.length ? funcProperties : null, /* OPTIONAL */\n null /* parent frame */);\n } else if (_.isArray(o)) {\n newEncodedObj.push('LIST');\n for (i = 0; i < o.length; i++) {\n newEncodedObj.push(encodeObject(o[i]));\n }\n } else if (o.__proto__.toString() === canonicalSet.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\n newEncodedObj.push('SET');\n // ES6 Set (TODO: add WeakSet)\n for (let item of o) {\n newEncodedObj.push(encodeObject(item));\n }\n } else if (o.__proto__.toString() === canonicalMap.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\n // ES6 Map (TODO: add WeakMap)\n newEncodedObj.push('DICT'); // use the Python 'DICT' type since it's close enough; adjust display in frontend\n for (let [key, value] of o) {\n newEncodedObj.push([encodeObject(key), encodeObject(value)]);\n }\n } else {\n // a true object\n\n // if there's a custom toString() function (note that a truly\n // prototypeless object won't have toString method, so check first to\n // see if toString is *anywhere* up the prototype chain)\n var s = (o.toString !== undefined) ? o.toString() : '';\n if (s !== '' && s !== '[object Object]') {\n newEncodedObj.push('INSTANCE_PPRINT', 'object', s);\n } else {\n newEncodedObj.push('INSTANCE', '');\n var pairs = _.pairs(o);\n for (i = 0; i < pairs.length; i++) {\n var e = pairs[i];\n newEncodedObj.push([encodeObject(e[0]), encodeObject(e[1])]);\n }\n\n var proto = Object.getPrototypeOf(o);\n if (_.isObject(proto) && !_.isEmpty(proto)) {\n //log('obj.prototype', proto, proto.smallObjId_hidden_);\n // I think __proto__ is the official term for this field,\n // *not* 'prototype'\n newEncodedObj.push(['__proto__', encodeObject(proto)]);\n }\n }\n }\n\n return ret;\n }\n\n }\n assert(false);\n}",
"function dist_index_esm_contains(obj,key){return Object.prototype.hasOwnProperty.call(obj,key);}",
"function isRawPostcodeObject(o, additionalAttr, blackListedAttr) {\n\tif (!additionalAttr) additionalAttr = [];\n\tif (!blackListedAttr) blackListedAttr = [];\n\tisSomeObject(o, rawPostcodeAttributes, additionalAttr, blackListedAttr);\n}",
"function _meta_(v,m){var ms=v['__meta__']||{};for(var k in m){ms[k]=m[k]};v['__meta__']=ms;return v}",
"function Animal() {\n this.kind = \"Dog\"\n}",
"function Kitten(name, photo, interests, isGoodWithKids, isGoodWithDogs, isGoodWithCats) {\n this.name = name;\n this.photo = photo;\n this.interests = interests;\n this.isGoodWithKids = isGoodWithKids;\n this.isGoodWithCats = isGoodWithCats;\n this.isGoodWithDogs = isGoodWithDogs;\n}",
"getMeta () {\n }",
"function np(e){return\"[object Object]\"===Object.prototype.toString.call(e)}",
"function Obj() {}",
"function isFriend(name, object) {\n//use hasWord function to check object names array\n// console.log(object);\n// console.log(name);\n//conditional to check for property\nif (object['friends'] !== undefined) {\nreturn hasWord(object.friends.join(' '), name);\n}\nelse {return false};\n \n}",
"function test_fail_hole_prototype() {\n var obj = Object.create({ stuff: \"in prototype\" });\n obj.foo = \"bar\";\n\n function f1() {\n bidar.serialize(obj);\n }\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\n}",
"function Person(saying) {\n this.saying = saying;\n /*\n return {\n dumbObject: true\n }\n */\n}",
"transient private protected internal function m182() {}",
"function kotlin(hljs) {\n const KEYWORDS = {\n keyword:\n 'abstract as val var vararg get set class object open private protected public noinline ' +\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\n 'import package is in fun override companion reified inline lateinit init ' +\n 'interface annotation data sealed internal infix operator out by constructor super ' +\n 'tailrec where const inner suspend typealias external expect actual',\n built_in:\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\n literal:\n 'true false null'\n };\n const KEYWORDS_WITH_LABEL = {\n className: 'keyword',\n begin: /\\b(break|continue|return|this)\\b/,\n starts: {\n contains: [\n {\n className: 'symbol',\n begin: /@\\w+/\n }\n ]\n }\n };\n const LABEL = {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\n };\n\n // for string templates\n const SUBST = {\n className: 'subst',\n begin: /\\$\\{/,\n end: /\\}/,\n contains: [ hljs.C_NUMBER_MODE ]\n };\n const VARIABLE = {\n className: 'variable',\n begin: '\\\\$' + hljs.UNDERSCORE_IDENT_RE\n };\n const STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"\"\"',\n end: '\"\"\"(?=[^\"])',\n contains: [\n VARIABLE,\n SUBST\n ]\n },\n // Can't use built-in modes easily, as we want to use STRING in the meta\n // context as 'meta-string' and there's no syntax to remove explicitly set\n // classNames in built-in modes.\n {\n begin: '\\'',\n end: '\\'',\n illegal: /\\n/,\n contains: [ hljs.BACKSLASH_ESCAPE ]\n },\n {\n begin: '\"',\n end: '\"',\n illegal: /\\n/,\n contains: [\n hljs.BACKSLASH_ESCAPE,\n VARIABLE,\n SUBST\n ]\n }\n ]\n };\n SUBST.contains.push(STRING);\n\n const ANNOTATION_USE_SITE = {\n className: 'meta',\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\s*:(?:\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\n };\n const ANNOTATION = {\n className: 'meta',\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\n contains: [\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [\n hljs.inherit(STRING, {\n className: 'meta-string'\n })\n ]\n }\n ]\n };\n\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\n // According to the doc above, the number mode of kotlin is the same as java 8,\n // so the code below is copied from java.js\n const KOTLIN_NUMBER_MODE = NUMERIC;\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\n '/\\\\*', '\\\\*/',\n {\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\n }\n );\n const KOTLIN_PAREN_TYPE = {\n variants: [\n {\n className: 'type',\n begin: hljs.UNDERSCORE_IDENT_RE\n },\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [] // defined later\n }\n ]\n };\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\n\n return {\n name: 'Kotlin',\n aliases: [ 'kt' ],\n keywords: KEYWORDS,\n contains: [\n hljs.COMMENT(\n '/\\\\*\\\\*',\n '\\\\*/',\n {\n relevance: 0,\n contains: [\n {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n }\n ]\n }\n ),\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n KEYWORDS_WITH_LABEL,\n LABEL,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n {\n className: 'function',\n beginKeywords: 'fun',\n end: '[(]|$',\n returnBegin: true,\n excludeEnd: true,\n keywords: KEYWORDS,\n relevance: 5,\n contains: [\n {\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\s*\\\\(',\n returnBegin: true,\n relevance: 0,\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\n },\n {\n className: 'type',\n begin: /</,\n end: />/,\n keywords: 'reified',\n relevance: 0\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n endsParent: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n begin: /:/,\n end: /[=,\\/]/,\n endsWithParent: true,\n contains: [\n KOTLIN_PAREN_TYPE,\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT\n ],\n relevance: 0\n },\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n STRING,\n hljs.C_NUMBER_MODE\n ]\n },\n KOTLIN_NESTED_COMMENT\n ]\n },\n {\n className: 'class',\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\n end: /[:\\{(]|$/,\n excludeEnd: true,\n illegal: 'extends implements',\n contains: [\n {\n beginKeywords: 'public protected internal private constructor'\n },\n hljs.UNDERSCORE_TITLE_MODE,\n {\n className: 'type',\n begin: /</,\n end: />/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0\n },\n {\n className: 'type',\n begin: /[,:]\\s*/,\n end: /[<\\(,]|$/,\n excludeBegin: true,\n returnEnd: true\n },\n ANNOTATION_USE_SITE,\n ANNOTATION\n ]\n },\n STRING,\n {\n className: 'meta',\n begin: \"^#!/usr/bin/env\",\n end: '$',\n illegal: '\\n'\n },\n KOTLIN_NUMBER_MODE\n ]\n };\n}",
"function kotlin(hljs) {\n const KEYWORDS = {\n keyword:\n 'abstract as val var vararg get set class object open private protected public noinline ' +\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\n 'import package is in fun override companion reified inline lateinit init ' +\n 'interface annotation data sealed internal infix operator out by constructor super ' +\n 'tailrec where const inner suspend typealias external expect actual',\n built_in:\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\n literal:\n 'true false null'\n };\n const KEYWORDS_WITH_LABEL = {\n className: 'keyword',\n begin: /\\b(break|continue|return|this)\\b/,\n starts: {\n contains: [\n {\n className: 'symbol',\n begin: /@\\w+/\n }\n ]\n }\n };\n const LABEL = {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\n };\n\n // for string templates\n const SUBST = {\n className: 'subst',\n begin: /\\$\\{/,\n end: /\\}/,\n contains: [ hljs.C_NUMBER_MODE ]\n };\n const VARIABLE = {\n className: 'variable',\n begin: '\\\\$' + hljs.UNDERSCORE_IDENT_RE\n };\n const STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"\"\"',\n end: '\"\"\"(?=[^\"])',\n contains: [\n VARIABLE,\n SUBST\n ]\n },\n // Can't use built-in modes easily, as we want to use STRING in the meta\n // context as 'meta-string' and there's no syntax to remove explicitly set\n // classNames in built-in modes.\n {\n begin: '\\'',\n end: '\\'',\n illegal: /\\n/,\n contains: [ hljs.BACKSLASH_ESCAPE ]\n },\n {\n begin: '\"',\n end: '\"',\n illegal: /\\n/,\n contains: [\n hljs.BACKSLASH_ESCAPE,\n VARIABLE,\n SUBST\n ]\n }\n ]\n };\n SUBST.contains.push(STRING);\n\n const ANNOTATION_USE_SITE = {\n className: 'meta',\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\s*:(?:\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\n };\n const ANNOTATION = {\n className: 'meta',\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\n contains: [\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [\n hljs.inherit(STRING, {\n className: 'meta-string'\n })\n ]\n }\n ]\n };\n\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\n // According to the doc above, the number mode of kotlin is the same as java 8,\n // so the code below is copied from java.js\n const KOTLIN_NUMBER_MODE = NUMERIC;\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\n '/\\\\*', '\\\\*/',\n {\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\n }\n );\n const KOTLIN_PAREN_TYPE = {\n variants: [\n {\n className: 'type',\n begin: hljs.UNDERSCORE_IDENT_RE\n },\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [] // defined later\n }\n ]\n };\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\n\n return {\n name: 'Kotlin',\n aliases: [ 'kt' ],\n keywords: KEYWORDS,\n contains: [\n hljs.COMMENT(\n '/\\\\*\\\\*',\n '\\\\*/',\n {\n relevance: 0,\n contains: [\n {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n }\n ]\n }\n ),\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n KEYWORDS_WITH_LABEL,\n LABEL,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n {\n className: 'function',\n beginKeywords: 'fun',\n end: '[(]|$',\n returnBegin: true,\n excludeEnd: true,\n keywords: KEYWORDS,\n relevance: 5,\n contains: [\n {\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\s*\\\\(',\n returnBegin: true,\n relevance: 0,\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\n },\n {\n className: 'type',\n begin: /</,\n end: />/,\n keywords: 'reified',\n relevance: 0\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n endsParent: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n begin: /:/,\n end: /[=,\\/]/,\n endsWithParent: true,\n contains: [\n KOTLIN_PAREN_TYPE,\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT\n ],\n relevance: 0\n },\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n STRING,\n hljs.C_NUMBER_MODE\n ]\n },\n KOTLIN_NESTED_COMMENT\n ]\n },\n {\n className: 'class',\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\n end: /[:\\{(]|$/,\n excludeEnd: true,\n illegal: 'extends implements',\n contains: [\n {\n beginKeywords: 'public protected internal private constructor'\n },\n hljs.UNDERSCORE_TITLE_MODE,\n {\n className: 'type',\n begin: /</,\n end: />/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0\n },\n {\n className: 'type',\n begin: /[,:]\\s*/,\n end: /[<\\(,]|$/,\n excludeBegin: true,\n returnEnd: true\n },\n ANNOTATION_USE_SITE,\n ANNOTATION\n ]\n },\n STRING,\n {\n className: 'meta',\n begin: \"^#!/usr/bin/env\",\n end: '$',\n illegal: '\\n'\n },\n KOTLIN_NUMBER_MODE\n ]\n };\n}",
"function Surrogate(){}",
"function Surrogate(){}",
"function Surrogate(){}",
"static serialize(obj, allowPrimitives, fallbackToJson, requireJsonType = false) {\n if (allowPrimitives) {\n if (typeof obj === \"string\") {\n return this.serializePrimitive(obj, \"string\");\n } else if (typeof obj === \"number\") {\n return this.serializePrimitive(obj, \"double\");\n } else if (Buffer.isBuffer(obj)) {\n return this.serializePrimitive(obj, \"bytes\");\n } else if (typeof obj === \"boolean\") {\n return this.serializePrimitive(obj, \"bool\");\n } else if (Long.isLong(obj)) {\n return this.serializePrimitive(obj, \"int64\");\n }\n }\n if (obj.constructor && typeof obj.constructor.encode === \"function\" && obj.constructor.$type) {\n return Any.create({\n // I have *no* idea why it's type_url and not typeUrl, but it is.\n type_url: \"type.googleapis.com/\" + AnySupport.fullNameOf(obj.constructor.$type),\n value: obj.constructor.encode(obj).finish()\n });\n } else if (fallbackToJson && typeof obj === \"object\") {\n let type = obj.type;\n if (type === undefined) {\n if (requireJsonType) {\n throw new Error(util.format(\"Fallback to JSON serialization supported, but object does not define a type property: %o\", obj));\n } else {\n type = \"object\";\n }\n }\n return Any.create({\n type_url: CloudStateJson + type,\n value: this.serializePrimitiveValue(stableJsonStringify(obj), \"string\")\n });\n } else {\n throw new Error(util.format(\"Object %o is not a protobuf object, and hence can't be dynamically \" +\n \"serialized. Try passing the object to the protobuf classes create function.\", obj));\n }\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.46990207",
"0.4690639",
"0.46904448",
"0.46862254",
"0.46716532",
"0.46667543",
"0.46522382",
"0.46354175",
"0.46053663",
"0.46017453",
"0.45926702",
"0.45891586",
"0.45877746",
"0.458541",
"0.45851982",
"0.45847243",
"0.4584686",
"0.458378",
"0.45767823",
"0.45753202",
"0.45753202",
"0.45753202",
"0.45713404",
"0.45637134",
"0.45637134",
"0.4557141",
"0.4557141",
"0.4557141",
"0.45494914",
"0.45366898",
"0.45342454",
"0.4533338",
"0.45322663",
"0.45229813",
"0.452288",
"0.452288",
"0.45159692",
"0.45102093",
"0.45099118",
"0.45062032",
"0.4506134",
"0.45033473",
"0.4502599",
"0.44998378",
"0.4497197",
"0.44843012",
"0.44764578",
"0.44738895",
"0.44715428",
"0.44715428",
"0.4471341",
"0.44594073",
"0.44552016",
"0.44538808",
"0.44522536",
"0.44464657",
"0.44464657",
"0.4443469",
"0.4443427",
"0.44433454",
"0.4437557",
"0.4436382",
"0.4430658",
"0.4429719",
"0.4428169",
"0.44260293",
"0.4420813",
"0.44155774",
"0.44130567",
"0.4406073",
"0.4401904",
"0.44010627",
"0.43994573",
"0.43948644",
"0.43847254",
"0.43847254",
"0.43830302",
"0.43830302",
"0.43830302",
"0.4381413"
] |
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 // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function u(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)}",
"function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray$1(obj);\n}",
"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)}",
"function is(obj) {\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\"c\" /* default */];\n}",
"function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function _isPlainObject(obj) {\n return (obj && obj.constructor.prototype === Object.prototype);\n}",
"__is_object(value) {\n return value && typeof value === 'object' && value.constructor === Object;\n }",
"function isObject(obj) { // 71\n\t\treturn toString.call(obj) === '[object Object]'; // 72\n\t} // 73",
"isPlainObject(obj) {\n return _toString.call(obj) === '[object Object]'\n }",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"isObject(obj) {\n return obj !== null && typeof obj === 'object'\n }",
"function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function isObjectLike(value) {\n return _typeof$1(value) == 'object' && value !== null;\n }",
"function isObjectLike$a(value) {\n return typeof value == 'object' && value !== null;\n}",
"function isObject(o) { return typeof o === 'object'; }",
"function isObject(o) { return typeof o === 'object'; }",
"function isObject(o) { return typeof o === 'object'; }",
"static hasObjectify(object) {\n return isObjectAssigned(object) && isFunction(object.objectify);\n }",
"function isObjectLike(value) {\n return typeof value === \"object\" && !!value;\n}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObjectObject(o){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 isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}",
"function isObject(obj) {\n return obj === Object(obj);\n}",
"function isObject(entry) {\n return entry.constructor === Object;\n}",
"function isObject(obj) {\n return obj === Object(obj);\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}",
"__key_in_object(object, key) {\n if (Object.prototype.hasOwnProperty.call(object, key)) {\n return true\n } else {\n return false\n }\n }",
"function utilIsIterable(obj) {\n\t\treturn obj != null && typeof obj[Symbol.iterator] === 'function'; // lazy equality for null\n\t}",
"function isObjectLike(value) {\n return value != null && (typeof value === \"function\" || typeof value === \"object\");\n}",
"function isObjectLike(obj) {\n return typeof obj === \"object\" && obj !== null;\n}",
"function isObject (o) { return o && typeof o === 'object' }",
"function isObject (o) { return o && typeof o === 'object' }",
"function isObject$8(val) {\n return kindOf$3(val) === 'object' || typeof val === 'function';\n}",
"function isObject(obj){\n return Object.prototype.toString.call(obj) == '[object Object]';\n }",
"function isObject$1(e){return\"[object Object]\"===Object.prototype.toString.call(e)}",
"function isObject(value) { return typeof value === \"object\" && value !== null; }",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}",
"function isObj$1(something) {\n return typeDetect(something) === 'Object';\n}",
"function isObject(a) {\n return (!!a) && (a.constructor === Object);\n}",
"function isObject(o){ return typeof o === 'object' && o !== null; }",
"function isObject$2556(x$2572) {\n return function isObject$2556(x$2573) {\n return function (a0$2574) {\n if (Object.prototype.toString.call(a0$2574) === '[object Object]') {\n return true;\n }\n return false;\n }.call(this, x$2573);\n }.curry().apply(null, arguments);\n }",
"function isObject(obj) {\n\n return obj && typeof obj === \"object\";\n}",
"isObjectEqual(a, b) {\n return a && b && a.foo === b.foo;\n }",
"function objectHasEnumerableKeys(value) {\n for (const _ in value) return true;\n return false;\n}",
"function isObject(x) {\n return x != null && typeof x === 'object';\n}",
"function isObject(o) {\n return o === Object(o);\n}",
"function isObject( x ) {\n return typeof x === \"object\" && x !== null;\n }",
"function isFrozen(obj) {\n if (!obj) { return true; }\n // TODO(erights): Object(<primitive>) wrappers should also be\n // considered frozen.\n if (obj.FROZEN___ === obj) { return true; }\n var t = typeof obj;\n return t !== 'object' && t !== 'function';\n }",
"function isIterableObject(obj) {\n if (obj === undefined || obj === null) {\n return false;\n }\n var t = typeof(obj);\n var types = {'string': 0, 'function': 0, 'number': 0, 'undefined': 0, 'boolean': 0};\n return types[t] === undefined;\n}",
"function isObject(x) {\n return typeof x === \"object\" && x !== null;\n}",
"function isObject(value) {\n return typeof value === 'object' && !!value;\n}",
"function isObject$1(value) {\n return _typeof_1(value) === \"object\" && value !== null;\n}",
"function isObject$1(value) {\n return _typeof_1(value) === \"object\" && value !== null;\n}",
"function isObject$1(value) {\n return typeof value === 'object' && value !== null || typeof value === 'function';\n }",
"function isObject(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}",
"function isObject(e){return Object.prototype.toString.call(e)===\"[object Object]\"}",
"function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}",
"function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}",
"function isObject(obj) {\n return Object.prototype.toString.call(obj) === '[object Object]';\n}",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function isObject$1(obj) {\n return obj !== null && _typeof(obj) === 'object' && 'constructor' in obj && obj.constructor === Object;\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }",
"function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }",
"function isObject(value) {\n return value && typeof value === 'object';\n}",
"function isObject$2(value) {\n return (\n typeof value === \"object\" &&\n value !== null &&\n // none of these are collection objects, so we can return false\n !(value instanceof Boolean) &&\n !(value instanceof Date) &&\n !(value instanceof Error) &&\n !(value instanceof Number) &&\n !(value instanceof RegExp) &&\n !(value instanceof String)\n );\n}",
"function isObject$2(value) {\n return (\n typeof value === \"object\" &&\n value !== null &&\n // none of these are collection objects, so we can return false\n !(value instanceof Boolean) &&\n !(value instanceof Date) &&\n !(value instanceof Error) &&\n !(value instanceof Number) &&\n !(value instanceof RegExp) &&\n !(value instanceof String)\n );\n}",
"function checkIfObject(obj) {\n if (obj === null || typeof obj === \"function\") return false;\n return typeof obj === \"object\";\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.62971216",
"0.62946296",
"0.62914604",
"0.6286696",
"0.6286696",
"0.6286696",
"0.6286696",
"0.6286696",
"0.6286696",
"0.6286696",
"0.6271967",
"0.62523067",
"0.6246597",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62422884",
"0.62417096",
"0.6239656",
"0.62381226",
"0.62349266",
"0.6232277",
"0.6232277",
"0.62299365",
"0.6220868",
"0.6199664",
"0.6195314",
"0.6191129",
"0.6191129",
"0.6191129",
"0.6191129",
"0.6191129",
"0.61857766",
"0.6155991",
"0.61543196",
"0.61471957",
"0.6142782",
"0.61374944",
"0.6127905",
"0.6127086",
"0.6112407",
"0.6108846",
"0.6099816",
"0.60876906",
"0.6084298",
"0.60841",
"0.60839814",
"0.60839814",
"0.6079516",
"0.60777074",
"0.6067156",
"0.6061706",
"0.6061706",
"0.60576034",
"0.6055879",
"0.6055879",
"0.6055879",
"0.6055879",
"0.6055879",
"0.6055879",
"0.6055879",
"0.60527575",
"0.60507524",
"0.60507524",
"0.60507524",
"0.6043533",
"0.6042689",
"0.6042689",
"0.60397136",
"0.60351396",
"0.60351396",
"0.6034387"
] |
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),\n type = type.match(/^\\[.+ (.+)\\]$/),\n type = type[1],\n type = type.toLowerCase()\n\n if (types.indexOf(type) !== -1) {\n return type\n }\n\n return typeof arg\n }",
"function AsYouType_typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { AsYouType_typeof = function _typeof(obj) { return typeof obj; }; } else { AsYouType_typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return AsYouType_typeof(obj); }",
"function type(input) {\n \treturn typeof input\n}",
"function _typeof$1(obj) {\n\t \"@babel/helpers - typeof\";\n\n\t return _typeof$1 = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n\t return typeof obj;\n\t } : function (obj) {\n\t return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n\t }, _typeof$1(obj);\n\t}",
"function _typeOf ( value )\n\t{\n\t\tvar type;\n\n\t\ttype = typeof value;\n\t\tif ( type === \"number\" )\n\t\t{\n\t\t\tif ( isNaN( value ) )\n\t\t\t{\n\t\t\t\ttype = \"NaN\";\n\t\t\t}\n\t\t}\n\t\telse if ( type === \"object\" )\n\t\t{\n\t\t\tif ( value )\n\t\t\t{\n\t\t\t\tif ( value instanceof Array )\n\t\t\t\t{\n\t\t\t\t\ttype = \"array\";\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttype = \"null\";\n\t\t\t}\n\t\t}\n\n\t\treturn type;\n\t}",
"function _typeOf ( value )\n\t{\n\t\tvar type;\n\n\t\ttype = typeof value;\n\t\tif ( type === \"number\" )\n\t\t{\n\t\t\tif ( isNaN( value ) )\n\t\t\t{\n\t\t\t\ttype = \"NaN\";\n\t\t\t}\n\t\t}\n\t\telse if ( type === \"object\" )\n\t\t{\n\t\t\tif ( value )\n\t\t\t{\n\t\t\t\tif ( value instanceof Array )\n\t\t\t\t{\n\t\t\t\t\ttype = \"array\";\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttype = \"null\";\n\t\t\t}\n\t\t}\n\n\t\treturn type;\n\t}",
"function typeStr (obj) {\n\t return isArray(obj) ? 'array' : typeof obj;\n\t }",
"function typeStr (obj) {\n\t return isArray(obj) ? 'array' : typeof obj;\n\t }",
"function getType(data) {\n return typeof data;\n}",
"function $type(obj) {\n if (obj == undefined) return false;\n\n if (obj.$family) return (obj.$family.name == 'number' && !isFinite(obj)) ? false : obj.$family.name;\n if (obj.nodeName){\n switch (obj.nodeType) {\n case 1: return 'element';\n case 9: return 'window';\n case 3: return (/\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\n }\n } else if (obj.window) {\n return 'element';\n } else if (typeof obj.length == 'number') {\n if (obj.callee) {\n return 'arguments';\n } else if (obj.item) {\n return 'collection';\n }\n }\n return typeof obj;\n}",
"function _typeof(t){return(_typeof=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\"function\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\"symbol\":typeof t})(t)}",
"function _typeof(t){return(_typeof=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\"function\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\"symbol\":typeof t})(t)}",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function $type(obj) {\r\n\t\tif (obj.nodeType) {\r\n\t\t\tswitch(obj.nodeType) {\r\n\t\t\t\tcase 1: return \"element\"; break;\r\n\t\t\t\tcase 3: return \"textnode\"; break;\r\n\t\t\t\tcase 9: return \"document\"; break;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (obj.item && obj.length) return \"collection\";\r\n\t\tif (obj.nodeName) return obj.nodeName;\r\n\t\tif (obj.sort) return \"array\";\r\n\t\treturn typeof(obj);\r\n\t}",
"function getType(arg) {\n return typeof arg;\n}",
"function whatDatatype(arg){\n return typeof(arg);\n}",
"function typeOf(b){var a=typeof b;if(a===\"object\"){if(b){if(typeof b.length===\"number\"&&!(b.propertyIsEnumerable(\"length\"))&&typeof b.splice===\"function\"){a=\"array\"}}else{a=\"null\"}}return a}",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }",
"function typeStr (obj) {\r\n return isArray(obj) ? 'array' : typeof obj;\r\n }",
"function typeOf(value) {\n\tvar s = typeof value;\n\tif (s === 'object') {\n\t\tif (value) {\n\t\t\tif (typeof value.length === 'number' &&\n\t\t\t\t\t!(value.propertyIsEnumerable('length')) &&\n\t\t\t\t\ttypeof value.splice === 'function') {\n\t\t\t\ts = 'array';\n\t\t\t}\n\t\t} else {\n\t\t\ts = 'null';\n\t\t}\n\t}\n\treturn s;\n}",
"function whatsTheTypeOf(input) {\n return typeof input ; //returns the type information as a string\n}",
"function type(value){\n return (\n Array.isArray(value) ? \"array\" :\n value instanceof Date ? \"date\" :\n typeof value\n );\n}",
"function Type(){\n\t\t\tthis.array='Array';\n\t\t\tthis.object='object';\n\t\t\tthis.string='string';\n\t\t\tthis.fn='function';\n\t\t\tthis.number='number';\n\t\t}",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }",
"function x(e) {\n var t = typeof e;\n return Array.isArray(e) ? \"array\" : e instanceof RegExp ? \"object\" : b(t, e) ? \"symbol\" : t;\n }",
"function $type(obj){\n if (obj == undefined) \n return false;\n if (obj.htmlElement) \n return 'element';\n var type = typeof obj;\n if (type == 'object' && obj.nodeName) {\n switch (obj.nodeType) {\n case 1:\n return 'element';\n case 3:\n return (/\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\n }\n }\n if (type == 'object' || type == 'function') {\n switch (obj.constructor) {\n case Array:\n return 'array';\n case RegExp:\n return 'regexp';\n }\n if (typeof obj.length == 'number') {\n if (obj.item) \n return 'collection';\n if (obj.callee) \n return 'arguments';\n }\n }\n return type;\n}",
"function typeOf(value) {\n var s = typeof value;\n if (s == 'object') {\n if (!value) {\n return 'null';\n } else if (value instanceof Array) {\n return 'array';\n }\n }\n return s;\n}",
"function x(e) {\n var t = typeof e;\n return Array.isArray(e) ? \"array\" : e instanceof RegExp ? \"object\" : b(t, e) ? \"symbol\" : t;\n }",
"function getTypeOf (input) {\n\n\tif (input === null) {\n\t\treturn 'null';\n\t}\n\n\telse if (typeof input === 'undefined') {\n\t\treturn 'undefined';\n\t}\n\n\telse if (typeof input === 'object') {\n\t\treturn (Array.isArray(input) ? 'array' : 'object');\n\t}\n\n\treturn typeof input;\n\n}",
"function _typeof( o ) {\r\n return typeof o ;\r\n }",
"function getType(o)\n{\n\tif (o === null)\n\t\treturn \"null\";\n\t\n\tif (Array.isArray(o))\n\t\treturn \"array\";\n\t\n\treturn typeof o;\n}",
"function _typeof2(e){return _typeof2=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&\"function\"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?\"symbol\":typeof e},_typeof2(e)}",
"function $type(obj){\r\n if (!$defined(obj)) \r\n return false;\r\n if (obj.htmlElement) \r\n return 'element';\r\n var type = typeof obj;\r\n if (type == 'object' && obj.nodeName) {\r\n switch (obj.nodeType) {\r\n case 1:\r\n return 'element';\r\n case 3:\r\n return (/\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\r\n }\r\n }\r\n if (type == 'object' || type == 'function') {\r\n switch (obj.constructor) {\r\n case Array:\r\n return 'array';\r\n case RegExp:\r\n return 'regexp';\r\n case Class:\r\n return 'class';\r\n }\r\n if (typeof obj.length == 'number') {\r\n if (obj.item) \r\n return 'collection';\r\n if (obj.callee) \r\n return 'arguments';\r\n }\r\n }\r\n return type;\r\n }"
] |
[
"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.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6377382",
"0.63735145",
"0.63700485",
"0.635094",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6309367",
"0.6305192",
"0.6298823",
"0.62889093",
"0.6284822",
"0.6262306",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62530714",
"0.62485164",
"0.6234021",
"0.6231154",
"0.62254965",
"0.62220204",
"0.62078804",
"0.61975265",
"0.61697876",
"0.6169293"
] |
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 typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t if (isSymbol(propType, propValue)) {\n\t\t return 'symbol';\n\t\t }\n\t\t return propType;\n\t\t }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"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 typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t return propType;\n\t\t}",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"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 typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t if (isSymbol(propType, propValue)) {\n\t\t return 'symbol';\n\t\t }\n\t\t return propType;\n\t\t}",
"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 typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t if (isSymbol(propType, propValue)) {\n\t\t return 'symbol';\n\t\t }\n\t\t return propType;\n\t\t}",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return \"array\";\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return \"object\";\n }\n if (isSymbol(propType, propValue)) {\n return \"symbol\";\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n\t var propType = typeof propValue === 'undefined' ? 'undefined' : _typeof(propValue);\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }",
"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }"
] |
[
"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.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.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.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68397415",
"0.68397415",
"0.6837778",
"0.6819414",
"0.68164027",
"0.68164027",
"0.68164027",
"0.68164027",
"0.68164027",
"0.6801955",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477",
"0.67824477"
] |
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 case \"date\":\n case \"regexp\":\n return \"a \" + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }",
"function getPostfixForTypeWarning(value) {\n\t\t var type = getPreciseType(value);\n\t\t switch (type) {\n\t\t case 'array':\n\t\t case 'object':\n\t\t return 'an ' + type;\n\t\t case 'boolean':\n\t\t case 'date':\n\t\t case 'regexp':\n\t\t return 'a ' + type;\n\t\t default:\n\t\t return type;\n\t\t }\n\t\t }",
"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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\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 case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }",
"function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }"
] |
[
"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.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735"
] |
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 }",
"getClassName() {\n return this.constructor\n .className;\n }",
"function getClassName(obj)\n{\n if (obj === null) {\n return 'null';\n }\n if (obj === undefined) {\n return 'undefined';\n }\n var c = obj.constructor.toString();\n return c.substring(9, c.indexOf('(', 10));\n}",
"function getClass(o) {\n\n\tif (o === null || o === undefined) return \"Object\";\n\treturn OP_toString.call(o).slice(\"[object \".length, -1);\n}",
"getClassName() {\n return this.constructor.name\n }",
"function getClass(obj) {\r\n return Object.prototype.toString.call(obj);\r\n}",
"function getClass(obj) {\n return {}.toString.call(obj).slice(8, -1);\n}",
"static getClassName() {\n return \"Object\";\n }",
"function classOf(o){\n if(o === null) return \"Null\";\n if(o === undefined) return \"Undefined\";\n return Object.prototype.toString.call(o).slice(8, -1);\n}",
"function get$className()/* : String*/\n {\n return flash.utils.getQualifiedClassName(this).replace(/::/, \".\");\n }",
"function get_class_name(current_obj) {\n\t\t\tvar id = current_obj.attr('id');\n\t\t\tvar name = id.substring(6,id.length);\n\t\t\treturn name;\n\t\t}",
"function getObjectName(object) {\n if (object === undefined) {\n return '';\n }\n if (object === null) {\n return 'Object';\n }\n if (typeof object === 'object' && !object.constructor) {\n return 'Object';\n }\n var funcNameRegex = /function ([^(]*)/;\n var results = (funcNameRegex).exec((object).constructor.toString());\n if (results && results.length > 1) {\n return results[1];\n }\n else {\n return '';\n }\n }",
"function _getClazz() {\r\n\t\tvar n = clz = this.vj$._class, idx = n.lastIndexOf('.');\r\n\t\tif (idx != -1) clz = n.substring(idx+1); \r\n\t\tif (this.vj$[clz]) return this.vj$[clz].clazz;\r\n\r\n\t\t//Error case...\r\n\t\treturn null;\r\n\t}",
"getClassName() {\n return this.statesTable.getString(this.currentState, 'ClassName');\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }",
"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\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.6599787",
"0.6599787",
"0.6599787",
"0.6599787",
"0.6582472",
"0.6582472"
] |
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 element.classList.add(css);\n } else {\n css.forEach(function(style) {\n element.classList.add(style);\n })\n }\n }\n \n return element;\n}",
"function createTag(tagName){\n return document.createElement(tagName);\n }",
"function createElements() {\n var nodeNames = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n nodeNames[_i] = arguments[_i];\n }\n return nodeNames.map(function (name) { return document.createElement(name); });\n }",
"function elementFactory(data) {\n if (!data.hasOwnProperty(\"type\"))\n return null;\n let el = document.createElement(data.type);\n if (data.hasOwnProperty(\"class\"))\n $(el).addClass(data.class);\n if (data.hasOwnProperty(\"html\"))\n $(el).html(data.html);\n if (data.hasOwnProperty(\"css\"))\n $(el).css(data.css);\n if (data.hasOwnProperty(\"attr\")) {\n for (let key in data.attr) {\n if (!data.attr.hasOwnProperty(key))\n continue;\n $(el).attr(key, data.attr[key]);\n }\n }\n if (data.hasOwnProperty(\"on\")) {\n for (let key in data.on) {\n if (!data.on.hasOwnProperty(key))\n continue;\n $(el).on(key, { target: el }, data.on[key]);\n }\n }\n return el;\n}",
"tagMaker() {\n const isHtmlNode = () => {\n return true;\n };\n const isAttribMap = () => {\n return true;\n };\n var notEmpty = (x) => {\n if ((typeof x === 'undefined') ||\n (x === null) ||\n x.length === 0) {\n return false;\n }\n return true;\n };\n var maker = (name, defaultAttribs = {}) => {\n var tagFun= (attribs, children) => {\n let node = '<';\n\n // case 1. one argument, first may be attribs or content, but attribs if object.\n if (typeof children === 'undefined') {\n if (typeof attribs === 'object' &&\n ! (attribs instanceof Array) &&\n isAttribMap(attribs)) {\n if (Object.keys(attribs).length === 0) {\n node += name;\n } else {\n const tagAttribs = this.attribsToString(this.mergeAttribs(attribs, defaultAttribs));\n node += [name, tagAttribs].filter(notEmpty).join(' ');\n }\n node += '>';\n // case 2. arity 1, is undefined\n } else if (typeof attribs === 'undefined') {\n const tagAttribs = this.attribsToString(defaultAttribs);\n node += [name, tagAttribs].filter(notEmpty).join(' ');\n node += '>';\n // case 3: arity 1, is content\n } else if (isHtmlNode(attribs)) {\n const tagAttribs = this.attribsToString(defaultAttribs);\n node += [name, tagAttribs].filter(notEmpty).join(' ');\n node += '>' + this.renderChildren(attribs);\n }\n // case 4. arity 2 - atribs + content\n } else if (isAttribMap(attribs) && isHtmlNode(children)) {\n if (Object.keys(attribs).length === 0) {\n node += name;\n } else {\n const tagAttribs = this.attribsToString(this.mergeAttribs(attribs, defaultAttribs));\n node += [name, tagAttribs].filter(notEmpty).join(' ');\n }\n node += '>' + this.renderChildren(children);\n }\n node += '</' + name + '>';\n return node;\n };\n return tagFun;\n };\n return maker;\n }",
"createElement(tag) {\n\t\treturn HTMLDocument.createElement(tag)\n\t}",
"function create(element) { return document.createElement(element) }",
"function _mkdom(templ, html) {\n\n var match = templ && templ.match(/^\\s*<([-\\w]+)/),\n tagName = match && match[1].toLowerCase(),\n el = mkEl(GENERIC)\n\n // replace all the yield tags with the tag inner html\n templ = replaceYield(templ, html || '')\n\n /* istanbul ignore next */\n //if ((checkIE || !startsWith(tagName, 'opt')) && SPECIAL_TAGS_REGEX.test(tagName))\n if (tblTags.test(tagName))\n el = specialTags(el, templ, tagName)\n else\n el.innerHTML = templ\n\n el.stub = true\n\n return el\n }",
"function newFactory(tag, h) {\n return function factory() {\n var args = [tag].concat(slice.call(arguments))\n return h.apply(void 0, args)\n }\n}",
"function createEl(text){\n return document.createElement(text);\n}",
"function createEl(tag, value) {\r\n\t\tvar el = document.createElement(tag);\r\n\t\tel.innerHTML = value;\r\n\t\treturn el;\r\n\t}",
"function createElement(tagName) {\n return document.createElement(tagName); //eslint-disable-line angular/document-service\n }",
"function createHTMLElement(tagName) {\n if(document.createElementNS)\n var elem = document.createElementNS(\"http://www.w3.org/1999/xhtml\", tagName);\n else\n var elem = document.createElement(tagName);\n\n return elem;\n}",
"create(...t) {\n let s = new r;\n for (const r of t) if (\"string\" == typeof r) s.push(document.createElement(r)); else if (r instanceof Object) {\n const t = document.createElement(r.tagName || \"div\");\n r.content && (Array.isArray(r.content) ? e$1(t, ...r.content) : e$1(t, r.content)), \n s.push(t);\n }\n return s;\n }",
"function createElm(tag, attobj) {\n const elm = document.createElement(tag);\n for (const key of Object.keys(attobj)) {\n elm[key] = attobj[key];\n }\n return elm;\n}",
"function ElementFactory() {\n this._uid = 12;\n }",
"function create(element){\r\n\treturn document.createElement(element);\r\n}",
"function createElem(opt_className, opt_html, opt_tagName) {\n var tag = opt_tagName||\"div\";\n var elem = document.createElement(tag);\n if (opt_html) elem.innerHTML = opt_html;\n if (opt_className) elem.className = opt_className;\n return elem;\n}",
"function makeElement(tagType, className, innerText) {\n let newElement = document.createElement(tagType);\n newElement.className = className;\n if (innerText) {\n newElement.textContent = innerText;\n }\n return newElement;\n}",
"function dom(s) { \n return document.createElement(s) \n}",
"function ElementFactory() {\n this._uid = 12;\n}",
"function ElementFactory() {\n this._uid = 12;\n}",
"function create(element) {\n\t return document.createElement(element);\n\t}",
"function ElementFactory() {\n this._uid = 12;\n}",
"function ElementFactory() {\n this._uid = 12;\n}",
"function create(element) {\n return document.createElement(element);\n}",
"function $Tag(tagName,args){\n // cl\n var $i = null\n var elt = null\n var elt = $DOMNode(document.createElement(tagName))\n elt.parent = this\n if(args!=undefined && args.length>0){\n $start = 0\n $first = args[0]\n // if first argument is not a keyword, it's the tag content\n if(!isinstance($first,$Kw)){\n $start = 1\n if(isinstance($first,[str,int,float])){\n txt = document.createTextNode($first.toString())\n elt.appendChild(txt)\n } else if(isinstance($first,$TagSum)){\n for($i=0;$i<$first.children.length;$i++){\n elt.appendChild($first.children[$i])\n }\n } else {\n try{elt.appendChild($first)}\n catch(err){throw ValueError('wrong element '+$first)}\n }\n }\n // attributes\n for($i=$start;$i<args.length;$i++){\n // keyword arguments\n $arg = args[$i]\n if(isinstance($arg,$Kw)){\n if($arg.name.toLowerCase().substr(0,2)===\"on\"){ // events\n eval('elt.'+$arg.name.toLowerCase()+'=function(){'+$arg.value+'}')\n }else if($arg.name.toLowerCase()==\"style\"){\n elt.set_style($arg.value)\n } else {\n if($arg.value!==false){\n // option.selected=false sets it to true :-)\n try{\n elt.setAttribute($arg.name.toLowerCase(),$arg.value)\n }catch(err){\n throw ValueError(\"can't set attribute \"+$arg.name)\n }\n }\n }\n }\n }\n }\n return elt\n}",
"function _mkdom(templ, html) {\n\n var match = templ && templ.match(/^\\s*<([-\\w]+)/),\n tagName = match && match[1].toLowerCase(),\n rootTag = rootEls[tagName] || GENERIC,\n el = mkEl(rootTag)\n\n el.stub = true\n\n // replace all the yield tags with the tag inner html\n if (html) templ = replaceYield(templ, html)\n\n /* istanbul ignore next */\n if (checkIE && tagName && (match = tagName.match(SPECIAL_TAGS_REGEX)))\n ie9elem(el, templ, tagName, !!match[1])\n else\n el.innerHTML = templ\n\n return el\n }",
"function createElement(tag, content, attributes) {\n var el = document.createElement(tag);\n if(content) {\n el.innerHTML = content;\n }\n\n _.each(attributes, function(val, attr) {\n el.setAttribute(attr, val);\n });\n\n return el;\n }",
"function _mkdom(html) {\n\n var match = html && html.match(/^\\s*<([-\\w]+)/),\n tagName = match && match[1].toLowerCase(),\n rootTag = rootEls[tagName] || GENERIC,\n el = mkEl(rootTag)\n\n el.stub = true\n\n if (checkIE && tagName && (match = tagName.match(SPECIAL_TAGS_REGEX)))\n ie9elem(el, html, tagName, !!match[1])\n else\n el.innerHTML = html\n\n return el\n }",
"function make(tag, options) {\n var keys, i,\n element = document.createElement(tag);\n if (options === undefined) {\n return element;\n }\n if ('parent' in options) {\n options.parent.appendChild(element);\n delete options.parent;\n }\n keys = Object.keys(options);\n for (i = keys.length - 1; i >= 0; --i) {\n element[keys[i]] = options[keys[i]];\n }\n return element;\n }",
"static createElement(html2, _options) {\n const el = d.createElement(\"template\");\n el.innerHTML = html2;\n return el;\n }",
"function createElement (str) {\n\t\tvar matches = $.render.tag_id_class_regexp.exec(str);\n\t\tvar tag_name, el, id, classnames;\n\t\tvar dfd = $.Deferred();\n\t\t\n\t\tif (matches === null) {\n el = $(document.createElement(\"div\"));\n el.html(str);\n\t\t\treturn el.html();\n\t\t} else {\n\t\t\ttag_name = matches[1] || \"div\"; // so we can use descriptors that are just ids and/or class names.\n\t\t\tif (tag_name === \"svg\") {\n\t\t\t\t// make a div to hold the loaded svg.\n\t\t\t\tel = $(document.createElement(\"div\"));\n\t\t\t\tel.addClass(\"svg\");\n\t\t\t} else if ($.render.valid_html_tags.indexOf(tag_name.toUpperCase()) > -1) {\n\t\t\t\tel = $(document.createElement(tag_name));\n\t\t\t} else {\n\t\t\t\treturn str;\n\t\t\t}\n\t\t\t\n\t\t\tif (id = matches[2]) {\n\t\t\t\tel.attr(\"id\", id.replace(\"#\", \"\"));\n\t\t\t}\n\t\t\tif (classnames = matches[3]) {\n\t\t\t\tel.addClass(classnames.split(\".\").join(\" \"));\n\t\t\t}\n\t\t\tvar attributes = matches[4];\n\t\t\tif (attributes) {\n\t\t\t\tvar attr_regexp = /(\\[([^=]+)=([^\\]]+)\\])/g;\n\t\t\t\tvar attr_spec;\n\t\t\t\tvar attrs_obj = {};\n\t\t\t\twhile (attr_spec = attr_regexp.exec(attributes)) {\n\t\t\t\t\tvar attr_key = attr_spec[2];\n\t\t\t\t\tvar attr_value = attr_spec[3];\n\t\t\t\t\tel.attr(attr_key, attr_value);\n\t\t\t\t\tattrs_obj[attr_key] = attr_value;\n\t\t\t\t\t\n\t\t\t\t\t// special cases: content that must be loaded after element is created.\n\t\t\t\t\tswitch (tag_name) {\n\t\t\t\t\t\tcase \"svg\":\n\t\t\t\t\t\t\tif (attr_key === \"src\") {\n\t\t\t\t\t\t\t\tvar svg_dfd = $.Deferred();\n\t\t\t\t\t\t\t\tvar svg_promise = svg_dfd.promise();\n\t\t\t\t\t\t\t\telement_load_promises.push(svg_promise);\n\t\t\t\t\t\t\t\t// we pull the contents of the src file\n\t\t\t\t\t\t\t\t// and use it to replace the <svg> element.\n\t\t\t\t\t\t\t\t$.ajax(attr_value, { crossDomain: true })\n\t\t\t\t\t\t\t\t.then(function (svg_file) {\n\t\t\t\t\t\t\t\t\tvar svg_file_jQ = $(svg_file.documentElement);\n\t\t\t\t\t\t\t\t\t// put svg file root node into element.\n\t\t\t\t\t\t\t\t\tvar svg_root_element = document.importNode(svg_file.documentElement,true);\n\t\t\t\t\t\t\t\t\tel.append(svg_root_element);\n\t\t\t\t\t\t\t\t\tel.data({ promise: svg_promise });\n\t\t\t\t\t\t\t\t\t// give added elements a chance to show up in the DOM.\n\t\t\t\t\t\t\t\t\tsvg_dfd.resolve();\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t\t.fail(function () {\n\t\t\t\t\t\t\t\t\t// convert svg tag to an object tag w src as data attr...?\n\t\t\t\t\t\t\t\t\t// Does this make a good fallback? I guess it depends on the reason for the ajax failure.\n\t\t\t\t\t\t\t\t\tdfd.fail();\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase \"img\":\n\t\t\t\t\t\t\tif (attr_key === \"src\") {\n\t\t\t\t\t\t\t\tvar img_dfd = $.Deferred();\n\t\t\t\t\t\t\t\tvar img_promise = img_dfd.promise();\n\t\t\t\t\t\t\t\telement_load_promises.push(img_promise);\n\t\t\t\t\t\t\t\tel.attr(attr_key, attr_value);\n\t\t\t\t\t\t\t\t// resolve once the image has been loaded.\n\t\t\t\t\t\t\t\tel.get(0).onload = function (evt) {\n\t\t\t\t\t\t\t\t\timg_dfd.resolve();\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tdfd.resolve();\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tdfd.resolve(); // no atrributes.\n\t\t\t}\n\t\t\tel.data({ promise: $.when.apply($, element_load_promises) });\n\t\t\treturn el;\n\t\t}\n\t}",
"static createElement(tagName, props) {\n return Object.assign(document.createElement(tagName), props || {});\n }",
"function buildElement(elementType, classes, id, htmlContent) {\n let element = document.createElement(elementType);\n element.className = classes;\n element.id = id;\n element.innerHTML = htmlContent;\n return element;\n}",
"function nodeCreate(tag)\n{\n\treturn document.createElement(tag);\t\n}",
"function makeElement(tagName, arrayPropertys) {\n var el = document.createElement(tagName);\n if (arrayPropertys == null || arrayPropertys == \"\")\n return el;\n\n //setando atributos\n for (x = 0; x < arrayPropertys.split(\"&\").length; ++x)\n {\n var attr = arrayPropertys.split(\"&\")[x].split(\"=\")[0];\n //O IE tem alguns atributos HTML diferentes do padrao W3C.\n attr = (attr.indexOf(\"class\") > -1 && isIE() ? \"className\" : attr);\n attr = (attr.indexOf(\"style\") > -1 && isIE() ? \"cssText\" : attr);\n //se o atributo eh um evento...\n if (attr.indexOf(\"on\") > -1 && isIE())\n el.attachEvent(attr, new Function(arrayPropertys.split(\"&\")[x].split(\"=\")[1]));\n else if (attr == \"innerHTML\")\n el.innerHTML = arrayPropertys.split(\"&\")[x].split(\"=\")[1];\n //else if (attr == \"checked\")\n // el.check = true;\n else\n el.setAttribute(attr, arrayPropertys.split(\"&\")[x].split(\"=\")[1]);\n\n }\n\n //setando o name para o id\n if (el.name == \"\")\n el.name = el.id;\n\n return el;\n}",
"function createElement(tagName, objAttrs = null, content = null) {\n let element = document.createElement(tagName);\n for (let attr in objAttrs) {\n element.setAttribute(attr, objAttrs[attr]);\n }\n\n if (content instanceof Array) {\n for (let el of content) {\n element.appendChild(el);\n }\n } else if (content instanceof HTMLElement) {\n element.appendChild(content);\n } else {\n element.innerText = content;\n }\n\n return element;\n }",
"function generateNewElement(tagName, styleClass, innerHtml, attributeStyle) {\n const newElement = document.createElement(tagName);\n if(styleClass) newElement.className = styleClass;\n if(innerHtml) newElement.innerHTML = innerHtml;\n if(attributeStyle) newElement.setAttribute('style', attributeStyle);\n\n return newElement\n}",
"function _mkdom(html) {\n var match = html && html.match(/^\\s*<([-\\w]+)/), tagName = match && match[1].toLowerCase(), rootTag = rootEls[tagName] || GENERIC, el = mkEl(rootTag);\n el.stub = true;\n if (checkIE && tagName && (match = tagName.match(SPECIAL_TAGS_REGEX)))\n ie9elem(el, html, tagName, !!match[1]);\n else\n el.innerHTML = html;\n return el\n }",
"make(_targetId, _tagName, _options) {\n if (!_targetId) {\n _targetId = 0;\n }\n if (!_tagName) {\n _tagName = 'DIV';\n }\n else {\n _tagName = _tagName.toUpperCase();\n }\n const _elem = document.createElement(_tagName);\n const _id = this._add(_elem);\n this._initCache(_id);\n if (_options) {\n let _attrs;\n if (this.isntNullOrUndefined(_options.attrs)) {\n _attrs = _options.attrs;\n }\n else if (this.isntNullOrUndefined(_options.attr)) {\n _attrs = _options.attr;\n }\n if (this.isObjectOrArray(_attrs)) {\n if (this.isObject(_attrs)) {\n _attrs = Object.entries(_attrs);\n }\n if (this.isArray(_attrs)) {\n _attrs.forEach(([_key, _value]) => {\n this.setAttr(_id, _key, _value, true);\n });\n }\n }\n const _classes = _options.classes;\n if (this.isArray(_classes)) {\n _classes.forEach(_className => {\n this.addClassName(_id, _className);\n });\n }\n if (_options.styles) {\n this.setStyles(_id, _options.styles);\n }\n if (_options.html) {\n this.setHTML(_id, _options.html);\n }\n }\n if (this._elements[_targetId] !== _elem.parentNode) {\n this._elements[_targetId].appendChild(_elem);\n }\n return _id;\n }",
"make(_targetId, _tagName, _options) {\n if (!_targetId) {\n _targetId = 0;\n }\n if (!_tagName) {\n _tagName = 'DIV';\n }\n else {\n _tagName = _tagName.toUpperCase();\n }\n const _elem = document.createElement(_tagName);\n const _id = this._add(_elem);\n this._initCache(_id);\n if (_options) {\n let _attrs;\n if (this.isntNullOrUndefined(_options.attrs)) {\n _attrs = _options.attrs;\n }\n else if (this.isntNullOrUndefined(_options.attr)) {\n _attrs = _options.attr;\n }\n if (this.isObjectOrArray(_attrs)) {\n if (this.isObject(_attrs)) {\n _attrs = Object.entries(_attrs);\n }\n if (this.isArray(_attrs)) {\n _attrs.forEach(([_key, _value]) => {\n this.setAttr(_id, _key, _value, true);\n });\n }\n }\n const _classes = _options.classes;\n if (this.isArray(_classes)) {\n _classes.forEach(_className => {\n this.addClassName(_id, _className);\n });\n }\n if (_options.styles) {\n this.setStyles(_id, _options.styles);\n }\n if (_options.html) {\n this.setHTML(_id, _options.html);\n }\n }\n if (this._elements[_targetId] !== _elem.parentNode) {\n this._elements[_targetId].appendChild(_elem);\n }\n return _id;\n }",
"createWith(tag, attributes)\n {\n const element = this.document().createElement(tag);\n\n for (var i = 0, l = (attributes || []).length; i < l; i++) {\n const key = attributes.item(i).name;\n const value = attributes.item(i).nodeValue;\n\n element.setAttribute(key, value);\n }\n\n return element;\n }",
"createElement(tag) {\n return this.document.createElement(tag);\n }",
"createMarkup(html) {\n return {\n __html: html\n };\n }",
"function newElem(name) { return document.createElement(name); }",
"function createElementFromString(str) {\nvar node, a = str.match(/<(\\w+)(\\s+)?([^>]+)?>/);\nif (a != null) {\nnode = document.createElement(a[1]);\nif (a[3] != null) {\nvar attrs = a[3].split(\" \");\nif (attrs.length > 0) {\nfor ( var i = 0; i < attrs.length; i++) {\nvar att = attrs[i].split(\"=\");\nif (att[0].length > 0 &&\natt[0] != \"/\" && att[1] && att[1].length != 2) {\nvar a_n = document.createAttribute(att[0]);\na_n.value = att[1].replace(/^['\"](.+)['\"]$/, \"$1\");\nnode.setAttributeNode(a_n);\n}\n}\n}\n}\n}\nreturn node;\n}",
"function createElement(tagName, className, innerText, dataAttributeName, dataAttributeValue) {\n var html_element = document.createElement(tagName);\n if(className) {\n html_element.className = className;\n }\n if(innerText) {\n html_element.innerText = html_element.textContent = innerText;\n }\n if(dataAttributeName && dataAttributeValue) {\n html_element.setAttribute(dataAttributeName, dataAttributeValue);\n }\n return html_element;\n }",
"function mk( elementName, attrObj, parent, appendChild) {\n\treturn mkHTML( elementName, attrObj, parent, appendChild);\n}",
"function createElement(tagName) {\n return;\n}",
"function El(tag) {\n this.el = document.createElement(tag);\n this;\n}",
"function createElement(tag, content, className) {\n let tagName = document.createElement(tag);\n let elementContent = document.createTextNode(content);\n tagName.appendChild(elementContent);\n tagName.className = className;\n return tagName;\n }",
"function makeElement(type) {\n\t\treturn document.createElement(type);\n\t}",
"function elem(tag, content){ \n\t\tvar ret = document.createElement(tag); \n\t\tret.innerHTML = content; \n\t\treturn ret;\n\t}",
"function newEl(name, attrs) {\n const el = d.createElement(name);\n for (let attr in attrs) if (el[attr] !== undefined) el[attr] = attrs[attr];\n return el;\n }",
"createAnElement(tag, id, store_here){\n store_here = store_here || this.elements;\n const element = document.createElement(tag);\n this.addElement(element, id, store_here);\n return element;\n }",
"function el(tagName, attributes, children) {\n\tif (typeof tagName !== 'string') {\n\t\tthrow new Error('tagName must be a string');\n\t}\n\n\tvar element = document.createElement(tagName);\n\n\tif (attributes && (typeof attributes === 'undefined' ? 'undefined' : _typeof(attributes)) === 'object') {\n\t\tObject.keys(attributes).forEach(function (i) {\n\t\t\t// Set event handlers\n\t\t\tif (/on[A-Z][a-z]/.test(i)) {\n\t\t\t\telement[i.toLowerCase()] = attributes[i];\n\t\t\t} else {\n\t\t\t\t// Set attributes\n\t\t\t\telement.setAttribute(i, attributes[i]);\n\t\t\t}\n\t\t});\n\t}\n\n\tif (typeof children === 'string') {\n\t\telement.innerHTML = children;\n\t} else if (children instanceof Array) {\n\t\tchildren.forEach(function (child) {\n\t\t\telement.appendChild(child);\n\t\t});\n\t}\n\n\treturn element;\n}",
"function elementCreator( type, id, className, value ){\n\t\t//Create element with it's class attribute, id and type\n\t\tvar button = addElement(type, className, id);\n\t\tif(value){\n\t\t\tbutton.innerHTML = value;\n\t\t}\n\t\treturn button;\n\t}",
"function xCreateElement(sTag)\r\n{\r\n if (document.createElement) return document.createElement(sTag);\r\n else return null;\r\n}",
"function elem(tag) {\n return $('<' + tag + '/>');\n}",
"create(...entities) {\n let newInstance = new MicroDOM;\n for (const entity of entities) if (\"string\" == typeof entity) newInstance.push(document.createElement(entity)); else if (entity instanceof Object) {\n const el = document.createElement(entity.tagName || \"div\");\n entity.content && (Array.isArray(entity.content) ? recursiveAppend(el, ...entity.content) : recursiveAppend(el, entity.content)), \n newInstance.push(el);\n }\n return newInstance;\n }",
"function element(name, content, attributes) {\n var e = $(document.createElement(name));\n\n if (content) { e.append(content); }\n for (var a in attributes) { e.attr(a, attributes[a]); }\n\n return e;\n}",
"function make(tag, obj) {\n // without a valid tag we can't continue\n if (typeof tag === \"undefined\" || !tag) {\n console.log(\"Util.make failed with \\ntag: \" + tag +\n \"\\ninnerHTML: \" + obj[innerHTML] +\n \"\\nclassName: \" + obj[className] +\n \"\\nid: \" + obj[id]);\n return;\n }\n var element = document.createElement(tag);\n for (var i in obj) {\n if (typeof obj[i] !== \"undefined\" && obj[i] !== null)\n if (i === \"innerHTML\" && obj[i].nodeName) {\n element.appendChild(obj[i]);\n } else if (i === \"style\") {\n \tfor (var j in obj[i]) \n \t\telement.style[j] = obj[i][j];\n } else {\n element[i] = obj[i];\n }\n }\n return element;\n}",
"function make(type) {\n\treturn document.createElement(type);\n}",
"function createElement(tag,children,props){\n\tvar element = document.createElement(tag);\n\tif(!(children instanceof Array)){children=[children];}\n\tfor(var i=0;i<children.length;i++){\n\t\tvar child=children[i];\n\t\tif(typeof child=='string'){child=document.createTextNode(child);}\n\t\tif(child){element.appendChild(child);}\n\t}\n\tif(typeof props=='object'){\n\t\tfor(var k in props){\n\t\t\tswitch(k){\n\t\t\tcase 'styles':\n\t\t\t\tvar styles=props.styles;\n\t\t\t\tfor(var s in styles){element.style[s]=styles[s];}\n\t\t\t\tbreak;\n\t\t\tcase 'events':\n\t\t\t\tvar events=props.events;\n\t\t\t\tfor(var e in events){ addHandler(element,e,events[e]); }\n\t\t\t\tbreak;\n\t\t\tcase 'class':\n\t\t\t\telement.className=props[k];break;\n\t\t\tdefault:\n\t\t\t\telement.setAttribute(k,props[k]);\n\t\t\t}\n\t\t}\n\t}\n\treturn element;\n}",
"function creator(data) {\n return Object.assign(document.createElement(data.tagName), data.props);\n}",
"function buildHTML(tag, html, attrs) {\n\n var element = document.createElement(tag);\n // if custom html passed in, append it\n if (html) element.innerHTML = html;\n\n // set each individual attribute passed in\n for (attr in attrs) {\n if (attrs[attr] === false) continue;\n element.setAttribute(attr, attrs[attr]);\n }\n\n return element;\n }",
"function newElement(name) {\n return document.createElement(name);\n}",
"function createWidgetElement(html) {\n let el = document.createElement(\"template\");\n el.innerHTML = html.trim();\n\n return el.content.firstChild;\n}",
"function generateTagHTML (tag){//generates HTML for a given tag\n return `<li class='tag'><div class='tag-box'>${tag}</div></li>`;\n}",
"function el(type, content, attributes) {\n const result = document.createElement(type);\n\n if (attributes !== undefined) {\n Object.assign(result, attributes);\n }\n\n if (Array.isArray(content)) {\n content.forEach(append);\n } else {\n append(content);\n }\n\n function append(node) {\n if (typeof node === 'string') {\n node = document.createTextNode(node);\n }\n result.appendChild(node);\n }\n return result;\n }",
"function constructorSitios() {\n this.crearElemento = function (texto, tipo) {\n let html;\n\n if (tipo === 'input') {\n html = new inputHTML(texto);\n } else if (tipo === 'img') {\n html = new ImagenHTML(texto);\n } else if (tipo === 'h1') {\n html = new HeadingHTML(texto);\n } else if (tipo === 'p') {\n html = new ParrafoHTML(texto);\n }\n\n html.tipo = tipo;\n\n html.mostrar = function(){\n const elemento = document.createElement(this.tipo);\n if(this.tipo === 'input'){\n elemento.setAttribute('placeholder', this.texto);\n }else if(this.tipo === 'img'){\n elemento.setAttribute('src', this.texto);\n }else{\n elemento.textContent = texto;\n }\n\n document.querySelector('#app').appendChild(elemento);\n }\n\n return html;\n }\n}",
"createNode(el) {\n\t\t\treturn document.createElement(el);\n\t\t}",
"function createElement(tagName, properties$, children$Arr) {\n\tvar elem = document.createElement(tagName);\n\tmanageProperties(elem, properties$);\n\tmanageChildren(elem, children$Arr);\n\treturn elem;\n}",
"function el(name) {\n return $(document.createElement(name));\n }",
"function createMarkup(data) {\n return { __html: data };\n}",
"function createNode(name) {\n return document.createElement(name)\n }",
"function construct_tag(tag_name){\n render_tag = '<li class=\"post__tag\"><a class=\"post__link post__tag_link\">' + tag_name + '</a> </li>'\n return render_tag\n}",
"fCreateTag( tagType, className, title, counter, appendedTo ) {\n\t\t\t\tlet divName = document.createElement( tagType );\n\t\t\t\t//divName.id = title + \"Id_\" + counter; //set id\n\t\t\t\tdivName.id = title + counter; //set id\n\t\t\t\tdivName.className = className; //title + \"Class\";\n\t\t\t\tdivName.href = \"#modalCarousel\";\n\t\t\t\t//let divNameId = $ (\"#\" + title + \"Id_\" + counter); //get id\n\t\t\t\t$( divName ).appendTo( appendedTo );\n\t\t\t}",
"function createPageElement(element){\n return document.createElement(element);\n}",
"function ElementFactory$1() {\n this._uid = 12;\n}",
"static _create(element) {\n return new NamedNodeMapImpl(element);\n }",
"buildElement() {\n const templateString = fs.readFileSync(this.__template, {encoding: 'utf-8'});\n const parser = new DOMParser();\n const doc = parser.parseFromString(templateString, 'text/html');\n return doc.querySelector('.pio-template-root').cloneNode(true);\n }",
"function html(tagName, attributes, ...children) {\n // create the element\n const r = document.createElement(tagName);\n // add the attributes\n for (const key in attributes) {\n // special case for booleans\n if (typeof attributes[key] === \"boolean\") {\n if (attributes[key]) {\n r.setAttribute(key, \"\");\n }\n }\n else {\n r.setAttribute(key, attributes[key]);\n }\n }\n // add the children\n children.forEach(child => {\n // special case for strings\n if (typeof child === \"string\") {\n r.appendChild(document.createTextNode(child));\n }\n else {\n r.appendChild(child);\n }\n });\n return r;\n}",
"function createElement(tagName, className, text) {\n\tconst elem = document.createElement(tagName);\n\telem.classList.add(className);\n\telem.textContent = text;\n\treturn elem;\n}",
"function createEl(tag, prop) {\n var el = document.createElement(tag || 'div')\n , n;\n\n for(n in prop) el[n] = prop[n];\n return el;\n }",
"function createTagElement(tid, skillString) {\n\t\tvar div = document.createElement('div');\n\t\tdiv.textContent = skillString;\n\t\tdiv.setAttribute('class', 'tag');\n\t\tdiv.setAttribute('id', tid);\n\t\treturn div;\n\t}",
"function $t (tag) {\n\ttag = tag || 'div';\n\treturn $('<'+tag+'/>');\n}",
"function createEl(tag, prop) {\r\n var el = document.createElement(tag || 'div')\r\n , n\r\n\r\n for(n in prop) el[n] = prop[n]\r\n return el\r\n }",
"function createEl(tag, prop) {\r\n var el = document.createElement(tag || 'div')\r\n , n\r\n\r\n for(n in prop) el[n] = prop[n]\r\n return el\r\n }",
"function create_element (html, info) {\n return Drupal.media.filter.create_element(html, info);\n}"
] |
[
"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.6351116",
"0.6351116",
"0.6343428",
"0.6337377",
"0.6337377",
"0.6330484",
"0.6298118",
"0.6293393",
"0.62885535",
"0.6254301",
"0.623585",
"0.62268084",
"0.6219574",
"0.6218406",
"0.62143123",
"0.62073374",
"0.6202201",
"0.6197932",
"0.61929435",
"0.6192131",
"0.61801296",
"0.61801296",
"0.6162718",
"0.61569697",
"0.61382157",
"0.6122527",
"0.6107662",
"0.60859585",
"0.6076014",
"0.607022",
"0.6056091",
"0.6054578",
"0.60405564",
"0.6038126",
"0.6022355",
"0.60183454",
"0.59986323",
"0.5998118",
"0.59960496",
"0.599069",
"0.59878016",
"0.59826803",
"0.5982096",
"0.59773797",
"0.5970402",
"0.5965261",
"0.59621024",
"0.5961031",
"0.59594876",
"0.5959335",
"0.5954031",
"0.5933233",
"0.5921821",
"0.59159607",
"0.59074324",
"0.59055036",
"0.589714",
"0.5896747",
"0.58905005",
"0.58875734",
"0.58840626",
"0.58832306",
"0.5882897",
"0.58824176",
"0.5880229",
"0.58728707",
"0.5869316",
"0.58660126",
"0.5864616",
"0.5864616",
"0.58559257"
] |
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 === name);\r\n this._plugins.push(this._plugins.splice(index, 1)[0]);\r\n }\r\n debug('orderPlugins:after', this.pluginNames);\r\n }",
"order() {\n debug('order:before', this.names);\n const runLast = this._plugins\n .filter(p => p.requirements.has('runLast'))\n .map(p => p.name);\n for (const name of runLast) {\n const index = this._plugins.findIndex(p => p.name === name);\n this._plugins.push(this._plugins.splice(index, 1)[0]);\n }\n debug('order:after', this.names);\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\"));\n }\n }\n })();\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\"));\n }\n }\n })();\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\"));\n }\n }\n })();\n }\n }\n }",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\"+pluginName+\"`.\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\"+pluginName+\"` does not.\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\"EventPluginRegistry: Failed to publish event `\"+eventName+\"` for plugin `\"+pluginName+\"`.\");}}}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\"+pluginName+\"`.\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\"+pluginName+\"` does not.\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\"EventPluginRegistry: Failed to publish event `\"+eventName+\"` for plugin `\"+pluginName+\"`.\");}}}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\"+pluginName+\"`.\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\"+pluginName+\"` does not.\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\"EventPluginRegistry: Failed to publish event `\"+eventName+\"` for plugin `\"+pluginName+\"`.\");}}}}}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\n 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' +\n pluginName +\n '`.',\n );\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\n 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' +\n pluginName +\n '` does not.',\n );\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (\n !publishEventForPlugin(\n publishedEvents[eventName],\n pluginModule,\n eventName,\n )\n ) {\n {\n throw Error(\n 'EventPluginRegistry: Failed to publish event `' +\n eventName +\n '` for plugin `' +\n pluginName +\n '`.',\n );\n }\n }\n }\n }\n }",
"function recomputePluginOrdering() {\n\t if (!eventPluginOrder) {\n\t // Wait until an `eventPluginOrder` is injected.\n\t return;\n\t }\n\t for (var pluginName in namesToPlugins) {\n\t var pluginModule = namesToPlugins[pluginName];\n\t var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\t !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\t if (plugins[pluginIndex]) {\n\t continue;\n\t }\n\t !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n\t plugins[pluginIndex] = pluginModule;\n\t var publishedEvents = pluginModule.eventTypes;\n\t for (var eventName in publishedEvents) {\n\t !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n\t }\n\t }\n\t}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}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;}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}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;}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}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;}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}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;}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}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;}}}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}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;}}}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\"));\n }\n }\n })();\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\"));\n }\n }\n })();\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\"));\n }\n }\n })();\n }\n }\n}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\"));\n }\n }\n })();\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\"));\n }\n }\n })();\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\"));\n }\n }\n })();\n }\n }\n}",
"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\n\treturn;}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;}}}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error('EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' + pluginName + '`.'));\n }\n }\n })();\n if (plugins[pluginIndex]) {\n continue;\n }\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error('EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' + pluginName + '` does not.'));\n }\n }\n })();\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error('EventPluginRegistry: Failed to publish event `' + eventName + '` for plugin `' + pluginName + '`.'));\n }\n }\n })();\n }\n }\n}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error('EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' + pluginName + '`.'));\n }\n }\n })();\n if (plugins[pluginIndex]) {\n continue;\n }\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error('EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' + pluginName + '` does not.'));\n }\n }\n })();\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error('EventPluginRegistry: Failed to publish event `' + eventName + '` for plugin `' + pluginName + '`.'));\n }\n }\n })();\n }\n }\n}",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }",
"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }"
] |
[
"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.70917714",
"0.7091518",
"0.7091518",
"0.70798963",
"0.7075046",
"0.7075046",
"0.7066281",
"0.7066281",
"0.7066281",
"0.7066281",
"0.7066281"
] |
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;} // Listeners and IDs are two parallel arrays that are always in sync.\ncb(event,dispatchListeners[i],dispatchIDs[i]);}}else if(dispatchListeners){cb(event,dispatchListeners,dispatchIDs);}}",
"function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(true){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i < dispatchListeners.length;i++) {if(event.isPropagationStopped()){break;} // Listeners and IDs are two parallel arrays that are always in sync.\n\tcb(event,dispatchListeners[i],dispatchIDs[i]);}}else if(dispatchListeners){cb(event,dispatchListeners,dispatchIDs);}}",
"function forEach(event, each, disposable) {\n return snapshot((listener, thisArgs = null, disposables) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);\n }",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (false) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"production\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"production\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (true) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}",
"function _forEach(event, each) {\n return snapshot(function (listener) {\n var thisArgs = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n var disposables = arguments.length > 2 ? arguments[2] : undefined;\n return event(function (i) {\n each(i);\n listener.call(thisArgs, i);\n }, null, disposables);\n });\n}",
"function patchViaCapturingAllTheEvents() {\n var _loop_1 = function (i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = wrapWithCurrentZone(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n}",
"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners=null;event._dispatchIDs=null;}",
"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners = null;event._dispatchIDs = null;}",
"function eventFunction(e){\n\t getSlot([q.id], allEvents).push(e);\n\t eventDurForeach(e, drawfn);\n\t}",
"function patchViaCapturingAllTheEvents() {\n var _loop_1 = function _loop_1(i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target,\n bound,\n source;\n\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n } else {\n source = 'unknown.' + onproperty;\n }\n\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = wrapWithCurrentZone(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n\n elt = elt.parentElement;\n }\n }, true);\n };\n\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n }",
"trigger (eventName) {\n if (this.events[eventName]) {\n for (let cb of this.events[eventName]) {\n cb();\n }\n }\n }",
"trigger(eventName) {\n if (this.events[eventName]) {\n for (let cb of this.events[eventName]) {\n cb();\n }\n }\n }",
"each(action) {\n for (const element of this)\n action(element);\n }",
"function patchViaCapturingAllTheEvents() {\n var _loop_1 = function(i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = Zone.current.wrap(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n \n}",
"function patchViaCapturingAllTheEvents() {\n var _loop_1 = function(i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = Zone.current.wrap(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n \n}",
"function patchViaCapturingAllTheEvents() {\n var _loop_1 = function (i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = Zone.current.wrap(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n \n}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n if (inst && event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(inst, registrationName);\n\n if (listener) {\n event._dispatchListeners = accumulateInto(\n event._dispatchListeners,\n listener,\n );\n event._dispatchInstances = accumulateInto(\n event._dispatchInstances,\n inst,\n );\n }\n }\n }",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (inst && event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"trigger(eventName) {\n if (this.events[eventName]) {\n for (let cb of this.events[eventName]) {\n cb();\n }\n }\n }",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}"
] |
[
"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.60784554",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.6072781",
"0.60410064",
"0.5766144",
"0.5738541",
"0.57251835",
"0.57084376",
"0.5707732",
"0.56692564",
"0.55691624",
"0.55544513",
"0.55030125",
"0.55030125",
"0.55007696",
"0.5492424",
"0.5490577",
"0.54880106",
"0.548289",
"0.548289",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405",
"0.54687405"
] |
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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"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 findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"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 React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}"
] |
[
"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.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7309252",
"0.7300612",
"0.72881067",
"0.72881067",
"0.72807443",
"0.72807443",
"0.72807443",
"0.72807443",
"0.72807443",
"0.72807443",
"0.72807443",
"0.72689474",
"0.72689474",
"0.72689474",
"0.7261283",
"0.72570956",
"0.7253915",
"0.72378296",
"0.72328913"
] |
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 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 React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(\n node,\n );\n }",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"function findDOMNode$2(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"function findDOMNode$1(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return external_ReactDOM_default.a.findDOMNode(node);\n}",
"toDOMNode(editor, node) {\n var domNode = Editor.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }",
"function ReactDOMComponent(element) {\r\n\t var tag = element.type;\r\n\t validateDangerousTag(tag);\r\n\t this._currentElement = element;\r\n\t this._tag = tag.toLowerCase();\r\n\t this._namespaceURI = null;\r\n\t this._renderedChildren = null;\r\n\t this._previousStyle = null;\r\n\t this._previousStyleCopy = null;\r\n\t this._hostNode = null;\r\n\t this._hostParent = null;\r\n\t this._rootNodeID = 0;\r\n\t this._domID = 0;\r\n\t this._hostContainerInfo = null;\r\n\t this._wrapperState = null;\r\n\t this._topLevelWrapper = null;\r\n\t this._flags = 0;\r\n\t if (process.env.NODE_ENV !== 'production') {\r\n\t this._ancestorInfo = null;\r\n\t setAndValidateContentChildDev.call(this, null);\r\n\t }\r\n\t}",
"toDOMNode(editor, node) {\n var domNode = __WEBPACK_IMPORTED_MODULE_1_slate__[\"Editor\"].isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\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.73300976",
"0.73300976",
"0.73300976",
"0.73300976",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.72913426",
"0.7209378",
"0.7165536",
"0.7165536",
"0.7155865",
"0.7155865",
"0.7155865",
"0.7155865",
"0.7155865",
"0.7155865",
"0.7151166",
"0.71080565",
"0.71080565",
"0.7060655",
"0.7047505",
"0.68988425",
"0.68061125",
"0.6794381",
"0.6381231",
"0.6313192",
"0.6300397",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026",
"0.62936026"
] |
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 React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\n}",
"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 findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"function findDOMNode$2(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(\n node,\n );\n }",
"function findDOMNode$1(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}",
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return external_ReactDOM_default.a.findDOMNode(node);\n}",
"toDOMNode(editor, node) {\n var domNode = Editor.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }",
"function getRenderedNativeOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}",
"function getRenderedNativeOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}",
"toDOMNode(editor, node) {\n var domNode = __WEBPACK_IMPORTED_MODULE_1_slate__[\"Editor\"].isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }",
"function getRenderedHostOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}",
"toDOMNode(editor, node) {\n var KEY_TO_ELEMENT = EDITOR_TO_KEY_TO_ELEMENT.get(editor);\n var domNode = index_es/* Editor.isEditor */.ML.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT === null || KEY_TO_ELEMENT === void 0 ? void 0 : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }",
"function getRenderedNativeOrTextFromComponent(component) {\n var rendered;\n while (rendered = component._renderedComponent) {\n component = rendered;\n }\n return component;\n}",
"function render(node) {\n switch (nodeType(node)) {\n case \"text\":\n return document.createTextNode(node);\n case \"element\":\n return renderElement(node);\n case \"component\":\n return renderComponent(node);\n }\n}",
"function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}",
"function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}",
"function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}",
"function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}",
"function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}",
"function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\r\n\t var tag = element.type;\r\n\t validateDangerousTag(tag);\r\n\t this._currentElement = element;\r\n\t this._tag = tag.toLowerCase();\r\n\t this._namespaceURI = null;\r\n\t this._renderedChildren = null;\r\n\t this._previousStyle = null;\r\n\t this._previousStyleCopy = null;\r\n\t this._hostNode = null;\r\n\t this._hostParent = null;\r\n\t this._rootNodeID = 0;\r\n\t this._domID = 0;\r\n\t this._hostContainerInfo = null;\r\n\t this._wrapperState = null;\r\n\t this._topLevelWrapper = null;\r\n\t this._flags = 0;\r\n\t if (process.env.NODE_ENV !== 'production') {\r\n\t this._ancestorInfo = null;\r\n\t setAndValidateContentChildDev.call(this, null);\r\n\t }\r\n\t}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}",
"function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}"
] |
[
"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.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.67319804",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.6716423",
"0.671305",
"0.6697971",
"0.6697971",
"0.6638889",
"0.6632871",
"0.65692234",
"0.64912564",
"0.64080024",
"0.64080024",
"0.63117594",
"0.62738717",
"0.62080437",
"0.6157202",
"0.6148927",
"0.6105821",
"0.6105821",
"0.6105821",
"0.6105821",
"0.6105821",
"0.6105821",
"0.6093044",
"0.6093044",
"0.6093044",
"0.6093044",
"0.6093044",
"0.6093044",
"0.6093044",
"0.6093044",
"0.6087441",
"0.6086045",
"0.6086045",
"0.6086045",
"0.6086045",
"0.6086045",
"0.6086045",
"0.6086045",
"0.6086045",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274",
"0.60740274"
] |
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, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}",
"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, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}",
"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, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}",
"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, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}",
"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, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}",
"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, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}",
"function getLowestCommonAncestor(instA, instB) {\n !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = instA._nativeParent;\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = instB._nativeParent;\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB) {\n return instA;\n }\n instA = instA._nativeParent;\n instB = instB._nativeParent;\n }\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n }\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n }\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n for(var tempA = nodeA; tempA; tempA = getParent(tempA))depthA++;\n var depthB = 0;\n for(var tempB = nodeB; tempB; tempB = getParent(tempB))depthB++;\n // If A is deeper, crawl up.\n while(depthA - depthB > 0){\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n while(depthB - depthA > 0){\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n var depth = depthA;\n while(depth--){\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) return nodeA;\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }",
"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.\n\twhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\n\twhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\n\tvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}",
"function getLowestCommonAncestor(instA, instB) {\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = getParent(instA);\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = getParent(instB);\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB || instA === instB.alternate) {\n\t return instA;\n\t }\n\t instA = getParent(instA);\n\t instB = getParent(instB);\n\t }\n\t return null;\n\t}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"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.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}",
"function getLowestCommonAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;var depthA=0;for(var tempA=instA;tempA;tempA=tempA._nativeParent){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=tempB._nativeParent){depthB++;} // If A is deeper, crawl up.\n\twhile(depthA-depthB>0){instA=instA._nativeParent;depthA--;} // If B is deeper, crawl up.\n\twhile(depthB-depthA>0){instB=instB._nativeParent;depthB--;} // Walk in lockstep until we find a match.\n\tvar depth=depthA;while(depth--){if(instA===instB){return instA;}instA=instA._nativeParent;instB=instB._nativeParent;}return null;}",
"function getLowestCommonAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;var depthA=0;for(var tempA=instA;tempA;tempA=tempA._nativeParent){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=tempB._nativeParent){depthB++;} // If A is deeper, crawl up.\n\twhile(depthA-depthB>0){instA=instA._nativeParent;depthA--;} // If B is deeper, crawl up.\n\twhile(depthB-depthA>0){instB=instB._nativeParent;depthB--;} // Walk in lockstep until we find a match.\n\tvar depth=depthA;while(depth--){if(instA===instB){return instA;}instA=instA._nativeParent;instB=instB._nativeParent;}return null;}"
] |
[
"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.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.817944",
"0.817944",
"0.817944",
"0.817944",
"0.817944",
"0.817944",
"0.817944",
"0.817944",
"0.817944",
"0.816906",
"0.8166565",
"0.8166565",
"0.8166565",
"0.8149842",
"0.8147916",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8140091",
"0.8115295",
"0.81075025",
"0.81075025",
"0.81075025",
"0.81075025",
"0.81075025",
"0.81075025",
"0.81075025",
"0.81075025",
"0.81075025",
"0.809656",
"0.809656"
] |
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.') : invariant(false) : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}",
"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.') : invariant(false) : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}",
"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.') : invariant(false) : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._nativeParent;\n }\n return false;\n}",
"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.') : invariant(false) : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}",
"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.') : invariant(false) : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}",
"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.') : invariant(false) : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n for (;instB; ) {\n if (instA === instB || instA === instB.alternate) return !0;\n instB = getParent(instB);\n }\n return !1;\n}",
"function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}",
"function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}",
"function isAncestor(instA, instB) {\n\t\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t\t while (instB) {\n\t\t if (instB === instA) {\n\t\t return true;\n\t\t }\n\t\t instB = instB._hostParent;\n\t\t }\n\t\t return false;\n\t\t}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n\t\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\t\n\t\t while (instB) {\n\t\t if (instB === instA) {\n\t\t return true;\n\t\t }\n\t\t instB = instB._hostParent;\n\t\t }\n\t\t return false;\n\t\t}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : undefined : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : undefined : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? (undefined) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? (undefined) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? \"production\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? \"production\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}"
] |
[
"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.7013527",
"0.7013527",
"0.7013527",
"0.7013527",
"0.7013527",
"0.7013527",
"0.7013527",
"0.70134753",
"0.70134753",
"0.70134753",
"0.70134753",
"0.70134753",
"0.70134753",
"0.70134753",
"0.70134753",
"0.7012644",
"0.70083946",
"0.698287",
"0.698287",
"0.698287",
"0.69818044",
"0.69818044",
"0.69818044",
"0.69686925",
"0.69686925",
"0.69686925",
"0.69686925",
"0.69550955",
"0.69174623",
"0.69174623",
"0.6870547",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.6846494",
"0.68154275"
] |
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(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(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(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(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(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=inst._hostParent;}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(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);}}",
"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);}}",
"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);}}",
"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);}}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0; ) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"traverse() {\n this.root.visit(this.root);\n }",
"function traverseTwoPhase(inst, fn, arg) {\n for (var path = []; inst; ) path.push(inst), inst = getParent(inst);\n var i;\n for (i = path.length; i-- > 0; ) fn(path[i], \"captured\", arg);\n for (i = 0; i < path.length; i++) fn(path[i], \"bubbled\", arg);\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i = void 0;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i = void 0;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}",
"function traverseTwoPhase(inst, fn, arg) {\r\n\t var path = [];\r\n\t while (inst) {\r\n\t path.push(inst);\r\n\t inst = inst._hostParent;\r\n\t }\r\n\t var i;\r\n\t for (i = path.length; i-- > 0;) {\r\n\t fn(path[i], 'captured', arg);\r\n\t }\r\n\t for (i = 0; i < path.length; i++) {\r\n\t fn(path[i], 'bubbled', arg);\r\n\t }\r\n\t}",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i = void 0;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i = void 0;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }",
"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i = void 0;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }"
] |
[
"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.5548963",
"0.5548963",
"0.5548963",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5547185",
"0.5541341",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5537696",
"0.5533395",
"0.5525063",
"0.5525063",
"0.5525063"
] |
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 const that = this;\n\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\n that._handleMouseInteraction();\n }\n }",
"function hover(parentSelector, childSelector, mouseEnter, mouseLeave) {\n $(parentSelector).on({\n mouseenter: function() {\n if(mouseEnter != null) {\n mouseEnter(this);\n }\n },\n mouseleave: function() {\n if(mouseLeave != null) {\n mouseLeave(this);\n }\n }\n }, childSelector);\n}",
"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._nativeParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._nativeParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],true,argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],false,argTo);}}",
"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._nativeParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._nativeParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],true,argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],false,argTo);}}",
"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._hostParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._hostParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],'captured',argTo);}}",
"function itoolPreviewMouseOver(className, callback) {\n var iframeJQuery = window.frames[0].jQuery;\n var iframeContents = _iframe.contents();\n var selElems = iframeJQuery(\".perc-itool-selected-elem\");\n //As this function gets fired on mouse over which can happen more than once as user moves the mouse on the menu\n //The following code is put in to detect whether we already handled the mouse over if yes then returns\n //If the selected elements length is zero return from here or\n //if selected element is only one and if it is div and if it has perc-itools-wrapper return from here\n //if the selected element's parent has a perc-itools-wrapper return from here.\n if(selElems.length === 0 ||\n (selElems.length === 1 && selElems.is(\"div\") && iframeJQuery(selElems).hasClass(\"perc-itools-wrapper\")) ||\n (iframeJQuery(selElems[0]).parent().hasClass(\"perc-itools-wrapper\")))\n return;\n\n selElems.siblings(\":not('.perc-itool-selected-elem')\").each(function(){\n if(iframeJQuery(this).is(\"div\"))\n {\n iframeJQuery(this).addClass('perc-itools-wrapper perc-make-me-region').addClass(className);\n }\n else\n {\n iframeJQuery(this).wrap(\"<div class='perc-widget perc-itool-nov-div-wrapper perc-itools-wrapper perc-itool-region-puff'></div>\");\n }\n });\n\n iframeContents.find('.perc-sibling-div').remove();\n if(selElems.length === 1 && selElems.is(\"div\"))\n {\n selElems.addClass('perc-itool-region-puff-self perc-make-me-region perc-self-wrapper perc-itools-wrapper').addClass(className);\n highlightSiblings(selElems);\n }\n else\n {\n selElems.wrapAll(\"<div class='perc-widget perc-itool-multi-wrapper perc-itool-nov-div-wrapper perc-itool-region-puff-self perc-self-wrapper perc-itools-wrapper \" + className + \"'></div>\");\n highlightSiblings(iframeJQuery(selElems[0]).parent());\n }\n //Change border color of all siblings to blue from grey.\n iframeContents.find('.perc-sibling-div').css({'border-color':'#00afea'});\n iframeJQuery('.perc-itool-selected-green-border').remove();\n iframeJQuery(selElems).each(function()\n {\n highlightSelectedElements(iframeJQuery(this), false);\n });\n\n // If user performs 'Side by Side' action - add the overflow:auto and height 100% to its parent so that below content don't overlap on columns\n if(className === 'perc-col') {\n if(selElems.length === 1) {\n\n selElems.parent().addClass('perc-clear');\n }\n\n else {\n\n selElems.parent().parent().addClass('perc-clear');\n }\n\n }\n\n // If there is only one selected element,turn its border into blue. If there are mulitple selected element keep their border green but turn its wrapper div border to blue\n if(selElems.length === 1) {\n iframeJQuery('.perc-itool-selected-green-border').css('border-color', '#00afea');\n }\n else {\n highlightSelectedElements(iframeJQuery('.perc-itool-multi-wrapper'), true);\n iframeJQuery('.perc-itool-selected-green-border').parent('.perc-itool-selected-green-border').css('border-color', '#00afea');\n }\n\n if (callback) {\n callback();\n }\n }",
"function isMouseLeaveOrEnter(e, handler) {\r\n\t if (e.type != 'mouseout' && e.type != 'mouseover')\r\n\t\t return false;\r\n\t var reltg = e.relatedTarget ? e.relatedTarget : e.type == 'mouseout' ? e.toElement : e.fromElement;\r\n\t while (reltg && reltg != handler)\r\n\t\t reltg = reltg.parentNode;\r\n\t return (reltg != handler);\r\n}",
"function handlerFn(ev) {\n if (ev.animationName !== 'muiNodeInserted') return;\n processLabel(ev.target);\n }",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"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);}}",
"function setCallBacks(){\n var children = parentDIV.childNodes;\n for(var i = 0; i < children.length; i++){\n children[i].onclick = params.callBack || \n function(){alert(\"Default callback\");};\n } \n }",
"function mouseEnterAnchor(obj, idVal, event) {\n\tvar position = obj.position();\n\n\tvar p = obj.position();\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('position', \"absolute\");\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('display', \"\");\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('left', ( p.left - 160 +'px'));\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('z-index', \"99999\");\n\n//\tvar topVal = obj.offset().top+32;\n//\tvar leftVal = obj.offset().left - 190;\n//\tshowOverlay($(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\"), leftVal, topVal,9000);\n}",
"function highlighter() {\n\n\tvar areas = $(\".highlight_area\");\n\n\t// in case of ajax reloading and other dynamics\n\t// remove the old mouseover/mouseout events and attach them new\n\tareas.off(\"mouseover\");\n\tareas.off(\"mouseout\");\n\tareas.mouseover(function() {\n\t\tvar itemId = parseId(jQuery(this).attr('class'));\n\t\tvar prntId = parseId(jQuery(this).attr('class'), 'parent_');\n\t\thighlight(itemId); // highlight the current element\n\t\tcheckForChilds(itemId);// highlight the child elements - recursive\n\t\t// - of the current item, if it's given\n\t\tif (prntId) { // check if the current item is a child of another\n\t\t\thighlight(prntId, 'id_'); // hightlight the next parent item,\n\t\t\t// if the current item is a child\n\t\t}\n\t}).mouseout(function() {\n\t\treset_highlight();\n\t});\n\n}",
"function mouseMovedOnListItem(hashId) {\n\t return function (dispatch, getState) {\n\t if (getState().Search.Map.BalloonState.MouseIsOnListItem)\n\t return;\n\t mouseEnteredListItem(hashId)(dispatch, getState);\n\t };\n\t}",
"function mouseoverIDs(str){\n svg.selectAll(\".node\")\n .attr(\"fill-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.02; })\n .attr(\"stroke-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.02; });\n svg.selectAll(\".nodeText\") \n .attr(\"fill-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.05; });\n svg.selectAll(\".lineNodes\")\n .attr(\"stroke-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0; });\n checkVisibility();\n}",
"function handleHover(e) {\r\n\t\t\t// Check if mouse(over|out) are still within the same parent element\r\n\t\t\tvar p = (e.type == \"mouseover\" ? e.fromElement : e.toElement) || e.relatedTarget;\r\n\t\r\n\t\t\t// Traverse up the tree\r\n\t\t\twhile ( p && p != this ) p = p.parentNode;\r\n\t\t\t\r\n\t\t\t// If we actually just moused on to a sub-element, ignore it\r\n\t\t\tif ( p == this ) return false;\r\n\t\t\t\r\n\t\t\t// Execute the right function\r\n\t\t\treturn (e.type == \"mouseover\" ? f : g).apply(this, [e]);\r\n\t\t}",
"_mouseEnterHandler() {\n const that = this;\n\n that._isElementHovered = true;\n\n if (that.dropDownOpenMode === 'auto' && !that.disabled && !that.readonly) {\n that.open();\n }\n }",
"_mouseEnterHandler() {\n const that = this;\n\n that._isElementHovered = true;\n\n if (that.tagName.indexOf('JQX-DROP-DOWN-') > -1 && that.dropDownOpenMode === 'auto' && !that.disabled && !that.readonly) {\n that.open();\n }\n }",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t\t var pathFrom = [];\n\t\t while (from && from !== common) {\n\t\t pathFrom.push(from);\n\t\t from = from._hostParent;\n\t\t }\n\t\t var pathTo = [];\n\t\t while (to && to !== common) {\n\t\t pathTo.push(to);\n\t\t to = to._hostParent;\n\t\t }\n\t\t var i;\n\t\t for (i = 0; i < pathFrom.length; i++) {\n\t\t fn(pathFrom[i], true, argFrom);\n\t\t }\n\t\t for (i = pathTo.length; i-- > 0;) {\n\t\t fn(pathTo[i], false, argTo);\n\t\t }\n\t\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t\t var pathFrom = [];\n\t\t while (from && from !== common) {\n\t\t pathFrom.push(from);\n\t\t from = from._hostParent;\n\t\t }\n\t\t var pathTo = [];\n\t\t while (to && to !== common) {\n\t\t pathTo.push(to);\n\t\t to = to._hostParent;\n\t\t }\n\t\t var i;\n\t\t for (i = 0; i < pathFrom.length; i++) {\n\t\t fn(pathFrom[i], true, argFrom);\n\t\t }\n\t\t for (i = pathTo.length; i-- > 0;) {\n\t\t fn(pathTo[i], false, argTo);\n\t\t }\n\t\t}",
"function mouseOver(elem) {\n let place = (elem.id);\n console.log(place);\n addColor(place);\n return place;\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}",
"function handleMouseEnterFix() {\n !mouseEntered.current && handleMouseEnter();\n }",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\r\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\r\n\t var pathFrom = [];\r\n\t while (from && from !== common) {\r\n\t pathFrom.push(from);\r\n\t from = from._hostParent;\r\n\t }\r\n\t var pathTo = [];\r\n\t while (to && to !== common) {\r\n\t pathTo.push(to);\r\n\t to = to._hostParent;\r\n\t }\r\n\t var i;\r\n\t for (i = 0; i < pathFrom.length; i++) {\r\n\t fn(pathFrom[i], 'bubbled', argFrom);\r\n\t }\r\n\t for (i = pathTo.length; i-- > 0;) {\r\n\t fn(pathTo[i], 'captured', argTo);\r\n\t }\r\n\t}",
"function mouseEntered(e) {\r\n DoHover(this, true, e);\r\n e.stopPropagation();\r\n }",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._nativeParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._nativeParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}",
"function the_click_callback(){\n\t\t\t\tif(typeof click_callback == 'function'){\n\t\t\t\t\tvar id = $container.attr('id');\n\t\t\t\t\tif(id==undefined || !id){\n\t\t\t\t\t\tid = '[no id]';\n\t\t\t\t\t}\n\t\t\t\t\tclick_callback(id, activenode);\n\t\t\t\t}\n\t\t\t}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}",
"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\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.47289667",
"0.47251385",
"0.47151572",
"0.470773",
"0.47012347",
"0.4660974",
"0.46470228",
"0.46364143",
"0.46347895",
"0.46347895",
"0.45938525",
"0.45877033",
"0.45877033",
"0.45877033",
"0.45877033",
"0.45877033",
"0.45877033",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45732072",
"0.45557362",
"0.45552894",
"0.45346874",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45307174",
"0.45277494",
"0.4522837",
"0.4522837",
"0.4522837",
"0.4522837",
"0.4522837",
"0.4522837",
"0.4522837",
"0.4517759",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947",
"0.45062947"
] |
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.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t\t return getListener(inst, registrationName);\n\t\t}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}",
"function listenerAtPhase(id,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(id,registrationName);}",
"function listenerAtPhase(id,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(id,registrationName);}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\r\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\r\n\t return getListener(inst, registrationName);\r\n\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }",
"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n}",
"function listenerAtPhase(inst, event, propagationPhase: PropagationPhases) {\n const registrationName =\n event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n}"
] |
[
"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.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"0.68936646",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.68223137",
"0.6754801",
"0.67308503",
"0.6726814"
] |
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(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}",
"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(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}",
"function accumulateDirectionalDispatches(domID,upwards,event){if(true){if(!domID){throw new Error('Dispatching id must not be null');}}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(domID,event,phase);if(listener){event._dispatchListeners = accumulateInto(event._dispatchListeners,listener);event._dispatchIDs = accumulateInto(event._dispatchIDs,domID);}}",
"function accumulateDirectionalDispatches(domID,upwards,event){if(\"production\"!==process.env.NODE_ENV){if(!domID){throw new Error('Dispatching id must not be null');}}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(domID,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchIDs=accumulateInto(event._dispatchIDs,domID);}}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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);}}",
"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);}}",
"function accumulateDispatches(id,ignoredDirection,event){if(event && event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(id,registrationName);if(listener){event._dispatchListeners = accumulateInto(event._dispatchListeners,listener);event._dispatchIDs = accumulateInto(event._dispatchIDs,id);}}}",
"function accumulateDirectionalDispatches(inst,phase,event){{!inst?warningWithoutStack$1(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);}}",
"function accumulateDirectionalDispatches(inst,phase,event){{!inst?warningWithoutStack$1(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);}}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t\t if (false) {\n\t\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t\t }\n\t\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t\t var listener = listenerAtPhase(inst, event, phase);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t\t if (false) {\n\t\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t\t }\n\t\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t\t var listener = listenerAtPhase(inst, event, phase);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"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);}}}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t\t if (process.env.NODE_ENV !== 'production') {\n\t\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t\t }\n\t\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t\t var listener = listenerAtPhase(domID, event, phase);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t\t }\n\t\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}",
"function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}",
"function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"development\" !== 'production') {\n \"development\" !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDispatches(inst,ignoredDirection,event){if(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);}}}",
"function accumulateDispatches(inst,ignoredDirection,event){if(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);}}}",
"function accumulateDispatches(inst,ignoredDirection,event){if(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);}}}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n if (\"development\" !== 'production') {\n \"development\" !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (false) {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (false) {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}",
"function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}"
] |
[
"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.59275264",
"0.59275264",
"0.59275264",
"0.59275264",
"0.59275264",
"0.59275264",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.5919303",
"0.59129936",
"0.590826",
"0.590826",
"0.590826",
"0.590826",
"0.590826",
"0.590826",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.59038055",
"0.5900558",
"0.5900558",
"0.5900558",
"0.5890637",
"0.5884771",
"0.5884771",
"0.5884771",
"0.5884771",
"0.5884771",
"0.5884771",
"0.5884771",
"0.5884557",
"0.5884557",
"0.5884557",
"0.58836865",
"0.5882393",
"0.5882393",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.58813524",
"0.5875384",
"0.5875384",
"0.5875384",
"0.5875384",
"0.5875384",
"0.5875384"
] |
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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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 are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners = null;event._dispatchIDs = null;}",
"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.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"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.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners=null;event._dispatchIDs=null;}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (inst && event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"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.\n\texecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;if(process.env.NODE_ENV!=='production'){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.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n if (inst && event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(inst, registrationName);\n\n if (listener) {\n event._dispatchListeners = accumulateInto(\n event._dispatchListeners,\n listener,\n );\n event._dispatchInstances = accumulateInto(\n event._dispatchInstances,\n inst,\n );\n }\n }\n }",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}",
"function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}"
] |
[
"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.5791305",
"0.5790863",
"0.57835335",
"0.5777487",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5774508",
"0.5771981",
"0.5771981",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648",
"0.5767648"
] |
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 accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? getParentInstance(targetInst) : null;\n\t traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t\t var targetInst = event._targetInst;\n\t\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t\t }\n\t\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t\t var targetInst = event._targetInst;\n\t\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t\t }\n\t\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t\t EventPluginHub.injection.getInstanceHandle().traverseTwoPhaseSkipTarget(event.dispatchMarker, accumulateDirectionalDispatches, event);\n\t\t }\n\t\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}",
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}"
] |
[
"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.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204"
] |
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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"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 =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}",
"function accumulateDispatches(id, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(id, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t\t }\n\t\t }\n\t\t}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}",
"function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}"
] |
[
"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.74662745",
"0.74662745",
"0.74662745",
"0.7465777",
"0.7465777",
"0.7465777",
"0.7465777",
"0.7465777",
"0.7465777",
"0.7465777",
"0.7457114",
"0.7420324",
"0.7420324",
"0.7420324",
"0.7420324",
"0.7420324",
"0.7420324",
"0.7420324",
"0.7420324",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.740026",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.73961383",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806",
"0.7375806"
] |
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,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}",
"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}",
"function extractEvents$2(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var isOverEvent=domEventName==='mouseover'||domEventName==='pointerover';var isOutEvent=domEventName==='mouseout'||domEventName==='pointerout';if(isOverEvent&&(eventSystemFlags&IS_REPLAYED)===0){// If this is an over event with a target, we might have already dispatched\n// the event in the out event of the other target. If this is replayed,\n// then it's because we couldn't dispatch against this target previously\n// so we have to do it now instead.\nvar related=nativeEvent.relatedTarget||nativeEvent.fromElement;if(related){// If the related node is managed by React, we can assume that we have\n// already dispatched the corresponding events during its mouseout.\nif(getClosestInstanceFromNode(related)||isContainerMarkedAsRoot(related)){return;}}}if(!isOutEvent&&!isOverEvent){// Must not be a mouse or pointer in or out - ignoring.\nreturn;}var win;// TODO: why is this nullable in the types but we read from it?\nif(nativeEventTarget.window===nativeEventTarget){// `nativeEventTarget` is probably a window object.\nwin=nativeEventTarget;}else{// TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\nvar doc=nativeEventTarget.ownerDocument;if(doc){win=doc.defaultView||doc.parentWindow;}else{win=window;}}var from;var to;if(isOutEvent){var _related=nativeEvent.relatedTarget||nativeEvent.toElement;from=targetInst;to=_related?getClosestInstanceFromNode(_related):null;if(to!==null){var nearestMounted=getNearestMountedFiber(to);if(to!==nearestMounted||to.tag!==HostComponent&&to.tag!==HostText){to=null;}}}else{// Moving to a node from outside the window.\nfrom=null;to=targetInst;}if(from===to){// Nothing pertains to our managed components.\nreturn;}var SyntheticEventCtor=SyntheticMouseEvent;var leaveEventType='onMouseLeave';var enterEventType='onMouseEnter';var eventTypePrefix='mouse';if(domEventName==='pointerout'||domEventName==='pointerover'){SyntheticEventCtor=SyntheticPointerEvent;leaveEventType='onPointerLeave';enterEventType='onPointerEnter';eventTypePrefix='pointer';}var fromNode=from==null?win:getNodeFromInstance(from);var toNode=to==null?win:getNodeFromInstance(to);var leave=new SyntheticEventCtor(leaveEventType,eventTypePrefix+'leave',from,nativeEvent,nativeEventTarget);leave.target=fromNode;leave.relatedTarget=toNode;var enter=null;// We should only process this nativeEvent if we are processing\n// the first ancestor. Next time, we will ignore the event.\nvar nativeTargetInst=getClosestInstanceFromNode(nativeEventTarget);if(nativeTargetInst===targetInst){var enterEvent=new SyntheticEventCtor(enterEventType,eventTypePrefix+'enter',to,nativeEvent,nativeEventTarget);enterEvent.target=toNode;enterEvent.relatedTarget=fromNode;enter=enterEvent;}accumulateEnterLeaveTwoPhaseListeners(dispatchQueue,leave,enter,from,to);}",
"function extractEvents$2(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var isOverEvent=domEventName==='mouseover'||domEventName==='pointerover';var isOutEvent=domEventName==='mouseout'||domEventName==='pointerout';if(isOverEvent&&(eventSystemFlags&IS_REPLAYED)===0){// If this is an over event with a target, we might have already dispatched\n// the event in the out event of the other target. If this is replayed,\n// then it's because we couldn't dispatch against this target previously\n// so we have to do it now instead.\nvar related=nativeEvent.relatedTarget||nativeEvent.fromElement;if(related){// If the related node is managed by React, we can assume that we have\n// already dispatched the corresponding events during its mouseout.\nif(getClosestInstanceFromNode(related)||isContainerMarkedAsRoot(related)){return;}}}if(!isOutEvent&&!isOverEvent){// Must not be a mouse or pointer in or out - ignoring.\nreturn;}var win;// TODO: why is this nullable in the types but we read from it?\nif(nativeEventTarget.window===nativeEventTarget){// `nativeEventTarget` is probably a window object.\nwin=nativeEventTarget;}else {// TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\nvar doc=nativeEventTarget.ownerDocument;if(doc){win=doc.defaultView||doc.parentWindow;}else {win=window;}}var from;var to;if(isOutEvent){var _related=nativeEvent.relatedTarget||nativeEvent.toElement;from=targetInst;to=_related?getClosestInstanceFromNode(_related):null;if(to!==null){var nearestMounted=getNearestMountedFiber(to);if(to!==nearestMounted||to.tag!==HostComponent&&to.tag!==HostText){to=null;}}}else {// Moving to a node from outside the window.\nfrom=null;to=targetInst;}if(from===to){// Nothing pertains to our managed components.\nreturn;}var SyntheticEventCtor=SyntheticMouseEvent;var leaveEventType='onMouseLeave';var enterEventType='onMouseEnter';var eventTypePrefix='mouse';if(domEventName==='pointerout'||domEventName==='pointerover'){SyntheticEventCtor=SyntheticPointerEvent;leaveEventType='onPointerLeave';enterEventType='onPointerEnter';eventTypePrefix='pointer';}var fromNode=from==null?win:getNodeFromInstance(from);var toNode=to==null?win:getNodeFromInstance(to);var leave=new SyntheticEventCtor(leaveEventType,eventTypePrefix+'leave',from,nativeEvent,nativeEventTarget);leave.target=fromNode;leave.relatedTarget=toNode;var enter=null;// We should only process this nativeEvent if we are processing\n// the first ancestor. Next time, we will ignore the event.\nvar nativeTargetInst=getClosestInstanceFromNode(nativeEventTarget);if(nativeTargetInst===targetInst){var enterEvent=new SyntheticEventCtor(enterEventType,eventTypePrefix+'enter',to,nativeEvent,nativeEventTarget);enterEvent.target=toNode;enterEvent.relatedTarget=fromNode;enter=enterEvent;}accumulateEnterLeaveTwoPhaseListeners(dispatchQueue,leave,enter,from,to);}",
"function makeNativeSimulator(eventType, topLevelType) {\n return function (domComponentOrNode, nativeEventData) {\n var fakeNativeEvent = new Event(eventType);\n _assign(fakeNativeEvent, nativeEventData);\n if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n simulateNativeEventOnDOMComponent(topLevelType, domComponentOrNode, fakeNativeEvent);\n } else if (domComponentOrNode.tagName) {\n // Will allow on actual dom nodes.\n simulateNativeEventOnNode(topLevelType, domComponentOrNode, fakeNativeEvent);\n }\n };\n}",
"function makeNativeSimulator(eventType, topLevelType) {\n return function (domComponentOrNode, nativeEventData) {\n var fakeNativeEvent = new Event(eventType);\n\n _assign(fakeNativeEvent, nativeEventData);\n\n if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n simulateNativeEventOnDOMComponent(topLevelType, domComponentOrNode, fakeNativeEvent);\n } else if (domComponentOrNode.tagName) {\n // Will allow on actual dom nodes.\n simulateNativeEventOnNode(topLevelType, domComponentOrNode, fakeNativeEvent);\n }\n };\n}",
"function InternalEvent() { }",
"function InternalEvent() { }",
"function InternalEvent() { }",
"function InternalEvent() { }",
"function InternalEvent() { }",
"function extractEvents(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){extractCompositionEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);extractBeforeInputEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);}",
"function extractEvents(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){extractCompositionEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);extractBeforeInputEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);}",
"function InternalEvent() {}",
"function Browser_GetMouseDownEventType(event)\n{\n\t//switch on event type first\n\tswitch (event.type)\n\t{\n\t\tcase window.__BROWSER_EVENT_MOUSEDOWN:\n\t\t\t//no mouse button?\n\t\t\tif (!event.button)\n\t\t\t{\n\t\t\t\t//return the event directly as it was triggered by the camera\n\t\t\t\treturn event.type;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t//check button\n\t\t\t\tswitch (event.button)\n\t\t\t\t{\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\t//has to be left button\n\t\t\t\t\t\treturn window.__BROWSER_EVENT_MOUSEDOWN;\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\t//switch according to browser\n\t\t\t\t\t\tswitch (window.__BROWSER_TYPE)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase __BROWSER_IE:\n\t\t\t\t\t\t\t\t//has to be left button\n\t\t\t\t\t\t\t\treturn window.__BROWSER_EVENT_MOUSEDOWN;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase __BROWSER_EVENT_CLICK:\n\t\tcase window.__BROWSER_EVENT_MOUSEUP:\n\t\tcase __BROWSER_EVENT_MOUSERIGHT:\n\t\tcase __BROWSER_EVENT_DOUBLECLICK:\n\n\t\t\t//return it\n\t\t\treturn event.type;\n\t}\n\t//failed\n\treturn false;\n}",
"function Utilities_GetEvent(e)\r\n{\r\n return e || window.event;\r\n}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}",
"function u(e) {\n return function(t, n) {\n var o = new r(e);\n l(o, n), S.isDOMComponent(t) ? S.simulateNativeEventOnDOMComponent(e, t, o) : t.tagName && // Will allow on actual dom nodes.\n S.simulateNativeEventOnNode(e, t, o);\n };\n }",
"function extractEvents$3(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;switch(domEventName){// Track the input node that has focus.\ncase'focusin':if(isTextInputElement(targetNode)||targetNode.contentEditable==='true'){activeElement$1=targetNode;activeElementInst$1=targetInst;lastSelection=null;}break;case'focusout':activeElement$1=null;activeElementInst$1=null;lastSelection=null;break;// Don't fire the event while the user is dragging. This matches the\n// semantics of the native select event.\ncase'mousedown':mouseDown=true;break;case'contextmenu':case'mouseup':case'dragend':mouseDown=false;constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);break;// Chrome and IE fire non-standard event when selection is changed (and\n// sometimes when it hasn't). IE's event fires out of order with respect\n// to key and input events on deletion, so we discard it.\n//\n// Firefox doesn't support selectionchange, so check selection status\n// after each key entry. The selection changes after keydown and before\n// keyup, but we check on keydown as well in the case of holding down a\n// key, when multiple keydown events are fired but only one keyup is.\n// This is also our approach for IE handling, for the reason above.\ncase'selectionchange':if(skipSelectionChangeEvent){break;}// falls through\ncase'keydown':case'keyup':constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);}}",
"function extractEvents$3(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;switch(domEventName){// Track the input node that has focus.\ncase'focusin':if(isTextInputElement(targetNode)||targetNode.contentEditable==='true'){activeElement$1=targetNode;activeElementInst$1=targetInst;lastSelection=null;}break;case'focusout':activeElement$1=null;activeElementInst$1=null;lastSelection=null;break;// Don't fire the event while the user is dragging. This matches the\n// semantics of the native select event.\ncase'mousedown':mouseDown=true;break;case'contextmenu':case'mouseup':case'dragend':mouseDown=false;constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);break;// Chrome and IE fire non-standard event when selection is changed (and\n// sometimes when it hasn't). IE's event fires out of order with respect\n// to key and input events on deletion, so we discard it.\n//\n// Firefox doesn't support selectionchange, so check selection status\n// after each key entry. The selection changes after keydown and before\n// keyup, but we check on keydown as well in the case of holding down a\n// key, when multiple keydown events are fired but only one keyup is.\n// This is also our approach for IE handling, for the reason above.\ncase'selectionchange':if(skipSelectionChangeEvent){break;}// falls through\ncase'keydown':case'keyup':constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);}}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}",
"function extractEvents$1(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;var getTargetInstFunc,handleEventFunc;if(shouldUseChangeEvent(targetNode)){getTargetInstFunc=getTargetInstForChangeEvent;}else if(isTextInputElement(targetNode)){if(isInputEventSupported){getTargetInstFunc=getTargetInstForInputOrChangeEvent;}else{getTargetInstFunc=getTargetInstForInputEventPolyfill;handleEventFunc=handleEventsForInputEventPolyfill;}}else if(shouldUseClickEvent(targetNode)){getTargetInstFunc=getTargetInstForClickEvent;}if(getTargetInstFunc){var inst=getTargetInstFunc(domEventName,targetInst);if(inst){createAndAccumulateChangeEvent(dispatchQueue,inst,nativeEvent,nativeEventTarget);return;}}if(handleEventFunc){handleEventFunc(domEventName,targetNode,targetInst);}// When blurring, set the value attribute for number inputs\nif(domEventName==='focusout'){handleControlledInputBlur(targetNode);}}",
"function extractEvents$1(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;var getTargetInstFunc,handleEventFunc;if(shouldUseChangeEvent(targetNode)){getTargetInstFunc=getTargetInstForChangeEvent;}else if(isTextInputElement(targetNode)){if(isInputEventSupported){getTargetInstFunc=getTargetInstForInputOrChangeEvent;}else {getTargetInstFunc=getTargetInstForInputEventPolyfill;handleEventFunc=handleEventsForInputEventPolyfill;}}else if(shouldUseClickEvent(targetNode)){getTargetInstFunc=getTargetInstForClickEvent;}if(getTargetInstFunc){var inst=getTargetInstFunc(domEventName,targetInst);if(inst){createAndAccumulateChangeEvent(dispatchQueue,inst,nativeEvent,nativeEventTarget);return;}}if(handleEventFunc){handleEventFunc(domEventName,targetNode,targetInst);}// When blurring, set the value attribute for number inputs\nif(domEventName==='focusout'){handleControlledInputBlur(targetNode);}}",
"function extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;\n switch (domEventName) {\n case 'focusin':\n if (isTextInputElement(targetNode) || targetNode.contentEditable === 'true') {\n activeElement$1 = targetNode;\n activeElementInst$1 = targetInst;\n lastSelection = null;\n }\n break;\n case 'focusout':\n activeElement$1 = null;\n activeElementInst$1 = null;\n lastSelection = null;\n break;\n case 'mousedown':\n mouseDown = true;\n break;\n case 'contextmenu':\n case 'mouseup':\n case 'dragend':\n mouseDown = false;\n constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\n break;\n case 'selectionchange':\n if (skipSelectionChangeEvent) {\n break;\n }\n case 'keydown':\n case 'keyup':\n constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\n }\n }",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}",
"function handleTopLevelWithPath(bookKeeping) {\n\t\t var path = bookKeeping.nativeEvent.path;\n\t\t var currentNativeTarget = path[0];\n\t\t var eventsFired = 0;\n\t\t for (var i = 0; i < path.length; i++) {\n\t\t var currentPathElement = path[i];\n\t\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t\t currentNativeTarget = path[i + 1];\n\t\t }\n\t\t // TODO: slow\n\t\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t\t if (reactParent === currentPathElement) {\n\t\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t\t bookKeeping.ancestors.push(currentPathElement);\n\t\t\n\t\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t\t eventsFired++;\n\t\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\t\n\t\t // Jump to the root of this React render tree\n\t\t while (currentPathElementID !== newRootID) {\n\t\t i++;\n\t\t currentPathElement = path[i];\n\t\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t\t }\n\t\t }\n\t\t }\n\t\t if (eventsFired === 0) {\n\t\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t\t }\n\t\t}",
"function nH(e){if (window.event){var e = window.event;var elm = e.srcElement;}else{var elm = e.target;};return elm}",
"function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}",
"function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}",
"function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}",
"function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}",
"function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}"
] |
[
"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.58962786",
"0.58962786",
"0.58962786",
"0.58962786",
"0.5895235",
"0.5859332",
"0.5859332",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.5813099",
"0.58021873",
"0.57971543",
"0.57928836",
"0.57919323",
"0.57919323",
"0.57919323",
"0.57919323",
"0.57919323",
"0.57919323",
"0.57919323",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.57887673",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.5763928",
"0.57356447",
"0.5729302",
"0.5720097",
"0.5720097",
"0.5720097",
"0.5720097",
"0.5717909"
] |
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) {\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) {\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) {\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) {\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) {\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) {\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) {\r\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\r\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\r\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\r\n\t}",
"function isKeypressCommand(nativeEvent) {\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) && !(nativeEvent.ctrlKey && nativeEvent.altKey);\n}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n\t return (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}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}",
"function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}"
] |
[
"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.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432",
"0.7977432"
] |
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 getStackAddendumByWorkInProgressFiber(workInProgress){var info='';var node=workInProgress;do{info+=describeFiber(node);// Otherwise this return pointer might point to the wrong tree:\nnode=node.return;}while(node);return info;}",
"function getStackAddendumByWorkInProgressFiber(workInProgress){var info='';var node=workInProgress;do{info+=describeFiber(node);// Otherwise this return pointer might point to the wrong tree:\nnode=node['return'];}while(node);return info;}",
"function getStackAddendumByWorkInProgressFiber(workInProgress){var info='';var node=workInProgress;do{info+=describeFiber(node);// Otherwise this return pointer might point to the wrong tree:\nnode=node['return'];}while(node);return info;}",
"function getStackAddendumByWorkInProgressFiber(workInProgress){var info='';var node=workInProgress;do{info+=describeFiber(node);// Otherwise this return pointer might point to the wrong tree:\nnode=node['return'];}while(node);return info;}",
"function getStackAddendumByWorkInProgressFiber(workInProgress){var info='';var node=workInProgress;do{info+=describeFiber(node);// Otherwise this return pointer might point to the wrong tree:\n\tnode=node['return'];}while(node);return info;}",
"work() {}",
"assignFiberPropertiesInDEV(unitOfWork, originalWorkInProgressCopy);\n\n if (enableProfilerTimer && unitOfWork.mode & ProfileMode) {\n // Reset the profiler timer.\n startProfilerTimer(unitOfWork);\n }",
"function createWorkInProgress(current, pendingProps) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n // Needed because Blocks store data on type.\n workInProgress.type = current.type;\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.flags = NoFlags;\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n workInProgress.childLanes = current.childLanes;\n workInProgress.lanes = current.lanes;\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n // Clone the dependencies object. This is mutated during the render phase, so\n // it cannot be shared with the current fiber.\n var currentDependencies = current.dependencies;\n workInProgress.dependencies = currentDependencies === null ? null : {\n lanes: currentDependencies.lanes,\n firstContext: currentDependencies.firstContext\n };\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n {\n workInProgress._debugNeedsRemount = current._debugNeedsRemount;\n switch (workInProgress.tag) {\n case IndeterminateComponent:\n case FunctionComponent:\n case SimpleMemoComponent:\n workInProgress.type = resolveFunctionForHotReloading(current.type);\n break;\n case ClassComponent:\n workInProgress.type = resolveClassForHotReloading(current.type);\n break;\n case ForwardRef:\n workInProgress.type = resolveForwardRefForHotReloading(current.type);\n break;\n }\n }\n return workInProgress;\n }",
"run(self, cb) {\n const context = this.fiberContext(self);\n context.runAsync(cb || empty);\n }",
"function handleWorkorderProgress(dataIn) {\r\n\t\r\n\tvar fieldsData = dataIn.fieldsData;\r\n\t\r\n\tvar WO_NOT_FOUND = 'Work Order not found';\r\n\tvar WO_NOT_IN_REQUIRED_STATUS = 'Work Order not in required status';\r\n\r\n\tvar tranid = fieldsData['tranid'];\r\n\t\r\n\tvar internalId = getWorkOrderInternalId(tranid);\r\n\t\r\n\tvar allowedStatusesToStart = ['Released', 'In Process', 'Planned'];\r\n\r\n\tif(!internalId) {\r\n\t\t// throw error, show error response, record not exist\r\n\t\t//throw(WO_NOT_FOUND);\r\n\t\tthrow nlapiCreateError('WO_NOT_FOUND', WO_NOT_FOUND,true);\r\n\t}\r\n\tvar statusVal = nlapiLookupField('workorder', internalId, 'status');\r\n\tif(!!statusVal && allowedStatusesToStart.indexOf(statusVal)) {\r\n\t\tvar fields = [];\r\n\t\tvar values = [];\r\n\t\tfor(var key in fieldsData) {\r\n\t\t\tfields.push(key);\r\n\t\t\tvalues.push(fieldsData[key]);\r\n\t\t}\r\n\t\tvar updatefields = nlapiSubmitField('workorder', internalId, fields, values);\r\n\t\t\r\n\t\t// Fetch this work order updated data again with 'listRecordProfessional' and send in response as 'listRecordProfessional' method do usally\r\n\t\tvar listRecordExtendedMethodData = {};\r\n\t\tlistRecordExtendedMethodData.recordType = 'workorder';\r\n\t\tlistRecordExtendedMethodData.pageSize = 999;\r\n\t\tlistRecordExtendedMethodData.filterData = dataIn.filterData;\r\n\t\tlistRecordExtendedMethodData.columnData = dataIn.columnData;\r\n\t\tvar result = listRecordProfessional(listRecordExtendedMethodData);\r\n\t\treturn result;\r\n\t}\r\n\telse {\r\n\t\t// throw error, show error response, wo not is required status\r\n\t\t//throw(WO_NOT_IN_REQUIRED_STATUS);\r\n\t\tthrow nlapiCreateError('WO_NOT_IN_REQUIRED_STATUS', WO_NOT_IN_REQUIRED_STATUS,true);\r\n\t}\r\n\r\n}",
"function handleBegin() {\n task.inProgress = true;\n handleTaskChange(task.id, task);\n }",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n\t var info = '';\n\t var node = workInProgress;\n\t do {\n\t info += describeFiber(node);\n\t // Otherwise this return pointer might point to the wrong tree:\n\t node = node['return'];\n\t } while (node);\n\t return info;\n\t}",
"function inc_busy()\n{\n background_jobs++;\n update_busy_indicator();\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = \"\", node = workInProgress;\n do {\n info += describeFiber(node), // Otherwise this return pointer might point to the wrong tree:\n node = node.return;\n } while (node);\n return info;\n}",
"function upload(work) {\n\tif (working < prop.upload_count) {\n\t\tselect_upload(work);\n\t} else {\n\t\twork.status = 'waiting';\n\t\tqueue.push(work);\n\t}\n}",
"function performUnitOfWork(fiber) {\n const isFunctionComponent =\n fiber.type instanceof Function\n if (isFunctionComponent) {\n updateFunctionComponent(fiber)\n } else {\n updateHostComponent(fiber)\n }\n\n // we return the first child \n // and then if no child siblings\n if (fiber.child) {\n return fiber.child;\n }\n let nextFiber = fiber;\n while (nextFiber) {\n if (nextFiber.sibling) {\n return nextFiber.sibling;\n }\n nextFiber = nextFiber.parent;\n }\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber$1(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"preventSubmitIfAlreadyInProgress() {\n }",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n }",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n}",
"function finalWork(resolve) {\n\tresolve(357);\n}",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n }",
"function getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node['return'];\n } while (node);\n return info;\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"work() {\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 getStackAddendumByWorkInProgressFiber(workInProgress) {\n var info = '';\n var node = workInProgress;\n do {\n info += describeFiber(node);\n // Otherwise this return pointer might point to the wrong tree:\n node = node.return;\n } while (node);\n return info;\n }",
"function startWork() {\n working = true;\n}",
"if (queue === current.updateQueue) {\n queue = workInProgress.updateQueue = cloneUpdateQueue(queue);\n }",
"function markForPostEffect(workInProgress) {\n // Schedule a side-effect on this fiber, AFTER the children's side-effects.\n if (workInProgress.lastEffect) {\n workInProgress.lastEffect.nextEffect = workInProgress;\n } else {\n workInProgress.firstEffect = workInProgress;\n }\n workInProgress.lastEffect = workInProgress;\n }",
"_doWork() {\n throw new Error(\"method not implemented\");\n }",
"function resetWorkInProgress(workInProgress, renderExpirationTime) {\n // This resets the Fiber to what createFiber or createWorkInProgress would\n // have set the values to before during the first pass. Ideally this wouldn't\n // be necessary but unfortunately many code paths reads from the workInProgress\n // when they should be reading from current and writing to workInProgress.\n\n // We assume pendingProps, index, key, ref, return are still untouched to\n // avoid doing another reconciliation.\n\n // Reset the effect tag but keep any Placement tags, since that's something\n // that child fiber is setting, not the reconciliation.\n workInProgress.effectTag &= Placement;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n var current = workInProgress.alternate;\n if (current === null) {\n // Reset to createFiber's initial values.\n workInProgress.childExpirationTime = NoWork;\n workInProgress.expirationTime = renderExpirationTime;\n\n workInProgress.child = null;\n workInProgress.memoizedProps = null;\n workInProgress.memoizedState = null;\n workInProgress.updateQueue = null;\n\n workInProgress.dependencies = null;\n\n if (enableProfilerTimer) {\n // Note: We don't reset the actualTime counts. It's useful to accumulate\n // actual time across multiple render passes.\n workInProgress.selfBaseDuration = 0;\n workInProgress.treeBaseDuration = 0;\n }\n } else {\n // Reset to the cloned values that createWorkInProgress would've.\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // Clone the dependencies object. This is mutated during the render phase, so\n // it cannot be shared with the current fiber.\n var currentDependencies = current.dependencies;\n workInProgress.dependencies = currentDependencies === null ? null : {\n expirationTime: currentDependencies.expirationTime,\n firstContext: currentDependencies.firstContext,\n responders: currentDependencies.responders\n };\n\n if (enableProfilerTimer) {\n // Note: We don't reset the actualTime counts. It's useful to accumulate\n // actual time across multiple render passes.\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n }\n\n return workInProgress;\n}",
"function resetWorkInProgress(workInProgress, renderExpirationTime) {\n // This resets the Fiber to what createFiber or createWorkInProgress would\n // have set the values to before during the first pass. Ideally this wouldn't\n // be necessary but unfortunately many code paths reads from the workInProgress\n // when they should be reading from current and writing to workInProgress.\n\n // We assume pendingProps, index, key, ref, return are still untouched to\n // avoid doing another reconciliation.\n\n // Reset the effect tag but keep any Placement tags, since that's something\n // that child fiber is setting, not the reconciliation.\n workInProgress.effectTag &= Placement;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n var current = workInProgress.alternate;\n if (current === null) {\n // Reset to createFiber's initial values.\n workInProgress.childExpirationTime = NoWork;\n workInProgress.expirationTime = renderExpirationTime;\n\n workInProgress.child = null;\n workInProgress.memoizedProps = null;\n workInProgress.memoizedState = null;\n workInProgress.updateQueue = null;\n\n workInProgress.dependencies = null;\n\n if (enableProfilerTimer) {\n // Note: We don't reset the actualTime counts. It's useful to accumulate\n // actual time across multiple render passes.\n workInProgress.selfBaseDuration = 0;\n workInProgress.treeBaseDuration = 0;\n }\n } else {\n // Reset to the cloned values that createWorkInProgress would've.\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // Clone the dependencies object. This is mutated during the render phase, so\n // it cannot be shared with the current fiber.\n var currentDependencies = current.dependencies;\n workInProgress.dependencies = currentDependencies === null ? null : {\n expirationTime: currentDependencies.expirationTime,\n firstContext: currentDependencies.firstContext,\n responders: currentDependencies.responders\n };\n\n if (enableProfilerTimer) {\n // Note: We don't reset the actualTime counts. It's useful to accumulate\n // actual time across multiple render passes.\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n }\n\n return workInProgress;\n}",
"_reportState(newValue,oldValue){// help avoid initial ready state being null\nif(null!=newValue&&0<this.items.length){this.dispatchEvent(new CustomEvent(\"progress-state-change\",{bubbles:!0,cancelable:!0,composed:!0,detail:{state:this.state,active:this.items[this.active]}}))}}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = 0;\n }\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseTime = current.selfBaseTime;\n workInProgress.treeBaseTime = current.treeBaseTime;\n }\n\n return workInProgress;\n }",
"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\n// so those are false.\nreturn workInProgressRootExitStatus===RootIncomplete;}",
"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\n// so those are false.\nreturn workInProgressRootExitStatus===RootIncomplete;}",
"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\n// so those are false.\nreturn workInProgressRootExitStatus===RootIncomplete;}"
] |
[
"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.544112",
"0.544112",
"0.544112",
"0.5410044",
"0.54094046",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.5400134",
"0.53823966",
"0.5368264",
"0.5368264",
"0.5362769",
"0.5362769",
"0.5362769",
"0.5362769",
"0.5362769",
"0.5362769",
"0.5362769",
"0.5356913",
"0.53558266",
"0.5350873",
"0.5350598",
"0.5345637",
"0.5344623",
"0.5344087",
"0.53420067",
"0.53420067",
"0.5292578",
"0.5285959",
"0.52690196",
"0.52690196",
"0.52690196"
] |
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(propertyInfo.hasOverloadedBooleanValue){if(node.hasAttribute(attributeName)){var value=node.getAttribute(attributeName);if(value===''){return true;}if(shouldIgnoreValue(propertyInfo,expected)){return value;}if(value===''+expected){return expected;}return value;}}else if(node.hasAttribute(attributeName)){if(shouldIgnoreValue(propertyInfo,expected)){// We had an attribute but shouldn't have had one, so read it\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.hasBooleanValue){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldIgnoreValue(propertyInfo,expected)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}}",
"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(propertyInfo.hasOverloadedBooleanValue){if(node.hasAttribute(attributeName)){var value=node.getAttribute(attributeName);if(value===''){return true;}if(shouldIgnoreValue(propertyInfo,expected)){return value;}if(value===''+expected){return expected;}return value;}}else if(node.hasAttribute(attributeName)){if(shouldIgnoreValue(propertyInfo,expected)){// We had an attribute but shouldn't have had one, so read it\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.hasBooleanValue){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldIgnoreValue(propertyInfo,expected)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}}",
"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(propertyInfo.hasOverloadedBooleanValue){if(node.hasAttribute(attributeName)){var value=node.getAttribute(attributeName);if(value===''){return true;}if(shouldIgnoreValue(propertyInfo,expected)){return value;}if(value===''+expected){return expected;}return value;}}else if(node.hasAttribute(attributeName)){if(shouldIgnoreValue(propertyInfo,expected)){// We had an attribute but shouldn't have had one, so read it\n\t// for the error message.\n\treturn node.getAttribute(attributeName);}if(propertyInfo.hasBooleanValue){// If this was a boolean, it doesn't matter what the value is\n\t// the fact that we have it is the same as the expected.\n\treturn expected;}// Even if this property uses a namespace we use getAttribute\n\t// because we assume its namespaced name is the same as our config.\n\t// To use getAttributeNS we need the local name which we don't have\n\t// in our config atm.\n\tstringValue=node.getAttribute(attributeName);}if(shouldIgnoreValue(propertyInfo,expected)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected) {\n\t {\n\t var propertyInfo = getPropertyInfo(name);\n\t if (propertyInfo) {\n\t var mutationMethod = propertyInfo.mutationMethod;\n\t if (mutationMethod || propertyInfo.mustUseProperty) {\n\t return node[propertyInfo.propertyName];\n\t } else {\n\t var attributeName = propertyInfo.attributeName;\n\t\n\t var stringValue = null;\n\t\n\t if (propertyInfo.hasOverloadedBooleanValue) {\n\t if (node.hasAttribute(attributeName)) {\n\t var value = node.getAttribute(attributeName);\n\t if (value === '') {\n\t return true;\n\t }\n\t if (shouldIgnoreValue(propertyInfo, expected)) {\n\t return value;\n\t }\n\t if (value === '' + expected) {\n\t return expected;\n\t }\n\t return value;\n\t }\n\t } else if (node.hasAttribute(attributeName)) {\n\t if (shouldIgnoreValue(propertyInfo, expected)) {\n\t // We had an attribute but shouldn't have had one, so read it\n\t // for the error message.\n\t return node.getAttribute(attributeName);\n\t }\n\t if (propertyInfo.hasBooleanValue) {\n\t // If this was a boolean, it doesn't matter what the value is\n\t // the fact that we have it is the same as the expected.\n\t return expected;\n\t }\n\t // Even if this property uses a namespace we use getAttribute\n\t // because we assume its namespaced name is the same as our config.\n\t // To use getAttributeNS we need the local name which we don't have\n\t // in our config atm.\n\t stringValue = node.getAttribute(attributeName);\n\t }\n\t\n\t if (shouldIgnoreValue(propertyInfo, expected)) {\n\t return stringValue === null ? expected : stringValue;\n\t } else if (stringValue === '' + expected) {\n\t return expected;\n\t } else {\n\t return stringValue;\n\t }\n\t }\n\t }\n\t }\n\t}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected) {\n {\n var propertyInfo = getPropertyInfo(name);\n if (propertyInfo) {\n var mutationMethod = propertyInfo.mutationMethod;\n if (mutationMethod || propertyInfo.mustUseProperty) {\n return node[propertyInfo.propertyName];\n } else {\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.hasOverloadedBooleanValue) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldIgnoreValue(propertyInfo, expected)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.hasBooleanValue) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldIgnoreValue(propertyInfo, expected)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }\n}",
"function getValueForProperty(node,name,expected,propertyInfo){{if(propertyInfo.mustUseProperty){var propertyName=propertyInfo.propertyName;return node[propertyName];}else{if(propertyInfo.sanitizeURL){// If we haven't fully disabled javascript: URLs, and if\n// the hydration is successful of a javascript: URL, we\n// still want to warn on the client.\nsanitizeURL(''+expected);}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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"function getValueForProperty(node,name,expected,propertyInfo){{if(propertyInfo.mustUseProperty){var propertyName=propertyInfo.propertyName;return node[propertyName];}else{if(propertyInfo.sanitizeURL){// If we haven't fully disabled javascript: URLs, and if\n// the hydration is successful of a javascript: URL, we\n// still want to warn on the client.\nsanitizeURL(''+expected);}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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"function getValueForProperty(node,name,expected,propertyInfo){{if(propertyInfo.mustUseProperty){var propertyName=propertyInfo.propertyName;return node[propertyName];}else{if(propertyInfo.sanitizeURL){// If we haven't fully disabled javascript: URLs, and if\n// the hydration is successful of a javascript: URL, we\n// still want to warn on the client.\nsanitizeURL(''+expected);}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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"function getValueForProperty(node,name,expected,propertyInfo){{if(propertyInfo.mustUseProperty){var propertyName=propertyInfo.propertyName;return node[propertyName];}else{if(propertyInfo.sanitizeURL){// If we haven't fully disabled javascript: URLs, and if\n// the hydration is successful of a javascript: URL, we\n// still want to warn on the client.\nsanitizeURL(''+expected);}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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"function getValueForProperty(node,name,expected,propertyInfo){{if(propertyInfo.mustUseProperty){var propertyName=propertyInfo.propertyName;return node[propertyName];}else {if(propertyInfo.sanitizeURL){// If we haven't fully disabled javascript: URLs, and if\n// the hydration is successful of a javascript: URL, we\n// still want to warn on the client.\nsanitizeURL(''+expected);}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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else {return stringValue;}}}}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if ( propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (\n shouldRemoveAttribute(\n name,\n expected,\n propertyInfo,\n false,\n )\n ) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (\n shouldRemoveAttribute(name, expected, propertyInfo, false)\n ) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (\n shouldRemoveAttribute(name, expected, propertyInfo, false)\n ) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"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\n// for the error message.\nreturn node.getAttribute(attributeName);}if(propertyInfo.type===BOOLEAN){// If this was a boolean, it doesn't matter what the value is\n// the fact that we have it is the same as the expected.\nreturn expected;}// Even if this property uses a namespace we use getAttribute\n// because we assume its namespaced name is the same as our config.\n// To use getAttributeNS we need the local name which we don't have\n// in our config atm.\nstringValue=node.getAttribute(attributeName);}if(shouldRemoveAttribute(name,expected,propertyInfo,false)){return stringValue===null?expected:stringValue;}else if(stringValue===''+expected){return expected;}else{return stringValue;}}}}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n\n if (value === '') {\n return true;\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n } // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n\n\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n return node[propertyName];\n } else {\n if (propertyInfo.sanitizeURL) // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n var attributeName = propertyInfo.attributeName;\n var stringValue = null;\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') return true;\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) return value;\n if (value === '' + expected) return expected;\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n if (propertyInfo.type === BOOLEAN) // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) return stringValue === null ? expected : stringValue;\n else if (stringValue === '' + expected) return expected;\n else return stringValue;\n }\n }",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}",
"function getValueForProperty(node, name, expected, propertyInfo) {\n {\n if (propertyInfo.mustUseProperty) {\n var propertyName = propertyInfo.propertyName;\n\n return node[propertyName];\n } else {\n if (!disableJavaScriptURLs && propertyInfo.sanitizeURL) {\n // If we haven't fully disabled javascript: URLs, and if\n // the hydration is successful of a javascript: URL, we\n // still want to warn on the client.\n sanitizeURL('' + expected);\n }\n\n var attributeName = propertyInfo.attributeName;\n\n var stringValue = null;\n\n if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n if (node.hasAttribute(attributeName)) {\n var value = node.getAttribute(attributeName);\n if (value === '') {\n return true;\n }\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return value;\n }\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n } else if (node.hasAttribute(attributeName)) {\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n // We had an attribute but shouldn't have had one, so read it\n // for the error message.\n return node.getAttribute(attributeName);\n }\n if (propertyInfo.type === BOOLEAN) {\n // If this was a boolean, it doesn't matter what the value is\n // the fact that we have it is the same as the expected.\n return expected;\n }\n // Even if this property uses a namespace we use getAttribute\n // because we assume its namespaced name is the same as our config.\n // To use getAttributeNS we need the local name which we don't have\n // in our config atm.\n stringValue = node.getAttribute(attributeName);\n }\n\n if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n return stringValue === null ? expected : stringValue;\n } else if (stringValue === '' + expected) {\n return expected;\n } else {\n return stringValue;\n }\n }\n }\n}"
] |
[
"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.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.79334545",
"0.79334545",
"0.79334545",
"0.79334545",
"0.7925724",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7898985",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.7889167",
"0.78776294",
"0.78775764",
"0.7872438",
"0.7872438",
"0.7872438",
"0.7872438",
"0.7861001",
"0.7851836",
"0.7851836",
"0.7851836",
"0.7851836",
"0.7851836",
"0.7851836",
"0.78316855",
"0.78292364",
"0.78292364"
] |
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(!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(!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(!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(!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(!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(!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(!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(!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(!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(!isAttributeNameSafe(name)){return;}// If the object is an opaque reference ID, it's expected that\n// the next prop is different than the server value, so just return\n// expected\nif(isOpaqueHydratingObject(expected)){return expected;}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(!isAttributeNameSafe(name)){return;}// If the object is an opaque reference ID, it's expected that\n// the next prop is different than the server value, so just return\n// expected\nif(isOpaqueHydratingObject(expected)){return expected;}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) {\n if (!isAttributeNameSafe(name)) return;\n // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n if (isOpaqueHydratingObject(expected)) return expected;\n if (!node.hasAttribute(name)) return expected === undefined ? undefined : null;\n var value = node.getAttribute(name);\n if (value === '' + expected) return expected;\n return value;\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n}",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n }\n // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n var value = node.getAttribute(name);\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n } // If the object is an opaque reference ID, it's expected that\n // the next prop is different than the server value, so just return\n // expected\n\n\n if (isOpaqueHydratingObject(expected)) {\n return expected;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n }\n\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n\n var value = node.getAttribute(name);\n\n if (value === '' + expected) {\n return expected;\n }\n\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n }\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n var value = node.getAttribute(name);\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n }\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n var value = node.getAttribute(name);\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n }",
"function getValueForAttribute(node, name, expected) {\n {\n if (!isAttributeNameSafe(name)) {\n return;\n }\n if (!node.hasAttribute(name)) {\n return expected === undefined ? undefined : null;\n }\n var value = node.getAttribute(name);\n if (value === '' + expected) {\n return expected;\n }\n return value;\n }\n }"
] |
[
"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.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.731567",
"0.72648305",
"0.72648305",
"0.72648305",
"0.72648305",
"0.7088294",
"0.70654756",
"0.70654756",
"0.70654756"
] |
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 props.onChangeCallback.bind(\n this.groupName,\n this.value);\n }\n if (props.checked === true) {\n this.optional.defaultChecked = true;\n }\n }",
"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;}",
"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;}",
"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;}",
"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;}",
"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;}",
"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;}",
"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;}",
"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;}",
"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;}",
"function CheckboxBase(props, context) {\n var _this = _super.call(this, props, context) || this;\n _this._checkBox = React.createRef();\n _this._onFocus = function (ev) {\n var inputProps = _this.props.inputProps;\n if (inputProps && inputProps.onFocus) {\n inputProps.onFocus(ev);\n }\n };\n _this._onBlur = function (ev) {\n var inputProps = _this.props.inputProps;\n if (inputProps && inputProps.onBlur) {\n inputProps.onBlur(ev);\n }\n };\n _this._onChange = function (ev) {\n var _a = _this.props, disabled = _a.disabled, onChange = _a.onChange;\n var _b = _this.state, isChecked = _b.isChecked, isIndeterminate = _b.isIndeterminate;\n if (!disabled) {\n if (!isIndeterminate) {\n if (onChange) {\n onChange(ev, !isChecked);\n }\n if (_this.props.checked === undefined) {\n _this.setState({ isChecked: !isChecked });\n }\n }\n else {\n if (onChange) {\n onChange(ev, isChecked);\n }\n if (_this.props.indeterminate === undefined) {\n _this.setState({ isIndeterminate: false });\n }\n }\n }\n };\n _this._onRenderLabel = function (props) {\n var label = props.label;\n return label ? (React.createElement(\"span\", { \"aria-hidden\": \"true\", className: _this._classNames.text }, label)) : null;\n };\n Utilities_1.initializeComponentRef(_this);\n if (process.env.NODE_ENV !== 'production') {\n Utilities_1.warnMutuallyExclusive('Checkbox', props, {\n checked: 'defaultChecked',\n indeterminate: 'defaultIndeterminate'\n });\n }\n _this._id = _this.props.id || Utilities_1.getId('checkbox-');\n _this.state = {\n isChecked: !!(props.checked !== undefined ? props.checked : props.defaultChecked),\n isIndeterminate: !!(props.indeterminate !== undefined ? props.indeterminate : props.defaultIndeterminate)\n };\n Utilities_1.initializeFocusRects();\n return _this;\n }",
"function CheckboxBase(props, context) {\n var _this = _super.call(this, props, context) || this;\n _this._checkBox = Object(__WEBPACK_IMPORTED_MODULE_2__Utilities__[\"B\" /* createRef */])();\n _this._onFocus = function (ev) {\n var inputProps = _this.props.inputProps;\n if (inputProps && inputProps.onFocus) {\n inputProps.onFocus(ev);\n }\n };\n _this._onBlur = function (ev) {\n var inputProps = _this.props.inputProps;\n if (inputProps && inputProps.onBlur) {\n inputProps.onBlur(ev);\n }\n };\n _this._onClick = function (ev) {\n var _a = _this.props, disabled = _a.disabled, onChange = _a.onChange;\n var isChecked = _this.state.isChecked;\n ev.preventDefault();\n ev.stopPropagation();\n if (!disabled) {\n if (onChange) {\n onChange(ev, !isChecked);\n }\n if (_this.props.checked === undefined) {\n _this.setState({ isChecked: !isChecked });\n }\n }\n };\n _this._onRenderLabel = function (props) {\n var label = props.label;\n return label ? __WEBPACK_IMPORTED_MODULE_1_react__[\"createElement\"](\"span\", { className: _this._classNames.text }, label) : null;\n };\n _this._warnMutuallyExclusive({\n checked: 'defaultChecked'\n });\n _this._id = Object(__WEBPACK_IMPORTED_MODULE_2__Utilities__[\"Z\" /* getId */])('checkbox-');\n _this.state = {\n isChecked: !!(props.checked !== undefined ? props.checked : props.defaultChecked)\n };\n return _this;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n\n return hostProps;\n }",
"function Toggle(props) {\n var size = props.size,\n children = props.children,\n value = props.value,\n onChange = props.onChange,\n defaultChecked = props.defaultChecked,\n controlledChecked = props.checked,\n disabled = props.disabled,\n className = props.className;\n var isControlled = !(0,_shared_helpers_js__WEBPACK_IMPORTED_MODULE_2__.isNil)(controlledChecked);\n\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_0__.useState)(defaultChecked),\n _useState2 = (0,_virtual_rollupPluginBabelHelpers_js__WEBPACK_IMPORTED_MODULE_4__.slicedToArray)(_useState, 2),\n checked = _useState2[0],\n setChecked = _useState2[1];\n\n var isChecked = isControlled ? controlledChecked : checked;\n\n var _useState3 = (0,react__WEBPACK_IMPORTED_MODULE_0__.useState)(false),\n _useState4 = (0,_virtual_rollupPluginBabelHelpers_js__WEBPACK_IMPORTED_MODULE_4__.slicedToArray)(_useState3, 2),\n animatingPress = _useState4[0],\n setAnimatingPress = _useState4[1];\n\n var _usePress = (0,_hooks_js__WEBPACK_IMPORTED_MODULE_5__.usePress)({\n onPress: function onPress() {\n return setAnimatingPress(true);\n },\n disabled: disabled\n }),\n isPressed = _usePress.isPressed,\n pressProps = _usePress.pressProps;\n\n (0,_shared_hooks_useUpdateLayoutEffect_js__WEBPACK_IMPORTED_MODULE_6__.default)(function () {\n setAnimatingPress(true);\n }, [isChecked]);\n\n function handleChange(evt) {\n onChange(evt, evt.target.checked);\n\n if (!evt.defaultPrevented && !isControlled) {\n setChecked(evt.target.checked);\n }\n }\n\n return (\n /*#__PURE__*/\n // eslint-disable-next-line jsx-a11y/label-has-for, jsx-a11y/label-has-associated-control\n react__WEBPACK_IMPORTED_MODULE_0___default().createElement(\"label\", (0,_virtual_rollupPluginBabelHelpers_js__WEBPACK_IMPORTED_MODULE_4__.extends)({\n className: (0,_node_modules_classnames_index_js__WEBPACK_IMPORTED_MODULE_7__.default)(className, cn({\n pointed: !disabled\n }))\n }, pressProps), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0___default().createElement(_VisuallyHidden_index_js__WEBPACK_IMPORTED_MODULE_8__.default, null, /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0___default().createElement(\"input\", {\n type: \"checkbox\",\n value: value,\n disabled: disabled,\n checked: isChecked,\n onChange: handleChange\n })), children, /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0___default().createElement(_components_Indicator_js__WEBPACK_IMPORTED_MODULE_9__.default, {\n setAnimatingPress: setAnimatingPress,\n animatingPress: animatingPress || isPressed,\n disabled: disabled,\n isChecked: isChecked,\n size: size\n }))\n );\n}",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked:\n checked != null ? checked : node._wrapperState.initialChecked,\n });\n\n return hostProps;\n }",
"_changeCheckState(optionalValue) {\n const that = this;\n let oldValue = that.checked;\n\n if ((oldValue === null) && (optionalValue !== undefined)) {\n that.$.fireEvent('change', { 'value': optionalValue, 'oldValue': null });\n that.checked = optionalValue;\n that._updateThumbPosition();\n return;\n }\n\n if (that.checked === null) {\n that.checked = true;\n }\n else {\n that.checked = !that.checked;\n }\n\n that._updateThumbPosition();\n\n that.$.fireEvent('change', { 'value': that.checked, 'oldValue': oldValue });\n that._updateHidenInputNameAndValue();\n }",
"function useCheckboxGroup(props) {\n if (props === void 0) {\n props = {};\n }\n\n var _props = props,\n defaultValue = _props.defaultValue,\n valueProp = _props.value,\n onChangeProp = _props.onChange,\n isNative = _props.isNative;\n\n var _useState = (0, _react.useState)(defaultValue || []),\n valueState = _useState[0],\n setValue = _useState[1];\n\n var _useControllableProp = (0, _hooks.useControllableProp)(valueProp, valueState),\n isControlled = _useControllableProp[0],\n value = _useControllableProp[1];\n\n var updateValue = (0, _react.useCallback)(function (nextState) {\n if (!isControlled) {\n setValue(nextState);\n }\n\n onChangeProp == null ? void 0 : onChangeProp(nextState);\n }, [isControlled, onChangeProp]);\n var onChange = (0, _react.useCallback)(function (eventOrValue) {\n if (!value) return;\n var isChecked = (0, _utils.isInputEvent)(eventOrValue) ? eventOrValue.target.checked : !value.includes(eventOrValue);\n var selectedValue = (0, _utils.isInputEvent)(eventOrValue) ? eventOrValue.target.value : eventOrValue;\n var nextValue = isChecked ? (0, _utils.addItem)(value, selectedValue) : (0, _utils.removeItem)(value, selectedValue);\n updateValue(nextValue);\n }, [updateValue, value]);\n return {\n value: value,\n onChange: onChange,\n setValue: updateValue,\n getCheckboxProps: function getCheckboxProps(props) {\n var _extends2;\n\n if (props === void 0) {\n props = {};\n }\n\n var checkedKey = isNative ? \"checked\" : \"isChecked\";\n return _extends({}, props, (_extends2 = {}, _extends2[checkedKey] = value.includes(props.value), _extends2.onChange = onChange, _extends2));\n }\n };\n}",
"function Checkbox({value, title, onClick}) {\n return <Wrapper onClick={onClick}>\n <Indicator value={value} />\n {title}\n </Wrapper>\n}",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n var hostProps = _assign({}, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n return hostProps;\n }",
"function getHostProps(element, props) {\n var node = element;\n var checked = props.checked;\n var hostProps = _assign({\n }, props, {\n defaultChecked: undefined,\n defaultValue: undefined,\n value: undefined,\n checked: checked != null ? checked : node._wrapperState.initialChecked\n });\n return hostProps;\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.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.61306286",
"0.6110397",
"0.6086774",
"0.604147",
"0.60363597",
"0.60111445",
"0.59502697"
] |
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 setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||getActiveElement(node.ownerDocument)!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||getActiveElement(node.ownerDocument)!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=''+node._wrapperState.initialValue;}else if(node.defaultValue!==''+value){node.defaultValue=''+value;}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=''+node._wrapperState.initialValue;}else if(node.defaultValue!==''+value){node.defaultValue=''+value;}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node,type,value){if(// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\ntype!=='number'||node.ownerDocument.activeElement!==node){if(value==null){node.defaultValue=toString(node._wrapperState.initialValue);}else if(node.defaultValue!==toString(value)){node.defaultValue=toString(value);}}}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if (// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' ||\n node.ownerDocument.activeElement !== node\n ) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n }\n else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function handleEmtpyValue(defaultMsg){\n if(oSetting.defaultIfEmpty && !currentElem.val()){\n currentElem.val(oSetting.defaultIfEmpty);\n return;\n }\n\n //set default value if it exist\n if(oSetting.defaultValue){\n currentElem.val(oSetting.defaultValue);\n return;\n }\n\n currentElem.addClass(oParams.errorInputCssClass);\n\n if(!oSetting.errorMsg){\n oSetting.errorMsg= defaultMsg;\n }\n oErrors=oErrors+(oSetting.errorMsg);\n allTrue=false;\n if(!firstErrorElem){\n firstErrorElem = oSetting.selector;\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}"
] |
[
"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.6374127",
"0.6374127",
"0.6374127",
"0.6374127",
"0.6373183",
"0.63599557",
"0.63395125",
"0.6309041",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6306426",
"0.6299643",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.6295297",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246",
"0.62905246"
] |
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}",
"change() { }",
"function onChange() {\n\t\t__debug_330( 'Received a change event.' );\n\t\tself.render();\n\t}",
"function onChange() {\n\t\t/* eslint-disable no-underscore-dangle */\n\t\t__debug_730( 'Received a change event.' );\n\t\tif ( self._autoRender ) {\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t/* eslint-disable no-underscore-dangle */\n\t\t__debug_259( 'Received a change event.' );\n\t\tif ( self._autoRender ) {\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t/* eslint-disable no-underscore-dangle */\n\t\t__debug_596( 'Received a change event.' );\n\t\tif ( self._autoRender ) {\n\t\t\tself.render();\n\t\t}\n\t}",
"handleChange(event) {\n\n }",
"handleEventChange() {\n }",
"function onChange() {\n\t\t__debug_587( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_520( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_488( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_475( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_412( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_429( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_457( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_332( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_577( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"function onChange() {\n\t\t__debug_395( 'Received a change event.' );\n\t\tif ( self._autoRender ) { // eslint-disable-line no-underscore-dangle\n\t\t\tself.render();\n\t\t}\n\t}",
"handleChange (event) {\n }",
"onChanged(e){}",
"function onChangeHandler(e) {\n\n }",
"function onChangeHandler(e) {\n\n }",
"function changeFunction() {\n\tconsole.log(\"onchange\");\n}",
"function handleChange(ev) {\n\n switch (ev.name) {\n case \"duration\":\n handleDurationChange(ev);\n break;\n case \"type\":\n handleTypeChange(ev);\n break;\n case \"unit\":\n handleUnitChange(ev);\n break;\n case \"display\":\n handleDisplayChange(ev);\n break;\n }\n}",
"handleChange(event){\n changeHandler(event,this);\n }",
"function onChange() {\n console.log(\"something changed...\");\n \n }",
"changeFn(event) {\n var fileList = event.__files_ || (event.target && event.target.files);\n if (!fileList)\n return;\n this.stopEvent(event);\n this.handleFiles(fileList);\n }",
"handleChange(event) {\n let elemName = event.target.name;\n let value = event.target.value;\n //reason picklist is selected\n if (elemName === \"reasonCombo\"){\n this.objInputFields.sReason = value;\n this.reasonSelected = true;\n }\n //comment text area is selected\n else if (elemName === \"commentField\"){\n this.objInputFields.sComment = value;\n } \n \n //this.sReason = event.target.value;\n //this.reasonSelected = true;\n this.bFormEdited = true;\n }",
"function changeEvent() {\n var value_sub = properties.value;\n trigger_param_list.push(value_sub);\n // 'seek' event is like a forced-change event\n $pebble_slider_object.triggerHandler('seek', trigger_param_list);\n if (prev_change_value !== value_sub) {\n $pebble_slider_object.triggerHandler('change', trigger_param_list);\n prev_change_value = value_sub;\n }\n trigger_param_list.length = 0;\n }",
"handleChange() {\r\n var e = document.getElementById(\"selection\")\r\n // call passed in function to spawn any necessary actions on the parent component.\r\n this.props.sendChange(e.value)\r\n }",
"function changeEvent(event){\n setTipo(event.target.value);\n x = unidades.transformar_lista_longitud(x, old_unit.ds_Longitud, usr_unit.ds_Longitud);\n old_unit.ds_Longitud = usr_unit.ds_Longitud;\n usr_unit.ds_Longitud = event.target.value;\n setValor(unidades.transformar_unidad_longitud(total,old_unit.ds_Longitud, usr_unit.ds_Longitud));\n setTotal(unidades.transformar_unidad_longitud(total,old_unit.ds_Longitud, usr_unit.ds_Longitud));\n setValor4(unidades.transformar_unidad_longitud(valor4,old_unit.ds_Longitud, usr_unit.ds_Longitud));\n usr_unit.saveConfig(\"1\");\n }",
"function handleChange(event) {\n switch (event.target.name) {\n case \"degree\":\n setDegree(event.target.value);\n break;\n case \"major\":\n setMajor(event.target.value);\n break;\n case \"organization\":\n setOrganization(event.target.value);\n break;\n default:\n break;\n }\n }",
"function handleChanged(event) {\n console.log(event.target.value);\n setName(event.target.value);\n }",
"function handleChange(editor, data, value) {\n onChange(value);\n }",
"function handleChange(editor, data, value) {\n onChange(value);\n }",
"onChange () {}",
"onChange () {}",
"function handleChange(event, newValue) {\n setValue(newValue);\n }",
"handleChange(e) {\n e.stopPropagation();\n const value = this.getInputEl().value;\n this.model.set({ value }, { fromInput: 1 });\n this.elementUpdated();\n }",
"on_change(event)\n\t{\n\t\t// Extract `value` from the argument\n\t\t// of this `onChange` listener\n\t\t// (for convenience)\n\n\t\tlet value = event\n\n\t\tif (event.target !== undefined)\n\t\t{\n\t\t\tvalue = event.target.value\n\t\t}\n\n\t\t// Call the parent `onChange` handler\n\t\t// with the `value` as an argument\n\t\t// (for convenience)\n\n\t\tconst { onChange } = this.props\n\n\t\tonChange(value)\n\t}",
"handleChange(e) {\n switch(e.target.name){\n case \"numLines\":\n this.props.updateDefinitionsNumLines(e.target.value);\n break;\n case \"extraspace\":\n this.props.updateDefinitionsExtraSpace(e.target.checked);\n break;\n case \"addHowToSolve\":\n this.props.updateAddHowToSolve(e.target.checked);\n break;\n case \"listType\":\n this.props.updateListType(e.target.value);\n break;\n default:\n break;\n }\n }",
"function handleChange(e) {\n const value = e.target.value;\n const name = e.target.name;\n dispatch({ value: value, update: name });\n }",
"onChange(callback) {\n this.events.change.push({ callback });\n }",
"onChange() {\n triggerEvent(this.input, 'input');\n triggerEvent(this.input, 'change');\n }",
"function optionChanged(){\n init();\n}",
"function handleFieldChange(name, value) {\n console.log('handle field change', name, value);\n}",
"function changeHandler(e){ //tuntuu redundantilta, vois poistaa myöhemmin emt.\n //console.log(e.target)\n //e.preventDefault();\n if(e.target.type === \"file\"){\n setFormObjects({\n ...FormObjects,\n [e.target.name]: [(e.target.value).match(/[^\\\\/]*$/)[0]]\n })\n }\n else{\n setFormObjects({\n ...FormObjects,\n [e.target.name]: [e.target.value]\n })\n }\n setChanges(true)\n }",
"change(fn, options) {\n\t\treturn this.on({ change: fn }, options);\n\t}",
"change(fn, options) {\n\t\treturn this.on({ change: fn }, options);\n\t}",
"handleTechChange(e) {\n console.log(\"tech name change:\" + e.target.value);\n }",
"handleChange() {\n this.$emit(\"change\");\n }",
"handleChange() {\n this.$emit(\"change\");\n }",
"change() {\n\n const divs = this.parent.querySelectorAll('[class^=\"toggle-select-\"],[class*=\" toggle-select-\"]');\n const selectOption = this.select.options[this.select.selectedIndex];\n let value;\n\n if(this.options.field == 'group')\n {\n value = selectOption.parentNode.label ? selectOption.parentNode.label.toLowerCase() : null;\n } else {\n value = selectOption.value;\n }\n\n // Toggle each div\n divs.forEach(div => {\n const isVisible = div.classList.contains('toggle-select-'+value);\n const inputs = div.querySelectorAll('select,textarea,input:not([type=\"hidden\"],[type=\"checkbox\"],[type=\"radio\"])');\n\n // Toggle the visible div\n isVisible ? div.classList.remove('d-none') : div.classList.add('d-none');\n\n // Toggle the inputs\n if(inputs)\n {\n this.toggleForm(inputs,isVisible);\n }\n\n });\n\n // Run the custom callback\n this.options.onChanged(value);\n\n }",
"function optionChanged(id) {\n\n getData(id);\n}",
"function handleChange(event, value) {\n setValue(value);\n }",
"function optionChanged(id) {\n getData(id);\n}",
"_setOnChanges(){\n\t\tthis.inputs.forEach(i => i.addEventListener('change', this._onChange.bind(this)));\t\n\t}",
"onChange(item) {}",
"handleChange(e) {\n\t\tif (e.target.type === 'checkbox') {\n\t\t\tthis.props.updateSetting(e.target.name, e.target.checked)\n\t\t} else {\n\t\t\te.preventDefault()\n\t\t\tthis.props.updateSetting(e.target.name, e.target.value)\n\t\t}\n\t}",
"handleChange () {\n this.props.onStatusChange(\n this.props.item.id,\n this.refs.checkbox.checked ? 'RESERVED' : 'NEW'\n );\n }",
"handleChange (changeEvent){\n\t\tthis.setState({\n\t\t\tselectedOption : changeEvent.target.value\n\t\t});\n\t}",
"function optionChanged(changed){\n charts(changed);\n metadata(changed);\n}",
"function handleChange(event) {\n //event.preventDefault()\n \n if(!event.target.value){\n console.log('Input limpio');\n setValue('limpio');\n }\n setValue(event.target.value);\n \n \n\n }",
"function shouldUseChangeEvent(elem){return elem.nodeName==='SELECT'||elem.nodeName==='INPUT'&&elem.type==='file';}",
"function onChange(event)\n\t{\n\t\tconst val = event.target.value\n\t\tsetValue(val)\n\t}",
"dispatchChange() {\n this.toggleAttribute(\"empty\", !this.value);\n this.dispatchEvent(new CustomEvent(\"change\", { bubbles: true }));\n }",
"function handleDomEvent () {\n\t \tthis._ractive.binding.handleChange();\n\t }",
"function onChange(e) {\n setValue(e.target.value);\n }",
"function onChange(change) {\r\n\t\t//split up the path to get the file name\r\n\t\tvar splitUpPath = change.path.split('/');\r\n\r\n\t\t//log the file detected\r\n\t\tconsole.log('\"' + splitUpPath[splitUpPath.length - 1] + '\" was ' + change.type);\r\n\t}",
"function handleEventFieldChange(event) {\n console.log('handle field change', event);\n}",
"function onChange() {\n\n // hide and show input elements for which this is necessary\n setVisibility();\n\n // update preview considering the changed input value\n updatePreview();\n\n // perform change actions\n self.onchange && self.onchange( self );\n\n }",
"function onChange() {\n\n // hide and show input elements for which this is necessary\n setVisibility();\n\n // update preview considering the changed input value\n updatePreview();\n\n // perform change actions\n self.onchange && self.onchange( self );\n\n }",
"function changeHandler(){\n\n // shortcut\n const $this = $(this);\n\n // set value in slider\n if( $this.data('type') == 'min' ) {\n $els.sliderCont.slider( 'values', 0, $this.val() );\n } else {\n $els.sliderCont.slider( 'values', 1, $this.val() );\n }\n\n }",
"function handleChange(e) {\n\t\tsetNewData({\n\t\t\t...newData,\n\t\t\t[e.target.name]: e.target.value,\n\t\t})\n\t}",
"function shouldUseChangeEvent(elem){return elem.nodeName === 'SELECT' || elem.nodeName === 'INPUT' && elem.type === 'file';}",
"function handleChangeType(event){\n const {name, value} = event.currentTarget\n changeFilde(name, value);\n}",
"function changed() {\n\t\t\t\t\t_dispatchEvent(_this, rootEl, 'change', target, el, rootEl, oldIndex, _index(dragEl, options.draggable), evt);\n\t\t\t\t}",
"_evtChange(event) { }",
"handleChangeInLookup(event){\n //Show spinner : wire will hide the spinner at the end\n this.isLoading = true;\n var value = event.detail.value.length>0?event.detail.value[0]:BLANK_STRING;\n //set the value based on the lookup changed\n switch (event.detail.source) {\n case MANAGER_LOOKUP:\n this.selectedManager = value;\n break;\n case USER_LOOKUP:\n this.selectedUser = value;\n break;\n case PROJECT_LOOKUP:\n this.selectedProject = value;\n break;\n default:\n console.log('Invalid Field');\n break;\n }\n }",
"function handleChange(){\n\t\t\t// Error handles\n\t\t\tif(xhr.readyState === this.DONE && xhr.status !== 200){\n\t\t\t\tconsole.log('check yoself');\n\t\t\t}\n\t\t\t// success handles\n\t\t\tif(xhr.readyState === this.DONE && xhr.status === 200){\n\t\t\t\tcallback(xhr.response);\n\t\t\t}\n\n\t\t}",
"onChange(event){\n this.props.onchange({target:{name:this.props.hNode.propertyName, value: event.target.checked}});\n }",
"function onChange() {\n if (input.get.call(element, valueField) !== observer.oldValue && !element.readOnly) {\n observer.set(input.get.call(element, valueField));\n }\n }",
"function optionChanged(id) {\n charting(id);\n meta(id);\n}// change(id)",
"change(e){\n this.props.onChange(e);\n }",
"onChange(callback) {\n\t\tthis.changeCallback = callback;\n\t}",
"variantChange(event) {\n this.variant = event.target.value;\n this.sname = event.target.name;\n\n // Publish Lightning Message via channel ListSelectorMessageChannel__c\n let message = {variantValue: this.variant};\n publish(this.messageContext, LISTMC, message);\n }",
"function handleChange(e, func) {\n const {value} = e.target;\n console.log(e.target.id,\":\",value);\n func(value);\n }",
"function handleChange(event) {\n // console.log(event.target.value)\n switch (event.target.name) {\n case \"name\":\n setName(event.target.value);\n break;\n case \"location\":\n setLocation(event.target.value);\n break;\n case \"phone\":\n setPhone(event.target.value);\n break;\n default:\n break;\n }\n }",
"_triggerChange (e) {\n var args = [this.getValue(), this.getFormElement(), this.getUIElement()];\n if (e) {\n args.push(e);\n }\n if (this.options.onChange) {\n this.options.onChange.apply(this, args);\n }\n }",
"addChangeListener(callback) {\n this.on('change', callback);\n }",
"handleChange(e) {\n const elem = e.target;\n // Check that the event was triggered by the right <select> button.\n if ((\" \" + elem.className + \" \" ).indexOf( \" \" + this.props.seqLenClass + \" \" ) > -1) {\n // Call render and override the charsPerLine setting with whatever the user specified.\n this.callRender({charsPerLine: elem.value});\n }\n }",
"handleChange(e) {\r\n // Prevent legacy form post\r\n e.preventDefault();\r\n\r\n // Get field name and value from event\r\n const target = e.target;\r\n let value = target.type === 'checkbox' ? target.checked : target.value;\r\n const name = target.name;\r\n\r\n this.validateAndSaveChange(name, value);\r\n }",
"changeSetting(event){\n\t\tlet type = event.target.type;\n\t\tlet val = event.target.value;\n\t\tswitch(type){\n\t\t\tcase 'checkbox':\n\t\t\t\tval = event.target.checked;\n\t\t\t\tbreak;\n\t\t\tcase 'number':\n\t\t\t\tval = parseInt(val);\n\t\t\t\tbreak;\n\t\t}\n\t\tconsole.log('Changed: ', event.target.id, val);\n\t\tthis.changes[event.target.id] = val;\n\t\tthis.setState({changes: clone(this.changes)});\n\t}",
"function handleChange(value) {\n console.log(`selected ${value}`);\n }",
"function handleChange(e) {\n setName(e.target.value);\n }",
"function changed(change) {\n if (change.changeType === \"property\" && change.property === property) {\n fn(change);\n }\n }",
"_triggerChangeEvent() {\n\t\tif ( this.$control.rendered && ! this.changeEventDisabled ) {\n\t\t\tthis._updateSettings();\n\t\t\tthis.events.emit( 'change', this.settings );\n\t\t}\n\t}",
"formChanged() {}"
] |
[
"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.73218906",
"0.7272271",
"0.7213144",
"0.7172082",
"0.7172082",
"0.7135516",
"0.70593154",
"0.7057752",
"0.7047312",
"0.70369786",
"0.7017632",
"0.70171803",
"0.6953554",
"0.6949268",
"0.69473183",
"0.6925149",
"0.69247746",
"0.69247746",
"0.6921572",
"0.6921572",
"0.6887625",
"0.6873889",
"0.6868702",
"0.6816885",
"0.6800813",
"0.6784801",
"0.6770731",
"0.67362815",
"0.67204165",
"0.67096955",
"0.67090863",
"0.67090863",
"0.67080957",
"0.6702231",
"0.6702231",
"0.6699963",
"0.6680338",
"0.66771644",
"0.6664612",
"0.66323525",
"0.66266215",
"0.662305",
"0.66136885",
"0.6604868",
"0.66048104",
"0.6604488",
"0.65987414",
"0.6592236",
"0.65880716",
"0.6582374",
"0.6572207",
"0.65722036",
"0.6569591",
"0.65623695",
"0.65623695",
"0.6558127",
"0.65553373",
"0.6545838",
"0.65361977",
"0.6535871",
"0.652795",
"0.6522288",
"0.6516211",
"0.6514555",
"0.6513177",
"0.65122265",
"0.65082526",
"0.64982486",
"0.6486231",
"0.64862174",
"0.6480262",
"0.6476834",
"0.6467417",
"0.6465933",
"0.6464175",
"0.646153",
"0.6461519",
"0.6456544",
"0.64546096",
"0.64537436",
"0.6452145"
] |
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('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value');// Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n// on DOM elements\nObject.defineProperty(activeElement,'value',newValueProp);if(activeElement.attachEvent){activeElement.attachEvent('onpropertychange',handlePropertyChange);}else{activeElement.addEventListener('propertychange',handlePropertyChange,false);}}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value'); // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t// on DOM elements\n\tObject.defineProperty(activeElement,'value',newValueProp);if(activeElement.attachEvent){activeElement.attachEvent('onpropertychange',handlePropertyChange);}else {activeElement.addEventListener('propertychange',handlePropertyChange,false);}}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value'); // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t// on DOM elements\n\tObject.defineProperty(activeElement,'value',newValueProp);if(activeElement.attachEvent){activeElement.attachEvent('onpropertychange',handlePropertyChange);}else {activeElement.addEventListener('propertychange',handlePropertyChange,false);}}",
"function startWatchingForValueChange(target,targetID){activeElement=target;activeElementID=targetID;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value');Object.defineProperty(activeElement,'value',newValueProp);activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetID){activeElement = target;activeElementID = targetID;activeElementValue = target.value;activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype,'value');Object.defineProperty(activeElement,'value',newValueProp);activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target, activeElementInst = targetInst, activeElement.attachEvent(\"onpropertychange\", handlePropertyChange);\n}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n\t activeElement = target;\n\t activeElementInst = targetInst;\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t\t activeElement = target;\n\t\t activeElementID = targetID;\n\t\t activeElementValue = target.value;\n\t\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\t\n\t\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t\t // on DOM elements\n\t\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t\t}",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent('onpropertychange', handlePropertyChange);\n }",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetID) {\n\t activeElement = target;\n\t activeElementID = targetID;\n\t activeElementValue = target.value;\n\t activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype, 'value');\n\t\n\t // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t // on DOM elements\n\t Object.defineProperty(activeElement, 'value', newValueProp);\n\t activeElement.attachEvent('onpropertychange', handlePropertyChange);\n\t}",
"function startWatchingForValueChange(target, targetInst) {\n activeElement = target;\n activeElementInst = targetInst;\n activeElement.attachEvent(\n 'onpropertychange',\n handlePropertyChange,\n );\n }"
] |
[
"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.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6934341",
"0.6851509",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.68508446",
"0.6809348",
"0.6799854",
"0.6799854",
"0.6799854",
"0.6799854",
"0.6799854",
"0.6799854",
"0.6799854",
"0.67934465"
] |
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\n var divList = document.getElementsByTagName('div');\r\r\n // set event to each div\r\r\n for(var i = 0, len = divList.length; i < len; i++) {\r\r\n var element = divList[i];\r\r\n eventUtility.removeEvent(element, \"click\", markDiv, useCapturing);\r\r\n }\r\r\n}",
"function removeEventListeners(){\n _.forEach(unlistenCallbacks, function(unlisten){\n unlisten();\n });\n unlistenCallbacks = [];\n }",
"function removeListeners() {\n\t\t\t$element.unbind(START_EV, touchStart);\n\t\t\t$element.unbind(CANCEL_EV, touchCancel);\n\t\t\t$element.unbind(MOVE_EV, touchMove);\n\t\t\t$element.unbind(END_EV, touchEnd);\n\t\t\t\n\t\t\t//we only have leave events on desktop, we manually calculate leave on touch as its not supported in webkit\n\t\t\tif(LEAVE_EV) { \n\t\t\t\t$element.unbind(LEAVE_EV, touchLeave);\n\t\t\t}\n\t\t\t\n\t\t\tsetTouchInProgress(false);\n\t\t}",
"function removeListeners() {\n\t\t\t$element.unbind(START_EV, touchStart);\n\t\t\t$element.unbind(CANCEL_EV, touchCancel);\n\t\t\t$element.unbind(MOVE_EV, touchMove);\n\t\t\t$element.unbind(END_EV, touchEnd);\n\t\t\t\n\t\t\t//we only have leave events on desktop, we manually calculate leave on touch as its not supported in webkit\n\t\t\tif(LEAVE_EV) { \n\t\t\t\t$element.unbind(LEAVE_EV, touchLeave);\n\t\t\t}\n\t\t\t\n\t\t\tsetTouchInProgress(false);\n\t\t}",
"function removeListeners() {\n\t\t\t$element.unbind(START_EV, touchStart);\n\t\t\t$element.unbind(CANCEL_EV, touchCancel);\n\t\t\t$element.unbind(MOVE_EV, touchMove);\n\t\t\t$element.unbind(END_EV, touchEnd);\n\n\t\t\t//we only have leave events on desktop, we manually calculate leave on touch as its not supported in webkit\n\t\t\tif(LEAVE_EV) {\n\t\t\t\t$element.unbind(LEAVE_EV, touchLeave);\n\t\t\t}\n\n\t\t\tsetTouchInProgress(false);\n\t\t}",
"function removeListeners() {\n $element.unbind(START_EV, touchStart);\n $element.unbind(CANCEL_EV, touchCancel);\n $element.unbind(MOVE_EV, touchMove);\n $element.unbind(END_EV, touchEnd);\n \n //we only have leave events on desktop, we manually calculate leave on touch as its not supported in webkit\n if(LEAVE_EV) { \n $element.unbind(LEAVE_EV, touchLeave);\n }\n \n setTouchInProgress(false);\n }",
"removeAllEventListeners() {\n this.eventListeners.forEach(({ target, type, boundListener }) => {\n this.log(`Removing \"${type}\" eventlistener`, target);\n target.removeEventListener(type, boundListener);\n });\n this.eventListeners.length = 0;\n }",
"removeAllEventListeners() {\n this.eventListeners.forEach(({target, type, boundListener}) => {\n this.log(`Removing \"${type}\" eventlistener`, target);\n target.removeEventListener(type, boundListener);\n });\n this.eventListeners.length = 0;\n }",
"function removeListeners() {\n $element.unbind(START_EV, touchStart);\n $element.unbind(CANCEL_EV, touchCancel);\n $element.unbind(MOVE_EV, touchMove);\n $element.unbind(END_EV, touchEnd);\n\n //we only have leave events on desktop, we manually calculate leave on touch as its not supported in webkit\n if (LEAVE_EV) {\n $element.unbind(LEAVE_EV, touchLeave);\n }\n\n setTouchInProgress(false);\n }",
"function detachEvents() {\n if (browser.addEventListener) {\n // remove current event listeners\n element.removeEventListener('touchstart', events, browser.passiveEvents ? { passive: true } : false);\n element.removeEventListener('mousedown', events, false);\n element.removeEventListener('webkitTransitionEnd', events, false);\n element.removeEventListener('msTransitionEnd', events, false);\n element.removeEventListener('oTransitionEnd', events, false);\n element.removeEventListener('otransitionend', events, false);\n element.removeEventListener('transitionend', events, false);\n root.removeEventListener('resize', events, false);\n } else {\n root.onresize = null;\n }\n }",
"removeEventListeners(){\n\t\tif(!this.document) {\n\t\t\treturn;\n\t\t}\n\t\tDOM_EVENTS.forEach(function(eventName){\n\t\t\tthis.document.removeEventListener(eventName, this._triggerEvent, { passive: true });\n\t\t}, this);\n\t\tthis._triggerEvent = undefined;\n\t}",
"function removeAddedEvents() {\n // remove added native events\n nativeEvents.forEach(function (_ref) {\n var key = _ref.key,\n listener = _ref.listener;\n element.removeEventListener(key, listener);\n });\n nativeEvents = [];\n }",
"removeEventListeners() {\n\t\twindow.removeEventListener('resize', this.bindResize);\n\t\tthis.domElement.removeEventListener('click', this.bindClick);\n\t\tTweenMax.ticker.removeEventListener('tick', this.bindRender);\n\t\tEmitter.off('LOADING_COMPLETE', this.bindEnter);\n\t\twindow.removeEventListener('mousemove', this.boundMouseMove);\n\t}",
"detachFromDOM() {\n\t\tthis.trackNode.removeEventListener('click', this.onTrackClick);\n\t\tthis.noValueNode.removeEventListener('click', this.onNoValueNodeClick);\n\n\t\tthis.handleNode.removeEventListener('mousedown', this.onHandleMouseDown);\n\t\tdocument.removeEventListener('mousemove', this.onDocumentMouseMove);\n\t\tdocument.removeEventListener('mouseup', this.onDocumentMouseUp);\n\n\t\tthis.handleNode.removeEventListener('touchstart', this.onHandleTouchStart);\n\t\tdocument.removeEventListener('touchmove', this.onDocumentTouchMove);\n\t\tdocument.removeEventListener('touchend', this.onDocumentTouchEnd);\n\n\t\tthis.handleNode.removeEventListener('keydown', this.onHandleKeyPress);\n\t}",
"_removeListeners() {\n try {\n WINDOW$1.document.removeEventListener('visibilitychange', this._handleVisibilityChange);\n\n WINDOW$1.removeEventListener('blur', this._handleWindowBlur);\n WINDOW$1.removeEventListener('focus', this._handleWindowFocus);\n\n restoreRecordDroppedEvent();\n\n if (this._performanceObserver) {\n this._performanceObserver.disconnect();\n this._performanceObserver = null;\n }\n } catch (err) {\n this._handleException(err);\n }\n }",
"_removeListeners() {\n document.removeEventListener('click', this._handleWindowClick);\n window.removeEventListener('resize', this._handleResize);\n this.el.removeEventListener('keydown', this._handleKeyDown);\n document.removeEventListener('blur', this._handleBlur, true);\n document.removeEventListener('focus', this._handleFocus, true);\n document.removeEventListener('spark.visible-children', this._handleVisibleChildren, true);\n }",
"_removeEventListeners() {\n this.el.removeEventListener('click', this._onClickBound);\n this.el.removeEventListener('keydown', this._onKeydownBound);\n }",
"function removeListeners() {\n $(\"#controls\").off(\"click\");\n $(\"#sequence\").off(\"click\");\n}",
"removeEventListeners() {\n this.elementListener.removeEventListener(\"mouseenter\", this.onMouseEnterBind);\n this.elementListener.removeEventListener(\"mouseleave\", this.onMouseLeaveBind);\n this.elementListener.removeEventListener(\"mousemove\", this.onMouseMoveBind);\n\n if (this.gyroscope) {\n window.removeEventListener(\"deviceorientation\", this.onDeviceOrientationBind);\n }\n\n if (this.glare || this.fullPageListening) {\n window.removeEventListener(\"resize\", this.onWindowResizeBind);\n }\n }",
"function xRemoveEventListener(e,eT,eL,cap)\r\n{\r\n if(!(e=xGetElementById(e)))return;\r\n eT=eT.toLowerCase();\r\n if(e.removeEventListener)e.removeEventListener(eT,eL,cap||false);\r\n else if(e.detachEvent)e.detachEvent('on'+eT,eL);\r\n else e['on'+eT]=null;\r\n}",
"_removeTriggerEvents() {\n if (this._triggerElement) {\n pointerDownEvents.forEach((type) => {\n this._triggerElement.removeEventListener(type, this, passiveEventOptions);\n });\n if (this._pointerUpEventsRegistered) {\n pointerUpEvents.forEach((type) => {\n this._triggerElement.removeEventListener(type, this, passiveEventOptions);\n });\n }\n }\n }",
"_removeTriggerEvents() {\n if (this._triggerElement) {\n pointerDownEvents.forEach((type) => {\n this._triggerElement.removeEventListener(type, this, passiveEventOptions);\n });\n if (this._pointerUpEventsRegistered) {\n pointerUpEvents.forEach((type) => {\n this._triggerElement.removeEventListener(type, this, passiveEventOptions);\n });\n }\n }\n }",
"_removeTriggerEvents() {\n if (this._triggerElement) {\n pointerDownEvents.forEach((type) => {\n this._triggerElement.removeEventListener(type, this, passiveEventOptions);\n });\n if (this._pointerUpEventsRegistered) {\n pointerUpEvents.forEach((type) => {\n this._triggerElement.removeEventListener(type, this, passiveEventOptions);\n });\n }\n }\n }",
"_removeEventListeners() {\n\n this.el.removeEventListener('click', this._onClickBound);\n window.removeEventListener('scroll', this._onScrollBound);\n window.removeEventListener('orientationchange', this._onScrollBound);\n document.removeEventListener('spark.visible-children', this._onVisibleBound, true);\n\n if (canObserve)\n this._removeMutationObserver();\n else\n window.removeEventListener('resize', this._onResizeBound);\n }",
"detachListeners () {\n if (this.listenersAttached) {\n window.removeEventListener('resize', this.handleWindowResize)\n window.removeEventListener('mouseup', this.handleMouseUp)\n window.removeEventListener('touchend', this.handleTouchEnd)\n window.removeEventListener('touchcancel', this.handleTouchEnd)\n window.removeEventListener('pointerdown', this.handlePointerEvent)\n window.removeEventListener('pointermove', this.handlePointerEvent)\n window.removeEventListener('pointerup', this.handlePointerEvent)\n window.removeEventListener('pointercancel', this.handlePointerEvent)\n this.listenersAttached = false\n }\n }",
"removeEvents()\n {\n if (!this.interactionDOMElement)\n {\n return;\n }\n\n ticker.shared.remove(this.update);\n\n if (window.navigator.msPointerEnabled)\n {\n this.interactionDOMElement.style['-ms-content-zooming'] = '';\n this.interactionDOMElement.style['-ms-touch-action'] = '';\n }\n else if (this.supportsPointerEvents)\n {\n this.interactionDOMElement.style['touch-action'] = '';\n }\n\n window.document.removeEventListener('mousemove', this.onMouseMove, true);\n this.interactionDOMElement.removeEventListener('mousedown', this.onMouseDown, true);\n this.interactionDOMElement.removeEventListener('mouseout', this.onMouseOut, true);\n this.interactionDOMElement.removeEventListener('mouseover', this.onMouseOver, true);\n window.removeEventListener('mouseup', this.onMouseUp, true);\n\n if (this.supportsTouchEvents)\n {\n this.interactionDOMElement.removeEventListener('touchstart', this.onTouchStart, true);\n this.interactionDOMElement.removeEventListener('touchend', this.onTouchEnd, true);\n this.interactionDOMElement.removeEventListener('touchmove', this.onTouchMove, true);\n }\n\n if (this.supportsPointerEvents)\n {\n window.document.removeEventListener('pointermove', this.onPointerMove, true);\n this.interactionDOMElement.removeEventListener('pointerdown', this.onPointerDown, true);\n this.interactionDOMElement.removeEventListener('pointerout', this.onPointerOut, true);\n this.interactionDOMElement.removeEventListener('pointerover', this.onPointerOver, true);\n window.removeEventListener('pointerup', this.onPointerUp, true);\n }\n else\n {\n /**\n * If pointer events aren't available on a device, this will turn either the touch or\n * mouse events into pointer events. This allows a developer to just listen for emitted\n * pointer events on interactive sprites\n */\n if (this.normalizeTouchEvents)\n {\n this.interactionDOMElement.removeEventListener('touchstart', this.onPointerDown, true);\n this.interactionDOMElement.removeEventListener('touchend', this.onPointerUp, true);\n this.interactionDOMElement.removeEventListener('touchmove', this.onPointerMove, true);\n }\n\n if (this.normalizeMouseEvents)\n {\n window.document.removeEventListener('mousemove', this.onPointerMove, true);\n this.interactionDOMElement.removeEventListener('mousedown', this.onPointerDown, true);\n this.interactionDOMElement.removeEventListener('mouseout', this.onPointerOut, true);\n window.removeEventListener('mouseup', this.onPointerUp, true);\n }\n }\n\n this.interactionDOMElement = null;\n\n this.eventsAdded = false;\n }",
"_removeEventListeners() {\n\n if (this._isNative) {\n this.selectEl.removeEventListener('change', this._onInputBound);\n }\n else {\n this.el.removeEventListener('change', this._onInputBound, true);\n }\n }",
"function xRemoveEventListener(e,eT,eL,cap)\n{\n if(!(e=xGetElementById(e)))return;\n eT=eT.toLowerCase();\n if(e.removeEventListener)e.removeEventListener(eT,eL,cap||false);\n else if(e.detachEvent)e.detachEvent('on'+eT,eL);\n else e['on'+eT]=null;\n}",
"removeEventListeners() {\r\n this.elementListener.removeEventListener(\"mouseenter\", this.onMouseEnterBind);\r\n this.elementListener.removeEventListener(\"mouseleave\", this.onMouseLeaveBind);\r\n this.elementListener.removeEventListener(\"mousemove\", this.onMouseMoveBind);\r\n \r\n if (this.gyroscope) {\r\n window.removeEventListener(\"deviceorientation\", this.onDeviceOrientationBind);\r\n }\r\n \r\n if (this.glare || this.fullPageListening) {\r\n window.removeEventListener(\"resize\", this.onWindowResizeBind);\r\n }\r\n }",
"function xRemoveEventListener2(e,eT,eL,cap)\r\n{\r\n if(!(e=xGetElementById(e))) return;\r\n eT=eT.toLowerCase();\r\n if(e==window) {\r\n if(eT=='resize' && e.xREL) {e.xREL=null; return;}\r\n if(eT=='scroll' && e.xSEL) {e.xSEL=null; return;}\r\n }\r\n if(e.removeEventListener) e.removeEventListener(eT,eL,cap||false);\r\n else if(e.detachEvent) e.detachEvent('on'+eT,eL);\r\n else e['on'+eT]=null;\r\n}",
"function removeEventListeners() {\n\n eventsAreBound = false;\n\n document.removeEventListener('keydown', onDocumentKeyDown, false);\n window.removeEventListener('hashchange', onWindowHashChange, false);\n window.removeEventListener('resize', onWindowResize, false);\n\n dom.wrapper.removeEventListener('touchstart', onTouchStart, false);\n dom.wrapper.removeEventListener('touchmove', onTouchMove, false);\n dom.wrapper.removeEventListener('touchend', onTouchEnd, false);\n\n if (window.navigator.msPointerEnabled) {\n dom.wrapper.removeEventListener('MSPointerDown', onPointerDown, false);\n dom.wrapper.removeEventListener('MSPointerMove', onPointerMove, false);\n dom.wrapper.removeEventListener('MSPointerUp', onPointerUp, false);\n }\n\n if (config.progress && dom.progress) {\n dom.progress.removeEventListener('click', onProgressClicked, false);\n }\n\n if (config.controls && dom.controls) {\n ['touchstart', 'click'].forEach(function (eventName) {\n dom.controlsLeft.forEach(function (el) {\n el.removeEventListener(eventName, onNavigateLeftClicked, false);\n });\n dom.controlsRight.forEach(function (el) {\n el.removeEventListener(eventName, onNavigateRightClicked, false);\n });\n dom.controlsUp.forEach(function (el) {\n el.removeEventListener(eventName, onNavigateUpClicked, false);\n });\n dom.controlsDown.forEach(function (el) {\n el.removeEventListener(eventName, onNavigateDownClicked, false);\n });\n dom.controlsPrev.forEach(function (el) {\n el.removeEventListener(eventName, onNavigatePrevClicked, false);\n });\n dom.controlsNext.forEach(function (el) {\n el.removeEventListener(eventName, onNavigateNextClicked, false);\n });\n });\n }\n\n }",
"removeListeners() {}",
"removeListeners() {}",
"removeListeners() {}",
"function detatchElementEvents() {\n var element = this.element;\n\n if (element.nodeName === 'FORM') {\n element.removeEventListener('submit', this.submitAjaxHandler);\n }\n\n switch (element.getAttribute('data-ajaxable-trigger-type')) {\n case 'timeout':\n clearTimeout(this.requestTimerId);\n break;\n\n case 'interval':\n clearTimeout(this.requestIntervalId);\n break;\n\n case 'click':\n element.removeEventListener('click', this.clickAjaxHandler);\n break;\n\n case 'hover':\n element.removeEventListener('click', this.hoverAjaxHandler);\n break;\n\n default:\n break;\n }\n}",
"removeAllListeners() {\n const listeners = this.eventListeners;\n let i, thisObj;\n\n for (const event in listeners) {\n const bucket = listeners[event]; // We iterate backwards since we call removeListener which will splice out of\n // this array as we go...\n\n for (i = bucket.length; i-- > 0;)\n /* empty */\n {\n const cfg = bucket[i];\n this.removeListener(event, cfg);\n thisObj = cfg.thisObj;\n\n if (thisObj && thisObj.untrackDetachers) {\n thisObj.untrackDetachers(this);\n }\n }\n }\n }",
"undelegateEvents() {\n this.delegatedEventListeners.forEach(({ type, listener }) => {\n this.el.removeEventListener(type, listener);\n });\n\n this.delegatedEventListeners = [];\n }",
"removeAllListeners() {\n\t\tfor (let i = 0; i < this.eventHandles_.length; i++) {\n\t\t\tthis.eventHandles_[i].removeListener();\n\t\t}\n\n\t\tthis.eventHandles_ = [];\n\t}",
"unWireEvent() {\n this.viewerContainer.removeEventListener('scroll', this.scrollHandler);\n this.viewerContainer.removeEventListener('mousedown', this.onMouseDownInternal);\n this.viewerContainer.removeEventListener('mousemove', this.onMouseMoveInternal);\n if (!Browser.isDevice) {\n this.editableDiv.removeEventListener('keypress', this.onKeyPressInternal);\n if (Browser.info.name === 'chrome') {\n this.editableDiv.removeEventListener('textInput', this.onTextInput);\n }\n }\n else {\n this.editableDiv.removeEventListener('input', this.onTextInputInternal);\n }\n this.editableDiv.removeEventListener('paste', this.onPaste);\n this.viewerContainer.removeEventListener('contextmenu', this.onContextMenu);\n this.editableDiv.removeEventListener('blur', this.onFocusOut);\n this.editableDiv.removeEventListener('keydown', this.onKeyDownInternal);\n this.editableDiv.removeEventListener('compositionstart', this.compositionStart);\n this.editableDiv.removeEventListener('compositionupdate', this.compositionUpdated);\n this.editableDiv.removeEventListener('compositionend', this.compositionEnd);\n this.viewerContainer.removeEventListener('mouseup', this.onMouseUpInternal);\n if (!isNullOrUndefined(this.iframe)) {\n this.iframe.removeEventListener('load', this.onIframeLoad);\n }\n this.viewerContainer.removeEventListener('dblclick', this.onDoubleTap);\n window.removeEventListener('resize', this.onWindowResize);\n window.removeEventListener('keyup', this.onKeyUpInternal);\n window.removeEventListener('mouseup', this.onImageResizer);\n window.removeEventListener('touchend', this.onImageResizer);\n }",
"function removeListeners() {\n\t\t$(document).off(EVENT_NAME_KEYPRESS);\n\t\t$(document).off(EVENT_NAME_KEYUP);\n\t}",
"removeAllEventListeners () {\n this.eventListeners = [];\n }",
"detach() {\n for (const container of this.containers) {\n container.removeEventListener('webkitmouseforcewillbegin', this[onMouseForceWillBegin], false);\n container.removeEventListener('webkitmouseforcedown', this[onMouseForceDown], false);\n container.removeEventListener('mousedown', this[onMouseDown], true);\n container.removeEventListener('webkitmouseforcechanged', this[onMouseForceChange], false);\n }\n\n document.removeEventListener('mousemove', this[onMouseMove]);\n document.removeEventListener('mouseup', this[onMouseUp]);\n }",
"function dettachEvents() {\n // Remove custom events from the window\n window.removeEventListener(\"touch\", handleInteruption, false);\n window.removeEventListener(\"mousewheel\", handleInteruption, false);\n window.removeEventListener(\"mousedown\", handleInteruption, false);\n}",
"removeEventListeners() {\n // Empty in base class.\n }",
"function clearListener(elementId) {\n\t\tvar element = document.getElementById(elementId);\n\t\tif (element) {\n\t\t\telement.replaceWith(element.cloneNode(true));\n\t\t}\n\t}",
"function clearEvents() {\n\t\t\tvar ident;\n\t\t\tfor (ident in listenersByEventId) {\n\t\t\t\tr.removeListener(ident);\n\t\t\t}\n\t\t}",
"_removeEventListeners() {\n\n window.removeEventListener('resize', this._onResizeBound);\n window.removeEventListener('orientationchange', this._onResizeBound);\n\n this.tabListEl.removeEventListener('click', this._onTabListClickBound);\n\n this.tabListEl.removeEventListener('touchstart', this._onTouchStartBound);\n this.tabListEl.removeEventListener('mousedown', this._onMouseDownBound);\n this.tabListEl.removeEventListener('mousewheel', this._onScrollBound);\n this.tabListEl.removeEventListener('DOMMouseScroll', this._onScrollBound);\n\n this.tabListEl.removeEventListener('focus', this._onFocusBound);\n this.tabListEl.removeEventListener('blur', this._onBlurBound);\n\n if (this.leftEl) {\n this.leftEl.removeEventListener('click', this._onLeftClickBound);\n }\n\n if (this.rightEl) {\n this.rightEl.removeEventListener('click', this._onRightClickBound);\n }\n }",
"_removeTrackListeners() {\n var interactionRects = Px.d3.selectAll(Polymer.dom(this.$$('#sliderSVG')).querySelectorAll('.sliderTrack'));\n\n interactionRects.on('click', null);\n }",
"_clearListeners() {\n for (const listener of this._listeners) {\n listener.remove();\n }\n this._listeners = [];\n }",
"_clearListeners() {\n for (let listener of this._listeners) {\n listener.remove();\n }\n this._listeners = [];\n }",
"detach() {\n this.attached.removeEventListener('mousedown', this.event);\n this.attached.removeEventListener('mouseup', this.event);\n this.attached.removeEventListener('click', this.event);\n this.attached.removeEventListener('dblclick', this.event);\n \n this.attached = null;\n }",
"function removeListeners() {\r\n gameOverModal.btn.removeEventListener(\"click\", backToMenu);\r\n }",
"__detatchListeners() {\n if (qx.bom.History.SUPPORTS_HASH_CHANGE_EVENT) {\n qx.bom.Event.removeNativeListener(\n window,\n \"hashchange\",\n this.__checkOnHashChange\n );\n } else {\n qx.event.Idle.getInstance().removeListener(\n \"interval\",\n this.__onHashChange,\n this\n );\n }\n }",
"_stopObserver() {\n for (var i = 0; i < this.__eventNames.length; i++) {\n qx.bom.Event.removeNativeListener(\n this.__defaultTarget,\n this.__eventNames[i],\n this.__wrappedListener\n );\n }\n }",
"function remove_eventhandlers(curr) {\n\t\n\t\t curr.off('mousemove', function (ev) {\n\t\t\t handle_mousemove_on_content(ev);\n\t\t });\n\n\t\t curr.off('click', function (ev) {\n\t\t handle_mouseclick_on_content(ev);\n\t\t });\t\n\t\n\t\t curr.off('mouseleave', function (ev) {\n\t\t handle_mouseleave_from_content(ev);\n\t\t });\n\t\t\n\t\t curr.off('mouseenter', function (ev) {\n\t\t \thandle_mouseenter_on_content (ev);\n\t\t });\n\t}",
"removeListeners() {\n var descriptor = this.getDescriptor();\n if (descriptor) {\n descriptor.unlisten(DescriptorEventType.ACTIVATED, this.onActivated, false, this);\n descriptor.unlisten(DescriptorEventType.DEACTIVATED, this.onDeactivated, false, this);\n descriptor.unlisten(DescriptorEventType.DEACTIVATED, this.onActivationError, false, this);\n }\n }",
"function removeAllListeners(container,opt) {\n\t\t\tcontainer.children().each(function() {\n\t\t\t try{ jQuery(this).die('click'); } catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseenter');} catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseleave');} catch(e) {}\n\t\t\t try{ jQuery(this).unbind('hover');} catch(e) {}\n\t\t\t})\n\t\t\ttry{ container.die('click','mouseenter','mouseleave');} catch(e) {}\n\t\t\tclearInterval(opt.cdint);\n\t\t\tcontainer=null;\n\n\n\n\t\t}",
"function removeAllListeners(container,opt) {\n\t\t\tcontainer.children().each(function() {\n\t\t\t try{ jQuery(this).die('click'); } catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseenter');} catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseleave');} catch(e) {}\n\t\t\t try{ jQuery(this).unbind('hover');} catch(e) {}\n\t\t\t})\n\t\t\ttry{ container.die('click','mouseenter','mouseleave');} catch(e) {}\n\t\t\tclearInterval(opt.cdint);\n\t\t\tcontainer=null;\n\n\n\n\t\t}",
"function removeAllListeners(container,opt) {\n\t\t\tcontainer.children().each(function() {\n\t\t\t try{ jQuery(this).die('click'); } catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseenter');} catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseleave');} catch(e) {}\n\t\t\t try{ jQuery(this).unbind('hover');} catch(e) {}\n\t\t\t})\n\t\t\ttry{ container.die('click','mouseenter','mouseleave');} catch(e) {}\n\t\t\tclearInterval(opt.cdint);\n\t\t\tcontainer=null;\n\n\n\n\t\t}",
"function removeAllListeners(container,opt) {\n\t\t\tcontainer.children().each(function() {\n\t\t\t try{ jQuery(this).die('click'); } catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseenter');} catch(e) {}\n\t\t\t try{ jQuery(this).die('mouseleave');} catch(e) {}\n\t\t\t try{ jQuery(this).unbind('hover');} catch(e) {}\n\t\t\t})\n\t\t\ttry{ container.die('click','mouseenter','mouseleave');} catch(e) {}\n\t\t\tclearInterval(opt.cdint);\n\t\t\tcontainer=null;\n\n\n\n\t\t}",
"function removeListeners() {\r\n modal.yes.removeEventListener(\"click\", backToMenu);\r\n modal.no.removeEventListener(\"click\", backToGame);\r\n }",
"function removeAllListeners(container, opt) {\n container.children().each(function() {\n try {\n jQuery(this).die('click');\n } catch (e) {\n }\n try {\n jQuery(this).die('mouseenter');\n } catch (e) {\n }\n try {\n jQuery(this).die('mouseleave');\n } catch (e) {\n }\n try {\n jQuery(this).unbind('hover');\n } catch (e) {\n }\n })\n try {\n container.die('click', 'mouseenter', 'mouseleave');\n } catch (e) {\n }\n clearInterval(opt.cdint);\n container = null;\n\n\n\n }",
"function cleanupInteractiveMouseListeners() {\n document.body.removeEventListener('mouseleave', scheduleHide);\n document.removeEventListener('mousemove', debouncedOnMouseMove);\n mouseMoveListeners = mouseMoveListeners.filter(function (listener) {\n return listener !== debouncedOnMouseMove;\n });\n }",
"_removeMouseDownListeners() {\n if (this._screenElement.ownerDocument) {\n this._screenElement.ownerDocument.removeEventListener('mousemove', this._mouseMoveListener);\n this._screenElement.ownerDocument.removeEventListener('mouseup', this._mouseUpListener);\n }\n clearInterval(this._dragScrollIntervalTimer);\n this._dragScrollIntervalTimer = undefined;\n }",
"removeListener() {\n document.getElementById('banner-picture').removeEventListener('mousedown', this.mouseDownHandler);\n document.removeEventListener('mouseup', this.mouseUpHandler);\n document.getElementById('banner-picture').removeEventListener('mouseenter', this.mouseEnterHandler);\n document.getElementById('banner-picture').removeEventListener('mousemove', this.mouseMoveHandler);\n }",
"function cleanupInteractiveMouseListeners() {\n document.body.removeEventListener('mouseleave', scheduleHide);\n document.removeEventListener('mousemove', debouncedOnMouseMove);\n mouseMoveListeners = mouseMoveListeners.filter(function (listener) {\n return listener !== debouncedOnMouseMove;\n });\n }",
"_removeEvents () {\n this.container.classList.remove(\"tooltiped\");\n\n this.container.removeEventListener(\"mouseenter\", this._mouseOver);\n this.container.removeEventListener(\"mousemove\", this._mouseMove);\n this.container.removeEventListener(\"mouseleave\", this._mouseOut);\n }",
"removeAllListeners() {\n this.listeners = {};\n }",
"removeEventListeners() {\n this.leafletMap.removeEventListener('click', (event) => {\n this.clickLeafletMap(event);\n })\n this.leafletMap.removeEventListener('mousemove', (event) => {\n this.onMouseMove(event);\n });\n this.leafletMap.removeEventListener('keydown', (event) => {\n this.onKeyPress(event.originalEvent);\n });\n this.leafletMap.removeEventListener('mouseover', (event) => {\n this.onMouseOverLeaflet(event)\n });\n this.leafletMap.removeEventListener('mouseout', (event) => {\n this.onMouseOutLeaflet(event)\n });\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n window.cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"detachFromDOM() {\n this._trackNode.off('click', this._onTrackClick);\n this._noValueNode.off('click', this._onNoValueNodeClick);\n\n this._handleNode.off('mousedown', this._onHandleMouseDown);\n $(document).off('mousemove', this._onDocumentMouseMove);\n $(document).off('mouseup', this._onDocumentMouseUp);\n\n this._handleNode.off('touchstart', this._onHandleTouchStart);\n $(document).off('touchmove', this._onDocumentTouchMove);\n $(document).off('touchend', this._onDocumentTouchEnd);\n\n this._handleNode.off('keydown', this._onHandleKeyPress);\n }",
"function disableEventListeners() {\n\t if (this.state.eventsEnabled) {\n\t cancelAnimationFrame(this.scheduleUpdate);\n\t this.state = removeEventListeners(this.reference, this.state);\n\t }\n\t}",
"function disableEventListeners() {\n\t if (this.state.eventsEnabled) {\n\t cancelAnimationFrame(this.scheduleUpdate);\n\t this.state = removeEventListeners(this.reference, this.state);\n\t }\n\t}",
"function disableEventListeners() {\n\t if (this.state.eventsEnabled) {\n\t cancelAnimationFrame(this.scheduleUpdate);\n\t this.state = removeEventListeners(this.reference, this.state);\n\t }\n\t}",
"_removeEventListeners() {\n window.removeEventListener('deviceorientation', this._onOrientationFound);\n\n this._map\n .off('locationfound', this._onLocationFound, this)\n .off('locationerror', this._onLocationError, this)\n .off('dragstart', this._onDragStart, this)\n .off('moveend', this._onMoveEnd, this);\n }",
"disconnectedCallback() {\n this.removeEventListener(\"mousedown\", this.tapEventOn);\n this.removeEventListener(\"mouseover\", this.tapEventOn);\n this.removeEventListener(\"mouseout\", this.tapEventOff);\n this.$.button.removeEventListener(\"focused-changed\", this.focusToggle);\n super.disconnectedCallback();\n }",
"function removeRedandYellowListeners(){\n\t\tfor (var i = $boxes.length -1; i>=0;i--){\n\t\t\tvar $box = $($boxes[i]);\n\t\t\t$box.off('click', addRedorYellow);\n\t\t}\n\t}",
"_onMouseUp () {\n document.removeEventListener(\"mousemove\", this._onMouseMove);\n document.removeEventListener(\"touchmove\", this._onMouseMove);\n\n document.removeEventListener(\"mouseup\", this._onMouseUp);\n document.removeEventListener(\"touchend\", this._onMouseUp);\n }",
"removeAllListeners() {\n const me = this,\n listeners = me.eventListeners || (me.eventListeners = {});\n\n for (let event in listeners) {\n listeners[event].forEach((cfg) => me.removeListener(event, cfg));\n }\n }",
"function removeButtonListeners() {\n if (buttons.fw) {\n buttons.fw.removeEventListener('click', handleForwardButtonClick);\n }\n if (buttons.bk) {\n buttons.bk.removeEventListener('click', handleBackwardButtonClick);\n }\n }",
"function removeEventListener(handle) {\n GEvent.removeListener(handle);\n }",
"function off(event_name) { \n $.forEach(this.elements, function(element){\n element.removeEventListener(event_name);\n })\n }",
"function _removeEventListeners(target) {\n\t for (var i in this._eventOutput.listeners) {\n\t target.removeEventListener(i, this.eventForwarder);\n\t }\n\t }",
"removeSelectionListeners(){\n\t\tif(!this.document) {\n\t\t\treturn;\n\t\t}\n\t\tthis.document.removeEventListener(\"selectionchange\", this._onSelectionChange, { passive: true });\n\t\tthis._onSelectionChange = undefined;\n\t}",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }",
"function disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n }"
] |
[
"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.67966807",
"0.67966807",
"0.67966807",
"0.67963916",
"0.6795824",
"0.67859656",
"0.67729586",
"0.67515653",
"0.6743473",
"0.6732952",
"0.6724873",
"0.6715488",
"0.6715488",
"0.6715488",
"0.6705269",
"0.6688051",
"0.6674303",
"0.66740364",
"0.66608715",
"0.6643074",
"0.6620405",
"0.6596653",
"0.6580174",
"0.657464",
"0.6574136",
"0.65490097",
"0.65392345",
"0.6536552",
"0.65357465",
"0.6515675",
"0.64818203",
"0.64793545",
"0.6459708",
"0.64437026",
"0.64420503",
"0.64145863",
"0.6402359",
"0.6402359",
"0.6402359",
"0.6402359",
"0.6398378",
"0.6391892",
"0.6391061",
"0.63845044",
"0.6379738",
"0.6370472",
"0.63464123",
"0.6334992",
"0.6334769",
"0.63320124",
"0.63251907",
"0.6314994",
"0.6314994",
"0.6314994",
"0.630269",
"0.6298718",
"0.62925327",
"0.6291126",
"0.6278353",
"0.62699366",
"0.62681955",
"0.6267749",
"0.62548226",
"0.62492186",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174",
"0.62444174"
] |
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('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function changeEvent() {\n var value_sub = properties.value;\n trigger_param_list.push(value_sub);\n // 'seek' event is like a forced-change event\n $pebble_slider_object.triggerHandler('seek', trigger_param_list);\n if (prev_change_value !== value_sub) {\n $pebble_slider_object.triggerHandler('change', trigger_param_list);\n prev_change_value = value_sub;\n }\n trigger_param_list.length = 0;\n }",
"function startWatchingForValueChange(target,targetID){activeElement=target;activeElementID=targetID;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value');Object.defineProperty(activeElement,'value',newValueProp);activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetID){activeElement = target;activeElementID = targetID;activeElementValue = target.value;activeElementValueProp = Object.getOwnPropertyDescriptor(target.constructor.prototype,'value');Object.defineProperty(activeElement,'value',newValueProp);activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value');// Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n// on DOM elements\nObject.defineProperty(activeElement,'value',newValueProp);if(activeElement.attachEvent){activeElement.attachEvent('onpropertychange',handlePropertyChange);}else{activeElement.addEventListener('propertychange',handlePropertyChange,false);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}if(getInstIfValueChanged(activeElementInst)){manualDispatchChangeEvent(nativeEvent);}}",
"function changed(change) {\n if (change.changeType === \"property\" && change.property === property) {\n fn(change);\n }\n }",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value'); // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t// on DOM elements\n\tObject.defineProperty(activeElement,'value',newValueProp);if(activeElement.attachEvent){activeElement.attachEvent('onpropertychange',handlePropertyChange);}else {activeElement.addEventListener('propertychange',handlePropertyChange,false);}}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElementValue=target.value;activeElementValueProp=Object.getOwnPropertyDescriptor(target.constructor.prototype,'value'); // Not guarded in a canDefineProperty check: IE8 supports defineProperty only\n\t// on DOM elements\n\tObject.defineProperty(activeElement,'value',newValueProp);if(activeElement.attachEvent){activeElement.attachEvent('onpropertychange',handlePropertyChange);}else {activeElement.addEventListener('propertychange',handlePropertyChange,false);}}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName !== 'value'){return;}var value=nativeEvent.srcElement.value;if(value === activeElementValue){return;}activeElementValue = value;manualDispatchChangeEvent(nativeEvent);}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}var value=nativeEvent.srcElement.value;if(value===activeElementValue){return;}activeElementValue=value;manualDispatchChangeEvent(nativeEvent);}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}var value=nativeEvent.srcElement.value;if(value===activeElementValue){return;}activeElementValue=value;manualDispatchChangeEvent(nativeEvent);}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}var value=nativeEvent.srcElement.value;if(value===activeElementValue){return;}activeElementValue=value;manualDispatchChangeEvent(nativeEvent);}",
"function handlePropertyChange(nativeEvent){if(nativeEvent.propertyName!=='value'){return;}var value=nativeEvent.srcElement.value;if(value===activeElementValue){return;}activeElementValue=value;manualDispatchChangeEvent(nativeEvent);}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n \"value\" === nativeEvent.propertyName && getInstIfValueChanged(activeElementInst) && manualDispatchChangeEvent(nativeEvent);\n}",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n\t if (nativeEvent.propertyName !== 'value') {\n\t return;\n\t }\n\t if (getInstIfValueChanged(activeElementInst, nativeEvent)) {\n\t manualDispatchChangeEvent(nativeEvent);\n\t }\n\t}",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }",
"function handlePropertyChange(nativeEvent) {\n if (nativeEvent.propertyName !== 'value') {\n return;\n }\n if (getInstIfValueChanged(activeElementInst)) {\n manualDispatchChangeEvent(nativeEvent);\n }\n }"
] |
[
"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.6695916",
"0.6695916",
"0.6695916",
"0.6695916",
"0.6695916",
"0.6695916",
"0.6695916",
"0.6669631",
"0.6664813",
"0.6664813",
"0.6654164",
"0.664981",
"0.664981",
"0.664981",
"0.664981",
"0.66312426",
"0.6628381",
"0.661579",
"0.661579",
"0.661579",
"0.661579",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.65962064",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6582329",
"0.6579768",
"0.6565309"
] |
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.indexOf(\"MSIE 8.0\") > 0) flag = true;\r\n\r\n }\r\n\r\n\r\n return flag;\r\n\r\n }",
"function less_IE8() {\n if (/msie [1-8]{1}[^0-9]/.test(navigator.userAgent.toLowerCase())) {\n return true;\n }\n}",
"function isIE9() {\n var userAgent = navigator.userAgent.toLowerCase();\n return userAgent.indexOf(\"trident/5.0\") > 0 || userAgent.indexOf(\"msie 9.0\") > 0;\n }",
"function isIE9() {\n var userAgent = navigator.userAgent.toLowerCase();\n return userAgent.indexOf(\"trident/5.0\") > 0 || userAgent.indexOf(\"msie 9.0\") > 0;\n }",
"function IEcompatibility() {\n\t// Only do anything if this is IE\n\tif(Browser.ie){\n\t\tvar __fix = $$(\"#kbbcode-size-options\", \"#kbbcode-size-options span\", \n\t\t\t\t\t\t\"#kbbcode-colortable\", \"#kbbcode-colortable td\");\n\t\tif (__fix) {\n\t\t\t__fix.setProperty('unselectable', 'on');\n\t\t}\n\t}\n}",
"function isIE8() {\n if (window.attachEvent && !window.addEventListener) {\n return true;\n } else {\n return false;\n }\n }",
"function lpPatch_IE8(){\n\tif (typeof Array.prototype.indexOf !== 'function') {\n\t\tArray.prototype.indexOf = function(obj, start) {\n\t\t for (var i = (start || 0), j = this.length; i < j; i++) {\n\t\t if (this[i] === obj) { return i; }\n\t\t }\n\t\t return -1;\n\t\t} \n\t}\n\t\n\tif(typeof String.prototype.trim !== 'function') {\n\t\tString.prototype.trim = function() {\n\t \treturn this.replace(/^\\s+|\\s+$/g, ''); \n\t\t}\n\t}\t\n}",
"function isIE() {\n return navigator.userAgent.toLowerCase().indexOf(\"trident\") > 0;\n }",
"function isIE() {\n return navigator.userAgent.toLowerCase().indexOf(\"trident\") > 0;\n }",
"function seven_isIE () {\n\t\t\tvar myNav = navigator.userAgent.toLowerCase();\n\t\t\treturn (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\n\t\t}",
"function fixIESelect() {\n return false;\n }",
"function compIE(){\r\n\tvar agent = navigator.userAgent;\r\n\tif(agent.indexOf(\"MSIE 7.0\") > -1 || agent.indexOf(\"MSIE 8.0\") > - 1 || agent.indexOf(\"Trident 4.0\") > -1 || document.documentMode && document.documentMode <= 5)\r\n\t\treturn true;\r\n\treturn false;\r\n}",
"function isIE9OrLower() {\n\t\tvar userAgent = navigator.userAgent.toLowerCase();\n\t\treturn (userAgent.indexOf('msie') != -1) ? parseInt(userAgent.split('msie')[1]) < 10 : false;\n\t}",
"function preIE10Check() {\n if (window.attachEvent && !window.navigator.msPointerEnabled) {\n return true;\n } else {\n return false;\n }\n }",
"function isIE() {\r\n return (navigator.userAgent.toLowerCase().indexOf('msie ') != -1) || (!!navigator.userAgent.match(/Trident.*rv[:]*11\\./));\r\n}",
"function ie() {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./))\n return true;\n else\n return false;\n}",
"function isIE() {\n return (navigator.userAgent.toLowerCase().indexOf('msie ') != -1) || (!!navigator.userAgent.match(/Trident.*rv[:]*11\\./));\n}",
"function isIE() {\n return jQuery.browser.msie;\n }",
"function isLessThanIe9() {\n var b = document.createElement('b');\n b.innerHTML = '<!--[if IE lte 9]><i></i><![endif]-->';\n return b.getElementsByTagName('i').length === 1;\n }",
"function autoComplete_func_isIE7() { // Private method\n return navigator.userAgent.indexOf(\"MSIE 7\") > -1 && navigator.userAgent.indexOf(\"Opera\") == -1;\n}",
"function is_IE()\n{\n\tif (navigator.userAgent.indexOf(\"MSIE\")>-1) return true;\n\treturn false\n}",
"function isIE() {\n return (navigator.appName == \"Microsoft Internet Explorer\");\n}",
"function mg_is_old_IE() {\r\n\t\tif( navigator.appVersion.indexOf(\"MSIE 8.\") != -1 ) {return true;}\r\n\t\telse {return false;}\r\n\t}",
"function isIE () {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\n}",
"function msieversion() {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) { \n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)));\n if (ieVersion === 9) {$('body').addClass('no-js ie' + ieVersion);}\n return ieVersion;\n }\n else { return false; }\n }",
"function msieversion() {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) { \n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)));\n if (ieVersion === 9) {$('body').addClass('no-js ie' + ieVersion);}\n return ieVersion;\n }\n else { return false; }\n }",
"function msieversion() {\r\n var ua = window.navigator.userAgent;\r\n var msie = ua.indexOf(\"MSIE \");\r\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) {\r\n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)));\r\n if (ieVersion === 9) {\r\n $('body').addClass('no-js ie' + ieVersion);\r\n }\r\n return ieVersion;\r\n } else {\r\n return false;\r\n }\r\n }",
"function fixIE() {\n if (!Array.indexOf) {\n Array.prototype.indexOf = function(arg) {\n var index = -1;\n for (var i = 0; i < this.length; i++){\n var value = this[i];\n if (value == arg) {\n index = i;\n break;\n } \n }\n return index;\n };\n }\n\n if (!window.console) {\n window.console = {};\n window.console.log = window.console.debug = function(message) {\n return;\n var body = document.getElementsByTagName('body')[0];\n var messageDiv = document.createElement('div');\n messageDiv.innerHTML = message;\n body.insertBefore(messageDiv, body.lastChild);\n };\n } \n}",
"function isIE () {\n\tvar myNav = navigator.userAgent.toLowerCase();\n\treturn (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\n}",
"function uTestBrowserIE()\n{\n return (uBrowserID == uIE);\n}",
"function isIE () {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1], 10) : false;\n }",
"function isIE() {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\n }",
"function fixIeBug(e){return browser.msie?e.length-e.replace(/\\r*/g,\"\").length:0}",
"function isIE() {\n\t\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t\t}",
"function isIE() {\n\tif (navigator.appName.indexOf(\"Explorer\")>0)\n\t\treturn true;\n\telse\n\t\treturn false;\n}",
"function isIE()\n{\n return document.all;\n}",
"function isIE () {\n var ms_ie = false;\n var ua = window.navigator.userAgent;\n var old_ie = ua.indexOf('MSIE ');\n var new_ie = ua.indexOf('Trident/');\n\n if ((old_ie > -1) || (new_ie > -1)) {\n ms_ie = true;\n }\n\n return ms_ie ;\n}",
"function isIE() { //ie?\n if (!!window.ActiveXObject || \"ActiveXObject\" in window)\n return true;\n else\n return false;\n}",
"function Re(e){return!0===Ie(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}",
"function is_IE() {\n return (window.navigator.userAgent.match(/MSIE|Trident/) !== null);\n}",
"function msieversion() \n{\n\ttry{\n\t var ua = window.navigator.userAgent;\n\t var msie = ua.indexOf(\"MSIE \");\n\t\n\t if (msie > 0) // Check for Internet Explorer\n\t {\n\t \tvar version = parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)));\n\t \tif (version < 9) {\n\t \t\treturn true;\n\t \t}\n\t }\n\t} catch (err) {\n\t\t//ignore any error\n\t}\n return false;\n}",
"function autoComplete_func_isIE() { // Private method\n return autoComplete_func_isIE5() || autoComplete_func_isIE6() || autoComplete_func_isIE7() ;\n}",
"function isIE() {\n return Prototype.Browser.IE;\n}",
"function checkIeVersion() {\n var ie = gees.tools.internetExplorerVersion();\n if (ie == 7 || ie == 8 || ie == 9) {\n gees.dom.get('name_field').value = 'name';\n gees.dom.get('text_field').value = 'description';\n }\n}",
"function vpb_IE_detected()\n{\n var ua = window.navigator.userAgent;\n var old_ie = ua.indexOf('MSIE ');\n var new_ie = ua.indexOf('Trident/');\n\n if ((old_ie > -1) || (new_ie > -1)) \n\t{\n return true;\n } else {\n\t\treturn false;\n\t}\n}",
"function detectIE() {\n\tvar isie = false;\n\tvar ua = window.navigator.userAgent;\n\tvar msie = ua.indexOf('MSIE ');\n\tvar trident = ua.indexOf('Trident/');\n\tvar edge = ua.indexOf('Edge/');\n\tif (msie > 0) {\n\t\t// IE 10 or older\n\t\tisie = true;\n\t\tvar ieVer = parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\n\t} else if (trident > 0) {\n\t\t// IE 11\n\t\tisie = true;\n\t\tvar rv = ua.indexOf('rv:');\n\t\tvar ieVer = parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\n\t} else if (edge > 0) {\n\t\t// Edge (IE 12+)\n\t\tisie = true;\n\t\tvar ieVer = parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\n\t}\n\tif (isie == true) {\n\t\t$('html').addClass('ie');\n\t\tif (ieVer == 11) $('html').addClass('ie11');\n\t}\n}",
"function isIE() {\n\t//Create var for userAgent\n\tuserAg = navigator.userAgent;\n\t//Create var to store return of index of strings\n\tvar is_ie = userAg.indexOf(\"MSIE \") > -1 || userAg.indexOf(\"Trident/\") > -1 || userAg.indexOf(\"Edge\") > -1;\n\t//return result\n\treturn is_ie;\n}",
"function autoComplete_func_isIE55() { // Private method\n return navigator.userAgent.indexOf(\"MSIE 5.5\") > -1;\n}",
"IE ():boolean {\n\n\t\treturn this.agent.match(/Trident/i) ? true : false;\n\t}",
"_detectBrowserSupport () {\n\t\t\n\t\tvar check = true;\n\n\t\t// nothing below IE9\n\t\tif (!document.addEventListener) check = false;\n\n\t\t// nothing below IE10\n\t\t// if (!window.onpopstate) check = false;\n\n\t\treturn check;\n\t}",
"function isBrowserIE () {\n var ua = window.navigator.userAgent\n var msie = ua.indexOf('MSIE ')\n var trident = ua.indexOf('Trident/')\n var edge = ua.indexOf('Edge/')\n if (msie > 0 || trident > 0 || edge > 0) {\n return true\n }\n }",
"function isIe678 () {\n\t\tvar IE = eval('\"v\"==\"\\v\"');\n\t\treturn \tIE;\n\t}",
"function clickIE4(){\nif (event.button==2){\nreturn false;\n}\n}",
"function isIE() {\n var nav = navigator.userAgent.toLowerCase();\n\n return (nav.indexOf('msie') != -1) ? parseInt(nav.split('msie')[1]) : false;\n }",
"function isInternetExplorer() {\n\t if (typeof navigator === 'undefined') {\n\t return false;\n\t }\n\t\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\t\n\t return rv >= 8;\n\t }",
"function ieViewportFix() {\n\n \t\t\tvar msViewportStyle = document.createElement(\"style\");\n\n \t\t\tmsViewportStyle.appendChild(\n \t\t\t\tdocument.createTextNode(\n \t\t\t\t\t\"@-ms-viewport { width: device-width; }\"\n \t\t\t\t)\n \t\t\t);\n \t\t\tif (navigator.userAgent.match(/IEMobile\\/10\\.0/)) {\n\n \t\t\t\tmsViewportStyle.appendChild(\n \t\t\t\t\tdocument.createTextNode(\n \t\t\t\t\t\t\"@-ms-viewport { width: auto !important; }\"\n \t\t\t\t\t)\n \t\t\t\t);\n \t\t\t}\n\n \t\t\tdocument.getElementsByTagName(\"head\")[0].\n \t\t\tappendChild(msViewportStyle);\n \t\t}",
"function iedetect(v) {\n\n\t var r = RegExp('msie' + (!isNaN(v) ? ('\\\\s' + v) : ''), 'i');\n\t\treturn r.test(navigator.userAgent);\n\t\t\t\n\t}",
"function isInternetExplorer() {\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\t\n\t return rv >= 8;\n\t }",
"function isInternetExplorer() {\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\t\n\t return rv >= 8;\n\t }",
"function autoComplete_func_isIE6() { // Private method\n return navigator.userAgent.indexOf(\"MSIE 6\") > -1 && navigator.userAgent.indexOf(\"Opera\") == -1;\n}",
"function detectIE() {\n if (navigator.userAgent.indexOf(\"MSIE\") >= 0) {\n window.location = \"/static/badbrowser.html\";\n }\n return false;\n}",
"function checkVersion() {\n\t\tvar msg = \"You're not using Internet Explorer.\";\n\t\tvar ver = getInternetExplorerVersion();\n\t\tif ( ver > -1 ) {\n\t\t\tif ( ver >= 8.0 ) {\n\t\t\t\tmsg = \"You're using a recent copy of Internet Explorer.\"\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmsg = \"You should upgrade your copy of Internet Explorer.\";\n\t\t\t}\n\t\t}\n\t\tconsole.log( msg );\n\t}",
"function isIE(e,i){var t,n=\"IE\",m=document.createElement(\"B\"),o=document.documentElement;return e&&(n+=\" \"+e,i&&(n=i+\" \"+n)),m.innerHTML=\"<!--[if \"+n+']><b id=\"iecctest\"></b><![endif]-->',o.appendChild(m),t=!!document.getElementById(\"iecctest\"),o.removeChild(m),t}",
"function detectIE() {\r\n\tvar ua = window.navigator.userAgent;\r\n\tvar msie = ua.indexOf('MSIE ');\r\n\tif (msie > 0) {\r\n\t\treturn parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\r\n\t}\r\n\tvar trident = ua.indexOf('Trident/');\r\n\tif (trident > 0) {\r\n\t\tvar rv = ua.indexOf('rv:');\r\n\t\treturn parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\r\n\t}\r\n\tvar edge = ua.indexOf('Edge/');\r\n\tif (edge > 0) {\r\n\t\treturn parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\r\n\t}\r\n\treturn false;\r\n}",
"function podPress_is_modern_ie() {\r\n\t\tif ( -1 != navigator.userAgent.search(/Trident\\/([0-9]+\\.[0-9]+)/gi) && true == podPress_is_v1_gtoreq_v2(RegExp.$1, '5') && -1 != navigator.userAgent.search(/MSIE\\s([0-9]+\\.[0-9]+)/gi) && true == podPress_is_v1_gtoreq_v2(RegExp.$1, '9') ) {\r\n\t\t\treturn true;\r\n\t\t} else {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}",
"function ie(a){this.ra=a}",
"function resizingWindowIsIE()\n{\n\tif (navigator.appName == 'Microsoft Internet Explorer') {\n\t\treturn true;\n\t}\n\treturn false;\n}",
"function isInternetExplorer() {\n\t if (typeof navigator === 'undefined') {\n\t return false;\n\t }\n\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\n\t return rv >= 8;\n\t }",
"function isInternetExplorer() {\n\t if (typeof navigator === 'undefined') {\n\t return false;\n\t }\n\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\n\t return rv >= 8;\n\t }",
"function IE(e) {\n if (navigator.appName == \"Microsoft Internet Explorer\" && (event.button == \"2\" || event.button == \"3\")) {\n return false;\n }\n}",
"function autoComplete_func_isIE5() { // Private method\n return navigator.userAgent.indexOf(\"MSIE 5\") > -1;\n}",
"function supportOldIE() {\n var oldIeVersion = document && (function() {\n var version = 3,\n div = document.createElement('div'),\n iElems = div.getElementsByTagName('i');\n\n // Keep constructing conditional HTML blocks until we hit one that resolves to an empty fragment\n while (\n div.innerHTML = '<!--[if gt IE ' + (++version) + ']><i></i><![endif]-->',\n iElems[0]\n ) {}\n return version > 4 ? version : undefined;\n }());\n\n if (oldIeVersion < 9) {\n // Support old IE by patching ko.components.register to ensure that we have called\n // document.createElement(componentName) at least once before trying to parse any\n // markup that might use a custom element with that name\n var allCustomComponentNames = [];\n ko.components.register = (function(underlyingRegisterFunc) {\n return function(componentName) {\n allCustomComponentNames.push(componentName);\n underlyingRegisterFunc.apply(this, arguments);\n document.createElement(componentName);\n };\n })(ko.components.register);\n\n // Also to enable custom elements on old IE, we have to call document.createElement(name)\n // on every document fragment that ever gets created. This is especially important\n // if you're also using jQuery, because its parseHTML code works by setting .innerHTML\n // on some element inside a temporary document fragment.\n // It would be nicer if jQuery exposed some API for registering custom element names,\n // but it doesn't.\n document.createDocumentFragment = (function(originalDocumentCreateDocumentFragment) {\n return function() {\n // Note that you *can't* do originalDocumentCreateDocumentFragment.apply(this, arguments)\n // because IE6/7 complain \"object doesn't support this method\". Fortunately the function\n // doesn't take any parameters, and doesn't need a \"this\" value.\n var docFrag = originalDocumentCreateDocumentFragment();\n ko.utils.arrayForEach(allCustomComponentNames, docFrag.createElement.bind(docFrag));\n return docFrag;\n };\n })(document.createDocumentFragment);\n }\n }",
"isIE() {\n return Boolean(\n (Object.getOwnPropertyDescriptor && Object.getOwnPropertyDescriptor(window, 'ActiveXObject')) ||\n 'ActiveXObject' in window\n )\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null) rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }",
"function isIE() {\n ua = navigator.userAgent;\n /* MSIE used to detect old browsers and Trident used to newer ones*/\n var is_ie = ua.indexOf(\"MSIE \") > -1 || ua.indexOf(\"Trident/\") > -1;\n\n return is_ie;\n}",
"function ie(e,r){var n=o(e),a=void 0===w[0]\nr=void 0===r||!!r,t.animate&&!a&&i(_,t.cssClasses.tap,t.animationDuration),E.forEach((function(e){re(e,function(e,r){return null===e||!1===e||void 0===e?w[r]:(\"number\"==typeof e&&(e=String(e)),e=t.format.from(e),!1===(e=D.toStepping(e))||isNaN(e)?w[r]:e)}(n[e],e),!0,!1)})),E.forEach((function(e){re(e,w[e],!0,!0)})),te(),E.forEach((function(e){$(\"update\",e),null!==n[e]&&r&&$(\"set\",e)}))}",
"function ie03Clr(){ \r\n\tz_ie03_nav_details_flag = false;\r\n}",
"function clickEventIE() {\r\n\tif (document.all) {\t\t\r\n\t\treturn false;\r\n\t\t}\r\n\t}",
"function isIE() {\n let ua = navigator.userAgent;\n /* MSIE used to detect old browsers and Trident used to newer ones*/\n return ua.indexOf(\"MSIE \") > -1 || ua.indexOf(\"Trident/\") > -1;\n}",
"function isIE( version, comparison ){\n\t\t var $div = jQuery('<div style=\"display:none;\"/>').appendTo(jQuery('body'));\n\t\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\n\t\t var ieTest = $div.find('a').length;\n\t\t $div.remove();\n\t\t return ieTest;\n\t\t}",
"function isIE( version, comparison ){\n\t\t var $div = jQuery('<div style=\"display:none;\"/>').appendTo(jQuery('body'));\n\t\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\n\t\t var ieTest = $div.find('a').length;\n\t\t $div.remove();\n\t\t return ieTest;\n\t\t}",
"function isIE( version, comparison ){\n\t\t var $div = jQuery('<div style=\"display:none;\"/>').appendTo(jQuery('body'));\n\t\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\n\t\t var ieTest = $div.find('a').length;\n\t\t $div.remove();\n\t\t return ieTest;\n\t\t}",
"function isIE( version, comparison ){\n\t\t var $div = jQuery('<div style=\"display:none;\"/>').appendTo(jQuery('body'));\n\t\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\n\t\t var ieTest = $div.find('a').length;\n\t\t $div.remove();\n\t\t return ieTest;\n\t\t}",
"function _overflowFixAdd() { ($.browser.msie) ? $(\"body, html\").css({ overflowX: 'visible' }) : $(\"body\").css({ overflowX: 'visible' }); }",
"function needsLayeringShim() {\n return isIE && (isWinXP || isWinVista || isWin7);\n}",
"function manageIconIE(icon) {\r\n\t\t\t\tif($.browser.msie) {\r\n\t\t\t\t\t$('.'+icon).html('');\r\n\t\t\t\t\t$('.'+icon+' > .empty').hide();\r\n\t\t\t\t}\r\n\t\t\t}",
"function ieimgposition(nextsh,opt) {\n\n\t\t\tif (isIE(8)) {\n\n\t\t\t\t\tvar ie8img = nextsh.find('.ieeightfallbackimage');\n\n\t\t\t\t\tvar ie8w = ie8img.width(),\n\t\t\t\t\t\tie8h = ie8img.height();\n\n\n\n\t\t\t\t\tif (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\n\t\t\t\t\t\tie8img.css({width:\"auto\",height:\"100%\"})\n\t\t\t\t\telse\n\t\t\t\t\t\tie8img.css({width:\"100%\",height:\"auto\"})\n\n\n\t\t\t\t\tsetTimeout(function() {\n\n\n\t\t\t\t\t\tvar ie8w = ie8img.width(),\n\t\t\t\t\t\t ie8h = ie8img.height();\n\n\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"center center\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"center top\" || nextsh.data('bgposition')==\"top center\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"center bottom\" || nextsh.data('bgposition')==\"bottom center\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"right top\" || nextsh.data('bgposition')==\"top right\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", right:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"right bottom\" || nextsh.data('bgposition')==\"bottom right\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", right:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"right center\" || nextsh.data('bgposition')==\"center right\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", right:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"left bottom\" || nextsh.data('bgposition')==\"bottom left\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"left center\" || nextsh.data('bgposition')==\"center left\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:\"0px\"});\n\t\t\t\t\t},20);\n\t\t\t\t}\n\t\t}",
"function ieimgposition(nextsh,opt) {\n\n\t\t\tif (isIE(8)) {\n\n\t\t\t\t\tvar ie8img = nextsh.find('.ieeightfallbackimage');\n\n\t\t\t\t\tvar ie8w = ie8img.width(),\n\t\t\t\t\t\tie8h = ie8img.height();\n\n\n\n\t\t\t\t\tif (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\n\t\t\t\t\t\tie8img.css({width:\"auto\",height:\"100%\"})\n\t\t\t\t\telse\n\t\t\t\t\t\tie8img.css({width:\"100%\",height:\"auto\"})\n\n\n\t\t\t\t\tsetTimeout(function() {\n\n\n\t\t\t\t\t\tvar ie8w = ie8img.width(),\n\t\t\t\t\t\t ie8h = ie8img.height();\n\n\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"center center\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"center top\" || nextsh.data('bgposition')==\"top center\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"center bottom\" || nextsh.data('bgposition')==\"bottom center\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"right top\" || nextsh.data('bgposition')==\"top right\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", right:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"right bottom\" || nextsh.data('bgposition')==\"bottom right\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", right:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"right center\" || nextsh.data('bgposition')==\"center right\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", right:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"left bottom\" || nextsh.data('bgposition')==\"bottom left\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:\"0px\"});\n\n\t\t\t\t\t\tif (nextsh.data('bgposition')==\"left center\" || nextsh.data('bgposition')==\"center left\")\n\t\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:\"0px\"});\n\t\t\t\t\t},20);\n\t\t\t\t}\n\t\t}"
] |
[
"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.6119342",
"0.6098509",
"0.6088588",
"0.6074193",
"0.6072221",
"0.6072221",
"0.6055239",
"0.6026759",
"0.60239065",
"0.60147053",
"0.59858984",
"0.59817094",
"0.5981705",
"0.5979868",
"0.5975253",
"0.59291714",
"0.5916504",
"0.5905284",
"0.59011906",
"0.58856195",
"0.58856195",
"0.58856195",
"0.58856195",
"0.58856195",
"0.58856195",
"0.58856195",
"0.5879892",
"0.5871901",
"0.5868145",
"0.58570963",
"0.5840877",
"0.5822187",
"0.58209807",
"0.58156276",
"0.5803946",
"0.5785291",
"0.57829297",
"0.5768446",
"0.57647914",
"0.574963",
"0.5739531",
"0.5718534",
"0.57040554",
"0.56772125",
"0.5676731",
"0.5676731",
"0.56668425",
"0.5662509",
"0.565696",
"0.56548375",
"0.5634285",
"0.5634084",
"0.5628696",
"0.5623509",
"0.5617889",
"0.5617889",
"0.5617283",
"0.55977213",
"0.55915487",
"0.55852497",
"0.5581351",
"0.55803746",
"0.55803746",
"0.55803746",
"0.55803746",
"0.55803746",
"0.55803746",
"0.5565348",
"0.5554187",
"0.55450875",
"0.55369455",
"0.55341214",
"0.5533861",
"0.5533861",
"0.5533861",
"0.5533861",
"0.5531279",
"0.55193484",
"0.55173606",
"0.5511919",
"0.5511919"
] |
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\ttabChangeSections(event);\n}",
"function handleClick() {\n\t\t window.ctaClick();\n\t\t}",
"function handleClick() {\n\t\t window.ctaClick();\n\t\t}",
"function _click(d){\n \n }",
"function click_on() {\n console.log('called click function');\n}",
"function clickHandler(e) {\n // Nur bei Linksklick\n if (e.button !== 0) return;\n clickAt(e.offsetX, e.offsetY);\n }",
"clickHandler(event) {\n declarativeClickHandler(this);\n }",
"function clickHandler(event) {\n \tconsole.log('event');\n \ttau.openPopup(popup);\n }",
"function click(el){\n \n \n}",
"function handleClick (e) {\n e.preventDefault();\n console.log('clicked');\n }",
"_evtClick(event) { }",
"_handleClick(event) {\n this.interaction.next(event);\n event.stopPropagation();\n }",
"metodoClick(){\n console.log(\"diste click\")\n }",
"handleClick(){\n alert(\"hey!!\");\n }",
"handleJDotterClick() {}",
"click(event) {\n if (event.target === this.get('element')) {\n this.sendAction();\n }\n }",
"function doClick(e) {\n options.onClick(e);\n }",
"click_extra() {\r\n }",
"function click() {\n\tconsole.log('click')\n}",
"click() { // add click event\n app.quit();\n }",
"onClick() {\n // Verifica se existe a função para processar o click e a invoca\n if(this.handleClick) {\n this.handleClick(this);\n }\n }",
"function onClick(e) {\n }",
"click(e) {\n\n // type==custom a hack for version_select type\n if (this.type == 'button' || this.type == 'custom') {\n var url = '/api/parameters/' + this.props.p.id + '/event';\n var eventData = {'type': 'click'};\n fetch(url, {\n method: 'post',\n credentials: 'include',\n headers: {\n 'Accept': 'application/json',\n 'Content-Type': 'application/json',\n 'X-CSRFToken': csrfToken\n },\n body: JSON.stringify(eventData)\n }).then(response => {\n if (!response.ok) {\n store.dispatch(wfModuleStatusAction(this.props.wf_module_id, 'error', response.statusText))\n } \n });\n }\n\n if (this.type == 'checkbox') {\n this.paramChanged(e.target.checked)\n }\n }",
"function handleClick(el,e) {\n\tloadURL(el.attributes.target,el.text);\n}",
"clickHandler (event) {\n this.onClick ({\n node: this.node,\n target: this,\n event: event\n })\n }",
"clickHandler() {\n // Activate if not active\n if (this.active === false) {\n // Button view press effect\n this.changeToActive();\n // No click 'action' for input - text is removed in visualEffectOnActivation\n }\n }",
"_handleClick(e) {\n this.dispatchEvent(\n new CustomEvent(\"hax-tray-button-click\", {\n bubbles: true,\n cancelable: true,\n composed: true,\n detail: {\n eventName: this.eventName,\n index: this.index,\n value: this.eventData,\n },\n })\n );\n }",
"_click(e) {\n const type = this.cel.getAttribute('data-type');\n\n this[type](e);\n }",
"function __clickhandler() {\n buttonfunc(elemnode); return false;\n }",
"function clickHandler() {\n console.log(\"Button 2 Pressed\");\n }",
"handleClick(event, url) {\n event.preventDefault();\n this.postRequestOnClick(url);\n }",
"onClick(element) {\n\t\taction(`You have clicked on element ${element.name}`).call();\n\t}",
"clickHandler(evt) {\n if (evt.target.classList.contains('fa-check')) {\n gameApp.eventHandler(evt);\n }\n\n if (evt.target.classList.contains('assignment') || evt.target.parentElement.classList.contains('assignment')) {\n gameApp.activateContract(evt);\n }\n\n if (evt.target.classList.contains('loc')) {\n gameApp.addLoc();\n }\n\n if (evt.target.classList.contains('nav-button')) {\n let elem = evt.target;\n gameApp.gameView.changeMenue(elem);\n }\n }",
"function clickHandler(){ // declare a function that updates the state\n elementIsClicked = true;\n isElementClicked();\n }",
"function clickHandler(event){\n\t\t\tif(ignoreClick){\n\t\t\t\tignoreClick = false;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tvar offset = overlay.cumulativeOffset();\t\t\t\n\t\t\ttarget.fire('flotr:click', [{\n\t\t\t\tx: xaxis.min + (event.pageX - offset.left - plotOffset.left) / hozScale,\n\t\t\t\ty: yaxis.max - (event.pageY - offset.top - plotOffset.top) / vertScale\n\t\t\t}]);\n\t\t}",
"function _clickHandler(ev) {\n\tvar $this = $(ev.target).closest(\".hm-container\").parent();\n\tvar $cfg = $this.data('heatmap').config;\n\n\tif ($cfg.onReady.state != loadStates.READY) return true;\n\n\t// If there's an event handler registered for clicks, invoke it,\n\t// passing an object containing all the relevant info for the event.\n\tif (typeof $cfg.onClick.val == 'function') {\n\t var $$ctx = $this.data('ctx');\n\t var mouse_pos = _mouseAbs(ev, $$ctx);\n\t var ndxs = _getIndexes(mouse_pos, $$ctx);\n\n\t return $cfg.onClick.val ( { \"profile\": (ndxs.profile == null ? 'undefined' : $$ctx.profile_metadata[ndxs.profile]), \n\t\t\t\t\t\"sample\": (ndxs.sample == null ? 'undefined' : $$ctx.sample_metadata[ndxs.sample]), \n\t\t\t\t\t\"indexes\": ndxs, \n\t\t\t\t\t\"context\": $$ctx, \n\t\t\t\t\t\"event\": ev } );\n\t}\n\treturn true;\n }",
"function links_click_event(event) {\n console.log(\"works link\");\n}",
"function listenForClick() {\n loopThroughGrid();\n clickTurnBtn();\n }",
"function clickAssess() {\n\t$.trigger(\"clickAssess\");\n}",
"onClick() {\n }",
"function clicked() {\r\n // consists of animations and transitions\r\n resetClickLinks();\r\n // Click node Action and Info\r\n // only if it is defined\r\n click_node = drag_node; // defining here\r\n nodePop(click_node);\r\n loadInfo();\r\n}",
"@action\n click() {\n this.args['on-click']?.();\n }",
"function on_click(e) {\n cloud.on_click(e.clientX, e.clientY);\n}",
"clickHandler(e) {\n // Only activate if there is a buttonHandler\n if (this.buttonHandler !== false) {\n // Activate if not active\n if (this.active === false) {\n // Button view press effect\n this.changeToActive();\n // Click action\n this.clickAction();\n }\n }\n }",
"_click(event) {\n if (this.disabled) {\n event.preventDefault();\n }\n else {\n this._handleInteraction(event);\n event.stopPropagation();\n }\n }",
"function handleClick(event) {\n // Get the clicked chart element:\n let activeElement = chart.getElementAtEvent(event);\n // Do nothing if the click is not on a point on the chart:\n if (!activeElement[0]) {\n return;\n }\n // Get the index number of the clicked element:\n let elementID = activeElement[0]._index;\n // Get the post ID from the taskData.xLabels object array:\n let postID = taskData.xLabels[activeElement[0]._index];\n // Go to the selected task:\n window.location.href = \"/single.html?task=\" + postID;\n }",
"addHandlerClick(handler) {\n // NOTE Event delegation. Figure out which button was clicked, based on the event\n this._parentElement.addEventListener('click', function (e) {\n // Select the closest button-element to the clicked element.\n const btn = e.target.closest('.btn--inline');\n\n if (!btn) return;\n // The Controller is made and marked in the controller.js\n\n const goToPage = +btn.dataset.goto;\n\n handler(goToPage);\n });\n }",
"handleClick(event) {\n const { location, isSelectable, onClick } = this.props;\n\n if (!isSelectable || event.target.closest('.c-finder-tree-leaf__btn--toggle-selection')) {\n return;\n }\n\n onClick(location);\n }",
"function deal_click(){\n console.log(\"click!\");\n}",
"function onClickEvent() {\n 'use strict';\n var sender = this.id;\n\n switch (sender) {\n case \"btnCreateCourse\":\n onCreateCourse();\n break;\n case \"btnModifyCourse\":\n onModifyCourse();\n break;\n case \"btnDeleteCourse\":\n onDeleteCourse();\n break;\n case \"btnRefreshCourses\":\n onRefreshCourse();\n break;\n }\n }",
"clickHandler() {\n // Activate if not active\n if (this.active === 'safety') {\n // Button view press effect\n this.removeSafety();\n } else if (this.active === false) {\n // Button view press effect\n this.changeToActive();\n // Click action\n this.clickAction();\n }\n }",
"function click() {\n d3_eventCancel();\n w.on(\"click.drag\", null);\n }",
"onClick(e){\n console.log(\"onclick\")\n }",
"function handleBtnClick(event) {\n handleEvent(event);\n}",
"on_desklet_clicked(event) {\n this.retrieveEvents();\n }",
"function onClick(event) {\n\t\t//console.log(event);\t\t\n\t\tvar target = event.target;\n\t\tif (target.classList.contains(\"ui-selector-indicator\")) {\n\t\t\t//console.log(\"Indicator clicked\");\n\t\t\tvar ItemClicked = event.srcElement.textContent;\n\t\t\tconsole.log(\"Item Clicked on home page was: \" + ItemClicked);\n\n\t\t\t//Handel home page click events\n\t\t\tif(ItemClicked == \"Switches\"){\n\t\t\t\ttau.changePage(\"switchesPage\");\n\t\t\t}else if(ItemClicked == \"Clear Database\"){\n\t\t\t\t//------------------------------------------Clear Database\n\t\t\t\t//This should be moved to it's own function.\n\t\t\t\tconsole.log(\"Clearing Database\");\n\t\t\t\tlocalStorage.clear();\n\t\t\t\tAccess_Token = null;\n\t\t\t\tAccess_Url = null;\n\t\t\t\tswitches_DB = null;\n\t\t\t\talert(\"Database Cleared\");\n\t\t\t\t//Maybe we should exit here?\n\t\t\t\t//------------------------------------------Clear Database\n\t\t\t}else if(ItemClicked == \"Routines\"){\n\t\t\t\ttau.changePage(\"routinesPage\");\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t}",
"function handleClick() {\n $('button').click(function(event){\n emptyAbilities();\n renderAbilities(event.currentTarget.innerHTML);\n showAbilities();\n });\n }",
"HAXCMSButtonClick(e) {\n // stub, the classes implementing this will actually do something\n // you always will call super.HAXCMS\n }",
"function click(e) {\r\n\t\tif(!e && typeof e=='string') e=document.getElementById(e);\r\n\t\tif(!e) return;\r\n\t\tvar evObj = e.ownerDocument.createEvent('MouseEvents');\r\n\t\tevObj.initMouseEvent(\"click\",true,true,e.ownerDocument.defaultView,0,0,0,0,0,false,false,false,false,0,null);\r\n\t\te.dispatchEvent(evObj);\r\n\t}",
"function click(e) {\r\n\t\tif(!e && typeof e=='string') e=document.getElementById(e);\r\n\t\tif(!e) return;\r\n\t\tvar evObj = e.ownerDocument.createEvent('MouseEvents');\r\n\t\tevObj.initMouseEvent(\"click\",true,true,e.ownerDocument.defaultView,0,0,0,0,0,false,false,false,false,0,null);\r\n\t\te.dispatchEvent(evObj);\r\n\t}",
"onInternalClick(event) {\n const me = this,\n bEvent = {\n event\n };\n\n if (me.toggleable) {\n // Clicking the pressed button in a toggle group should do nothing\n if (me.toggleGroup && me.pressed) {\n return;\n }\n\n me.toggle(!me.pressed);\n }\n /**\n * User clicked button\n * @event click\n * @property {Core.widget.Button} button - Clicked button\n * @property {Event} event - DOM event\n */\n\n me.trigger('click', bEvent);\n /**\n * User performed the default action (clicked the button)\n * @event action\n * @property {Core.widget.Button} button - Clicked button\n * @property {Event} event - DOM event\n */\n // A handler may have resulted in destruction.\n\n if (!me.isDestroyed) {\n me.trigger('action', bEvent);\n } // since Widget has Events mixed in configured with 'callOnFunctions' this will also call onClick and onAction\n\n if (!this.href) {\n // stop the event since it has been handled\n event.preventDefault();\n event.stopPropagation();\n }\n }",
"click(e){\r\n if ( this.url ){\r\n bbn.fn.link(this.url);\r\n }\r\n else{\r\n this.$emit('click', e);\r\n }\r\n }",
"function Click() {\n}",
"_addClickFunctionality(button, option){\n\t\tvar config = this;\n\t\tbutton.click(function(){\n\t\t\tconfig.clicked_button = event.target;\n\t\t\tconfig._updatePrice(config.clicked_button)\n\t\t\tconfig._sortButtonColoring(config.clicked_button);\n\t\t\tconfig._updateMagento(config.clicked_button);\n\t\t\tconfig._eraseCategories(config.clicked_button);\n\t\t\tconfig._hideCategories(config.clicked_button);\n\t\t\tconfig._decideNext(config.clicked_button, option);\n\t\t});\n\t}",
"function handleClick(e) {\n sendRequest()\n }",
"clicked(x, y) {}",
"function do_click() {\n alert('you clicked');\n}",
"function testclick(e) {\n\talert('Clicked ' + '\\'' + e.source.id + '\\'');\n}",
"function cb_beforeClick(cb, pos) { }",
"click(callback, bubbles=false) {\n this.self.addEventListener('click', callback, bubbles);\n }",
"function handleClick (event){\n\tconsole.log(event);\n\tvar elementText = event.target.innerHTML; // the target html to var\n\tsayWhat.innerHTML = \"You clicked on the \" + elementText + \" section\"; // assign to output this\n}",
"function onClick(e) {\n \t\t// console.log(this);\n\t\t}",
"onParcelClick() {\n console.log('u clicked the lil parcel')\n }",
"function clickEvents(){\n alert('i am clicked');\n}",
"addClickHandler() {\n this.$el.find(this.settings.menuGroupTitleSelector).on('click', (e) => {\n e.preventDefault();\n e.stopPropagation();\n window.open(this.menu.find(this.settings.firstItemSelector).first().attr('href'), e.metaKey ? '_blank' : '_self');\n });\n this.toggler.on('click', (e) => {\n e.preventDefault();\n e.stopPropagation();\n this.menu.toggleClass(this.settings.visibleCssClass);\n this.setTogglerIcon(this.settings.icon.selector);\n });\n }",
"_onTap(e) {}",
"function clickHandler(e) {\r\n if (that.currentGameState.onClick) {\r\n that.currentGameState.onClick.call(this, that.currentGameState, e);\r\n }\r\n }",
"handleClick() {\n\t\tthis.setState( { clicked: true } );\n\t\tthis.props.addProductCallback( this.props.product.id );\n\t}",
"function click(e, type) {\r\nif(!e) {return;}\r\nif(typeof e=='string') e=document.getElementById(e);\r\nvar evObj = document.createEvent('MouseEvents');\r\nevObj.initMouseEvent((type||'click'),true,true,window,0,0,0,0,0,false,false,false,false,0,null);\r\ne.dispatchEvent(evObj);\r\n}",
"function click(e, type) {\r\nif(!e) {return;}\r\nif(typeof e=='string') e=document.getElementById(e);\r\nvar evObj = document.createEvent('MouseEvents');\r\nevObj.initMouseEvent((type||'click'),true,true,window,0,0,0,0,0,false,false,false,false,0,null);\r\ne.dispatchEvent(evObj);\r\n}",
"function click(e, type) {\r\nif(!e) {return;}\r\nif(typeof e=='string') e=document.getElementById(e);\r\nvar evObj = document.createEvent('MouseEvents');\r\nevObj.initMouseEvent((type||'click'),true,true,window,0,0,0,0,0,false,false,false,false,0,null);\r\ne.dispatchEvent(evObj);\r\n}",
"function click(e, type) {\r\nif(!e) {return;}\r\nif(typeof e=='string') e=document.getElementById(e);\r\nvar evObj = document.createEvent('MouseEvents');\r\nevObj.initMouseEvent((type||'click'),true,true,window,0,0,0,0,0,false,false,false,false,0,null);\r\ne.dispatchEvent(evObj);\r\n}",
"function click(e, type) {\r\nif(!e) {return;}\r\nif(typeof e=='string') e=document.getElementById(e);\r\nvar evObj = document.createEvent('MouseEvents');\r\nevObj.initMouseEvent((type||'click'),true,true,window,0,0,0,0,0,false,false,false,false,0,null);\r\ne.dispatchEvent(evObj);\r\n}",
"function click(e, type) {\r\nif(!e) {return;}\r\nif(typeof e=='string') e=document.getElementById(e);\r\nvar evObj = document.createEvent('MouseEvents');\r\nevObj.initMouseEvent((type||'click'),true,true,window,0,0,0,0,0,false,false,false,false,0,null);\r\ne.dispatchEvent(evObj);\r\n}",
"function handleClick(e){\n switch (e.target.classList[0]){\n // For like and delete, I've loaded up the id in two different ways for funsies.\n case \"btn-success\": \n // In this case (like), I know the API is going to return the relevant quote object on a success, which has a quoteId. \n // When I pass through the callback function (quoteObject) => addLikeById(quote.quoteId)) and call it in the second .then, the response from the fetch is passed to it as an argument.\n adapter.likeQuote(parseInt(e.target.dataset.likeId), (quoteObject) => addLikeById(quoteObject.quoteId));\n break;\n case \"btn-danger\":\n // In this case (delete), the API doesn't send back anything, so I pulled the id from the dataset from the target of the event.\n adapter.deleteQuote(e.target.dataset.deleteId, () => removeQuoteById(e.target.dataset.deleteId))\n break;\n default:\n break;\n }\n }",
"function handleClick() {\n if (props.type == 'todo') {\n return finishTask(props.task, props.index)\n }\n\n else if (props.type == 'done') {\n return undoTask(props.task, props.index)\n }\n }",
"onItemClick(name, elem, evt){\r\n this.emit('click', name, elem, evt);\r\n }",
"clicked() {\n this.get('onOpen')();\n }",
"handleClick(articleToPlay) {\r\n // Asserting if an utterance is being played it gets canceled\r\n this.playing = 'LIST_PLAY';\r\n // Sending data to PlayerPage component changing state\r\n this.clickHandler(this.playing, true, articleToPlay.headline, articleToPlay.author, articleToPlay.content);\r\n }",
"elementClick(e) {\n if (e.detail) {\n e.detail.target.dispatchEvent(\n new MouseEvent(\"click\", {\n bubbles: true,\n cancelable: true,\n view: window,\n })\n );\n }\n }",
"onclick(){}",
"function setClickBehaviour(){\n\t\t\tbutton.on(\"click\", changeButtonLabelAndSendEvent);\n\t\t}",
"buttonClick(ev) {\n\n\t\t// Get the button using the index\n\t\tvar btn = this.props.buttons[ev.currentTarget.dataset.index];\n\n\t\t// If there's a callback\n\t\tif(typeof btn.callback == 'function') {\n\t\t\tbtn.callback(btn);\n\t\t} else {\n\t\t\tthis.props.close();\n\t\t}\n\t}",
"handleClick () {\n super.handleClick();\n if (this.casting) {\n return this.stopCasting();\n } else {\n return this.doLaunch();\n }\n }",
"_onLabelClick(ev) {\n const $target = $(ev.currentTarget);\n this.trigger('revisionSelected', [0, $target.data('revision')]);\n }"
] |
[
"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.69725585",
"0.6969008",
"0.6940908",
"0.6886495",
"0.6866536",
"0.6859694",
"0.68442965",
"0.68236756",
"0.6817138",
"0.68103236",
"0.68081677",
"0.6805614",
"0.680148",
"0.6785153",
"0.6783431",
"0.6759283",
"0.6754726",
"0.6740714",
"0.67305374",
"0.6720963",
"0.6707124",
"0.6705986",
"0.6694178",
"0.66818166",
"0.6671246",
"0.6657273",
"0.6655512",
"0.66379064",
"0.6624547",
"0.66195226",
"0.6616446",
"0.6603907",
"0.6601692",
"0.65978515",
"0.65958583",
"0.65890324",
"0.65886736",
"0.65840906",
"0.6581051",
"0.65719074",
"0.65687764",
"0.655458",
"0.6552917",
"0.6552641",
"0.6552641",
"0.6528553",
"0.65236956",
"0.6521108",
"0.6520102",
"0.6519221",
"0.6515924",
"0.65125406",
"0.6512157",
"0.6505019",
"0.6500281",
"0.64877325",
"0.64848256",
"0.6479867",
"0.64731705",
"0.6470219",
"0.64697886",
"0.6464425",
"0.6460205",
"0.64523137",
"0.64523137",
"0.64523137",
"0.64523137",
"0.64523137",
"0.64523137",
"0.64493674",
"0.6448905",
"0.6448193",
"0.64468056",
"0.64439505",
"0.6439658",
"0.64387053",
"0.64304215",
"0.64304113",
"0.6428534",
"0.6425676"
] |
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 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 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 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 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 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 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 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 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 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 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 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 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 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 syntheticEvent=this;var nativeEvent=syntheticEvent.nativeEvent;if(nativeEvent.getModifierState){return nativeEvent.getModifierState(keyArg);}var keyProp=modifierKeyToProp[keyArg];return keyProp?!!nativeEvent[keyProp]:false;}",
"function bufferModifier(e) { return e.shiftKey*1 + e.ctrlKey*2 + e.altKey*4 }",
"function getModifierState(event, mod) {\n return typeof event.getModifierState === \"function\"\n ? event.getModifierState(mod)\n : false;\n}",
"function modifierStateGetter(keyArg){ /*jshint validthis:true */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){ /*jshint validthis:true */var syntheticEvent=this;var nativeEvent=syntheticEvent.nativeEvent;if(nativeEvent.getModifierState){return nativeEvent.getModifierState(keyArg);}var keyProp=modifierKeyToProp[keyArg];return keyProp?!!nativeEvent[keyProp]:false;}",
"function hasModifierKeys(oEvent) {\n\t\treturn oEvent.shiftKey || oEvent.altKey || getCtrlKey(oEvent);\n\t}",
"_modifiers(e) {\n const [_x, _y] = ELEM.getScrollPosition(0);\n const [x, y] = [Event.pointerX(e), Event.pointerY(e)];\n if (!isNaN(x) || isNaN(y)) {\n this.status.setCrsr(x, y);\n }\n this.status.setAltKey(e.altKey);\n this.status.setCtrlKey(e.ctrlKey);\n this.status.setShiftKey(e.shiftKey);\n this.status.setMetaKey(e.metaKey);\n }",
"_modifiers(e) {\n const [_x, _y] = ELEM.getScrollPosition(0);\n const [x, y] = [Event.pointerX(e), Event.pointerY(e)];\n if (!isNaN(x) || isNaN(y)) {\n this.status.setCrsr(x, y);\n }\n this.status.setAltKey(e.altKey);\n this.status.setCtrlKey(e.ctrlKey);\n this.status.setShiftKey(e.shiftKey);\n this.status.setMetaKey(e.metaKey);\n }",
"function isModifierKey(value) {\n\t\t var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n\t\t return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n\t\t }",
"function modifKey(e) \n{\n var modif=''; \n if (event.altKey) \n {\n modif+='[ Alt ] ';\n } \n if (event.ctrlKey) \n {\n modif+='[ Ctrl ] ';\n } \n if (event.shiftKey) \n {\n modif+='[ Shift ] ';\n } \n getKey(e,modif); \n}",
"function toModifiersMask(modifiers) {\n // From Source/WebKit/Shared/WebEvent.h\n let mask = 0;\n if (modifiers.has('Shift')) mask |= 1;\n if (modifiers.has('Control')) mask |= 2;\n if (modifiers.has('Alt')) mask |= 4;\n if (modifiers.has('Meta')) mask |= 8;\n return mask;\n}",
"function isModifier(e) {\n\treturn e.ctrlKey || e.altKey || e.metaKey;\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n }",
"function modifierStateGetter(keyArg) {\r\n\t var syntheticEvent = this;\r\n\t var nativeEvent = syntheticEvent.nativeEvent;\r\n\t if (nativeEvent.getModifierState) {\r\n\t return nativeEvent.getModifierState(keyArg);\r\n\t }\r\n\t var keyProp = modifierKeyToProp[keyArg];\r\n\t return keyProp ? !!nativeEvent[keyProp] : false;\r\n\t}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\";\n }",
"function keyName(event, noShift) {\n\t\t if (presto && event.keyCode == 34 && event[\"char\"]) { return false }\n\t\t var name = keyNames[event.keyCode];\n\t\t if (name == null || event.altGraphKey) { return false }\n\t\t // Ctrl-ScrollLock has keyCode 3, same as Ctrl-Pause,\n\t\t // so we'll use event.code when available (Chrome 48+, FF 38+, Safari 10.1+)\n\t\t if (event.keyCode == 3 && event.code) { name = event.code; }\n\t\t return addModifierNames(name, event, noShift)\n\t\t }",
"function modifierStateGetter(keyArg) {\n\t\t var syntheticEvent = this;\n\t\t var nativeEvent = syntheticEvent.nativeEvent;\n\t\t if (nativeEvent.getModifierState) {\n\t\t return nativeEvent.getModifierState(keyArg);\n\t\t }\n\t\t var keyProp = modifierKeyToProp[keyArg];\n\t\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t\t}",
"function modifierStateGetter(keyArg) {\n\t\t var syntheticEvent = this;\n\t\t var nativeEvent = syntheticEvent.nativeEvent;\n\t\t if (nativeEvent.getModifierState) {\n\t\t return nativeEvent.getModifierState(keyArg);\n\t\t }\n\t\t var keyProp = modifierKeyToProp[keyArg];\n\t\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t\t}",
"function modifierStateGetter(keyArg) {\n\t\t var syntheticEvent = this;\n\t\t var nativeEvent = syntheticEvent.nativeEvent;\n\t\t if (nativeEvent.getModifierState) {\n\t\t return nativeEvent.getModifierState(keyArg);\n\t\t }\n\t\t var keyProp = modifierKeyToProp[keyArg];\n\t\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t\t}",
"function isModifierKey(value) {\r\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\r\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\r\n}",
"function keyName(event, noShift) {\r\n if (presto && event.keyCode == 34 && event[\"char\"]) { return false }\r\n var name = keyNames[event.keyCode];\r\n if (name == null || event.altGraphKey) { return false }\r\n // Ctrl-ScrollLock has keyCode 3, same as Ctrl-Pause,\r\n // so we'll use event.code when available (Chrome 48+, FF 38+, Safari 10.1+)\r\n if (event.keyCode == 3 && event.code) { name = event.code; }\r\n return addModifierNames(name, event, noShift)\r\n}",
"onKeyDown(e) {\n e = e || window.event;\n //console.log(e.shiftKey);\n }",
"function modifierStateGetter(keyArg) {\n var syntheticEvent = this, nativeEvent = syntheticEvent.nativeEvent;\n if (nativeEvent.getModifierState) return nativeEvent.getModifierState(keyArg);\n var keyProp = modifierKeyToProp[keyArg];\n return !!keyProp && !!nativeEvent[keyProp];\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode];\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode]\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function isModifierKey(value) {\n var name = typeof value == \"string\" ? value : keyNames[value.keyCode]\n return name == \"Ctrl\" || name == \"Alt\" || name == \"Shift\" || name == \"Mod\"\n}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}",
"function modifierStateGetter(keyArg) {\n\t var syntheticEvent = this;\n\t var nativeEvent = syntheticEvent.nativeEvent;\n\t if (nativeEvent.getModifierState) {\n\t return nativeEvent.getModifierState(keyArg);\n\t }\n\t var keyProp = modifierKeyToProp[keyArg];\n\t return keyProp ? !!nativeEvent[keyProp] : false;\n\t}"
] |
[
"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.68797",
"0.6851738",
"0.68236375",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.6771633",
"0.67651886",
"0.6738654",
"0.6715765",
"0.6715143",
"0.6715143",
"0.6715143",
"0.6714739",
"0.6662252",
"0.6660694",
"0.664939",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.6628046",
"0.66168284",
"0.66168284",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337",
"0.6615337"
] |
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, value) {\n\t\tthis.keys.push(key);\n\t\tthis.values.push(value);\n\t}\n\n\t// get value from key\n\tthis.get = function(key) {\n\t\treturn this.keys.indexOf(key) != -1 ? this.values[this.keys.indexOf(key)] : null;\n\n\t}\n}",
"function InvokeDefinitionMap() {\n this.map = [];\n this.lookup_table = {}; // Just for building dictionary\n}",
"function Map() {\n\t\tthis._values = {};\n\t}",
"function Map(implementation){\n\tvar map;\n\t\n\tswitch(implementation){\n\t\tcase 'hashMap':\n\t\t\tmap = new HashMap();\n\t\tbreak;\n\t\tdefault:\n\t\t\ttry{\n\t\t\t\tmap = instantiate(implementation)\n\t\t\t} catch(e) {\n\t\t\t\tthrow Error(\"Undefined implemantation name \" + implementation);\n\t\t\t}\n\t}\n\tInterface.ensureImplements(map, MapInterface);\n\treturn map;\n}",
"function ValueMap(data) {\n this.data = data || {};\n}",
"_saveInstanceProperties() {\n for (const [p] of this.constructor\n ._classProperties) {\n if (this.hasOwnProperty(p)) {\n const value = this[p];\n delete this[p];\n if (!this._instanceProperties) {\n this._instanceProperties = new Map();\n }\n this._instanceProperties.set(p, value);\n }\n }\n }",
"function ObjectMap ()\n\t{\n\t\t\n\t\t/**\n\t\t * Key value pairs\n\t\t * \n\t\t * @type {array of objects}\n\t\t */\n\t\tthis._keyValuePairs = [];\n\t}",
"function Map() {}",
"function TsMap(intrator) {\n // Used to store keys.\n this.keyStore = [];\n // Used to store values.\n this.valueStore = [];\n // The Map's size,\n // increase at function set,\n // decrease at function remove,\n // clear at function clear.\n this.size = 0;\n if (intrator) {\n for (var _i = 0, intrator_1 = intrator; _i < intrator_1.length; _i++) {\n var item = intrator_1[_i];\n this.keyStore.push(item[0]);\n this.valueStore.push(item[1]);\n this.size++;\n }\n }\n }",
"function CachedMap(mappingFunction) {\n this._map = mappingFunction || null;\n this._cachedOutput = null;\n this._cachedInput = Number.NaN; //never valid as input\n }",
"function Map() {\n this.dict = {};\n\n /**\n * Returns the number of key-value mappings in this map.\n * @method\n */\n this.size = function () {\n return Object.keys(this.dict).length;\n };\n\n /**\n * Returns true if this map contains no key-value mappings.\n * @method\n */\n this.isEmpty = function () {\n return Object.keys(this.dict).length == 0;\n };\n\n /**\n * Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.\n * @method\n */\n this.get = function (key) {\n return this.dict[key];\n };\n\n /**\n * Returns true if this map contains a mapping for the specified key.\n * @method\n */\n this.containsKey = function (key) {\n if (this.get(key) !== undefined) {\n return true;\n } else {\n return false;\n }\n };\n\n /**\n * Associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced.\n * @method\n */\n this.put = function (key, value) {\n this.dict[key] = value;\n };\n\n /**\n * Removes the mapping for the specified key from this map if present.\n * @method\n */\n this.remove = function (key) {\n try {\n 'use strict';\n delete this.dict[key];\n } catch (e) {\n console.log(e);\n }\n };\n\n /**\n * Removes all of the mappings from this map. The map will be empty after this call returns.\n * @method\n */\n this.clear = function () {\n this.dict = {};\n };\n\n /**\n * Executes the given callback for each entry in this map until all entries have been processed.\n * The given callback will be passed a map entry as parameter. So, for example...\n *\n * function myCallback(mapEntryItem) {\n * \t\tconsole.log('I will process this item: ' + mapEntryItem.text);\n * }\n *\n * myMap.forEach(myCallback);\n *\n * @method\n */\n this.forEach = function (callback) {\n var len = this.size();\n for (i = 0; i < len; i++) {\n var item = this.get(Object.keys(this.dict)[i]);\n callback(item);\n }\n };\n\n this.first = function (callback) {\n var len = this.size();\n for (i = 0; i < len && i < 1; i++) {\n var item = this.get(Object.keys(this.dict)[0]);\n callback(Object.keys(this.dict)[0], item);\n }\n };\n\n this.forAll = function (callback) {\n var len = this.size();\n for (i = 0; i < len; i++) {\n var key = Object.keys(this.dict)[i];\n var item = this.get(key);\n callback(key, item);\n }\n };\n}",
"function Map(index, type) {\n\n // Constants -------------------------------------------------------------------\n\n const ID_PROP = '_id';\n\n // Instances -------------------------------------------------------------------\n\n // Keep track of the entry listeners added by the user.\n var _entryListeners = [];\n\n\t// Privates --------------------------------------------------------------------\n\n /**\n * Adds an entry listener which can be notified via callback function when an entry is added,\n * removed, updated or evicted from the map. These notifications will occur asynchronously and\n * they occur _after_ the event has been performed on the cache.\n *\n * The listener will have to provide at least one valid callback function. The function names\n * are entryAdded(entry), entryRemoved(entry), entryUpdated(entry) and entryEvicted(entry). If\n * the entry is a JSON object (which they all are), the entry will be a parsed JSON object. If\n * not, the entry parameter will be passed as-is.\n *\n * Each listener has a name property that uniquely identifies the listener. This is a bit of\n * a hack to prevent multiple listeners from being registered when the JS platform reloads\n * modules when they have been modified. In these cases, the registerListener() functions\n * fire again when the module is reloaded, and there is insufficient uniqueness in the\n * current set of parameters to determine if the registration is a duplicate or two\n * different listeners on the same event.\n *\n * @param listener\n */\n var addEntryListener = function(listener) {\n if (!listener.entryAdded && !listener.entryRemoved &&\n !listener.entryUpdated && !listener.entryEvicted) {\n throw 'EntryListener must implement a valid callback function.';\n }\n\n if (!listener.name) {\n throw 'EntryListener must have a unique name.';\n }\n\n // Remove a listener with the same name if it exists\n _entryListeners = _entryListeners.filter(function (l) {\n return listener.name !== l.name\n });\n\n _entryListeners.push(listener);\n };\n\n var clearEntryListeners = function() {\n _entryListeners = [];\n };\n\n var invokeListeners = function(eventName, event) {\n log.debug('Received internal event: {}, checking for listeners among [{}] candidates.',\n eventName, _entryListeners.length);\n if (_entryListeners.length > 0) {\n // Create the object we will be passing into each of our listeners\n var entry = {\n key: event.key,\n index: index,\n type: type,\n source: name,\n value: event.value,\n oldValue: event.oldValue\n };\n\n if (typeof entry.value === 'string') {\n try {\n entry.value = JSON.parse(entry.value);\n } catch(e) {\n }\n }\n\n if (typeof entry.oldValue === 'string') {\n try {\n entry.oldValue = JSON.parse(entry.oldValue);\n } catch(e) {\n }\n }\n\n for (var i = 0; i < _entryListeners.length; i++) {\n var handler = _entryListeners[i][eventName];\n if (handler) {\n executor.submit(createTask(eventName, handler, entry));\n }\n }\n }\n\n function createTask(eventName, func, entry) {\n return new java.lang.Runnable({\n run: function() {\n try {\n func(entry);\n } catch (e) {\n log.error('Error executing listener event: {}', eventName, e);\n }\n }\n });\n }\n };\n\n\t/**\n\t * Put can be called with or without a 'key' parameter. If the key parameter is not present, the\n\t * JSON value object is queried for an '_id' property. If found, the ID_PROP is the key. If not\n\t * found, a new UUID is generated and used as the key.\n\t *\n\t * This is completely arbitrary, but I am stipulating the key is a string and the value is an\n\t * object. If we decide later to allow values to be a string, date, or something else, this\n\t * logic will have to be rewritten.\n\t *\n\t * @params {string, object [,ttl, units]}\n\t * @params {object [,ttl, units]}\n\t *\n\t */\n\tvar put = function() {\n if (arguments.length === 0)\n throw 'IllegalArgumentException, map.put requires at least one argument.';\n\n var args = Array.prototype.slice.call(arguments);\n\n var result = putValue.apply(this, args);\n\n if (typeof result === 'string') {\n return JSON.parse(result);\n } else {\n return null;\n }\n\t};\n\n\n\tvar putValue = function() {\n\t\tvar args = Array.prototype.slice.call(arguments);\n\t\tvar types = args.map(function(arg) {\n\t\t\treturn typeof arg;\n\t\t});\n\n\t\t// If the first parameter is a string, it is our key\n\t\tif (types[0] === 'string') {\n\t\t\treturn putKeyValue.apply(this, args);\n\t\t}\n\n\t\t// If the first parameter is an object, we have to check to see if it has a key. If so, we\n\t\t// will use it, otherwise we will generate a new key.\n\t\tif (types[0] === 'object') {\n\t\t\tvar value = args[0];\n\t\t\tvar key = value[ID_PROP];\n\t\t\tif (!key) key = value[ID_PROP] = generateId();\n\n\t\t\t// push the key into the argument list and invoke putKeyValue\n\t\t\targs.unshift(key);\n\t\t\treturn putKeyValue.apply(this, args);\n\t\t}\n\n\t\tthrow 'IllegalArgumentException, map.put requires the first parameter to be a string or an ' +\n\t\t\t\t'object.';\n\t};\n\n\n\t/**\n\t * Puts an entry into this map with a given ttl (time to live) value.\n\t * Entry will expire and get evicted after the ttl.\n\t *\n\t * @param key {String} key of the entry\n\t * @param value {Object} value of the entry\n\t * @param ttl {Number} maximum time for this entry to stay in the map\n\t * @param timeunit {String} time unit for the ttl\n\t * @return {Object} old value of the entry\n\t */\n\tvar putKeyValue = function(key, value, ttl, timeunit) {\n\t\tlog.debug('Putting into map <' + name + '>: ' + key);\n\n if(!ttl) ttl = 0;\n if(!timeunit) timeunit = java.util.concurrent.TimeUnit.MILLISECONDS;\n if (typeof timeunit === 'string') timeunit = java.util.concurrent.TimeUnit.valueOf(timeunit);\n\n\t\tdelete value._type;\n\t\tdelete value._version;\n\t\tdelete value._index;\n\t\tdelete value._score;\n\n var json = JSON.stringify(value);\n\t\treturn map.put(key, json, ttl, timeunit);\n\t};\n\n\t/**\n\t * Returns the value to which the specified key is mapped,\n\t * or {@code null} if this map contains no mapping for the key.\n\t *\n\t * <p>If this map permits null values, then a return value of\n\t * {@code null} does not <i>necessarily</i> indicate that the map\n\t * contains no mapping for the key; it's also possible that the map\n\t * explicitly maps the key to {@code null}. The {@link #containsKey\n\t * containsKey} operation may be used to distinguish these two cases.\n\t *\n\t * @param key the key whose associated value is to be returned\n\t * @return the value to which the specified key is mapped, or\n\t * {@code null} if this map contains no mapping for the key\n\t */\n\tvar get = function(key) {\n\t\tif (typeof key === 'object') return queryGet(key);\n\t\tlog.debug('Getting from map [{}]: {}', name, key);\n\t\tvar value = map.get(key);\n\t\tif (typeof value === 'string') {\n\t\t\treturn JSON.parse(value);\n\t\t} else {\n\t\t\treturn null;\n\t\t}\n\t};\n\n\n /**\n * Returns a set view of the keys contained in this map. The set is\n * backed by the map, so changes to the map are reflected in the set, and\n * vice-versa. If the map is modified while an iteration over the set is\n * in progress (except through the iterator's own <tt>remove</tt>\n * operation), the results of the iteration are undefined. The set\n * supports element removal, which removes the corresponding mapping from\n * the map, via the <tt>Iterator.remove</tt>, <tt>Set.remove</tt>,\n * <tt>removeAll</tt> <tt>retainAll</tt>, and <tt>clear</tt> operations.\n * It does not support the add or <tt>addAll</tt> operations.\n *\n * @return a set view of the keys contained in this map.\n */\n\tvar keySet = function() {\n return map.keySet();\n\t};\n\n /**\n * Determines if the key passed is in the cache. Does not use the MapLoader to find the\n * key. Useful for testing map eviction.\n *\n * @param key\n */\n var hasKey = function ( key ) {\n var predicate = new com.hazelcast.query.Predicate( {\n apply: function(entry) {\n return entry.key === key;\n }\n } );\n var keys = map.keySet(predicate);\n return keys.size() > 0;\n };\n\n\tvar count = function(query) {\n\t\treturn elastic.count(query, index, type);\n\t};\n\n\n\tvar evict = function(key) {\n\t\tlog.debug('Evicting from map <' + name + '>: ' + key);\n\t\treturn map.evict(key);\n\t};\n\n\n\t//var refresh = function(query) {\n var refresh = function(query) {\n\t\treturn elastic.refresh(index);\n\t};\n\n\n\t/**\n\t * Removes the mapping for a key from this map if it is present\n\t * (optional operation). More formally, if this map contains a mapping\n\t * from key <tt>k</tt> to value <tt>v</tt> such that\n\t * <code>(key==null ? k==null : key.equals(k))</code>, that mapping\n\t * is removed. (The map can contain at most one such mapping.)\n\t *\n\t * <p>Returns the value to which this map previously associated the key,\n\t * or <tt>null</tt> if the map contained no mapping for the key.\n\t *\n\t * <p>The map will not contain a mapping for the specified key once the\n\t * call returns.\n\t *\n\t * @param key key whose mapping is to be removed from the map\n\t * @return the previous value associated with <tt>key</tt>, or\n\t * <tt>null</tt> if there was no mapping for <tt>key</tt>.\n\t */\n\tvar remove = function(key) {\n\t\tif (typeof key === 'object') return queryRemove(key);\n\t\tlog.debug('Removing from map [{}] using key: {}', name, key);\n\t\tvar previous = map.remove(key);\n\t\treturn (previous) ? JSON.parse(previous) : null;\n\t};\n\n\n\t/**\n\t * Removes all of the mappings from this map (optional operation).\n\t * The map will be empty after this call returns.\n\t */\n\tvar clear = function() {\n\t\tmap.clear();\n\t};\n\n\tvar size = function() {\n\t\treturn map.size();\n\t};\n\n\n\n\t/**\n\t * Hazelcast's strength is not querying because it is possible for some data to not yet be in\n\t * the in-memory cache. Because of this, querying is better suited to be performed against\n\t * Elastic Search or some other backing store which has access to the full set of data.\n\t *\n\t * @param json Object that describes the ES query\n\t */\n\tvar queryGet = function(json) {\n //var splitArr = name.split(\"-\");\n\t\tlog.debug('Searching map [{}]: {}', name, JSON.stringify(json));\n\t\treturn elastic.search(json, index, type);\n\t};\n\n\t/**\n\t * The query used to remove items from the map will be an ElasticSearch query. We don't\n\t * currently have a way to easily determine which id's are affected by the query, so we will\n\t * evict all elements from the map.\n\t *\n\t * // todo: It may be feasible to run the query and get the ids of all elements affected,\n\t * then evict them individually from the Hazelcase map by id,\n\t *\n\t * @param json\n\t */\n\tvar queryRemove = function(json) {\n\t\tlog.debug('Removing from map [{}] using query.: {}', name, JSON.stringify(json));\n\t\telastic.remove(json, index, type);\n\t\tmap.clear();\n\t};\n\n\n\tvar toString = function() {\n\t\treturn 'Hazelcast Map [' + name + ']';\n\t};\n\n\t// Constructors ----------------------------------------------------------------\n\n if (name === 'undefined' || type === 'undefined' || name === null || type === null)\n {\n\t throw 'Name of index and type of map must be set.';\n }\n\n // The name of the map in Hazelcast is a concatination of index and type.\n var name = index + '-' + type;\n\n // Use the Hazelcast instance to retrieve the map by name\n \tvar map = hazelcast.getMap(name);\n\n // attach a listener to the map to be notified of any events that occur on the map.\n var listener = new com.hazelcast.core.EntryListener({\n entryAdded: function(event) {\n invokeListeners('entryAdded', event);\n\t },\n entryRemoved: function(event) {\n invokeListeners('entryRemoved', event);\n\t },\n entryUpdated: function(event) {\n invokeListeners('entryUpdated', event);\n\t },\n entryEvicted: function(event) {\n invokeListeners('entryEvicted', event);\n\t }\n });\n\n // We use the local version of the entry listener because we usually only want one node in the\n // cluster to handle the event. If all of our nodes were notified when an event fired, we would\n // have to do some distributed gymnastics to ensure only one node handled the event. So, this\n // local event listening is very crucial, and provides excellent performance.\n log.debug('Adding Hazelcast event listener to map [{}]', name);\n map.addLocalEntryListener(listener);\n\n\n\treturn {\n addEntryListener: addEntryListener,\n clearEntryListeners: clearEntryListeners,\n\t\tclear: clear,\n\t\tevict: evict,\n\t\tget: get,\n\t\tkeySet: keySet,\n\t\thasKey: hasKey,\n\t\thzObject: map,\n index: index,\n type: type,\n\t\tname: name,\n\t\tput: put,\n\t\tcount: count,\n\t\tremove: remove,\n\t\trefresh: refresh,\n\t\tsize: size,\n\t\ttoString: toString\n\t};\n}",
"function getInstanceContext(instanceId) {\n return instanceMap[instanceId]; \n }",
"function get(key){return key._reactInternals;}",
"function get(key){return key._reactInternals;}",
"function h$Map() {\n this._pairsKeys = [];\n this._pairsValues = [];\n this._keys = [];\n this._size = 0;\n}",
"function h$Map() {\n this._pairsKeys = [];\n this._pairsValues = [];\n this._keys = [];\n this._size = 0;\n}",
"function h$Map() {\n this._pairsKeys = [];\n this._pairsValues = [];\n this._keys = [];\n this._size = 0;\n}",
"function h$Map() {\n this._pairsKeys = [];\n this._pairsValues = [];\n this._keys = [];\n this._size = 0;\n}",
"function mapState(state) {\n return {\n counterValue: state.counterValue\n }\n}",
"function Map() {\n this.members = {};\n this.length = 0;\n }",
"render() {\n return(\n <div className=\"drumkit\">\n <div className=\"keys\">\n {\n Object.keys(this.state.keymaps)\n .map(key => <Keys key={key} map={this.state.keymaps[key]} index={key} className={this.state.keymaps[key].className} />)\n }\n </div>\n </div>\n )\n }",
"function Map() {\n var keys = [], values = [];\n\n return {\n contains: function (key) {\n var at = keys.indexOf(key);\n return at > -1;\n },\n get: function (key) {\n var at = keys.indexOf(key);\n if (at >= 0) {\n return values[at];\n }\n },\n put: function (key, value) {\n var at = keys.indexOf(key);\n if (at < 0) {\n at = keys.length;\n }\n keys[at] = key;\n values[at] = value;\n },\n remove: function (key) {\n var at = keys.indexOf(key);\n if (at >= 0) {\n keys.splice(at, 1);\n values.splice(at, 1);\n }\n }\n }\n}",
"map(predicate) {\n const tuples = this.toArray().map(([component, value]) => {\n const newValue = predicate(value, component);\n return [component.id.toString(), [component, newValue]];\n });\n return new ComponentMap(new Map(tuples));\n }",
"add(index, instance) {\n // Add a single object only one parameter is passed\n // so index = instance\n if( instance === undefined) this.map.set( 0, index );\n else this.map.set( index, instance );\n }",
"constructor () {\n this.storage = immutable.Map()\n }",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function get(key){return key._reactInternalFiber;}",
"function Map() {\n if (this instanceof Map) {\n this._keys = OrderedSet.create();\n this._values = Object.create(null);\n this.size = 0;\n } else {\n missingNew('Map');\n }\n }",
"function MapCache() {\n this.__data__ = {};\n}",
"_saveInstanceProperties() {\n // Use forEach so this works even if for/of loops are compiled to for loops\n // expecting arrays\n this.constructor\n ._classProperties.forEach((_v, p) => {\n if (this.hasOwnProperty(p)) {\n const value = this[p];\n delete this[p];\n if (!this._instanceProperties) {\n this._instanceProperties = new Map();\n }\n this._instanceProperties.set(p, value);\n }\n });\n }",
"_saveInstanceProperties() {\n // Use forEach so this works even if for/of loops are compiled to for loops\n // expecting arrays\n this.constructor\n ._classProperties.forEach((_v, p) => {\n if (this.hasOwnProperty(p)) {\n const value = this[p];\n delete this[p];\n if (!this._instanceProperties) {\n this._instanceProperties = new Map();\n }\n this._instanceProperties.set(p, value);\n }\n });\n }",
"_saveInstanceProperties() {\n // Use forEach so this works even if for/of loops are compiled to for loops\n // expecting arrays\n this.constructor\n ._classProperties.forEach((_v, p) => {\n if (this.hasOwnProperty(p)) {\n const value = this[p];\n delete this[p];\n if (!this._instanceProperties) {\n this._instanceProperties = new Map();\n }\n this._instanceProperties.set(p, value);\n }\n });\n }",
"function LazyMap() {\n this.store = {};\n}",
"function LazyMap() {\n this.store = {};\n}",
"function LazyMap() {\n this.store = {};\n}",
"function LazyMap() {\n this.store = {};\n}",
"function LazyMap() {\n this.store = {};\n}",
"function LazyMap() {\n this.store = {};\n}",
"function ObjectWithMap(){\r\n\t\r\n\tthis.map = (func) => {\r\n\t\t\r\n\t\tfor (let i in this){\r\n\t\t\tif(i != 'map') this[i] = func(this[i]);\r\n\t\t}\r\n\t\t\r\n\t}\r\n}",
"function jsonMapMember(keyConstructor, valueConstructor, options) {\n if (options === void 0) { options = {}; }\n return function (target, propKey) {\n var decoratorName = \"@jsonMapMember on \" + nameof(target.constructor) + \".\" + String(propKey); // For error messages.\n if (typeof keyConstructor !== \"function\") {\n logError(decoratorName + \": could not resolve constructor of map keys at runtime.\");\n return;\n }\n if (typeof valueConstructor !== \"function\") {\n logError(decoratorName + \": could not resolve constructor of map values at runtime.\");\n return;\n }\n // If ReflectDecorators is available, use it to check whether 'jsonMapMember' has been used on a map. Warn if not.\n if (isReflectMetadataSupported && Reflect.getMetadata(\"design:type\", target, propKey) !== Map) {\n logError(decoratorName + \": property is not a Map. \" + MISSING_REFLECT_CONF_MSG);\n return;\n }\n injectMetadataInformation(target, propKey, {\n ctor: Map,\n elementType: [valueConstructor],\n keyType: keyConstructor,\n emitDefaultValue: options.emitDefaultValue,\n isRequired: options.isRequired,\n options: extractOptionBase(options),\n key: propKey.toString(),\n name: options.name || propKey.toString(),\n deserializer: options.deserializer,\n serializer: options.serializer,\n });\n };\n}",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"function Map(){\r\n\r\n\tthis.elements = new Array();\r\n\t\r\n\tthis.size = function(){\r\n\t\treturn this.elements.length;\r\n\t};\r\n\t\r\n\tthis.isEmpty = function(){\r\n\t\treturn (this.elements.length < 1);\r\n\t};\r\n\t\r\n\tthis.clear = function(){\r\n\t\tthis.elements = new Array();\r\n\t};\r\n\t\r\n\tthis.put = function(_key, _value){\r\n\t\tthis.remove(_key);\r\n\t\tthis.elements.push({key: _key, value: _value});\r\n\t};\r\n\t\r\n\tthis.remove = function(_key){\r\n\t\ttry {\r\n\t\t\tfor (i = 0; i < this.elements.length; i++) {\r\n\t\t\t\tif (this.elements[i].key == _key) {\r\n\t\t\t\t\tthis.elements.splice(i, 1);\r\n\t\t\t\t\treturn true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} catch (e) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn false;\r\n\t};\r\n\t\r\n\tthis.get = function(_key){\r\n\t\ttry {\r\n\t\t\tfor (i = 0; i < this.elements.length; i++) {\r\n\t\t\t\tif (this.elements[i].key == _key) { return this.elements[i].value; }\r\n\t\t\t}\r\n\t\t} catch (e) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t};\r\n\t\r\n\tthis.element = function(_index){\r\n\t\tif (_index < 0 || _index >= this.elements.length) { return null; }\r\n\t\treturn this.elements[_index];\r\n\t};\r\n\t\r\n\tthis.containsKey = function(_key){\r\n\t\ttry {\r\n\t\t\tfor (i = 0; i < this.elements.length; i++) {\r\n\t\t\t\tif (this.elements[i].key == _key) {\r\n\t\t\t\t\treturn true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} catch (e) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn false;\r\n\t};\r\n\t\r\n\tthis.values = function(){\r\n\t\tvar arr = new Array();\r\n\t\tfor (i = 0; i < this.elements.length; i++) {\r\n\t\t\tarr.push(this.elements[i].value);\r\n\t\t}\r\n\t\treturn arr;\r\n\t};\r\n\t\r\n\tthis.keys = function(){\r\n\t\tvar arr = new Array();\r\n\t\tfor (i = 0; i < this.elements.length; i++) {\r\n\t\t\tarr.push(this.elements[i].key);\r\n\t\t}\r\n\t\treturn arr;\r\n\t};\r\n}",
"function HashMap(){\n return {\n get: function(k){\n return this.store[k];\n },\n set: function(k, v){\n this.store[k] = v;\n return this;\n },\n has: function(k){\n return this.store[k] !== undefined;\n },\n delete: function(k){\n if(this.store[k] !== undefined){\n delete this.store[k];\n return true;\n }\n return false;\n },\n entries: function(){\n var entries = [];\n for(key in this.store){\n entries.push([key, this.store[key]]);\n }\n return entries;\n },\n forEach: function(callback, thisArg){\n for(key in this.store){\n if(thisArg !== undefined){\n thisArg.callback(key, this.store[key]);\n }else{\n callback(key, this.store[key]);\n }\n }\n },\n keys: function(){\n var keys = [];\n for(key in this.store){\n keys.push(key);\n }\n return keys;\n },\n values: function(){\n var values = [];\n for(key in this.store){\n values.push(this.store[key]);\n }\n return values;\n },\n\n store: {}\n };\n }",
"function Map(){\n\n\tthis.elements = new Array();\n\t\n\tthis.size = function(){\n\t\treturn this.elements.length;\n\t}\n\t\n\tthis.isEmpty = function(){\n\t\treturn (this.elements.length < 1);\n\t}\n\t\n\tthis.clear = function(){\n\t\tthis.elements = new Array();\n\t}\n\t\n\tthis.put = function(_key, _value){\n\t\tthis.remove(_key);\n\t\tthis.elements.push({key: _key, value: _value});\n\t}\n\t\n\tthis.remove = function(_key){\n\t\ttry {\n\t\t\tfor (i = 0; i < this.elements.length; i++) {\n\t\t\t\tif (this.elements[i].key == _key) {\n\t\t\t\t\tthis.elements.splice(i, 1);\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tthis.get = function(_key){\n\t\ttry {\n\t\t\tfor (i = 0; i < this.elements.length; i++) {\n\t\t\t\tif (this.elements[i].key == _key) { return this.elements[i].value; }\n\t\t\t}\n\t\t} catch (e) {\n\t\t\treturn null;\n\t\t}\n\t}\n\t\n\tthis.element = function(_index){\n\t\tif (_index < 0 || _index >= this.elements.length) { return null; }\n\t\treturn this.elements[_index];\n\t}\n\t\n\tthis.containsKey = function(_key){\n\t\ttry {\n\t\t\tfor (i = 0; i < this.elements.length; i++) {\n\t\t\t\tif (this.elements[i].key == _key) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tthis.values = function(){\n\t\tvar arr = new Array();\n\t\tfor (i = 0; i < this.elements.length; i++) {\n\t\t\tarr.push(this.elements[i].value);\n\t\t}\n\t\treturn arr;\n\t}\n\t\n\tthis.keys = function(){\n\t\tvar arr = new Array();\n\t\tfor (i = 0; i < this.elements.length; i++) {\n\t\t\tarr.push(this.elements[i].key);\n\t\t}\n\t\treturn arr;\n\t}\n}",
"function getInstanceBindingMap(content, delegate_) {\n var contentId = getContentUid(content);\n if (delegate_) {\n var map = delegate_.bindingMaps[contentId];\n if (!map) {\n map = delegate_.bindingMaps[contentId] =\n createInstanceBindingMap(content, delegate_.prepareBinding) || [];\n }\n return map;\n }\n\n var map = content.bindingMap_;\n if (!map) {\n map = content.bindingMap_ =\n createInstanceBindingMap(content, undefined) || [];\n }\n return map;\n }",
"function getInstanceBindingMap(content, delegate_) {\n var contentId = getContentUid(content);\n if (delegate_) {\n var map = delegate_.bindingMaps[contentId];\n if (!map) {\n map = delegate_.bindingMaps[contentId] =\n createInstanceBindingMap(content, delegate_.prepareBinding) || [];\n }\n return map;\n }\n\n var map = content.bindingMap_;\n if (!map) {\n map = content.bindingMap_ =\n createInstanceBindingMap(content, undefined) || [];\n }\n return map;\n }",
"function Map() {\n\t this.items = Object.create(null);\n\t this.length = 0;\n\t this.next = 0;\n\t }",
"function MapCache() {\n this.__data__ = {};\n }",
"function Map() {\n\t\t this.items = Object.create(null);\n\t\t this.length = 0;\n\t\t this.next = 0;\n\t\t }",
"function replacer(key, value) {\n const originalObject = this[key];\n\n if(originalObject instanceof Map) {\n const entry = Array.from(originalObject.entries());\n return entry.reduce((acc, [key, value]) => {\n acc[key] = value;\n return acc;\n }, {});\n } else {\n return value;\n }\n}",
"function createMap() {\n return Object.create(null)\n}",
"function createAutoBindMap(){if(!current.__reactAutoBindMap){return;}var __reactAutoBindMap={};for(var name in current.__reactAutoBindMap){if(typeof proxy[name]==='function'&¤t.__reactAutoBindMap.hasOwnProperty(name)){__reactAutoBindMap[name]=proxy[name];}}return __reactAutoBindMap;}",
"function createAutoBindMap(){if(!current.__reactAutoBindMap){return;}var __reactAutoBindMap={};for(var name in current.__reactAutoBindMap){if(typeof proxy[name]==='function'&¤t.__reactAutoBindMap.hasOwnProperty(name)){__reactAutoBindMap[name]=proxy[name];}}return __reactAutoBindMap;}",
"_saveInstanceProperties(){// Use forEach so this works even if for/of loops are compiled to for loops\n// expecting arrays\nthis.constructor._classProperties.forEach((_v,p)=>{if(this.hasOwnProperty(p)){const value=this[p];delete this[p];if(!this._instanceProperties){this._instanceProperties=new Map}this._instanceProperties.set(p,value)}})}",
"function Map() {\n if (this instanceof this.constructor) {\n this._keys = OrderedSet.create();\n this._keys._silenceRemoveDeprecation = true;\n this._values = new _emberMetalEmpty_object.default();\n this.size = 0;\n } else {\n missingNew('OrderedSet');\n }\n }",
"function Map() {\n if (this instanceof this.constructor) {\n this._keys = OrderedSet.create();\n this._keys._silenceRemoveDeprecation = true;\n this._values = new _emberMetalEmpty_object.default();\n this.size = 0;\n } else {\n missingNew('OrderedSet');\n }\n }",
"function mapData(instances) {\n const diffData = {}\n instances.forEach((instance, idx) => {\n diffData[instance.name.toLowerCase()] = idx\n })\n return diffData\n}",
"function saveInstance(instanceContext) {\n instanceId = instanceContext.instanceId;\n if (!instanceId) throw '--- instanceId is undefined';\n if (!instanceMap[instanceId]) throw '--- undefined instance ---';\n instanceMap[instanceId] = instanceContext;\n }",
"function MapCache() {\n this.__data__ = {};\n }",
"handleMap() {\r\n this.setState({displayMap: true});\r\n this.setState({displayedState: 'Map'});\r\n this.setState({displayedData: []});\r\n this.setState({output: []});\r\n this.setState({submitted: false});\r\n this.setState({allEntries: false});\r\n this.clearSearchFields();\r\n }"
] |
[
"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.4996279",
"0.4996279",
"0.498942",
"0.4978291",
"0.49621314",
"0.49542353",
"0.49530086",
"0.49278274",
"0.49168128",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.49167535",
"0.4907739",
"0.49037302",
"0.4882101",
"0.4882101",
"0.4882101",
"0.4879474",
"0.4879474",
"0.4879474",
"0.4879474",
"0.4879474",
"0.4879474",
"0.48716152",
"0.4863252",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48509988",
"0.48505586",
"0.48305696",
"0.4824233",
"0.48224047",
"0.48224047",
"0.48104116",
"0.48077253",
"0.48065156",
"0.48015407",
"0.4789329",
"0.47867453",
"0.47867453",
"0.47770765",
"0.4770031",
"0.4770031",
"0.47631076",
"0.4758567",
"0.47509113",
"0.47493035"
] |
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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"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 continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"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[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }",
"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 React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n }\n else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n return null;\n }",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}",
"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\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.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6786113",
"0.6786113",
"0.6786113",
"0.6786113",
"0.6786113",
"0.6786113",
"0.6786113",
"0.6780215",
"0.6780215",
"0.6780215",
"0.6780215",
"0.67587155",
"0.67587155",
"0.67587155",
"0.6752296",
"0.67223823",
"0.6698966",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794",
"0.6667794"
] |
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); }\n baseVisitor[type](node, st, c);\n if (!override) { callback(node, st || ancestors, ancestors, type); }\n if (isNew) { ancestors.pop(); }\n })(node, state);\n }",
"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); }\n baseVisitor[type](node, st, c);\n if (!override) { callback(node, st || ancestors, ancestors, type); }\n if (isNew) { ancestors.pop(); }\n })(node, state);\n }",
"setAncestors() {\n\t\t \tvar thisDataSource = this;\n\t\t \tvar addedClient = false;\n\t\t \t_.forEach(thisDataSource.nodes, function(node) {\n\t\t \t\tnode.ancestors = thisDataSource.ancestors_struct[node.id] || [];\n\t\t \t\tif (_.isEmpty(node.ancestors) === false) {\n\t\t \t\t\tnode.parent = node.ancestors[0];\n\t\t \t\t} else {\n\t\t \t\t\tif (_.includes(thisDataSource.children_struct.topLevel, node.id) == false) {\n\t\t \t\t\t\t//container has no parent\n\t\t \t\t\t\t//adding to client\n\t\t \t\t\t\tnode.ancestors.push(\"client\");\n\t\t \t\t\t\tthisDataSource.ancestors_struct[node.id] = [\"client\"];\n\t\t \t\t\t\tif (addedClient === false) {\n\t\t \t\t\t\t\taddedClient = true;\n\t\t\t \t\t\t\tthisDataSource.children_struct.topLevel.push(\"client\");\n\t\t \t\t\t\t\tthisDataSource.children_struct['client'] = [];\n\t\t \t\t\t\t}\n\t\t \t\t\t\tthisDataSource.children_struct['client'].push(node.id);\n\t\t\t \t\t}\n\t\t \t\t}\n\t\t \t})\n\t\t }",
"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); }\n baseVisitor[type](node, st, c);\n if (!override) { callback(node, st || ancestors, ancestors, type); }\n if (isNew) { ancestors.pop(); }\n })(node, state);\n}",
"function ancestor(node, visitors, baseVisitor, state, override) {\n var ancestors = [];\n if (!baseVisitor) { baseVisitor = base\n ; }(function c(node, st, override) {\n var type = override || node.type, found = visitors[type];\n var isNew = node !== ancestors[ancestors.length - 1];\n if (isNew) { ancestors.push(node); }\n baseVisitor[type](node, st, c);\n if (found) { found(node, st || ancestors, ancestors); }\n if (isNew) { ancestors.pop(); }\n })(node, state, override);\n }",
"function ancestor(node, visitors, baseVisitor, state) {\n var ancestors = [];\n if (!baseVisitor) { baseVisitor = base\n ; }(function c(node, st, override) {\n var type = override || node.type, found = visitors[type];\n var isNew = node !== ancestors[ancestors.length - 1];\n if (isNew) { ancestors.push(node); }\n baseVisitor[type](node, st, c);\n if (found) { found(node, st || ancestors, ancestors); }\n if (isNew) { ancestors.pop(); }\n })(node, state);\n }",
"function ancestor(node, visitors, baseVisitor, state, override) {\n var ancestors = [];\n if (!baseVisitor) { baseVisitor = base\n ; }(function c(node, st, override) {\n var type = override || node.type, found = visitors[type];\n var isNew = node !== ancestors[ancestors.length - 1];\n if (isNew) { ancestors.push(node); }\n baseVisitor[type](node, st, c);\n if (found) { found(node, st || ancestors, ancestors); }\n if (isNew) { ancestors.pop(); }\n })(node, state, override);\n}",
"function fullAncestor(node, callback, base, state) {\n if (!base) { base = exports.base; }\n var ancestors = [];(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); }\n base[type](node, st, c);\n if (!override) { callback(node, st || ancestors, ancestors, type); }\n if (isNew) { ancestors.pop(); }\n })(node, state);\n}",
"function ancestor(node, visitors, base, state) {\n if (!base) { base = exports.base; }\n var ancestors = [];(function c(node, st, override) {\n var type = override || node.type, found = visitors[type];\n var isNew = node != ancestors[ancestors.length - 1];\n if (isNew) { ancestors.push(node); }\n base[type](node, st, c);\n if (found) { found(node, st || ancestors, ancestors); }\n if (isNew) { ancestors.pop(); }\n })(node, state);\n}",
"get hierarchy()\n {\n let hierarchy = [];\n let parent = this;\n while (typeof parent !== 'undefined')\n {\n hierarchy.push(parent);\n parent = parent.parent;\n }\n return hierarchy;\n }",
"parent() {\n return this._ancestors.top();\n }",
"goToParent() {\n if (!this.hasParent()) {\n throw new Error(\"goToParent(): node has no ancestor\");\n }\n\n this._currentNode = this._ancestors.pop(); // We need to pop the containers and indexes stacks at least once\n // and more as needed until we restore the invariant that\n // this._containers.top()[this.indexes.top()] === this._currentNode\n //\n\n while (this._containers.size() && // This is safe, but easier to just disable flow than do casts\n // $FlowFixMe\n this._containers.top()[this._indexes.top()] !== this._currentNode) {\n this._containers.pop();\n\n this._indexes.pop();\n }\n }",
"refresh() {\n const topAncestor = this._ancestors[0] || this;\n topAncestor._refresh();\n }",
"popToNearestCommonAncestor(parentPrev, next);\n } else {\n // We must still be deeper.\n popPreviousToCommonLevel(parentPrev, next);\n }",
"popToNearestCommonAncestor(prev, parentNext);\n } else {\n // We must still be deeper.\n popNextToCommonLevel(prev, parentNext);\n }",
"cacheParentFolders() {\n let parents = this.$store.state.breadcrumb;\n parents.reverse().shift();\n\n for(let parent of parents) {\n\tthis.getFolderStructure(parent.path);\n }\n }",
"function getAncestors(child_id){\n var child_uuid = lookUpTable[child_id].uuid;\n graphApi.getAncestors(child_uuid)\n .success(function(data){\n getNodes(data, child_id);\n renderAgain();\n\n })\n .error(function(){console.log(\"An error occured when tried to get ancestors\");});\n }",
"function populate_parent(astroot) {\n\n function visit(node, parent) {\n if (!node || typeof node.type !== \"string\") {\n return;\n }\n\n for ( var prop in node) {\n if (node.hasOwnProperty(prop)) {\n\n // skip cyclic reference\n // at least for try-statement\n if (prop === '__parent__') {\n continue;\n }\n\n var child = node[prop];\n if (Array.isArray(child)) {\n for (var i = 0; i < child.length; i++) {\n visit(child[i], node);\n }\n }\n else {\n visit(child, node);\n }\n }\n }\n\n // must be post\n node.__parent__ = parent;\n }\n visit(astroot, null);\n}",
"function init$2(inRoot) {\n\t var root = inRoot;\n\t root.hierNode = {\n\t defaultAncestor: null,\n\t ancestor: root,\n\t prelim: 0,\n\t modifier: 0,\n\t change: 0,\n\t shift: 0,\n\t i: 0,\n\t thread: null\n\t };\n\t var nodes = [root];\n\t var node;\n\t var children;\n\t\n\t while (node = nodes.pop()) {\n\t // jshint ignore:line\n\t children = node.children;\n\t\n\t if (node.isExpand && children.length) {\n\t var n = children.length;\n\t\n\t for (var i = n - 1; i >= 0; i--) {\n\t var child = children[i];\n\t child.hierNode = {\n\t defaultAncestor: null,\n\t ancestor: child,\n\t prelim: 0,\n\t modifier: 0,\n\t change: 0,\n\t shift: 0,\n\t i: i,\n\t thread: null\n\t };\n\t nodes.push(child);\n\t }\n\t }\n\t }\n\t }",
"fillParents () {\n this.files.forEach((demoFile: DemoFile) => {\n demoFile.folder = this\n })\n this.folders.forEach((demoFolder: DemoFolder) => {\n demoFolder.parentFolder = this\n demoFolder.fillParents()\n })\n }",
"get ancestors () {\n return this.parents.reduce((parents, patch) => {\n return parents.concat([ patch ]).concat(patch.parents);\n }, []);\n }",
"constructor(root) {\n this.root = root; // When the callback is called, this property will hold the\n // node that is currently being traversed.\n\n this._currentNode = null; // This is a stack of the objects and arrays that we've\n // traversed through before reaching the currentNode.\n // It is different than the ancestors array.\n\n this._containers = new Stack(); // This stack has the same number of elements as the _containers\n // stack. The last element of this._indexes[] is the index of\n // the current node in the object or array that is the last element\n // of this._containers[]. If the last element of this._containers[] is\n // an array, then the last element of this stack will be a number.\n // Otherwise if the last container is an object, then the last index\n // will be a string property name.\n\n this._indexes = new Stack(); // This is a stack of the ancestor nodes of the current one.\n // It is different than the containers[] stack because it only\n // includes nodes, not arrays.\n\n this._ancestors = new Stack();\n }",
"function forceOpeningOfAncestorFolders() {\n if (this.parentObj == null || this.parentObj.isOpen)\n return\n else {\n this.parentObj.forceOpeningOfAncestorFolders()\n clickOnNodeObj(this.parentObj)\n }\n}",
"buildHierarchy () {\n for (var i = this.layers.length - 1; i >= 0; i--) {\n for (var j = 0; j < this.layers[i].length; j++) {\n for (var k = 0; k < this.layers[i][j].length; k++) {\n if (this.layers[i][j][k] === null) {\n continue\n }\n if (this.layers[i][j][k].parents.length < 1) {\n this.roots.push(this.layers[i][j][k].findChildren(this, this.numChildren))\n }\n }\n }\n }\n }",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}",
"function TopLevelCallbackBookKeeping(topLevelType, nativeEvent) {\n this.topLevelType = topLevelType;\n this.nativeEvent = nativeEvent;\n this.ancestors = [];\n}"
] |
[
"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.5566639",
"0.5564998",
"0.5543213",
"0.553229",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017",
"0.5494017"
] |
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() { 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() { return this._selected; }",
"get selected() { return this._selected; }",
"select() { this.selected = true; }",
"get _shouldUpdateSelection(){return this.selected!=null||this.selectedValues!=null&&this.selectedValues.length;}",
"function validateProps(element,props){// TODO (yungsters): Remove support for `selected` in <option>.\n\t{warning(props.selected==null,'Use the `defaultValue` or `value` props on <select> instead of '+'setting `selected` on <option>.');}}",
"get disallowEmptySelection() {\n return this.state.disallowEmptySelection;\n }",
"function validateProps(element,props){// TODO (yungsters): Remove support for `selected` in <option>.\n{warning(props.selected==null,'Use the `defaultValue` or `value` props on <select> instead of '+'setting `selected` on <option>.');}}",
"function validateProps(element,props){// TODO (yungsters): Remove support for `selected` in <option>.\n{warning(props.selected==null,'Use the `defaultValue` or `value` props on <select> instead of '+'setting `selected` on <option>.');}}",
"select () {\n this.selected = true;\n }",
"function validateProps(element,props){// TODO (yungsters): Remove support for `selected` in <option>.\n{if(props.selected!=null&&!didWarnSelectedSetOnOption){warning(false,'Use the `defaultValue` or `value` props on <select> instead of '+'setting `selected` on <option>.');didWarnSelectedSetOnOption=true;}}}",
"function validateProps(element,props){// TODO (yungsters): Remove support for `selected` in <option>.\n{if(props.selected!=null&&!didWarnSelectedSetOnOption){warning(false,'Use the `defaultValue` or `value` props on <select> instead of '+'setting `selected` on <option>.');didWarnSelectedSetOnOption=true;}}}",
"_hideSelected() {\n this.props.hideSelected();\n }",
"checkSelection(){\n Ember.run.next(() =>{\n let sel = this.getSelection(),\n hasSelection = !!$.trim(sel.toString());\n\n this.$toolpane.css('visibility', hasSelection ? 'visible' : 'hidden');\n\n if(hasSelection) {\n this.$toolpane.css(this.getToolpaneCoords(sel));\n }\n });\n }",
"_setSelectedOption() {\n if (this.options.length > 1) super._setSelectedOption();\n }",
"set selectedItem(aItem) {\n // A predicate is allowed to select a specific item.\n // If no item is matched, then the current selection is removed.\n if (typeof aItem == \"function\") {\n aItem = this.getItemForPredicate(aItem);\n }\n\n // A falsy item is allowed to invalidate the current selection.\n let targetElement = aItem ? aItem._target : null;\n let prevElement = this._widget.selectedItem;\n\n // Make sure the selected item's target element is focused and visible.\n if (this.autoFocusOnSelection && targetElement) {\n targetElement.focus();\n }\n if (this.maintainSelectionVisible && targetElement) {\n // Some methods are optional. See the WidgetMethods object documentation\n // for a comprehensive list.\n if (\"ensureElementIsVisible\" in this._widget) {\n this._widget.ensureElementIsVisible(targetElement);\n }\n }\n\n // Prevent selecting the same item again and avoid dispatching\n // a redundant selection event, so return early.\n if (targetElement != prevElement) {\n this._widget.selectedItem = targetElement;\n let dispTarget = targetElement || prevElement;\n let dispName = this.suppressSelectionEvents ? \"suppressed-select\" : \"select\";\n ViewHelpers.dispatchEvent(dispTarget, dispName, aItem);\n }\n }",
"get selected() { return this.selectionList.selectedOptions.isSelected(this); }",
"get selected() { return this.selectionList.selectedOptions.isSelected(this); }",
"_selectViaInteraction() {\n if (!this.disabled) {\n this._selected = this.multiple ? !this._selected : true;\n this._changeDetectorRef.markForCheck();\n this._emitSelectionChangeEvent(true);\n }\n }",
"_selectViaInteraction() {\n if (!this.disabled) {\n this._selected = this.multiple ? !this._selected : true;\n this._changeDetectorRef.markForCheck();\n this._emitSelectionChangeEvent(true);\n }\n }",
"_selectViaInteraction() {\n if (!this.disabled) {\n this._selected = this.multiple ? !this._selected : true;\n this._changeDetectorRef.markForCheck();\n this._emitSelectionChangeEvent(true);\n }\n }",
"_selectViaInteraction() {\n if (!this.disabled) {\n this._selected = this.multiple ? !this._selected : true;\n this._changeDetectorRef.markForCheck();\n this._emitSelectionChangeEvent(true);\n }\n }",
"function validateProps(element, props) {\n // TODO (yungsters): Remove support for `selected` in <option>.\n {\n if (props.selected != null && !didWarnSelectedSetOnOption) {\n warning(false, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');\n didWarnSelectedSetOnOption = true;\n }\n }\n }",
"get selected() {\n return this._selected;\n }",
"get selected() {\n return this._selected;\n }",
"get selected() {\n return this._selected;\n }",
"_canItemBeSelected(item) {\n return item.disabled === false && item.templateApplied !== true;\n }",
"_setSelected(selected) {\n if (selected === this._selected) {\n return false;\n }\n this._selected = selected;\n if (selected) {\n this.selectionList.selectedOptions.select(this);\n }\n else {\n this.selectionList.selectedOptions.deselect(this);\n }\n this.selectedChange.emit(selected);\n this._changeDetector.markForCheck();\n return true;\n }",
"mounted(el, { value }) {\r\n setSelected(el, value);\r\n }",
"mounted(el, { value }) {\r\n setSelected(el, value);\r\n }",
"displayUnreliableSuppressed() {\n // Don't display unreliable/suppressed unless the selected maternal health is one of the following values.\n if ([\"Maternal Mortality Rate\", \"Late Maternal Death Rate\"].includes(this.getMaternalHealthSelected())) {\n return true;\n }\n return false;\n }",
"function validateProps(element, props) {\n // TODO (yungsters): Remove support for `selected` in <option>.\n {\n warning(props.selected == null, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');\n }\n }",
"function validateProps(element, props) {\n // TODO (yungsters): Remove support for `selected` in <option>.\n {\n warning(props.selected == null, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');\n }\n }",
"@readOnly\n @computed('selectedItems', 'disabled')\n /**\n * Input should be disabled if anything is selected\n * @param {Number[]} selected - the selected indices\n * @param {Boolean} disabled - the selected indices\n * @returns {Boolean} true if anything is selected\n */\n disableInput (selected, disabled) {\n return disabled || (selected.length > 0)\n }",
"set selected(value) {\n this._selected = value;\n this._selectedTimestamp = value ? new Date() : undefined;\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"mounted(el, { value }) {\n setSelected(el, value);\n }",
"function handleSelection(value) {\n setCategory(value);\n setVisible(false);\n }",
"function validateProps(element, props) {\n // TODO (yungsters): Remove support for `selected` in <option>.\n {\n if (props.selected != null && !didWarnSelectedSetOnOption) {\n warning(false, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');\n didWarnSelectedSetOnOption = true;\n }\n }\n }",
"function checkSelection(name, value){\n\tif (value == -1) {\n \t errMessages += \"<li>\" + name + \" - Please select a choice.</li>\"; \n\t}\n\telse {\n\t\treturn true;\n\t}\n}",
"notify(options) {\n\t\tif (options.model==='MenuModel' && options.method==='selected') {\n\t\t\t//console.log(['In ',this.name,' selected = ',options.selected]);\n\t\t\tif (this.name === options.selected) {\n\t\t\t\tsetTimeout(() => {\n\t\t\t\t\tthis.visible = true;\n\t\t\t\t\tthis.restore();\n\t\t\t\t\tthis.show();\n\t\t\t\t}, 100);\n\t\t\t} else {\n\t\t\t\tthis.visible = false;\n\t\t\t\tthis.hide();\n\t\t\t}\n\t\t}\n\t}",
"'state.selected_diagnostics'() {\n if (this.state.selected_diagnostics.length !== 0) {\n this.uncheckLabelsButtons();\n this.createPlot();\n }\n }",
"function SelectableDropdownItem({ isSelected, ...props }) {\n return (\n <li className=\"relative\"> \n <DropdownItem \n {...props} \n handleClick={!isSelected ? props.handleClick : (e) => e.preventDefault()} \n {\n ...(isSelected && { rootClass: 'border-2 border-primary pointer-events-none' })\n } />\n {\n isSelected && (\n <div className=\"absolute top-2 right-2 py-1 px-2 rounded-lg bg-green-200 font-bold text-sm text-green-700 pointer-events-none shadow-main\">\n <p>Selected</p>\n </div>\n )\n }\n </li>\n )\n}",
"get hidden() {\n return !this.selected;\n }",
"setSelected(selected) {\n if (selected !== this.state.selected) {\n this.setState({ selected })\n }\n }",
"select(item) {\n if (this.state.selected !== item) {\n this.state.selected = item;\n this.props.updateFilter(this.state.selected);\n }\n }",
"getSelectedTarget() {\n this.socket.emit('get_selected_target');\n return false;\n }",
"_selectionHandler(activeProject) {\n for (projectElement of this.projects) {\n projectElement.markUnchecked();\n }\n activeProject.markChecked();\n this.emitter.emit('did-change-path-selection', activeProject.path);\n }",
"mounted (el, { value }) {\n setSelected(el, value);\n }",
"function Update()\r\n{\r\n\tif (selected && !activated)\r\n\t{\r\n\t\tif (puzzle_desc_box.enabled == false)\r\n\t\t{\r\n\t\t\teditor_object.SendMessage(\"assign_target\", this.gameObject, \r\n\t\t\t\t\t\t\t\t\t SendMessageOptions.DontRequireReceiver);\r\n\t\t\tpuzzle_desc_box.enabled = true;\r\n\t\t}\r\n\t} else if (puzzle_desc_box.enabled == true) \r\n\t{\r\n\t\tpuzzle_desc_box.enabled = false;\r\n\t}\r\n}",
"function validateProps(element, props) {\n\t // TODO (yungsters): Remove support for `selected` in <option>.\n\t {\n\t warning(props.selected == null, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');\n\t }\n\t}",
"set Selected(value) {\n this._selected = value;\n if (value) {\n selectedInput = this;\n }\n else {\n selectedInput = null;\n }\n }",
"function Selected(props) {\n return (react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"div\", { className: 'selected ' + (props.clear || '') },\n react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"p\", null,\n react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"i\", null,\n \"The \",\n props.selecting,\n \" \",\n react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"b\", null, props.selected),\n \" has been selected\"),\n props.clear === 'clear' ? react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"a\", { onClick: props.clearWS },\n react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"svg\", { xmlns: 'http://www.w3.org/2000/svg', id: 'Close', width: '12', height: '12', viewBox: '0 0 12 12' },\n react__WEBPACK_IMPORTED_MODULE_0__[\"createElement\"](\"path\", { id: 'X_5_', d: 'M6.21,6.5l2.65-2.65c0.19-0.19,0.19-0.51,0-0.71 s-0.51-0.19-0.71,0L5.5,5.79L2.85,3.15c-0.19-0.19-0.51-0.19-0.71,0s-0.19,0.51,0,0.71L4.79,6.5L2.15,9.15 c-0.19,0.19-0.19,0.51,0,0.71c0.19,0.19,0.51,0.19,0.71,0L5.5,7.21l2.65,2.65c0.19,0.19,0.51,0.19,0.71,0 c0.19-0.19,0.19-0.51,0-0.71L6.21,6.5z', fillRule: 'evenodd', clipRule: 'evenodd', fill: '#666766' }))) : '')));\n}",
"get selectable() { return this._selectable; }",
"get selectable() { return this._selectable; }",
"__$$triggerSelectionChange() {\n\t\tconst selected = this.state.selected\n\t\tthis.refs.headerCheckbox.indeterminate = this.__$$checkboxShouldBeIndeterminate(selected)\n\n\t\tconst fn = this.props.onChange || (() => { })\n\t\tfn(this, this.getSelectedIndices(selected))\n\t}",
"selectionChanged(selected) {\n const vizConf = this.visualConfig;\n this.selected = selected;\n if (selected) {\n this.label.tint = vizConf.ui.label.font.highlight;\n this.labelBgContainer.forEach((labelBg) => {\n labelBg.tint = vizConf.ui.label.background.highlight;\n });\n } else {\n this.label.tint = vizConf.ui.label.font.color;\n this.labelBgContainer.forEach((labelBg) => {\n labelBg.tint = vizConf.ui.label.background.color;\n });\n }\n }",
"constructor(value, selected) {\r\n this.value = value;\r\n this.selected = selected;\r\n }",
"selected(value) {\n value = this.convertOutput(value);\n this.set('model.' + this.get('field'), value);\n // Send action if it is passed.\n if (this.get('onSelect')) {\n this.get('onSelect')(value);\n }\n }",
"_checkSelectIsAble () {\n return true\n }",
"validateSelect(target) {\n\t\tif(target.value == '') {\n\t\t\ttarget.style.border = '1px solid red';\n\t\t\tthis.selectWarning.classList.add('warning');\n\t\t} else {\n\t\t\ttarget.style.border = '';\n\t\t\tthis.selectWarning.classList.remove('warning');\n\t\t}\n\t}",
"_setSelected(selected) {\n if (selected === this._selected) {\n return false;\n }\n this._selected = selected;\n if (selected) {\n this.selectionList.selectedOptions.select(this);\n }\n else {\n this.selectionList.selectedOptions.deselect(this);\n }\n this._changeDetector.markForCheck();\n return true;\n }",
"onMultiSelectionComponentPress(event) {\n if (this.isInactive) {\n return;\n }\n this.fireEvent(\"_selection-requested\", {\n item: this,\n selected: event.target.checked,\n selectionComponentPressed: true\n });\n }",
"selectHandler(e) {\n const { trigger } = this.props;\n trigger(e);\n }",
"function option(value, selected) {\n return {\n selected: observable(has(selected) ? selected : allCheckbox()),\n value: has(value) ? value.toString() : \"\"\n };\n }",
"@className('is-invalid')\n @computed('selectedColor')\n get _isInvalid() {\n return !this._validateColor(this.get('selectedColor'));\n }"
] |
[
"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.5524347",
"0.5524347",
"0.5512643",
"0.54439366",
"0.54362947",
"0.5418763",
"0.54142296",
"0.54142296",
"0.5413833",
"0.5413833",
"0.5413833",
"0.5413833",
"0.5390096",
"0.5370125",
"0.5370125",
"0.5370125",
"0.5365418",
"0.5357",
"0.5332892",
"0.5332892",
"0.530829",
"0.5303921",
"0.5303921",
"0.52982014",
"0.52782947",
"0.5271891",
"0.5271891",
"0.5271891",
"0.5271891",
"0.5271891",
"0.5271891",
"0.5271891",
"0.52651465",
"0.526195",
"0.5258207",
"0.5254269",
"0.52514637",
"0.5247657",
"0.5244729",
"0.5243029",
"0.52174795",
"0.52173066",
"0.5215223",
"0.5214553",
"0.5211811",
"0.52097136",
"0.5195866",
"0.5183406",
"0.51589376",
"0.51589376",
"0.513957",
"0.5136522",
"0.5133418",
"0.51204515",
"0.51150763",
"0.51135206",
"0.5106696",
"0.5102468",
"0.5101712",
"0.51015633",
"0.5096969"
] |
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) : parseInt(value);\n const signedNumber = !canBeNegative\n ? Math.abs(valueAsNumber)\n : valueAsNumber;\n\n return !isNaN(signedNumber) ? signedNumber : defaultValue;\n } else if (canBeEmpty) {\n return '';\n }\n\n return defaultValue;\n}",
"function requireValue(field, value) { }",
"function validatedata($attr, $defaultValue) {\n \"use strict\";\n if ($attr !== undefined) {\n return $attr\n }\n return $defaultValue;\n}",
"function validatedata($attr, $defaultValue) {\n \"use strict\";\n if ($attr !== undefined) {\n return $attr\n }\n return $defaultValue;\n}",
"function validatedata($attr, $defaultValue) {\r\n \"use strict\";\r\n if ($attr !== undefined) {\r\n return $attr\r\n }\r\n return $defaultValue;\r\n}",
"function validatedata($attr, $defaultValue) {\r\n \"use strict\";\r\n if ($attr !== undefined) {\r\n return $attr\r\n }\r\n return $defaultValue;\r\n}",
"function validatedata($attr, $defaultValue) {\r\n \"use strict\";\r\n if ($attr !== undefined) {\r\n return $attr\r\n }\r\n return $defaultValue;\r\n}",
"function validatedata($attr, $defaultValue) {\n \"use strict\";\n if ($attr !== undefined) {\n return $attr\n }\n return $defaultValue;\n }",
"function valueCheck(props, ...args) {\n if (props.multiple) return p.arrayOf(valueShape).isRequired(props, ...args)\n return valueShape(props, ...args)\n}",
"function validate(value){\r\n \r\n if(typeof(value) !== \"undefined\" && value !== \"\"){\r\n // console.log(\"value exists: \", value);\r\n\r\n return value;\r\n\r\n }\r\n\r\n // console.log(\"value does not exist: \", value);\r\n \r\n return \"\";\r\n\r\n }",
"validateValue (value) {\n return TypeNumber.isNumber(value) && !isNaN(value)\n }",
"function defaulted(value,defaultValue){return value!==undefined?value:defaultValue;}",
"function validator(value) {\n if (value === undefined || value === null)\n return true;\n if (Number.isNaN(value))\n return false;\n return true;\n}",
"validate(value) {\n if (value < 0) return 0;\n else if (value > 5) return 5;\n }",
"validateRequired(propValue, value) {\n return !(propValue && _isEmpty(value));\n }",
"function ValidateTypeValue(type, value)\n{\n\tif (type == \"Bool\")\n\t{\n\t\tif (value != \"true\" && value != \"false\")\n\t\t{\n\t\t\treturn \"default value must be either 'True' or 'False' for Bool\";\n\t\t}\n\t}\n\telse if (type == \"Int\" || type == \"Float\")\n\t{\n\t\tif (isNaN(value))\n\t\t{\n\t\t\treturn \"default value must be digit(s) for Int or Float\";\n\t\t}\n\t}\n\telse\n\t{\n\t\t// everything is fine as a string or custom type\n\t\treturn null;\n\t}\n}",
"validInput(value) {\r\n let props = this.props;\r\n if (!value)\r\n return props.eReq;\r\n else if (props.eClientValidation)\r\n return props.eClientValidation(value, props.inputProps.floatingLabelText)\r\n return null;\r\n }",
"function CheckInputValue($mask, $input, value, validationType, def, isFormSubmit) {\n\n var $parentForm = $input.closest(\".responsive-form\");\n\n // validate\n switch (validationType) {\n // =======================================================\n // === VAL TYPE: Required field\n // === REQUIRMENTS: not null\n // === Data-Validation(s): \"req-field\"\n // =======================================================\n\n case \"req-field\":\n def.resolve(!IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Required Drop Down Selection\n // === REQUIRMENTS: not null or not zero\n // === SUPPORTED Data-Validation: \"req-selection\"\n // =======================================================\n\n case \"req-selection\":\n\n def.resolve(!IsNoSelection(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Checkbox/Radio Button field\n // === REQUIRMENTS: checked\n // === SUPPORTED Data-Validation: \"req-checked\"\n // =======================================================\n\n case \"req-checked\":\n\n def.resolve(!$input.is(\":checked\"));\n break;\n\n // =======================================================\n // === VAL TYPE: Checkbox/Radio Button List fields\n // === REQUIRMENTS: at least one input checked\n // === Data-Validation(s): \"req-checked-list\"\n // =======================================================\n\n case \"req-checked-list\":\n\n def.resolve(!$input.find(\"input:checked\").size());\n break;\n\n // =======================================================\n // === VAL TYPE: Price field\n // === REQUIRMENTS: not null, valid number, greater than zero, or \"N/A\"\n // === Data-Validation(s): \"req-price\"\n // =======================================================\n\n case \"req-price\":\n if ($input.hasClass(\"format-price\")){\n value = value.replace(/[^.0-9]/g, '');\n $input.val('$' + parseFloat(value).toFixed(2));\n }\n def.resolve(!IsPrice(value) || !IsNotZero(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Price field\n // === REQUIRMENTS: not null, valid number, greater than or equal to a minimum number, or \"N/A\"\n // === SUPPORTED CLASSES: \"req-price-min\"\n // === requires attribute: data-minprice=\"10\"\n // =======================================================\n\n case \"req-price-min\":\n var enteredPriceText = value.replace(/[^.0-9]/g, \"\"),\n enteredPrice = parseFloat(enteredPriceText),\n minPrice = $input.attr(\"data-minprice\");\n\n $input.val('$' + enteredPrice);\n\n def.resolve(!IsNotEmpty(enteredPrice) || !IsNumber(enteredPrice) || enteredPrice < minPrice);\n break;\n\n // =======================================================\n // === VAL TYPE: Price field\n // === REQUIRMENTS: valid number, greater than zero, or \"N/A\" and within range\n //\t=== Data-Validation(s): \"req-price-range\"\n // === SUPPORTED CLASSES: \" req-price-top, req-price-bottom\"\n // =======================================================\n\n case \"req-price-range\":\n var showDollar = \"$\";\n if ($input.hasClass(\"format-price\")) {\n value = value.replace(/[^.0-9]/g, '');\n $input.val('$' + parseFloat(value).toFixed(2));\n }\n\n case \"req-number-range\":\n var isNumber = IsNumber(value),\n topPriceText = ($input.closest(':has(.req-price-top)').find('.req-price-top').text()).replace(/[^.0-9]/g, ''),\n topPrice = parseFloat(topPriceText),\n bottomPriceText = ($input.closest(':has(.req-price-bottom)').find('.req-price-bottom').text()).replace(/[^.0-9]/g, ''),\n bottomPrice = parseFloat(bottomPriceText),\n enteredPriceText = value.replace(/[^.0-9]/g, ''),\n enteredPrice = parseFloat(enteredPriceText),\n\t\t\t\t\tdollar = showDollar || \"\",\n returnValue = false;\n\t\t\t\t\t\n if (value != \"N/A\" && (!isNumber || value <= 0)) {\n \t\t\t\n returnValue = true;\n $mask.attr('data-warning-override', 'Please enter a valid amount.');\n\n }\n else if (!isNaN(topPrice) && topPrice < enteredPrice) {\n returnValue = true;\n $mask.attr('data-warning-override', 'Please enter an amount less than or equal to ' + dollar + topPrice + '.');\n }\n else if (!isNaN(bottomPrice) && bottomPrice > enteredPrice) {\n \t\t\t\n returnValue = true;\n $mask.attr('data-warning-override', 'Please enter an amount more than ' + dollar + bottomPrice + '.');\n }\n def.resolve(returnValue);\n break;\n\n\n case \"req-number\":\n if (!IsNotEmpty(value)) {\n\n $mask.removeAttr('data-warning-override');\n }\n else {\n $mask.attr('data-warning-override', $mask.attr('title') + ' (Must be a valid number)');\n }\n\n def.resolve(!IsWholeNumber(value) || !IsNumber(value) || !IsNotZero(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Number field\n // === REQUIRMENTS: valid number, greater than zero, less than 3\n // === Data-Validation(s): \"req-three\"\n // =======================================================\n \n case \"req-three\":\n\n def.resolve(!IsWholeNumber(value) || !IsNumber(value) || parseInt(value) < 0 || parseInt(value) > 3 );\n break;\n\n // =======================================================\n // === VAL TYPE: Number field\n // === REQUIRMENTS: valid number, greater than zero\n // === Data-Validation(s): \"opt-number\"\n // =======================================================\n\n case \"opt-number\":\n\n def.resolve(IsNotEmpty(value) && (!IsWholeNumber(value) || !IsNumber(value) ));\n break;\n\n // =======================================================\n // === VAL TYPE: UPC field\n // === REQUIRMENTS: not null, valid number, 11 or 12 digits\n // === Data-Validation(s): \"req-upc\"\n // =======================================================\n\n case \"req-upc\":\n\n def.resolve(!IsWholeNumber(value) || !IsNumber(value) || (value.length != 11 && value.length != 12));\n break;\n\n // =======================================================\n // === VAL TYPE: UPC field\n // === REQUIRMENTS: not null, valid number, 13 digits \n // === Data-Validation(s): \"req-upc\"\n // =======================================================\n case \"opt-isbn\":\n if (value == \"\") {\n def.resolve(false);\n }\n case \"req-isbn\":\n value = value.replace(\"-\", \"\");\n def.resolve(!IsWholeNumber(value) || !IsNumber(value) || !IsISBN(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Phone Number field\n // === REQUIRMENTS: not null, valid phone number\n // === Data-Validation(s): \"req-phone\"\n // =======================================================\n\n case \"req-phone\":\n\n FormatUSPhoneNumber($input, value, false);\n def.resolve((!IsPhoneNumber(value) && !IsInternationalPhoneNumber(value)) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Optional Phone Number field\n // === REQUIRMENTS: valid phone number\n // === Data-Validation(s): \"opt-phone\"\n // =======================================================\n\n case \"opt-phone\":\n\n FormatUSPhoneNumber($input, value, false);\n def.resolve(!IsPhoneNumber(value) && !IsInternationalPhoneNumber(value) && IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: US Phone Number field\n // === REQUIRMENTS: not null, valid US phone number\n // === Data-Validation(s): \"req-phone-us\"\n // =======================================================\n\n case \"req-phone-us\":\n\n FormatUSPhoneNumber($input, value, true);\n def.resolve(!IsUSPhoneNumber(value) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Optional US Phone Number field\n // === REQUIRMENTS: valid US phone number\n // === Data-Validation(s): \"opt-phone-us\"\n // =======================================================\n\n case \"opt-phone-us\":\n\n FormatUSPhoneNumber($input, value, false);\n def.resolve(!IsUSPhoneNumber(value) && IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Phone Number field by country value\n // === REQUIRMENTS: not null, valid phone number by country\n // === Data-Validation(s): \"req-phone-bycountry\"\n // =======================================================\n\n case \"req-phone-bycountry\":\n\n FormatUSPhoneNumber($input, value, false);\n def.resolve(IsPhoneNumberByCountry(value, $parentForm.find(\".dd-country select\").val().toLowerCase()) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Optional Phone Number field by country value\n // === REQUIRMENTS: not null, valid phone number by country\n // === Data-Validation(s): \"req-phone-bycountry\"\n // =======================================================\n\n case \"opt-phone-bycountry\":\n\n FormatUSPhoneNumber($input, value, false);\n def.resolve(IsPhoneNumberByCountry(value, $parentForm.find(\".dd-country select\").val().toLowerCase()) && IsNotEmpty(value) && value != \"+\" + $input.data('phonecode'));\n break;\n\n // =======================================================\n // === VAL TYPE: Address1 field\n // === REQUIRMENTS: valid add from UPS web API\n // === Data-Validation(s): \"req-address1\"\n // =======================================================\n\n case \"req-address1\":\n\n var jsonCurrentAddress = { addressline1: $parentForm.find(\".txt-address1 .textbox\").val(), city: $parentForm.find(\".txt-city .textbox\").val(), state: $parentForm.find(\".dd-states .dropdown\").val(), zipCode: $parentForm.find(\".txt-zipcode .textbox\").val(), country: $parentForm.find(\".dd-country .dropdown\").val() };\n \n // if the zip code is empty, fail\n if (!IsNotEmpty(value)) {\n def.resolve(true);\n } // if\n\n // if the address has been certified to be correct, even though UPS said otherwise...pass\n else if (CertifiedAddressMatches(jsonCurrentAddress))\n {\n def.resolve(false);\n } // else if\n\n else {\n\n // get the values for the current zip code and country code\n var countryCode = $parentForm.find(\".dd-country .dropdown\").val();\n\n // make sure we have a valid country code and valid ZIP code before checking for city/state population and only perform this check on form submit\n if (countryCode == \"US\" && isFormSubmit) {\n\n // build the json request\n var jsonData = { testing: false, companyname: $parentForm.find(\".txt-company .textbox\").val(), addressline1: $parentForm.find(\".txt-address1 .textbox\").val(), addressline2: $parentForm.find(\".txt-address2 .textbox\").val(), city: $parentForm.find(\".txt-city .textbox\").val(), state: $parentForm.find(\".dd-states .dropdown\").val(), zipCode: $parentForm.find(\".txt-zipcode .textbox\").val(), country: $parentForm.find(\".dd-country .dropdown\").val() },\n addressString = $parentForm.find(\".txt-address1 .textbox\").val() + \" \" + $parentForm.find(\".txt-address2 .textbox\").val() + \" \" + $parentForm.find(\".txt-city .textbox\").val() + \" \" + $parentForm.find(\".dd-states .dropdown\").val() + \" \" + $parentForm.find(\".txt-zipcode .textbox\").val();\n\n // debug console output\n if (showJSONAddressData) { console.log(jsonData); }\n\n // send the json request to the handler\n $.ajax({\n url: '/MyAccount/CommonControls/ResponsiveForms/Handlers/UPSAddressValidationStreetLevel.ashx',\n type: 'POST',\n data: JSON.stringify(jsonData),\n contentType: \"application/json; charset=utf-8\",\n dataType: \"json\",\n success: function (data) {\n\n // the json in values produced json out values\n if (data != undefined && data.Response != undefined) {\n\n // assign the response objects\n var dataResponse = data.Response,\n dataAddressClassification = data.AddressClassification,\n dataAddressKeyFormats = data.AddressKeyFormats,\n dataAddressIndicator = data.AddressIndicator;\n\n // debug console output\n if (showJSONAddressData) { console.log(data); }\n\n // a response has been returned, but check to see if it is an error response \n if (dataResponse.ResponseStatusDescription == \"Failure\") {\n // something went wrong, pass by default?\n def.resolve(false);\n } // if\n else {\n\n // LOGIC:\n // ---------------------------------------------------------------------------------------------------------------------\n // If there are no address responses:\n // - ask to verify their address is correct or change the address\n\n // If there is one address response:\n // - update the address with the response address\n // - pass\n\n // If there is more than one address response:\n // - ask to choose from one of the response addresses, verify their address is correct, or change the address\n // ---------------------------------------------------------------------------------------------------------------------\n\n var bypassResultsModal = (typeof placeOrder !== 'undefined' && placeOrder);\n\n // there are no address response matches\n if (dataAddressKeyFormats.length == 0) {\n\n // before we show the modal for no matches, let's make sure we have all the information needed for a full address...\n if (!bypassResultsModal && $.trim(jsonData.addressline1) != \"\" && $.trim(jsonData.city) != \"\" && $.trim(jsonData.state) != \"\" && $.trim(jsonData.zipCode) != \"\") {\n // show the address results modal with the appropriate message\n BuildAddressResultsModal($parentForm.find(\".txt-address1 .textbox\").attr(\"id\"), \"none\", addressString);\n } // if\n\n // fail\n def.resolve(true);\n } //if\n\n // there is an exact match -> auto populate the other address fields\n else if (dataAddressKeyFormats.length == 1) {\n\n // Address: 255 Hupi Rd Monterey, Ma 01245\n // UPS Returns: 1-99 Hupi Rd Monterey, Ma 01245\n // Issue: Since there was only 1 match, we were assuming it was an exact match and auto updating the street address incorrectly.\n // Solution: Check to make sure the address returned by UPS api does not start with \"1-\" for street number ranges. If it does, move forward\n // with the user submitted address and do not overwrite automatically.\n if (dataAddressKeyFormats[0].AddressLine1.lastIndexOf(\"1-\", 0) !== 0) {\n $parentForm.find(\".txt-address1 .textbox\").val(CapitalizeFirstLetter(dataAddressKeyFormats[0].AddressLine1)).trigger(\"change\");\n }\n // make sure UPS was actually returning address2 value before setting...\n if (dataAddressKeyFormats[0].AddressLine2 != \"\") {\n $parentForm.find(\".txt-address2 .textbox\").val(CapitalizeFirstLetter(dataAddressKeyFormats[0].AddressLine2)).trigger(\"change\");\n } // if\n $parentForm.find(\".txt-city .textbox\").val(CapitalizeFirstLetter(dataAddressKeyFormats[0].PoliticalDivision2)).trigger(\"change\");\n $parentForm.find(\".dd-states .dropdown\").focus().val(dataAddressKeyFormats[0].PoliticalDivision1).blur().trigger(\"update\");\n $parentForm.find(\".txt-zipcode .textbox\").val(dataAddressKeyFormats[0].PostcodePrimaryLow);\n\n $parentForm.find(\".txt-zipcode label\").addClass(\"inputted\");\n $parentForm.find(\".txt-city label\").addClass(\"inputted\");\n\n // pass\n def.resolve(false);\n\n } // if\n \n // there are multiple addresses responses\n else {\n\n var fullAddresses = [],\n tempAddresses = [],\n distinctAddress = [],\n passingAddress = false;\n\n // construct the address values and push into a temp array\n $.each(dataAddressKeyFormats, function (index, value) {\n fullAddresses.push(CapitalizeFirstLetter(dataAddressKeyFormats[index].AddressLine1) + \", \" + CapitalizeFirstLetter(dataAddressKeyFormats[index].PoliticalDivision2) + \" \" + dataAddressKeyFormats[index].PoliticalDivision1 + \" \" + CapitalizeFirstLetter(dataAddressKeyFormats[index].PostcodePrimaryLow));\n }); // each\n\n // make sure we have unique addresses, because there could be street number/apt number groups\n $.each(fullAddresses, function (i, el) {\n if ($.inArray(el, tempAddresses) === -1) {\n tempAddresses.push(el);\n dataAddressKeyFormats[i].fullAddress = fullAddresses[i];\n distinctAddress.push(dataAddressKeyFormats[i]);\n } // if\n }); // each\n\n // show the address results modal with the appropriate message, as long as this is not a validation from an placed order\n if (!bypassResultsModal) {\n BuildAddressResultsModal($parentForm.find(\".txt-address1 .textbox\").attr(\"id\"), \"multiple\", addressString, distinctAddress);\n } // if\n\n // fail\n def.resolve(true);\n } // else\n\n\n\n } // else\n } // if\n },\n fail: function (data) {\n // hide the loading images for the city/state, since there was no return data\n $parentForm.find(\".txt-city, .txt-state, .dd-states\").find(\".input-loading\").hide();\n // pass the validation since there was an error getting the JSON\n def.resolve(false);\n } // $.ajax() Fail.error(function () {\n }); // ajax\n\n } // if\n else {\n // no address validation for non-US countries...\n def.resolve(false);\n } // else\n } // else\n\n break;\n\n // =======================================================\n // === VAL TYPE: Address2 field\n // === REQUIRMENTS: valid apartment / suite/ building #\n // === Data-Validation(s): \"opt-address2\"\n // === https://developerkitcommunity.ups.com/index.php/Address_Validation_Street_Level_XML_Developers_Guide_-_July_9,_2011\n // =======================================================\n\n case \"opt-address2\":\n\n // only perform address line 2 validation if this is in the US\n if ( !IsNonUSCountry($input) && $(\"#bypassed-\" + $input.attr(\"id\")).size() == 0) {\n // grab the parts of the address\n var inAddress1 = $.trim($parentForm.find(\".txt-address1 .textbox\").val()),\n inAddress2 = $.trim($parentForm.find(\".txt-address2 .textbox\").val()),\n inCity = $.trim($parentForm.find(\".txt-city .textbox\").val()),\n useStateDD = $parentForm.find(\".dd-states\").css(\"display\") != \"none\",\n inState = useStateDD ? $parentForm.find(\".dd-states .dropdown\").val() : $.trim($parentForm.find(\".txt-state .textbox\").val()),\n inZip = $.trim($parentForm.find(\".txt-zipcode .textbox\").val());\n\n // make sure we have a complete address so we can validate the address2 line\n if (inAddress1 != \"\" && inCity != \"\" && inState != \"\" && inZip != \"\") {\n\n var addressXML = \"<address><addressline1>\" + inAddress1 + \"</addressline1><addressline2>\" + inAddress2 + \"</addressline2><city>\" + inCity + \"</city><state>\" + inState + \"</state><zip>\" + inZip + \"</zip></address>\",\n $loadingImg = $input.parent().find(\".input-loading\"),\n isMissingApartment = false;\n\n ShowLoadingImage($mask, $input, $loadingImg);\n\n // call the satori web service\n $.ajax({\n type: \"POST\",\n url: \"/AVLUtilities/AddressVerification.aspx\",\n contentType: \"text/xml\",\n dataType: \"text\",\n data: addressXML,\n success: function (msg) {\n $loadingImg.fadeOut(100, function () {\n // parse the ml response\n var xmlDoc = $.parseXML(msg),\n $xml = $(xmlDoc),\n missingApt = $xml.find(\"ismissingaptnumber\");\n // assign the return value for the missing apartment number\n if (missingApt != null && missingApt != \"\") {\n // determine if the address is missing an apartment number\n isMissingApartment = missingApt.text().toLowerCase() === \"true\";\n // if the missing apratment is true, flag so we let this go next time around\n if (isMissingApartment) { address2Flagged = true; }\n // send back the value\n def.resolve(isMissingApartment);\n } // if\n else {\n def.resolve(false);\n } // else\n }); // fadeOut\n },\n error: function (msg) {\n $loadingImg.hide();\n def.resolve(false);\n }\n });\n } // if\n else {\n // not enough addres information to test the address2 data\n def.resolve(false);\n } // else\n } // if\n else {\n def.resolve(false);\n } // else\n\n break;\n\n // =======================================================\n // === VAL TYPE: Zipcode field\n // === REQUIRMENTS: not null, correct zipcode format, valid in US verified by UPS API\n // === Data-Validation(s): \"req-zipcode\"\n // === https://developerkitcommunity.ups.com/index.php/Address_Validation_XML_Developers_Guide_-_July_08,_2013\n // =======================================================\n\n case \"req-zipcode\":\n\n // if the zip code is empty, fail\n if (!IsNotEmpty(value) || (/[\\/\\\\\\\"?&.*:<>|@#%,]/g).test(value)) {\n def.resolve(true)\n } // if\n\n else {\n\n // get the values for the current zip code and country code\n var countryCode = $parentForm.find(\".dd-country .dropdown\").val();\n\n // make sure we have a valid country code and valid ZIP code before checking for city/state population\n if (countryCode == \"US\") {\n\n // only for realtime validation...\n if (!isFormSubmit) {\n // display the loading images for the city/state inputs \n $parentForm.find(\".txt-city, .txt-state, .dd-states\").find(\".input-loading\").show();\n } // if\n\n // build the json request\n var jsonData = { testing: false, country: $parentForm.find(\".dd-country .dropdown\").val(), zipCode: value };\n\n // debug console output\n if (showJSONAddressData) { console.log(jsonData); }\n\n // send the json request to the handler\n $.ajax({\n url: '/MyAccount/CommonControls/ResponsiveForms/Handlers/UPSAddressValidationCityStateZIP.ashx',\n type: 'POST',\n data: JSON.stringify(jsonData),\n contentType: \"application/json; charset=utf-8\",\n dataType: \"json\",\n success: function (data) {\n\n // the json in values produced json out values\n if (data != undefined && data.Response != undefined) {\n\n // assign the two main objects: response details and address result(s)\n var dataResponse = data.Response,\n dataAVResults = data.AddressValidationResults;\n\n // debug console output\n if (showJSONAddressData) { console.log(dataResponse); } // if\n\n // a response has been returned, but check to see if it is an error response \n if (dataResponse.ResponseStatusDescription == \"Failure\") {\n\n // hide any failed validation display for the city / state since there is a failure\n DisplayValidationResult($parentForm.find(\".txt-city\"), $parentForm.find(\".txt-city .textbox\"), false, isFormSubmit)\n DisplayValidationResult($parentForm.find(\".dd-states\"), $parentForm.find(\".dd-states .dropdown\"), false, isFormSubmit)\n\n // only for realtime validation...\n if (!isFormSubmit) {\n // hide the loading images for the city/state, since there was no return data\n $parentForm.find(\".txt-city, .txt-state, .dd-states\").find(\".input-loading\").hide();\n } // if\n\n // we know these error codes result from an invalid zip code\n if (dataResponse.ErrorCode == \"101112\" || dataResponse.ErrorCode == \"20008\") {\n // UPS telling us that this postal code is invalid\n def.resolve(true);\n } // if\n // all other error codes cannot be determined for pass/fail, so pass by default\n else {\n def.resolve(false);\n }\n } // if\n else {\n\n // debug console output\n if (showJSONAddressData) {\n $.each(dataAVResults, function (index, value) {\n console.log(dataAVResults[index]);\n }); // each\n } // if\n\n // only for realtime validation...\n if (!isFormSubmit) {\n // hide the loading images for the state laoder\n $parentForm.find(\".txt-state .input-loading, .dd-states .input-loading\").fadeOut(100);\n\n // hide the loading images for the city/state\n $parentForm.find(\".txt-city .input-loading\").fadeOut(100, function () {\n\n if (dataAVResults.length > 0) {\n // we will assume that the first result will have the more likely state option (cannot do anything else since this is already a drop down)\n var upsState = dataAVResults[0].StateProvinceCode;\n\n // hide any failed validation display for the state\n DisplayValidationResult($parentForm.find(\".dd-states\"), $parentForm.find(\".dd-states .dropdown\"), false, isFormSubmit)\n\n // make sure there is a city response\n if (dataAVResults[0].City != \"\") {\n // assign the city to the textbox value since there is only one result\n if (dataAVResults.length == 1) {\n $parentForm.find(\".txt-city .textbox\").val(CapitalizeFirstLetter(dataAVResults[0].City));\n // hide any failed validation display for the city\n DisplayValidationResult($parentForm.find(\".txt-city\"), $parentForm.find(\".txt-city .textbox\"), false, isFormSubmit)\n } // if\n // assign the cityresults to the textbox autocomplete plugin since there is more than one result\n else {\n\n var cities = new Array(),\n cityAlreadyPresent = false;\n\n // pull out the city values and push into a temp array\n $.each(dataAVResults, function (index, value) {\n cities[index] = CapitalizeFirstLetter(dataAVResults[index].City);\n // if the the city currently set as the city value is in the array, do not clear the value\n if (dataAVResults[index].City.toLowerCase() == $.trim($parentForm.find(\".txt-city .textbox\").val()).toLowerCase()) {\n cityAlreadyPresent = true;\n } // if\n }); // each\n\n // clear the current city value, if exists, since it is not in the returned city array\n if (!cityAlreadyPresent) {\n $parentForm.find(\".txt-city .textbox\").val(\"\");\n // reset the label\n $parentForm.find(\".txt-city\").find(\"label\").removeClass(\"inputted\");\n } // if\n\n $parentForm.find(\".txt-city .textbox\").autocomplete({\n position: { my: \"left top\", at: \"left bottom-1\", of: $parentForm.find(\".txt-city\") },\n delay: 0,\n source: cities,\n minLength: 0,\n select: function (event, ui) {\n var $this = $parentForm.find(\".txt-city .textbox\");\n // set the sibling label as inputted\n $this.parent().find(\"label\").addClass(\"inputted\");\n // hide any failed validation display for the city\n DisplayValidationResult($parentForm.find(\".txt-city\"), $parentForm.find(\".txt-city .textbox\"), false, isFormSubmit)\n }, // onSelect\n close: function (event, ui) {\n // trigger the local storage save...\n $parentForm.find(\".txt-city .textbox\").trigger(\"change\");\n }\n })\n .on(\"focus\", function () {\n if ($(this).hasClass(\"ui-autocomplete-input\")) {\n $(this).autocomplete(\"search\", \"\");\n } // if\n });\n\n\n } // else\n } // if\n\n // assign the state\n // make sure there is a state textbox and it is currently displayed\n if ($parentForm.find(\".txt-state\").size() > 0 && $parentForm.find(\".txt-state\").css(\"display\") != \"none\") {\n // for the state's textbox\n $parentForm.find(\".txt-state .textbox\").val(upsState);\n // remove the warning note if it exists\n DisplayValidationResult($parentForm.find(\".txt-state\"), $parentForm.find(\".txt-state .textbox\"), false, isFormSubmit)\n } // if\n else {\n // for the state's drop down...\n // update the custom dropdown control\n $parentForm.find(\".dd-states select\").val(upsState).trigger(\"update\");\n // remove the warning note if it exists\n DisplayValidationResult($parentForm.find(\".dd-states\"), $parentForm.find(\".dd-states .dropdown\"), false, isFormSubmit)\n\n } // else\n\n // update the label states for the address fieldset\n InitFormLabels($(\"#address-container\"));\n\n // return with passed validation\n def.resolve(false);\n } // if\n else {\n def.resolve(true);\n }\n }); // fadeOut\n } // if\n\n // form submission validation with passed validation\n else {\n def.resolve(false);\n } // else\n\n } // else\n } // if\n\n // no data was returned so we cannot validate at this time, so pass validation :(\n else {\n\n // debug console output\n if (showJSONAddressData) { console.log(data); } // if\n\n // only for realtime validation...\n if (!isFormSubmit) {\n // hide the loading images for the city/state, since there was no return data\n $parentForm.find(\".txt-city, .txt-state, .dd-states\").find(\".input-loading\").hide();\n } // if\n\n def.resolve(false);\n\n } // else\n },\n fail: function (data) {\n // hide the loading images for the city/state, since there was no return data\n $parentForm.find(\".txt-city, .txt-state, .dd-states\").find(\".input-loading\").hide();\n // pass the validation since there was an error getting the JSON\n def.resolve(false);\n } // $.ajax() Fail.error(function () {\n }); // ajax\n\n } // if\n else {\n // Not a US or PR zip code address, check for general validatin\n def.resolve(false);\n } // else\n } // else\n\n break;\n\n // =======================================================\n // === VAL TYPE: CVV field\n // === REQUIRMENTS: not null, positive integer number, either 3 or 4 digits\n // === Data-Validation(s): \"req-cvv\"\n // =======================================================\n\n case \"req-cvv\":\n\n def.resolve(!IsNotEmpty(value) || !IsNumber(value) || value.length < 3 || value.length > 4);\n break;\n\n // =======================================================\n // === VAL TYPE: Credit Card field\n // === REQUIRMENTS: not null, LUHN test (http://en.wikipedia.org/wiki/Luhn)\n // === Data-Validation(s): \"req-creditcard\"\n // =======================================================\n\n case \"req-creditcard\":\n\n def.resolve(!IsLuhnPass(value) || !IsNotZero(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Email field\n // === REQUIRMENTS: not null, correct email format\n // === Data-Validation(s): \"req-email\"\n // =======================================================\n\n case \"req-email\":\n\n def.resolve(!IsEmailAddress(value) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Optional Email field\n // === REQUIRMENTS: correct email format\n // === Data-Validation(s): \"optional-email\"\n // =======================================================\n\n case \"opt-email\":\n\n def.resolve(!IsEmailAddress(value) && IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Multi Email field\n // === REQUIRMENTS: not null, correct email format\n // === Data-Validation(s): \"req-multi-email\"\n // =======================================================\n\n case \"req-multi-email\":\n\n var isFail = false,\n emailList = value.split(','),\n n;\n\n for (n in emailList) {\n var validEmail = IsEmailAddress(emailList[n]);\n if (!validEmail || !IsNotEmpty(validEmail)) {\n isFail = true\n } // if\n break;\n } // for\n\n def.resolve(isFail);\n\n break;\n\n // =======================================================\n // === VAL TYPE: Optional multi CC Email field\n // === REQUIRMENTS: not null, correct email format\n // === Data-Validation(s): \"opt-multi-email\"\n // =======================================================\n\n case \"opt-multi-email\":\n\n var isFail = false,\n emailList = value.split(','),\n n;\n\n if (IsNotEmpty(emailList)) {\n for (n in emailList) {\n var validEmail = IsEmailAddress(emailList[n]);\n if (!validEmail) {\n isFail = true\n } // if\n break;\n } // for\n } // if\n\n def.resolve(isFail);\n\n break;\n\n // =======================================================\n // === VAL TYPE: Email field for new account\n // === REQUIRMENTS: not null, correct email format, doesn't exist\n // === Data-Validation(s): \"req-email\"\n // === Assistance: modal content, email verification page\n // =======================================================\n\n case \"req-email-newaccount\":\n\n isFail = (!IsEmailAddress(value) || !IsNotEmpty(value));\n $mask.removeAttr('data-warning-override');\n if (IsEmailAddress(value) && IsNotEmpty(value)) {\n\n var $loadingImg = $input.parent().find(\".input-loading\");\n\n ShowLoadingImage($mask, $input, $loadingImg);\n\n // verify the email is valid\n $.get(\"/MyAccount/VerifyEmailAddress.aspx?email=\" + value, function (data) {\n\n $loadingImg.fadeOut(100, function () {\n // the email address is currently registered...\n if (data == \"true\") {\n $mask.attr('data-warning-override', 'This email is already registered. Please enter another email.');\n def.resolve(true);\n // only do if this is instant validation\n if (!isFormSubmit) {\n // assign the email address value to the modal window\n $(\"#email-value\").text(value);\n // trigger the modal window with the conflict message and options\n $.openModal({\n target: '#email-registered',\n showCloseButton: false,\n width: '500px'\n });\n }\n } else if (data === \"guest\") {\n $('.check-guest input').attr('checked', true);\n def.resolve(false);\n } else {\n def.resolve(false);\n }\n }); // fadeOut\n\n }); // get\n } // if\n else {\n\n def.resolve(true);\n } // else\n\n break;\n\n // =======================================================\n // === VAL TYPE: SSN field\n // === REQUIRMENTS: correct ssn format\n // === Data-Validation(s): \"req-ssn\"\n // =======================================================\n\n case \"req-ssn\":\n\n def.resolve(!IsSSN(value) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: URL field\n // === REQUIRMENTS: not null, correct url format\n // === Data-Validation(s): \"req-url\"\n // =======================================================\n\n case \"req-url\":\n\n def.resolve(!IsURL(value) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Date field\n // === REQUIRMENTS: not null, correct date format\n // === Data-Validation(s): \"req-date\"\n // =======================================================\n\n case \"req-date\":\n\n def.resolve(!IsDate(value) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Date field\n // === REQUIRMENTS: not null, correct date format\n // === Data-Validation(s): \"req-date-mm-dd-yy\"\n // =======================================================\n\n case \"req-date-mm-dd-yy\":\n\n def.resolve(!IsDateMMDDYY(value) || !IsNotEmpty(value));\n break;\n\n // =======================================================\n // === VAL TYPE: Credit Card Exp Date field\n // === REQUIRMENTS: date later than today\n // === Data-Validation(s): \"req-expyear, req-expmonth\"\n // === NOTES: Must have BOTH supported Data-Validations.\n // =======================================================\n\n \tcase \"req-expmonth\":\n \t\tvar $expYear = $parentForm.find(\"select[data-validation=req-expyear]\"),\n \t\thasMonth = IsNotEmpty(value);\n \t\tif (hasMonth && IsNotEmpty($expYear.val())) {\n \t\t\tValidateInput($expYear);\n \t\t}\n \t\tdef.resolve(!hasMonth);\n \t\tbreak;\n\n case \"req-expyear\":\n\n var now = new Date(),\n nowMonth = now.getMonth() + 1,\n nowYear = now.getFullYear(),\n expMonthString = $($parentForm.find(\"select[data-validation=req-expmonth]\")[0]).val() || '12',\n expMonth = 0,\n expYear = parseInt(value) || 0;\n\n expMonth = (expMonthString[0] == \"0\") ? parseInt(expMonthString[1]) : parseInt(expMonthString);\n\n def.resolve((expYear < nowYear) || (expYear == nowYear && expMonth < nowMonth));\n break;\n\n // =======================================================\n // === VAL TYPE: Date Drop Down Comparison\n // === REQUIRMENTS: greater than date > less than date\n // === Data-Validation(s): \"req-dateddl-gt\", \"req-dateddl-lt\"\n // === NOTES: Must have BOTH supported Data-Validations.\n // =======================================================\n\n case \"req-dateddl-gt\":\n\n var gtDate = new Date(),\n gtDateparts = value.split('/'),\n ltDate = new Date(),\n ltDateparts = $parentForm.find(\"select[data-validation=req-dateddl-lt]\").val().split('/');\n\n gtDate.setDate(parseInt(gtDateparts[0]));\n gtDate.setMonth((parseInt(gtDateparts[1]) - 1));\n gtDate.setYear(parseInt(gtDateparts[2]));\n\n ltDate.setDate(parseInt(ltDateparts[0]));\n ltDate.setMonth((parseInt(ltDateparts[1]) - 1));\n ltDate.setYear(parseInt(ltDateparts[2]));\n\n def.resolve(gtDate.getTime() < ltDate.getTime());\n break;\n\n // =======================================================\n // === VAL TYPE: Email and Confirmation field\n // === REQUIRMENTS: not null, correct email format, matches\n // === Data-Validation(s): \"req-email1\",\"req-email2\"\n // === NOTES: Must have BOTH supported Data-Validations.\n // =======================================================\n\n \tcase \"req-email1\":\n \tcase \"req-email\":\n\n def.resolve(!IsEmailAddress(value) || !IsNotEmpty(value));\n break;\n\n case \"req-email2\":\n\n var email1Val = $parentForm.find(\"input[data-validation=req-email1]\").val();\n\n if (!IsEmailAddress(value) || !IsNotEmpty(value)) {\n def.resolve(true);\n } // if\n else if (value != email1Val) {\n $mask.attr(\"title\", \"The email address and confirmation don't match.\");\n def.resolve(true);\n } // else if\n else {\n def.resolve(false);\n } // else\n break;\n\n\n // =======================================================\n // === VAL TYPE: Password and Confirmation field\n // === REQUIRMENTS: not null, at least 6 characters, matches\n // === Data-Validation(s): \"req-password1\",\"req-password2\"\n // =======================================================\n\n case \"req-password\":\n case \"req-password1\":\n\n if (value.length == 0) { $mask.attr(\"title\", \"Please enter a password.\"); }\n else if (value.length < 6) { $mask.attr(\"title\", \"Your password must be at least 6 characters.\"); }\n else if (value.length > 20) { $mask.attr(\"title\", \"Your password must be 20 characters or less.\"); }\n\n def.resolve(!IsNotEmpty(value) || value.length < 6 || value.length > 20);\n break;\n\n case \"req-password2\":\n\n var password1Val = $parentForm.find(\"input[data-validation=req-password1]\").val();\n\n if (!IsNotEmpty(value)) {\n def.resolve(true);\n } // if\n else if (value != password1Val) {\n $mask.attr(\"title\", \"The password and confirmation don't match.\");\n def.resolve(true);\n } // else if\n else if (value.length < 6) {\n $mask.attr(\"title\", \"Your confirming password must be at least 6 characters.\");\n def.resolve(true);\n } // else if\n else if (value.length > 20) {\n $mask.attr(\"title\", \"Your confirming password must be 20 characters or less.\");\n def.resolve(true);\n } // else if\n else {\n def.resolve(false);\n } // else\n break;\n\n \t// =======================================================\n \t// === VAL TYPE: volumename and trackname field\n \t// === REQUIRMENTS: not null, no special characters\n \t// === Data-Validation(s): \"req-volumename\",\"req-trackname\"\n \t// =======================================================\n\n \tcase \"req-volumename\":\n case \"req-trackname\":\n case \"req-urlpage\":\n var illegalChars = validationType == \"req-volumename\" ? /[\\[\\]\\/\\\\\\\"~'&^$!}{\\;()?.*+=:<>|@#%,]/g : /[\\/\\\\\\\"?.*:<>|@#%]/g;\n \t value = $input.val().replace(/[^\\x00-\\x7F]/g, \"\"); //remove non ascii characters\n \t value = value.replace(illegalChars, \"\"); // remove illegal ascii characters\n \t\t$input.val(value);\n \t\t$input.closest('fieldset').sisyphus().saveAllData();\n \t\tif (isFormSubmit) {\n \t\t\tdef.resolve(!IsNotEmpty(value.trim()));\n \t\t}\n \t\telse{\n \t\t\tdef.resolve(false);\n \t\t}\n \t\tbreak;\n\n \t\t// =======================================================\n \t\t// === VAL TYPE: ISRC field\n \t\t// === REQUIRMENTS: not null, matches ISRC regExp\n \t\t// === Data-Validation(s): \"req-isrc\"\n \t\t// =======================================================\n case \"opt-isrc\":\n if (!IsNotEmpty(value)) {\n def.resolve(false);\n break;\n }\n \tcase \"req-isrc\":\n \t\tdef.resolve( !IsNotEmpty(value) || !/^[a-zA-Z]{2}(-?)[0-9a-zA-Z]{3}(-?)\\d{2}(-?)\\d{5}$/.test(value));\n \t\tbreak;\n\n case \"req-search\":\n def.resolve(!IsNotEmpty(value) || value.trim().toLowerCase() == 'search');\n break;\n\n default:\n // for any data-validation values that have no validation, return with a pass value\n def.resolve(false);\n break;\n } // switch\n\n return def.promise();\n\n } // CheckInputValue",
"function defaultValue(v) { }",
"function customValidation(input) { \n}",
"validate(_value, _utils) {\n return false;\n }",
"function canBeValue() { }",
"function customValidation(input){\n return input;\n \n}",
"function _setValue(a, defaultValue, errorMessage) {\n var b = (typeof a !== 'undefined') ? a : defaultValue;\n\n if(defaultValue == \"no_default\" && b == defaultValue) {\n console.error(errorMessage);\n return false;\n }\n\n return b;\n}",
"validator(name, value) {\n switch (name) {\n case 'name':\n return this.nameValidation(value);\n case 'keyword1':\n return this.keywordValidation(value);\n case 'keyword2':\n return this.keywordValidation(value);\n case 'keyword3':\n return this.keywordValidation(value);\n }\n }",
"function vaildator(value){\n if(value!=''){\n return value;\n }\n else{\n return '(name not given)';\n }\n}",
"function validator(fn)\r\n {\r\n return function()\r\n {\r\n if(($(this).attr(\"required\") == \"required\"))\r\n {\r\n if(!($(this).val())) return false;\r\n if ( this.value == $(this).attr(\"placeholder\") ) return false;\r\n }\r\n\r\n if(fn)\r\n return fn.apply(this);\r\n\r\n return true\r\n }\r\n }",
"function valueExists(val, defaultValue)\r\n{\r\n\tif (val != null && val.toString().length > 0)\r\n\t\treturn val;\r\n\t\t\r\n\treturn defaultValue;\r\n}",
"function validateValueWithFunc(value, parseFunc, type) {\n if (parseFunc(value))\n console.log('Invalid ' + type);\n else\n console.log('Valid ' + type);\n}",
"isValid(value){\n return !isNaN(value);\n }",
"validate(name, value) {\n switch (name) {\n case 'name':\n if (!isNotEmpty(value)) {\n return FORM_LOCK_NAME_MISSING\n }\n break\n case 'expirationDuration':\n if (!isPositiveInteger(value)) return FORM_EXPIRATION_DURATION_INVALID\n break\n case 'maxNumberOfKeys':\n if (value !== INFINITY && !isPositiveInteger(value)) {\n return FORM_MAX_KEYS_INVALID\n }\n break\n case 'keyPrice':\n if (!isPositiveNumber(value)) {\n return FORM_KEY_PRICE_INVALID\n }\n break\n }\n return false\n }",
"validate(value) { //The validate method recieves (as its first argument) the value to be validated\n if (value < 0) {\n throw new Error('Age must be a positive number!');\n }\n }",
"function floatFn(rule,value,callback,source,options){var errors=[];var validate=rule.required||!rule.required&&source.hasOwnProperty(rule.field);if(validate){if((0,_util.isEmptyValue)(value)&&!rule.required){return callback();}_rule2[\"default\"].required(rule,value,source,errors,options);if(value!==undefined){_rule2[\"default\"].type(rule,value,source,errors,options);_rule2[\"default\"].range(rule,value,source,errors,options);}}callback(errors);}",
"function floatFn(rule,value,callback,source,options){var errors=[];var validate=rule.required||!rule.required&&source.hasOwnProperty(rule.field);if(validate){if((0,_util.isEmptyValue)(value)&&!rule.required){return callback();}_rule2[\"default\"].required(rule,value,source,errors,options);if(value!==undefined){_rule2[\"default\"].type(rule,value,source,errors,options);_rule2[\"default\"].range(rule,value,source,errors,options);}}callback(errors);}",
"function floatFn(rule,value,callback,source,options){var errors=[];var validate=rule.required||!rule.required&&source.hasOwnProperty(rule.field);if(validate){if((0,_util.isEmptyValue)(value)&&!rule.required){return callback();}_rule2[\"default\"].required(rule,value,source,errors,options);if(value!==undefined){_rule2[\"default\"].type(rule,value,source,errors,options);_rule2[\"default\"].range(rule,value,source,errors,options);}}callback(errors);}",
"function isInvalid(value) {\n return value === undefined || value !== value;\n}",
"function isInvalid(value) {\n return value === undefined || value !== value;\n}",
"function isInvalid(value) {\n return value === undefined || value !== value;\n}",
"function isInvalid(value) {\n return value === undefined || value !== value;\n}",
"function validate(newValue) {\n if(newValue==\"\"){\n target.hasError(true);\n target.validationMessage(options.overrideMessage);\n return target;\n }else\n {\n var n1=parseInt(newValue,10);\n var n2=Number(newValue);\n if(isNaN(n1) ||isNaN(n2)) {\n target.hasError(true);\n target.validationMessage(\"This field is numberic\");\n return target;\n }else{\n if((n1<options.min) || (n1>options.max) ) {\n target.hasError(true);\n target.validationMessage(\"Trebuie sa fie intre \"+options.min+\" si \"+options.max);\n return target;\n\n }else{\n target.hasError(false);\n target.validationMessage(\"all is OK!\");\n return target;\n }\n }\n }\n\n }",
"validate(value) {\n if(value < 0){\n throw new Error('Age must be positive')\n }\n }",
"_validateInitialPropertyValues() {\n const that = this,\n value = typeof (that.value) === String ? that.value.replace(/\\s/g, '') : that.value.toString().replace(/\\s/g, '');\n\n if (that.mode === 'numeric' && that._numericProcessor.regexScientificNotation.test(value)) {\n that.value = that._numericProcessor.scientificToDecimal(value);\n delete that._valueBeforeCoercion;\n }\n\n //Validates significantDigits\n that.significantDigits = (that.significantDigits !== null) ? Math.min(Math.max(that.significantDigits, 1), 21) : null;\n\n if (that.significantDigits === null && that.precisionDigits === null) {\n that.significantDigits = 8;\n }\n else if (that.significantDigits !== null && that.precisionDigits !== null) {\n that.error(that.localize('significantPrecisionDigits', { elementType: that.nodeName.toLowerCase() }));\n }\n\n //minMax validation\n that._validateMinMax('both', true);\n\n if (that.showTooltip && that.showThumbLabel) {\n that.showTooltip = false;\n }\n }",
"function date$validateValue(value) {\n if (isNaN(value)) {\n // TODO(floitsch): Use real exception object.\n throw Error(\"Invalid Date\");\n }\n return value;\n}",
"function validateAndSetNumericOption(default_value, start, end, id, value){\n\n // regular expression to check if numeric\n var regex = /[^\\d|.]/gi;\n \n // if not numeric or value is out of range, warn\n if ((value.match(regex)) || (start > value) || (value > end)) {\n alert(getMessage('inputRange') + \" \" + start + '-' + end);\n }\n else {\n \n // otherwise, proceed to set property\n setChartProperty(default_value, id, value);\n }\n}",
"validate(value) {\n if (value < 0) {\n throw new Error(\"age must be a positive number\");\n }\n }",
"function validate (value, minLength, maxLength = 999) {\n return {\n state: state(value, minLength, maxLength),\n invalidFeedback: invalidFeedback(value, minLength, maxLength),\n validFeedback: validFeedback(value, minLength, maxLength)\n }\n}",
"function default_missing_values(default_val)\n{\n\treturn default_val;\n}",
"function validateValue(validationType, value) {\n\t\t\t\tif (validationType == 'alpha_numeric') {\n\t\t\t\t\t/*\n\t\t\t\t\tvar Exp = /^[0-9a-zA-Z\\s]+$/;\n\t\t\t\t\treturn value.match(Exp);\n\t\t\t\t\t*/\n\t\t\t\t\treturn value;\n\t\t\t\t} else if (validationType == 'email') {\n\t\t\t\t\tvar re = /^(([^<>()[\\]\\\\.,;:\\s@\\\"]+(\\.[^<>()[\\]\\\\.,;:\\s@\\\"]+)*)|(\\\".+\\\"))@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\])|(([a-zA-Z\\-0-9]+\\.)+[a-zA-Z]{2,}))$/;\n\t\t\t\t\treturn re.test(value);\n\t\t\t\t} else if (validationType == 'numeric') {\n\t\t\t\t\treturn !isNaN(value)\n\t\t\t\t}\n\t\t\t}",
"function validate(value){\r\n const error={\r\n\r\n };\r\n if(!value.title){\r\n error.title='Enter a UserName !';\r\n }\r\n if(!value.categories){\r\n error.categories='Enter a Category !!';\r\n }\r\n if(!value.content){\r\n error.content='Enter some content !!';\r\n }\r\n return error;\r\n}",
"function validateUser({ name = \"unknown\" }) {\n return name === \"john\";\n}",
"validate( _value, _utils ) {\n\t\t\treturn false;\n\t\t}",
"function checkValueType(value, valueStructure) {\n\tif(valueStructure && valueStructure.hasOwnProperty('valueType')) {\n\t\tvar result = false;\n\t\tswitch(valueStructure['valueType']) {\n\t\t case valueTypes[0]: // option\n\t\t if(valueStructure.hasOwnProperty('defaultValue') && valueStructure['defaultValue'].length > 0) {\n\t\t \tif(valueStructure['defaultValue'].indexOf(value) > -1) {\n\t\t \t\tresult = true\n\t\t \t} else {\n\t\t \t\tresult = false;\n\t\t \t\twriteLog(value + ' is not existed in default value.');\n\t\t \t}\n\t\t } else {\n\t\t \tresult = false;\n\t\t \twriteLog('Default value property is not existed.');\n\t\t }\n\n\t\t return result;\n\t\t break;\n\t\t case valueTypes[1]: // number\n\t\t return !isNaN(parseFloat(value)) && isFinite(value);\n\t\t break;\n\t\t default:\n\t\t if(value) {\n\t\t \treturn true;\n\t\t } else {\n\t\t \treturn false;\n\t\t }\n\t\t}\n\t} else {\n\t\twriteLog('valueType property is not existed.');\n\t\treturn false;\n\t}\n}",
"function validate(val, affectedKey, affectedKeyGeneric, def, op, skipRequiredCheck, strictRequiredCheck) {\n\n // Get the schema for this key, marking invalid if there isn't one.\n if (!def) {\n invalidKeys.push(Utility.errorObject(\"keyNotInSchema\", affectedKey, val, def, ss));\n return;\n }\n\n // Check for missing required values. The general logic is this:\n // * If the operator is $unset or $rename, it's invalid.\n // * If the value is null, it's invalid.\n // * If the value is undefined and one of the following are true, it's invalid:\n // * We're validating a key of a sub-object.\n // * We're validating a key of an object that is an array item.\n // * We're validating a document (as opposed to a modifier).\n // * We're validating a key under the $set operator in a modifier, and it's an upsert.\n if (!skipRequiredCheck && !def.optional) {\n if (val === null || val === void 0) {\n invalidKeys.push(Utility.errorObject(\"required\", affectedKey, null, def, ss));\n return;\n }\n }\n\n // Value checks are not necessary for null or undefined values\n if (Utility.isNotNullOrUndefined(val)) {\n\n // Check that value is of the correct type\n var typeError = doTypeChecks(def, val, op);\n if (typeError) {\n invalidKeys.push(Utility.errorObject(typeError, affectedKey, val, def, ss));\n return;\n }\n\n // Check value against allowedValues array\n if (def.allowedValues && !_.contains(def.allowedValues, val)) {\n invalidKeys.push(Utility.errorObject(\"notAllowed\", affectedKey, val, def, ss));\n return;\n }\n\n }\n\n // Perform custom validation\n var lastDot = affectedKey.lastIndexOf('.');\n var fieldParentName = lastDot === -1 ? '' : affectedKey.slice(0, lastDot + 1);\n var validators = def.custom ? [def.custom] : [];\n validators = validators.concat(ss._validators).concat(SimpleSchema._validators);\n _.every(validators, function(validator) {\n var errorType = validator.call(_.extend({\n key: affectedKey,\n genericKey: affectedKeyGeneric,\n definition: def,\n isSet: (val !== void 0),\n value: val,\n operator: op,\n field: function(fName) {\n mDoc = mDoc || new MongoObject(obj, ss._blackboxKeys); //create if necessary, cache for speed\n var keyInfo = mDoc.getInfoForKey(fName) || {};\n return {\n isSet: (keyInfo.value !== void 0),\n value: keyInfo.value,\n operator: keyInfo.operator\n };\n },\n siblingField: function(fName) {\n mDoc = mDoc || new MongoObject(obj, ss._blackboxKeys); //create if necessary, cache for speed\n var keyInfo = mDoc.getInfoForKey(fieldParentName + fName) || {};\n return {\n isSet: (keyInfo.value !== void 0),\n value: keyInfo.value,\n operator: keyInfo.operator\n };\n }\n }, extendedCustomContext || {}));\n if (typeof errorType === \"string\") {\n invalidKeys.push(Utility.errorObject(errorType, affectedKey, val, def, ss));\n return false;\n }\n return true;\n });\n }",
"static getErrorMessage(value, validator) {\n let content = '';\n let isMultiple = Array.isArray(value);\n\n switch (validator.rule) {\n case 'alpha':\n if (validator.allowDashes && validator.allowSpaces) {\n content = 'letters, dashes and spaces';\n } else if (validator.allowSpaces) {\n content = 'letters and spaces';\n } else if (validator.allowDashes) {\n content = 'letters and dashes';\n } else {\n content = 'letters';\n }\n\n return isMultiple ?\n `Please select options that contain ${content} only.` :\n `Please enter ${content} only.`;\n case 'alphanumeric':\n if (validator.allowDashes && validator.allowSpaces) {\n content = 'letters, numbers, dashes and spaces';\n } else if (validator.allowSpaces) {\n content = 'letters, numbers and spaces';\n } else if (validator.allowDashes) {\n content = 'letters, numbers and dashes';\n } else {\n content = 'letters and numbers';\n }\n\n return isMultiple ?\n `Please select options that contain ${content} only.` :\n `Please enter ${content} only.`;\n case 'number':\n if (validator.allowNegative && validator.allowDecimal) {\n content = 'positive or negative decimal numbers';\n } else if (validator.allowNegative) {\n content = 'positive or negative numbers';\n } else if (validator.allowDecimal) {\n content = 'decimal numbers';\n } else {\n content = 'numbers';\n }\n\n return isMultiple ?\n `Please select options that contain ${content} only.` :\n `Please enter ${content} only.`;\n case 'email':\n return isMultiple ?\n 'Please select only valid email address.' :\n 'Please enter a valid email address.';\n case 'max':\n return isMultiple ?\n `Please select values up to a maximum of ${validator.value}.` :\n `Please enter a value up to a maximum of ${validator.value}.`;\n case 'maxLength':\n return isMultiple ?\n `Please select up to ${validator.value} options.` :\n `Please enter up to ${validator.value} characters.`;\n case 'min':\n return isMultiple ?\n `Please select values up from a minimum of ${validator.value}.` :\n `Please enter a value up from a minimum of ${validator.value}.`;\n case 'minLength':\n return isMultiple ?\n `Please select at least ${validator.value} options.` :\n `Please enter at least ${validator.value} characters.`;\n case 'required':\n return isMultiple ?\n 'Please select at least one option.' :\n 'Please enter a value for this field.';\n case 'sameAs':\n return `Please make sure that the two values match.`;\n default:\n return 'Please enter a correct value for this field.';\n }\n }",
"validate(state, setError) {\n let errmsg = null,\n minimum = state.minimum,\n maximum = state.maximum,\n start = state.start;\n\n errmsg = emptyValidator('Owner', state.seqowner);\n if (errmsg) {\n setError('seqowner', errmsg);\n return true;\n } else {\n setError('seqowner', errmsg);\n }\n\n errmsg = emptyValidator('Schema', state.schema);\n if (errmsg) {\n setError('schema', errmsg);\n return true;\n } else {\n setError('schema', errmsg);\n }\n\n if (!this.isNew(state)) {\n errmsg = emptyValidator('Current value', state.current_value);\n if (errmsg) {\n setError('current_value', errmsg);\n return true;\n } else {\n setError('current_value', errmsg);\n }\n\n errmsg = emptyValidator('Increment value', state.increment);\n if (errmsg) {\n setError('increment', errmsg);\n return true;\n } else {\n setError('increment', errmsg);\n }\n\n errmsg = emptyValidator('Minimum value', state.minimum);\n if (errmsg) {\n setError('minimum', errmsg);\n return true;\n } else {\n setError('minimum', errmsg);\n }\n\n errmsg = emptyValidator('Maximum value', state.maximum);\n if (errmsg) {\n setError('maximum', errmsg);\n return true;\n } else {\n setError('maximum', errmsg);\n }\n\n errmsg = emptyValidator('Cache value', state.cache);\n if (errmsg) {\n setError('cache', errmsg);\n return true;\n } else {\n setError('cache', errmsg);\n }\n }\n\n let min_lt = gettext('Minimum value must be less than maximum value.'),\n start_lt = gettext('Start value cannot be less than minimum value.'),\n start_gt = gettext('Start value cannot be greater than maximum value.');\n\n if (isEmptyString(minimum) || isEmptyString(maximum))\n return null;\n\n if ((minimum == 0 && maximum == 0) ||\n (parseInt(minimum, 10) >= parseInt(maximum, 10))) {\n setError('minimum', min_lt);\n return true;\n } else {\n setError('minimum', null);\n }\n\n if (start && minimum && parseInt(start) < parseInt(minimum)) {\n setError('start', start_lt);\n return true;\n } else {\n setError('start', null);\n }\n\n if (start && maximum && parseInt(start) > parseInt(maximum)) {\n setError('start', start_gt);\n return true;\n } else {\n setError('start', null);\n }\n return null;\n }",
"_checkValue(value) {\n if (!_.isFunction(value)) {\n throw new Error('functionsDict._checkValue: must provide only Function as values.');\n }\n }",
"checkValidation(value, type) {\n switch (type) {\n case \"firstName\":\n return value.length > 0;\n case \"lastName\":\n return value.length > 0;\n case \"email\":\n return validateEmail(value);\n case \"password\":\n return validatePassword(value);\n case \"confirmPassword\":\n return value === this.state.password.value;\n case \"username\":\n return value.length > 6 && this.checkUsername(value);\n default:\n return false;\n }\n }",
"acceptValue(value) {\n let accept = !isNaN(value);\n\n if (accept && !(this.okMin(value) && this.okMax(value))) {\n accept = false;\n const current = this.input.value; // current is a string, so compare to int or string... hence == here not ===\n // noinspection EqualityComparisonWithCoercionJS\n\n if (current != value) {\n // The new value is out of range, but we accept it if the current value\n // is also problematic. Consider the case where the input is empty and the\n // minimum value is 100. The user must first type \"1\" and we must accept it\n // if they are to get the opportunity to type the \"0\"s.\n accept = !this.acceptValue(current); // Also, if we are checking the current value, be sure not to infinitely\n // recurse here.\n }\n }\n\n return accept;\n }",
"function floatFn(rule, value, callback, source, options) {\n\t\t var errors = [];\n\t\t var validate = rule.required || !rule.required && source.hasOwnProperty(rule.field);\n\t\t if (validate) {\n\t\t if ((0, _util.isEmptyValue)(value) && !rule.required) {\n\t\t return callback();\n\t\t }\n\t\t _rule2[\"default\"].required(rule, value, source, errors, options);\n\t\t if (value !== undefined) {\n\t\t _rule2[\"default\"].type(rule, value, source, errors, options);\n\t\t _rule2[\"default\"].range(rule, value, source, errors, options);\n\t\t }\n\t\t }\n\t\t callback(errors);\n\t\t}",
"function validateValue(value) {\n // check that value is a a valid Number -> no negative numbers or NaN allowed\n if (typeof value === 'number' && value >= 0 && value === value) return value;\n\n // check that value is a string and can be turned into a valid positive Number\n if (typeof value === 'string') return validateValue(parseInt(value, 10));\n return null;\n}",
"validate(value) {\n if (value < 0) {\n throw new Error('Age must be a positive number');\n }\n }",
"function calculateValue(testValue, defaultValue) {\n if (testValue) {\n return testValue;\n }\n else {\n return defaultValue;\n }\n }",
"function shouldValidate(ctx, value) {\n // when an immediate/initial validation is needed and wasn't done before.\n if (!ctx._ignoreImmediate && ctx.immediate) {\n return true;\n }\n // when the value changes for whatever reason.\n if (ctx.value !== value && ctx.normalizedEvents.length) {\n return true;\n }\n // when it needs validation due to props/cross-fields changes.\n if (ctx._needsValidation) {\n return true;\n }\n // when the initial value is undefined and the field wasn't rendered yet.\n if (!ctx.initialized && value === undefined) {\n return true;\n }\n return false;\n }",
"function checkValidInput(value) {\n if (!value || value === \"\") {\n return false;\n } else {\n return true;\n }\n}",
"function myValidation(value) {\n //console.log ('value = ', value);\n scope.signupCtrl.validateMenuItem(value)\n .then(function() {\n if (!scope.signupCtrl.error) {\n mCtrl.$setValidity('menuItem', true);\n } else {\n mCtrl.$setValidity('menuItem', false);\n }\n });\n return value;\n }",
"function noempty(input_value, default_value)\n{\n if (!input_value)\n {\n return default_value;\n }\n if (input_value.length==0)\n {\n return default_value;\n }\n return input_value;\n}",
"function lnameVal() {\n var elm = document.getElementById(\"lname\");\n\n if (elm.validity.valueMissing) {\n elm.setCustomValidity(\"Please enter in your last name!\");\n } else {\n elm.setCustomValidity(\"\");\n }\n}",
"validate(value){\n if(value < 0) throw new Error('The age must be a positive number')\n }",
"function shouldValidate(ctx, value) {\n // when an immediate/initial validation is needed and wasn't done before.\n if (!ctx._ignoreImmediate && ctx.immediate) {\n return true;\n }\n // when the value changes for whatever reason.\n if (ctx.value !== value && ctx.normalizedEvents.length) {\n return true;\n }\n // when it needs validation due to props/cross-fields changes.\n if (ctx._needsValidation) {\n return true;\n }\n // when the initial value is undefined and the field wasn't rendered yet.\n if (!ctx.initialized && value === undefined) {\n return true;\n }\n return false;\n}",
"function shouldValidate(ctx, value) {\n // when an immediate/initial validation is needed and wasn't done before.\n if (!ctx._ignoreImmediate && ctx.immediate) {\n return true;\n }\n // when the value changes for whatever reason.\n if (ctx.value !== value && ctx.normalizedEvents.length) {\n return true;\n }\n // when it needs validation due to props/cross-fields changes.\n if (ctx._needsValidation) {\n return true;\n }\n // when the initial value is undefined and the field wasn't rendered yet.\n if (!ctx.initialized && value === undefined) {\n return true;\n }\n return false;\n}",
"function validate(input, val) {\n\t\n\tswitch(input) {\n\t\tcase 'home':\n\t\t\treturn isNumerical(val) && validateLength(val);\n\t\t\tbreak;\n\t\tcase 'mobile':\n\t\t\treturn isNumerical(val) && validateLength(val);\n\t\t\tbreak;\n\t\tcase 'work':\n\t\t\treturn isNumerical(val) && validateLength(val);\n\t\t\tbreak;\n\t\tcase 'country':\n\t\t\tbreak;\n\t\tdefault:\n\t\t\treturn validateLength(val);\n\t\t\tbreak;\n\t}\n}",
"FieldValidation(key, value) {\n switch(key) {\n case 'firstName':\n if(value.length > 15){\n return 'error';\n }\n break;\n case 'lastName':\n if(value.length > 15){\n return 'error';\n }\n break;\n case 'email':\n if(value.match(/^([\\w.%+-]+)@([\\w-]+\\.)+([\\w]{2,})$/i)){\n return 'error';\n }\n break;\n case 'pec':\n if(value.match(/^([\\w.%+-]+)@([\\w-]+\\.)+([\\w]{2,})$/i)){\n return 'error';\n }\n break;\n case 'role':\n if(value.length > 15){\n return 'error';\n }\n case 'password':\n if(value.length > 15){\n return 'error';\n }\n break;\n case 'password2':\n if(!value.match('passowrd')){\n return 'error';\n }\n break;\n case 'phoneNumber':\n if(value.length > 10){\n return 'error';\n }\n break;\n case 'telAz':\n if(value.length > 10){\n return 'error';\n }\n break;\n case 'nomeAzienda':\n if(value.length > 50){\n return 'error';\n }\n break;\n case 'subCategoria':\n if(value.length > 30){\n return 'error';\n }\n break;\n case 'piva':\n if(value.length > 11){\n return 'error';\n }\n break;\n case 'ateco':\n if(value.length > 8){\n return 'error';\n }\n break;\n case 'provCCIAA':\n if(value.length > 2){\n return 'error';\n }\n break;\n case 'numREA':\n if(value.length > 6){\n return 'error';\n }\n break;\n case 'sedeLegInd':\n if(value.length > 30){\n return 'error';\n }\n break;\n case 'sedeLegNum':\n if(value.length > 3){\n return 'error';\n }\n break;\n case 'capLeg':\n if(value.length > 5){\n return 'error';\n }\n break;\n case 'sedeLegFax':\n if(value.length > 10){\n return 'error';\n }\n break;\n case 'sedeAmmInd':\n if(value.length > 30){\n return 'error';\n }\n break;\n case 'sedeAmmNum':\n if(value.length > 3){\n return 'error';\n }\n break;\n case 'capAmm':\n if(value.length > 5){\n return 'error';\n }\n break;\n case 'sedeAmmFax':\n if(value.length > 10){\n return 'error';\n }\n break;\n }\n }",
"shouldSetInputTextToDefaultValue (props) {\n let result = (this.previousDefaultValue != props.defaultValue) || (this.previousChangeIndicator != props.changeIndicator)\n return result\n }",
"function defaulted(value, defaultValue) {\r\n return value !== undefined ? value : defaultValue;\r\n}",
"function defaulted(value, defaultValue) {\r\n return value !== undefined ? value : defaultValue;\r\n}",
"function defaulted(value, defaultValue) {\r\n return value !== undefined ? value : defaultValue;\r\n}",
"function regexp(rule, value, callback, source, options) {\n\t\t var errors = [];\n\t\t var validate = rule.required || !rule.required && source.hasOwnProperty(rule.field);\n\t\t if (validate) {\n\t\t if ((0, _util.isEmptyValue)(value) && !rule.required) {\n\t\t return callback();\n\t\t }\n\t\t _rule2[\"default\"].required(rule, value, source, errors, options);\n\t\t if (!(0, _util.isEmptyValue)(value)) {\n\t\t _rule2[\"default\"].type(rule, value, source, errors, options);\n\t\t }\n\t\t }\n\t\t callback(errors);\n\t\t}",
"preValidate(key, value, errors, values) {}",
"function defaultValue(test,defaultValue) {\r\n\treturn (typeof test !== 'undefined' ? test : defaultValue);\r\n}",
"function validateUserInput(userValue, minValue, maxValue) {\n if (isNumber(userValue)) {\n if (userValue > maxValue || userValue < minValue) {\n return false;\n }\n\n else {\n return true;\n }\n }\n\n else {\n return false;\n }\n}",
"_validateMaskValue() {\n const that = this;\n\n if (that.readonly || that.disabled || !that.validation || typeof that.validation !== 'function') {\n return;\n }\n\n const value = that.value;\n\n const success = that.validation(value);\n\n if (!success) {\n that.setAttribute('error', '');\n }\n else {\n that.removeAttribute('error');\n }\n\n that.$.fireEvent('validation', {\n 'success': success\n });\n }",
"function floatFn(rule, value, callback, source, options) {\n\t var errors = [];\n\t var validate = rule.required || !rule.required && source.hasOwnProperty(rule.field);\n\t if (validate) {\n\t if ((0, _util.isEmptyValue)(value) && !rule.required) {\n\t return callback();\n\t }\n\t _rule2[\"default\"].required(rule, value, source, errors, options);\n\t if (value !== undefined) {\n\t _rule2[\"default\"].type(rule, value, source, errors, options);\n\t _rule2[\"default\"].range(rule, value, source, errors, options);\n\t }\n\t }\n\t callback(errors);\n\t}",
"function validateUser({ name = \"unknown\" } = {}) {\n return name === \"john\";\n}",
"validate(value){\n if (!validator.isEmail(value)){\n throw new Error('Email invalid')\n }\n }",
"function validateValue(value) {\n return (VALID_VALUE_BASE_REGEX.test(value) &&\n !INVALID_VALUE_COMMA_EQUAL_REGEX.test(value));\n}",
"function validateValue(value) {\n return (VALID_VALUE_BASE_REGEX.test(value) &&\n !INVALID_VALUE_COMMA_EQUAL_REGEX.test(value));\n}",
"function CfnTaskTemplate_DefaultFieldValuePropertyValidator(properties) {\n if (!cdk.canInspect(properties)) {\n return cdk.VALIDATION_SUCCESS;\n }\n const errors = new cdk.ValidationResults();\n if (typeof properties !== 'object') {\n errors.collect(new cdk.ValidationResult('Expected an object, but received: ' + JSON.stringify(properties)));\n }\n errors.collect(cdk.propertyValidator('defaultValue', cdk.requiredValidator)(properties.defaultValue));\n errors.collect(cdk.propertyValidator('defaultValue', cdk.validateString)(properties.defaultValue));\n errors.collect(cdk.propertyValidator('id', cdk.requiredValidator)(properties.id));\n errors.collect(cdk.propertyValidator('id', CfnTaskTemplate_FieldIdentifierPropertyValidator)(properties.id));\n return errors.wrap('supplied properties not correct for \"DefaultFieldValueProperty\"');\n}",
"function value(val) { return control_1.default(val); }",
"validationHandler(rules, value) {\n let isValid = true;\n\n if (!rules) {\n return true;\n }\n\n if (rules.required) {\n isValid = value.trim() !== \"\" && isValid;\n }\n\n if (rules.minLength) {\n isValid = value.length >= rules.minLength && isValid;\n }\n\n if (rules.maxLength) {\n isValid = value.length <= rules.maxLength && isValid;\n }\n\n if (rules.isEmail) {\n const pattern = /[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*@(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?/;\n isValid = pattern.test(value) && isValid;\n }\n\n return isValid;\n }",
"function integer(rule,value,callback,source,options){var errors=[];var validate=rule.required||!rule.required&&source.hasOwnProperty(rule.field);if(validate){if((0,_util.isEmptyValue)(value)&&!rule.required){return callback();}_rule2[\"default\"].required(rule,value,source,errors,options);if(value!==undefined){_rule2[\"default\"].type(rule,value,source,errors,options);_rule2[\"default\"].range(rule,value,source,errors,options);}}callback(errors);}",
"function integer(rule,value,callback,source,options){var errors=[];var validate=rule.required||!rule.required&&source.hasOwnProperty(rule.field);if(validate){if((0,_util.isEmptyValue)(value)&&!rule.required){return callback();}_rule2[\"default\"].required(rule,value,source,errors,options);if(value!==undefined){_rule2[\"default\"].type(rule,value,source,errors,options);_rule2[\"default\"].range(rule,value,source,errors,options);}}callback(errors);}",
"function integer(rule,value,callback,source,options){var errors=[];var validate=rule.required||!rule.required&&source.hasOwnProperty(rule.field);if(validate){if((0,_util.isEmptyValue)(value)&&!rule.required){return callback();}_rule2[\"default\"].required(rule,value,source,errors,options);if(value!==undefined){_rule2[\"default\"].type(rule,value,source,errors,options);_rule2[\"default\"].range(rule,value,source,errors,options);}}callback(errors);}",
"function validateMinMaxValue(val)\n{\n var dt = P2.getFieldValue(TYPE_NAME);\n if (dt == INT_TYPE || dt == DEC_TYPE)\n {\n if(!val || val.length == 0)\n return \"Min/Max values are required\"\n }\n return null;\n}",
"function valueOrDefault(value, defaultValue) {\n\t\treturn typeof value === 'undefined' ? defaultValue : value;\n\t}",
"function validateNamedOptionalPropertyEquals(functionName,inputName,optionName,input,expected){if(input!==undefined){validateNamedPropertyEquals(functionName,inputName,optionName,input,expected);}}",
"function regexp(rule, value, callback, source, options) {\n\t var errors = [];\n\t var validate = rule.required || !rule.required && source.hasOwnProperty(rule.field);\n\t if (validate) {\n\t if ((0, _util.isEmptyValue)(value) && !rule.required) {\n\t return callback();\n\t }\n\t _rule2[\"default\"].required(rule, value, source, errors, options);\n\t if (!(0, _util.isEmptyValue)(value)) {\n\t _rule2[\"default\"].type(rule, value, source, errors, options);\n\t }\n\t }\n\t callback(errors);\n\t}",
"function defaulted(value, defaultValue) {\n return value !== undefined ? value : defaultValue;\n }",
"function undefinedDefault(value, defaultValue) {\n return (value !== undefined) ? value : defaultValue;\n}",
"function _validateIsNotBlank(def){\n return !isEmpty(def.attrValue);\n}"
] |
[
"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.5850534",
"0.58382624",
"0.5832495",
"0.5827688",
"0.581331",
"0.58104706",
"0.57828456",
"0.57550627",
"0.57483244",
"0.5705512",
"0.56952184",
"0.5676993",
"0.5666483",
"0.5665817",
"0.5665817",
"0.5665817",
"0.56593883",
"0.56593883",
"0.56593883",
"0.56593883",
"0.565329",
"0.5645423",
"0.56385815",
"0.5634249",
"0.5631972",
"0.561746",
"0.55995023",
"0.5598736",
"0.5596319",
"0.55823517",
"0.5581123",
"0.5576831",
"0.55748844",
"0.5567295",
"0.555334",
"0.55509",
"0.5537622",
"0.5533782",
"0.55309516",
"0.55252206",
"0.5524409",
"0.5519985",
"0.55082774",
"0.54966646",
"0.54965717",
"0.54833883",
"0.5482924",
"0.5481612",
"0.54746187",
"0.5464223",
"0.5464223",
"0.5461036",
"0.5458784",
"0.5458329",
"0.5455748",
"0.5455748",
"0.5455748",
"0.54516596",
"0.54510033",
"0.54487586",
"0.5434088",
"0.54293984",
"0.54275113",
"0.54243594",
"0.5423496",
"0.5421067",
"0.5421067",
"0.54184175",
"0.54169947",
"0.54120696",
"0.54086924",
"0.54086924",
"0.54086924",
"0.5408298",
"0.54062825",
"0.53942436",
"0.53923774",
"0.53907543",
"0.5384356",
"0.5383341"
] |
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 new Error(\"The `\"+propName+\"` prop supplied to <select> must be a scalar \"+\"value if `multiple` is false.\");}}}",
"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 new Error(\"The `\" + propName + \"` prop supplied to <select> must be a scalar \" + \"value if `multiple` is false.\");}}}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function updateOptions() {\n /*jshint validthis:true */\n if (this.props.value == null) {\n return;\n }\n var options = this.getDOMNode().options;\n var selectedValue = '' + this.props.value;\n\n for (var i = 0, l = options.length; i < l; i++) {\n var selected = this.props.multiple ?\n selectedValue.indexOf(options[i].value) >= 0 :\n selected = options[i].value === selectedValue;\n\n if (selected !== options[i].selected) {\n options[i].selected = selected;\n }\n }\n}",
"function useSelect(props) {\n const {\n buttonRef: buttonRefProp,\n defaultValue: defaultValueProp,\n disabled = false,\n listboxId: listboxIdProp,\n listboxRef: listboxRefProp,\n multiple = false,\n onChange,\n onHighlightChange,\n onOpenChange,\n open = false,\n options,\n optionStringifier = _defaultOptionStringifier.default,\n value: valueProp\n } = props;\n const buttonRef = React.useRef(null);\n const handleButtonRef = (0, _utils.unstable_useForkRef)(buttonRefProp, buttonRef);\n const listboxRef = React.useRef(null);\n const listboxId = (0, _utils.unstable_useId)(listboxIdProp);\n let defaultValue;\n if (valueProp === undefined && defaultValueProp === undefined) {\n defaultValue = [];\n } else if (defaultValueProp !== undefined) {\n defaultValue = multiple ? defaultValueProp : [defaultValueProp];\n }\n const value = React.useMemo(() => {\n if (valueProp !== undefined) {\n return multiple ? valueProp : [valueProp];\n }\n return undefined;\n }, [valueProp, multiple]);\n const optionsMap = React.useMemo(() => {\n const map = new Map();\n options.forEach(option => {\n map.set(option.value, option);\n });\n return map;\n }, [options]);\n\n // prevents closing the listbox on keyUp right after opening it\n const ignoreEnterKeyUp = React.useRef(false);\n\n // prevents reopening the listbox when button is clicked\n // (listbox closes on lost focus, then immediately reopens on click)\n const ignoreClick = React.useRef(false);\n\n // Ensure the listbox is focused after opening\n const [listboxFocusRequested, requestListboxFocus] = React.useState(false);\n const focusListboxIfRequested = React.useCallback(() => {\n if (listboxFocusRequested && listboxRef.current != null) {\n listboxRef.current.focus();\n requestListboxFocus(false);\n }\n }, [listboxFocusRequested]);\n const handleListboxRef = (0, _utils.unstable_useForkRef)(listboxRefProp, listboxRef, focusListboxIfRequested);\n const {\n notifySelectionChanged,\n notifyHighlightChanged,\n registerHighlightChangeHandler,\n registerSelectionChangeHandler\n } = (0, _useSelectChangeNotifiers.default)();\n React.useEffect(() => {\n focusListboxIfRequested();\n }, [focusListboxIfRequested]);\n React.useEffect(() => {\n requestListboxFocus(open);\n }, [open]);\n const createHandleMouseDown = otherHandlers => event => {\n var _otherHandlers$onMous;\n otherHandlers == null ? void 0 : (_otherHandlers$onMous = otherHandlers.onMouseDown) == null ? void 0 : _otherHandlers$onMous.call(otherHandlers, event);\n if (!event.defaultPrevented && open) {\n ignoreClick.current = true;\n }\n };\n const createHandleButtonClick = otherHandlers => event => {\n var _otherHandlers$onClic;\n otherHandlers == null ? void 0 : (_otherHandlers$onClic = otherHandlers.onClick) == null ? void 0 : _otherHandlers$onClic.call(otherHandlers, event);\n if (!event.defaultPrevented && !ignoreClick.current) {\n onOpenChange == null ? void 0 : onOpenChange(!open);\n }\n ignoreClick.current = false;\n };\n const createHandleButtonKeyDown = otherHandlers => event => {\n var _otherHandlers$onKeyD;\n otherHandlers == null ? void 0 : (_otherHandlers$onKeyD = otherHandlers.onKeyDown) == null ? void 0 : _otherHandlers$onKeyD.call(otherHandlers, event);\n if (event.defaultPrevented) {\n return;\n }\n if (event.key === 'Enter') {\n ignoreEnterKeyUp.current = true;\n }\n if (event.key === 'ArrowDown' || event.key === 'ArrowUp') {\n event.preventDefault();\n onOpenChange == null ? void 0 : onOpenChange(true);\n }\n };\n const createHandleListboxKeyUp = otherHandlers => event => {\n var _otherHandlers$onKeyU;\n otherHandlers == null ? void 0 : (_otherHandlers$onKeyU = otherHandlers.onKeyUp) == null ? void 0 : _otherHandlers$onKeyU.call(otherHandlers, event);\n if (event.defaultPrevented) {\n return;\n }\n const closingKeys = multiple ? ['Escape'] : ['Escape', 'Enter', ' '];\n if (open && !ignoreEnterKeyUp.current && closingKeys.includes(event.key)) {\n var _buttonRef$current;\n buttonRef == null ? void 0 : (_buttonRef$current = buttonRef.current) == null ? void 0 : _buttonRef$current.focus();\n }\n ignoreEnterKeyUp.current = false;\n };\n const createHandleListboxItemClick = React.useCallback(otherHandlers => event => {\n var _otherHandlers$onClic2;\n otherHandlers == null ? void 0 : (_otherHandlers$onClic2 = otherHandlers.onClick) == null ? void 0 : _otherHandlers$onClic2.call(otherHandlers, event);\n if (event.defaultPrevented) {\n return;\n }\n if (!multiple) {\n onOpenChange == null ? void 0 : onOpenChange(false);\n }\n }, [multiple, onOpenChange]);\n const createHandleListboxBlur = otherHandlers => event => {\n var _otherHandlers$onBlur;\n otherHandlers == null ? void 0 : (_otherHandlers$onBlur = otherHandlers.onBlur) == null ? void 0 : _otherHandlers$onBlur.call(otherHandlers, event);\n if (!event.defaultPrevented) {\n onOpenChange == null ? void 0 : onOpenChange(false);\n }\n };\n const listboxReducer = React.useCallback((state, action) => {\n const newState = (0, _useListbox.defaultListboxReducer)(state, action);\n switch (action.type) {\n case _useListbox.ActionTypes.keyDown:\n // change selection when listbox is closed\n if ((action.event.key === 'ArrowUp' || action.event.key === 'ArrowDown') && !open && !multiple) {\n return (0, _extends2.default)({}, newState, {\n selectedValues: newState.highlightedValue != null ? [newState.highlightedValue] : []\n });\n }\n break;\n case _useListbox.ActionTypes.blur:\n case _useListbox.ActionTypes.setValue:\n case _useListbox.ActionTypes.optionsChange:\n return (0, _extends2.default)({}, newState, {\n highlightedValue: newState.selectedValues.length > 0 ? newState.selectedValues[0] : null\n });\n default:\n return newState;\n }\n return newState;\n }, [open, multiple]);\n const {\n getRootProps: getButtonRootProps,\n active: buttonActive,\n focusVisible: buttonFocusVisible\n } = (0, _useButton.default)({\n disabled,\n ref: handleButtonRef\n });\n const optionValues = React.useMemo(() => options.map(o => o.value), [options]);\n const isOptionDisabled = React.useCallback(valueToCheck => {\n var _option$disabled;\n const option = optionsMap.get(valueToCheck);\n return (_option$disabled = option == null ? void 0 : option.disabled) != null ? _option$disabled : false;\n }, [optionsMap]);\n const stringifyOption = React.useCallback(valueToCheck => {\n const option = optionsMap.get(valueToCheck);\n if (!option) {\n return '';\n }\n return optionStringifier(option);\n }, [optionsMap, optionStringifier]);\n const useListboxParameters = {\n defaultValue,\n id: listboxId,\n isOptionDisabled,\n listboxRef: handleListboxRef,\n onChange: (e, newValues) => {\n if (multiple) {\n onChange == null ? void 0 : onChange(e, newValues);\n } else {\n var _newValues$;\n onChange == null ? void 0 : onChange(e, (_newValues$ = newValues[0]) != null ? _newValues$ : null);\n }\n },\n onHighlightChange: (e, newValue) => {\n onHighlightChange == null ? void 0 : onHighlightChange(e, newValue != null ? newValue : null);\n },\n options: optionValues,\n optionStringifier: stringifyOption,\n selectionLimit: multiple ? null : 1,\n stateReducer: listboxReducer,\n value\n };\n const {\n getRootProps: getListboxRootProps,\n getOptionProps: getListboxOptionProps,\n getOptionState,\n highlightedOption,\n selectedOption\n } = (0, _useListbox.default)(useListboxParameters);\n React.useEffect(() => {\n notifySelectionChanged(selectedOption);\n }, [selectedOption, notifySelectionChanged]);\n React.useEffect(() => {\n notifyHighlightChanged(highlightedOption);\n }, [highlightedOption, notifyHighlightChanged]);\n const getButtonProps = (otherHandlers = {}) => {\n return (0, _extends2.default)({}, getButtonRootProps((0, _extends2.default)({}, otherHandlers, {\n onClick: createHandleButtonClick(otherHandlers),\n onMouseDown: createHandleMouseDown(otherHandlers),\n onKeyDown: createHandleButtonKeyDown(otherHandlers)\n })), {\n role: 'combobox',\n 'aria-expanded': open,\n 'aria-haspopup': 'listbox',\n 'aria-controls': listboxId\n });\n };\n const getListboxProps = (otherHandlers = {}) => getListboxRootProps((0, _extends2.default)({}, otherHandlers, {\n onBlur: createHandleListboxBlur(otherHandlers),\n onKeyUp: createHandleListboxKeyUp(otherHandlers)\n }));\n const getOptionProps = React.useCallback((optionValue, otherHandlers = {}) => {\n return getListboxOptionProps(optionValue, (0, _extends2.default)({}, otherHandlers, {\n onClick: createHandleListboxItemClick(otherHandlers)\n }));\n }, [getListboxOptionProps, createHandleListboxItemClick]);\n React.useDebugValue({\n selectedOption,\n highlightedOption,\n open\n });\n const contextValue = React.useMemo(() => ({\n listboxRef,\n getOptionProps,\n getOptionState,\n registerHighlightChangeHandler,\n registerSelectionChangeHandler\n }), [getOptionProps, getOptionState, registerHighlightChangeHandler, registerSelectionChangeHandler]);\n if (props.multiple) {\n return {\n buttonActive,\n buttonFocusVisible,\n disabled,\n getButtonProps,\n getListboxProps,\n contextValue,\n open,\n value: selectedOption,\n highlightedOption\n };\n }\n return {\n buttonActive,\n buttonFocusVisible,\n disabled,\n getButtonProps,\n getListboxProps,\n contextValue,\n open,\n value: selectedOption.length > 0 ? selectedOption[0] : null,\n highlightedOption\n };\n}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return null;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return null;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return null;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return null;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function selectValueType(props, propName, componentName) {\n\t if (props[propName] == null) {\n\t return null;\n\t }\n\t if (props.multiple) {\n\t if (!Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n\t (\"`multiple` is true.\")\n\t );\n\t }\n\t } else {\n\t if (Array.isArray(props[propName])) {\n\t return new Error(\n\t (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n\t (\"value if `multiple` is false.\")\n\t );\n\t }\n\t }\n\t}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n invariant(\n Array.isArray(props[propName]),\n 'The `%s` prop supplied to <select> must be an array if `multiple` is ' +\n 'true.',\n propName\n );\n } else {\n invariant(\n !Array.isArray(props[propName]),\n 'The `%s` prop supplied to <select> must be a scalar value if ' +\n '`multiple` is false.',\n propName\n );\n }\n}",
"function MultiSelect(props) {\n // props = Options, index of section, add/remove function from parent, default (preselected) values, in sync with other MultiSelect Components?\n // props = [ options:Array[obj], index:int, add:func, remove:func, defaultOptions:Array[obj], sync:bool ]\n\n const [currentlySelected, setCurrentlySelected] = useState([]);\n\n useEffect(() => {\n if (props.defaultOptions) {\n let replaceSelected = cloneDeep(props.defaultOptions);\n replaceSelected.sort(sortByLabel);\n setCurrentlySelected(replaceSelected);\n }\n }, [props.defaultOptions])\n\n const [currentlyNotSelected, setCurrentlyNotSelected] = useState([]);\n\n useEffect(() => {\n let replace = cloneDeep(props.options);\n // if props.sync, let parent component handle props.options instead\n if (props.defaultOptions && !props.sync) {\n // loop through each section to check for selected inputs\n if (props.defaultOptions.length > 0) {\n for (let i = 0; i < props.defaultOptions.length; i++) {\n const selected = props.defaultOptions[i];\n // loop through list of unselected inputs and compare\n for (let x = replace.length; x > 0; x--) {\n const input = replace.pop();\n // if not the selected input, add back to unselected\n if (input.label !== selected.label)\n replace.unshift(input);\n }\n }\n }\n }\n replace.sort(sortByLabel);\n setCurrentlyNotSelected(replace);\n }, [props.options, props.defaultOptions, props.sync])\n\n const [hasDropdown, setHasDropdown] = useState(false);\n const [searchInput, setSearchInput] = useState(\"\");\n\n const searchInputRef = useRef(null);\n\n // handleDropDown:func()\n // => check if dropdown is true\n // => true: close dropdown (display: none)\n // => false: dropdown (display: block)\n const handleDropDown = (e) => {\n if (e.key === \"Enter\" || e.key === undefined) {\n searchInputRef.current.value = \"\";\n setSearchInput(\"\");\n setHasDropdown(!hasDropdown);\n }\n };\n\n const handleSearchInput = (e) => setSearchInput(e.target.value);\n\n // handleSelectOption:func(e)\n // => add to currentlySelected\n // => call add function (prop)\n // => remove from currentlyNotSelected\n const handleSelectOption = (e) => {\n if (e.key === \"Enter\" || e.key === undefined) {\n let optionIndex = e.target.getAttribute(\"data-id\");\n\n let replaceSelected = cloneDeep(currentlySelected);\n let replaceNotSelected = cloneDeep(currentlyNotSelected);\n let transfer = replaceNotSelected.splice(optionIndex, 1);\n replaceSelected.push(...transfer);\n\n if (props.add !== undefined)\n props.add(...transfer, props.dataId);\n\n setCurrentlySelected(replaceSelected);\n setCurrentlyNotSelected(replaceNotSelected);\n }\n }\n\n // handleRemoveOption:func(e)\n // => remove from currentlySelected\n // => call remove function (prop)\n // => add to currentlyNotSelected\n const handleRemoveOption = (e) => {\n let optionIndex = e.target.getAttribute(\"data-id\");\n\n let replaceSelected = cloneDeep(currentlySelected);\n let replaceNotSelected = cloneDeep(currentlyNotSelected);\n let transfer = replaceSelected.splice(optionIndex, 1);\n replaceNotSelected.push(...transfer);\n\n if (props.rm !== undefined)\n if (props.dataId === undefined)\n console.error(\"Unable to call remove function, dataId is empty!\")\n else\n props.rm(...transfer, props.dataId);\n\n setCurrentlySelected(replaceSelected);\n setCurrentlyNotSelected(replaceNotSelected);\n }\n\n\n return (\n <div className=\"multiSelect\">\n <div className=\"multiSelectTop\" style={hasDropdown ? {} : { borderBottom: \"#e6e6e6 solid 1px\" }}>\n <div className=\"selectedBox\">\n {\n currentlySelected.map((option, index) => {\n return (\n <span key={index} className=\"selected noselect\">\n {option.label}\n <input data-id={index} onClick={handleRemoveOption} type=\"button\" value=\"✕\" />\n </span>\n );\n })\n }\n </div>\n\n <div className=\"dropdownButton\" tabIndex=\"0\" onKeyPress={handleDropDown} onClick={handleDropDown}><i className=\"downArrow\"></i></div>\n </div>\n <div className=\"dropdown\" style={hasDropdown ? {} : { display: \"none\" }}>\n <input ref={searchInputRef} placeholder=\"Search\" className=\"selectSearch\" onChange={handleSearchInput} />\n <ul style={currentlyNotSelected.length === 0 ? { textAlign: \"center\", padding: \"10px\" } : {}}>\n {\n (currentlyNotSelected.length !== 0 && hasDropdown ? currentlyNotSelected.map((option, index) => {\n if (searchInput === \"\" || option.label.toUpperCase().includes(searchInput.toUpperCase())) {\n return (\n <li data-id={index}\n key={index}\n tabIndex=\"0\"\n onKeyPress={handleSelectOption}\n onClick={handleSelectOption}\n className=\"noselect\"\n >\n {option.label}\n </li>\n );\n }\n\n return null;\n }) : <span>List is empty!</span>)\n }\n </ul>\n </div>\n </div>\n );\n}",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map(v => this._getOptionId(v));\n\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n } else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function useSelect(props) {\n const {\n buttonRef: buttonRefProp,\n defaultOpen = false,\n defaultValue: defaultValueProp,\n disabled = false,\n listboxId: listboxIdProp,\n listboxRef: listboxRefProp,\n multiple = false,\n onChange,\n onHighlightChange,\n onOpenChange,\n open: openProp,\n options: optionsParam,\n optionStringifier = defaultOptionStringifier,\n value: valueProp\n } = props;\n const buttonRef = React.useRef(null);\n const handleButtonRef = useForkRef(buttonRefProp, buttonRef);\n const listboxRef = React.useRef(null);\n const listboxId = useId(listboxIdProp);\n let defaultValue;\n if (valueProp === undefined && defaultValueProp === undefined) {\n defaultValue = [];\n } else if (defaultValueProp !== undefined) {\n defaultValue = multiple ? defaultValueProp : [defaultValueProp];\n }\n const value = React.useMemo(() => {\n if (valueProp !== undefined) {\n return multiple ? valueProp : [valueProp];\n }\n return undefined;\n }, [valueProp, multiple]);\n const {\n subitems,\n contextValue: compoundComponentContextValue\n } = useCompoundParent();\n const options = React.useMemo(() => {\n if (optionsParam != null) {\n return new Map(optionsParam.map((option, index) => [option.value, {\n value: option.value,\n label: option.label,\n disabled: option.disabled,\n ref: /*#__PURE__*/React.createRef(),\n id: `${listboxId}_${index}`\n }]));\n }\n return subitems;\n }, [optionsParam, subitems, listboxId]);\n\n // prevents closing the listbox on keyUp right after opening it\n const ignoreEnterKeyUp = React.useRef(false);\n\n // prevents reopening the listbox when button is clicked\n // (listbox closes on lost focus, then immediately reopens on click)\n const ignoreClick = React.useRef(false);\n\n // Ensure the listbox is focused after opening\n const [listboxFocusRequested, requestListboxFocus] = React.useState(false);\n const focusListboxIfRequested = React.useCallback(() => {\n if (listboxFocusRequested && listboxRef.current != null) {\n listboxRef.current.focus();\n requestListboxFocus(false);\n }\n }, [listboxFocusRequested]);\n const handleListboxRef = useForkRef(listboxRefProp, listboxRef, focusListboxIfRequested);\n const {\n getRootProps: getButtonRootProps,\n active: buttonActive,\n focusVisible: buttonFocusVisible,\n rootRef: mergedButtonRef\n } = useButton({\n disabled,\n rootRef: handleButtonRef\n });\n const optionValues = React.useMemo(() => Array.from(options.keys()), [options]);\n const isItemDisabled = React.useCallback(valueToCheck => {\n const option = options.get(valueToCheck);\n return option?.disabled ?? false;\n }, [options]);\n const stringifyOption = React.useCallback(valueToCheck => {\n const option = options.get(valueToCheck);\n if (!option) {\n return '';\n }\n return optionStringifier(option);\n }, [options, optionStringifier]);\n const controlledState = React.useMemo(() => ({\n selectedValues: value,\n open: openProp\n }), [value, openProp]);\n const getItemId = React.useCallback(itemValue => options.get(itemValue)?.id, [options]);\n const handleSelectionChange = React.useCallback((event, newValues) => {\n if (multiple) {\n onChange?.(event, newValues);\n } else {\n onChange?.(event, newValues[0] ?? null);\n }\n }, [multiple, onChange]);\n const handleHighlightChange = React.useCallback((event, newValue) => {\n onHighlightChange?.(event, newValue ?? null);\n }, [onHighlightChange]);\n const handleStateChange = React.useCallback((e, field, fieldValue) => {\n if (field === 'open') {\n onOpenChange?.(fieldValue);\n if (fieldValue === false && e?.type !== 'blur') {\n buttonRef.current?.focus();\n }\n }\n }, [onOpenChange]);\n const useListParameters = {\n getInitialState: () => ({\n highlightedValue: null,\n selectedValues: defaultValue ?? [],\n open: defaultOpen\n }),\n getItemId,\n controlledProps: controlledState,\n isItemDisabled,\n rootRef: handleListboxRef,\n onChange: handleSelectionChange,\n onHighlightChange: handleHighlightChange,\n onStateChange: handleStateChange,\n reducerActionContext: React.useMemo(() => ({\n multiple\n }), [multiple]),\n items: optionValues,\n itemStringifier: stringifyOption,\n selectionMode: multiple ? 'multiple' : 'single',\n stateReducer: selectReducer\n };\n const {\n dispatch,\n getRootProps: getListboxRootProps,\n contextValue: listContextValue,\n state: {\n open,\n highlightedValue: highlightedOption,\n selectedValues: selectedOptions\n },\n rootRef: mergedListboxRef\n } = useList(useListParameters);\n React.useEffect(() => {\n focusListboxIfRequested();\n }, [focusListboxIfRequested]);\n React.useEffect(() => {\n requestListboxFocus(open);\n }, [open]);\n const createHandleMouseDown = otherHandlers => event => {\n otherHandlers?.onMouseDown?.(event);\n if (!event.defaultPrevented && open) {\n ignoreClick.current = true;\n }\n };\n const createHandleButtonClick = otherHandlers => event => {\n otherHandlers?.onClick?.(event);\n if (!event.defaultPrevented && !ignoreClick.current) {\n const action = {\n type: SelectActionTypes.buttonClick,\n event\n };\n dispatch(action);\n }\n ignoreClick.current = false;\n };\n const createHandleButtonKeyDown = otherHandlers => event => {\n otherHandlers?.onKeyDown?.(event);\n if (event.defaultPrevented) {\n return;\n }\n if (event.key === 'Enter') {\n ignoreEnterKeyUp.current = true;\n }\n if (event.key === 'ArrowDown' || event.key === 'ArrowUp') {\n event.preventDefault();\n dispatch({\n type: SelectActionTypes.buttonArrowKeyDown,\n key: event.key,\n event\n });\n }\n };\n const createHandleListboxKeyUp = otherHandlers => event => {\n otherHandlers?.onKeyUp?.(event);\n if (event.defaultPrevented) {\n return;\n }\n const closingKeys = multiple ? ['Escape'] : ['Escape', 'Enter', ' '];\n if (open && !ignoreEnterKeyUp.current && closingKeys.includes(event.key)) {\n buttonRef?.current?.focus();\n }\n ignoreEnterKeyUp.current = false;\n };\n useEnhancedEffect(() => {\n // Scroll to the currently highlighted option.\n if (highlightedOption != null) {\n const optionRef = options.get(highlightedOption)?.ref;\n if (!listboxRef.current || !optionRef?.current) {\n return;\n }\n const listboxClientRect = listboxRef.current.getBoundingClientRect();\n const optionClientRect = optionRef.current.getBoundingClientRect();\n if (optionClientRect.top < listboxClientRect.top) {\n listboxRef.current.scrollTop -= listboxClientRect.top - optionClientRect.top;\n } else if (optionClientRect.bottom > listboxClientRect.bottom) {\n listboxRef.current.scrollTop += optionClientRect.bottom - listboxClientRect.bottom;\n }\n }\n }, [highlightedOption, options]);\n const getButtonProps = (otherHandlers = {}) => {\n return _extends({}, getButtonRootProps(_extends({}, otherHandlers, {\n onClick: createHandleButtonClick(otherHandlers),\n onMouseDown: createHandleMouseDown(otherHandlers),\n onKeyDown: createHandleButtonKeyDown(otherHandlers)\n })), {\n role: 'combobox',\n 'aria-expanded': open,\n 'aria-haspopup': 'listbox',\n 'aria-controls': listboxId\n });\n };\n const getOptionMetadata = React.useCallback(optionValue => options.get(optionValue), [options]);\n const getListboxProps = (otherHandlers = {}) => {\n return _extends({}, getListboxRootProps(_extends({}, otherHandlers, {\n onKeyUp: createHandleListboxKeyUp(otherHandlers)\n })), {\n id: listboxId,\n role: 'listbox',\n 'aria-multiselectable': multiple ? 'true' : undefined\n });\n };\n React.useDebugValue({\n selectedOptions,\n highlightedOption,\n open\n });\n const contextValue = React.useMemo(() => _extends({}, listContextValue, compoundComponentContextValue), [listContextValue, compoundComponentContextValue]);\n let selectValue;\n if (props.multiple) {\n selectValue = selectedOptions;\n } else {\n selectValue = selectedOptions.length > 0 ? selectedOptions[0] : null;\n }\n return {\n buttonActive,\n buttonFocusVisible,\n buttonRef: mergedButtonRef,\n contextValue,\n disabled,\n dispatch,\n getButtonProps,\n getListboxProps,\n getOptionMetadata,\n listboxRef: mergedListboxRef,\n open,\n options: optionValues,\n value: selectValue,\n highlightedOption\n };\n}",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"writeValue(value) {\n this.value = value;\n let optionSelectedStateSetter;\n if (Array.isArray(value)) {\n // convert values to ids\n const ids = value.map((v) => this._getOptionId(v));\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(ids.indexOf(o.toString()) > -1);\n };\n }\n else {\n optionSelectedStateSetter = (opt, o) => {\n opt._setSelected(false);\n };\n }\n this._optionMap.forEach(optionSelectedStateSetter);\n }",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function selectValueType(props, propName, componentName) {\n if (props[propName] == null) {\n return null;\n }\n if (props.multiple) {\n if (!Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be an array if \") +\n (\"`multiple` is true.\")\n );\n }\n } else {\n if (Array.isArray(props[propName])) {\n return new Error(\n (\"The `\" + propName + \"` prop supplied to <select> must be a scalar \") +\n (\"value if `multiple` is false.\")\n );\n }\n }\n}",
"function checkSelectPropTypes(props){{ReactControlledValuePropTypes.checkPropTypes('select',props);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){error('The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){error('The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}}",
"function checkSelectPropTypes(props){{ReactControlledValuePropTypes.checkPropTypes('select',props);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){error('The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){error('The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}}",
"function checkSelectPropTypes(props){{ReactControlledValuePropTypes.checkPropTypes('select',props);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){error('The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){error('The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}}",
"function checkSelectPropTypes(props){ReactControlledValuePropTypes.checkPropTypes('select',props);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$1(false,'The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){warning$1(false,'The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}",
"function checkSelectPropTypes(props){ReactControlledValuePropTypes.checkPropTypes('select',props);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$1(false,'The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){warning$1(false,'The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}",
"constructor(value, selected) {\r\n this.value = value;\r\n this.selected = selected;\r\n }",
"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());}}}",
"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());}}}",
"function checkSelectPropTypes(props){ReactControlledValuePropTypes.checkPropTypes('select',props,getCurrentFiberStackAddendum$4);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());}}}",
"function checkSelectPropTypes(props){ReactControlledValuePropTypes.checkPropTypes('select',props,getCurrentFiberStackAddendum$4);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());}}}",
"function checkSelectPropTypes(props){ReactControlledValuePropTypes.checkPropTypes('select',props,getCurrentFiberStackAddendum$4);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());}}}",
"setOptions(prop, value) {\n\t\t\t\tset({ options: true, prop }, value);\n\t\t\t}",
"function checkSelectPropTypes(props){{checkControlledValueProps('select',props);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){error('The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){error('The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}}",
"function checkSelectPropTypes(props){{checkControlledValueProps('select',props);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){error('The `%s` prop supplied to <select> must be an array if '+'`multiple` is true.%s',propName,getDeclarationErrorAddendum());}else if(!props.multiple&&isArray){error('The `%s` prop supplied to <select> must be a scalar '+'value if `multiple` is false.%s',propName,getDeclarationErrorAddendum());}}}}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function checkSelectPropTypes(inst, props) {\n\t var owner = inst._currentElement._owner;\n\t LinkedValueUtils.checkPropTypes('select', props, owner);\n\t\n\t if (props.valueLink !== undefined && !didWarnValueLink) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n\t didWarnValueLink = true;\n\t }\n\t\n\t for (var i = 0; i < valuePropNames.length; i++) {\n\t var propName = valuePropNames[i];\n\t if (props[propName] == null) {\n\t continue;\n\t }\n\t var isArray = Array.isArray(props[propName]);\n\t if (props.multiple && !isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t } else if (!props.multiple && isArray) {\n\t process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n\t }\n\t }\n\t}",
"function valueProp() {\n for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n var props = args[0],\n propName = args[1],\n Component = args[2];\n\n\n if ((0, _util.isLabelInValue)(props)) {\n var _err = genArrProps(_propTypes2['default'].shape({\n label: _propTypes2['default'].node,\n value: _propTypes2['default'].string\n })).apply(undefined, args);\n if (_err) {\n return new Error('Invalid prop `' + propName + '` supplied to `' + Component + '`. ' + 'You should use { label: string, value: string } or [{ label: string, value: string }] instead.');\n }\n return null;\n }\n\n var err = genArrProps(_propTypes2['default'].string).apply(undefined, args);\n if (err) {\n return new Error('Invalid prop `' + propName + '` supplied to `' + Component + '`. ' + 'You should use string or [string] instead.');\n }\n return null;\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}",
"function checkSelectPropTypes(inst, props) {\n var owner = inst._currentElement._owner;\n LinkedValueUtils.checkPropTypes('select', props, owner);\n\n if (props.valueLink !== undefined && !didWarnValueLink) {\n process.env.NODE_ENV !== 'production' ? warning(false, '`valueLink` prop on `select` is deprecated; set `value` and `onChange` instead.') : void 0;\n didWarnValueLink = true;\n }\n\n for (var i = 0; i < valuePropNames.length; i++) {\n var propName = valuePropNames[i];\n if (props[propName] == null) {\n continue;\n }\n var isArray = Array.isArray(props[propName]);\n if (props.multiple && !isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n } else if (!props.multiple && isArray) {\n process.env.NODE_ENV !== 'production' ? warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum(owner)) : void 0;\n }\n }\n}"
] |
[
"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.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.55750763",
"0.5524348",
"0.5524348",
"0.5524348",
"0.5524348",
"0.5524348",
"0.5524348",
"0.5524348",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.55128974",
"0.544627",
"0.544627",
"0.544627",
"0.5440135",
"0.5440135",
"0.5436662",
"0.5433799",
"0.5433799",
"0.54301035",
"0.54301035",
"0.54301035",
"0.5423016",
"0.5415343",
"0.5415343",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5399629",
"0.5390848",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554",
"0.53871554"
] |
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 thisWidget.value = newValue;\n thisWidget.announce();\n }\n thisWidget.renderValue();\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"setValue(value) {\n ReactDOM.findDOMNode(this).value = value;\n }",
"setValue(value, {update=true} = {}) {\n let numpad = this.numpad.querySelector('.value')\n if (numpad) numpad.setAttribute('text', {value})\n this.el.setAttribute('text', {value})\n this.inputField.value = value\n if (update && this.data.target)\n {\n this.data.target.setAttribute(this.data.component, {[this.data.property]: value})\n }\n }",
"function setDefaultValue(node, type, value) {\n if (type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) node.defaultValue = toString(node._wrapperState.initialValue);\n else if (node.defaultValue !== toString(value)) node.defaultValue = toString(value);\n }\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\n }",
"constructor(value, parentNode = null){\n this.children = [];\n this.value = value;\n this.parent = parentNode;\n }",
"function patchDOMProp(el, key, value, // the following args are passed only due to potential innerHTML/textContent\n// overriding existing VNodes, in which case the old tree must be properly\n// unmounted.\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\n if (key === 'innerHTML' || key === 'textContent') {\n if (prevChildren) unmountChildren(prevChildren, parentComponent, parentSuspense);\n el[key] = value == null ? '' : value;\n return;\n }\n if (key === 'value' && el.tagName !== 'PROGRESS' && // custom elements may use _value internally\n !el.tagName.includes('-')) {\n // store value as _value as well since\n // non-string values will be stringified.\n el._value = value;\n const newValue = value == null ? '' : value;\n if (el.value !== newValue || // #4956: always set for OPTION elements because its value falls back to\n // textContent if no value attribute is present. And setting .value for\n // OPTION has no side effect\n el.tagName === 'OPTION') el.value = newValue;\n if (value == null) el.removeAttribute(key);\n return;\n }\n if (value === '' || value == null) {\n const type = typeof el[key];\n if (type === 'boolean') {\n // e.g. <select multiple> compiles to { multiple: '' }\n el[key] = _shared.includeBooleanAttr(value);\n return;\n } else if (value == null && type === 'string') {\n // e.g. <div :id=\"null\">\n el[key] = '';\n el.removeAttribute(key);\n return;\n } else if (type === 'number') {\n // e.g. <img :width=\"null\">\n // the value of some IDL attr must be greater than 0, e.g. input.size = 0 -> error\n try {\n el[key] = 0;\n } catch (_a) {\n }\n el.removeAttribute(key);\n return;\n }\n }\n // some properties perform value validation and throw\n try {\n el[key] = value;\n } catch (e) {\n _runtimeCore.warn(`Failed setting prop \"${key}\" on <${el.tagName.toLowerCase()}>: ` + `value ${value} is invalid.`, e);\n }\n}",
"function patchDOMProp(el, key, value, \n // the following args are passed only due to potential innerHTML/textContent\n // overriding existing VNodes, in which case the old tree must be properly\n // unmounted.\n prevChildren, parentComponent, parentSuspense, unmountChildren) {\n if (key === 'innerHTML' || key === 'textContent') {\n if (prevChildren) {\n unmountChildren(prevChildren, parentComponent, parentSuspense);\n }\n el[key] = value == null ? '' : value;\n return;\n }\n if (key === 'value' && el.tagName !== 'PROGRESS') {\n // store value as _value as well since\n // non-string values will be stringified.\n el._value = value;\n var newValue = value == null ? '' : value;\n if (el.value !== newValue) {\n el.value = newValue;\n }\n return;\n }\n if (value === '' && typeof el[key] === 'boolean') {\n // e.g. <select multiple> compiles to { multiple: '' }\n el[key] = true;\n }\n else if (value == null && typeof el[key] === 'string') {\n // e.g. <div :id=\"null\">\n el[key] = '';\n el.removeAttribute(key);\n }\n else {\n // some properties perform value validation and throw\n try {\n el[key] = value;\n }\n catch (e) {\n if ((true)) {\n warn(\"Failed setting prop \\\"\" + key + \"\\\" on <\" + (el.tagName.toLowerCase()) + \">: \" +\n \"value \" + value + \" is invalid.\", e);\n }\n }\n }\n }",
"function patchDOMProp(el, key, value, \n // the following args are passed only due to potential innerHTML/textContent\n // overriding existing VNodes, in which case the old tree must be properly\n // unmounted.\n prevChildren, parentComponent, parentSuspense, unmountChildren) {\n if (key === 'innerHTML' || key === 'textContent') {\n if (prevChildren) {\n unmountChildren(prevChildren, parentComponent, parentSuspense);\n }\n el[key] = value == null ? '' : value;\n return;\n }\n if (key === 'value' && el.tagName !== 'PROGRESS') {\n // store value as _value as well since\n // non-string values will be stringified.\n el._value = value;\n var newValue = value == null ? '' : value;\n if (el.value !== newValue) {\n el.value = newValue;\n }\n return;\n }\n if (value === '' && typeof el[key] === 'boolean') {\n // e.g. <select multiple> compiles to { multiple: '' }\n el[key] = true;\n }\n else if (value == null && typeof el[key] === 'string') {\n // e.g. <div :id=\"null\">\n el[key] = '';\n el.removeAttribute(key);\n }\n else {\n // some properties perform value validation and throw\n try {\n el[key] = value;\n }\n catch (e) {\n if ((true)) {\n warn(\"Failed setting prop \\\"\" + key + \"\\\" on <\" + (el.tagName.toLowerCase()) + \">: \" +\n \"value \" + value + \" is invalid.\", e);\n }\n }\n }\n }",
"setValue(value) {\n //this.findDOMNode(this).value = value;\n }",
"set value(value){\n const thisWidget = this;\n const newValue = thisWidget.parseValue(value);\n \n //add validation\n if (newValue != thisWidget.correctValue && thisWidget.isValid(newValue)) {\n thisWidget.correctValue = newValue;\n thisWidget.announce();\n } \n thisWidget.renderValue();\n }",
"writeValue(value) {\n // The value needs to be normalized for IE9, otherwise it is set to 'null' when null\n const normalizedValue = value == null ? '' : value;\n this.setProperty('value', normalizedValue);\n }",
"function patchDOMProp(el, key, value, \r\n// the following args are passed only due to potential innerHTML/textContent\r\n// overriding existing VNodes, in which case the old tree must be properly\r\n// unmounted.\r\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\r\n if (key === 'innerHTML' || key === 'textContent') {\r\n if (prevChildren) {\r\n unmountChildren(prevChildren, parentComponent, parentSuspense);\r\n }\r\n el[key] = value == null ? '' : value;\r\n return;\r\n }\r\n if (key === 'value' && el.tagName !== 'PROGRESS') {\r\n // store value as _value as well since\r\n // non-string values will be stringified.\r\n el._value = value;\r\n el.value = value == null ? '' : value;\r\n return;\r\n }\r\n if (value === '' && typeof el[key] === 'boolean') {\r\n // e.g. <select multiple> compiles to { multiple: '' }\r\n el[key] = true;\r\n }\r\n else if (value == null && typeof el[key] === 'string') {\r\n // e.g. <div :id=\"null\">\r\n el[key] = '';\r\n }\r\n else {\r\n // some properties perform value validation and throw\r\n try {\r\n el[key] = value;\r\n }\r\n catch (e) {\r\n {\r\n warn(`Failed setting prop \"${key}\" on <${el.tagName.toLowerCase()}>: ` +\r\n `value ${value} is invalid.`, e);\r\n }\r\n }\r\n }\r\n}",
"writeValue(value) {\n const normalizedValue = value == null ? '' : value;\n this.setProperty('value', normalizedValue);\n }",
"constructor(defaultValue) {\n\t\tsuper(); \n\t\tthis.defaultValue = defaultValue;\n\t}",
"function value(val) { return control_1.default(val); }",
"setValue(value) {\n this.value = value;\n }",
"setValue(value, options = {}) {\n return super.setValue(value, options);\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"initialValueChanged(previous, next) {\n // If the value is clean and the component is connected to the DOM\n // then set value equal to the attribute value.\n if (!this.dirtyValue) {\n this.value = this.initialValue;\n this.dirtyValue = false;\n }\n }",
"function setValue( value ) {\n\n\t\t\t_state = _stateEnum[ \"entry\" ];\n\t\t\t_widget[ \"content\" ][ \"impl\" ].className = \"entry\";\n\t\t\t_widget[ \"content\" ][ \"impl\" ].value = value;\n\n\t\t\tif ( ! isValid() ) {\n\n\t\t\t\t_widget[ \"content\" ][ \"impl\" ].className = \"invalid\";\n\t\t\t}\n\n\t\t\treturn _that;\t\n\t\t}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' ||\n node.ownerDocument.activeElement !== node\n ) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if (// Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"refreshValue() {\n if (this.isObject(this.markupElemIds) && this.isNumber(this.markupElemIds.value)) {\n const _value = this.isString(this.value) ?\n this.value : JSON.stringify(this.value);\n this.setMarkupOfPart('value', _value);\n }\n return this;\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"onInputValueChange() {\n assert && assert( this.node.inputValue !== undefined, 'use null to remove input value attribute' );\n\n if ( this.node.inputValue === null ) {\n this.removeAttributeFromElement( 'value' );\n }\n else {\n\n // type conversion for DOM spec\n const valueString = `${this.node.inputValue}`;\n this.setAttributeToElement( 'value', valueString, { asProperty: true } );\n }\n }",
"set value(_value) {\n this.setValue(_value);\n }",
"set value(value) {}",
"function patchDOMProp(el, key, value, \r\n// the following args are passed only due to potential innerHTML/textContent\r\n// overriding existing VNodes, in which case the old tree must be properly\r\n// unmounted.\r\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\r\n if (key === 'innerHTML' || key === 'textContent') {\r\n if (prevChildren) {\r\n unmountChildren(prevChildren, parentComponent, parentSuspense);\r\n }\r\n el[key] = value == null ? '' : value;\r\n return;\r\n }\r\n if (key === 'value' && el.tagName !== 'PROGRESS') {\r\n // store value as _value as well since\r\n // non-string values will be stringified.\r\n el._value = value;\r\n const newValue = value == null ? '' : value;\r\n if (el.value !== newValue) {\r\n el.value = newValue;\r\n }\r\n return;\r\n }\r\n if (value === '' || value == null) {\r\n const type = typeof el[key];\r\n if (value === '' && type === 'boolean') {\r\n // e.g. <select multiple> compiles to { multiple: '' }\r\n el[key] = true;\r\n return;\r\n }\r\n else if (value == null && type === 'string') {\r\n // e.g. <div :id=\"null\">\r\n el[key] = '';\r\n el.removeAttribute(key);\r\n return;\r\n }\r\n else if (type === 'number') {\r\n // e.g. <img :width=\"null\">\r\n el[key] = 0;\r\n el.removeAttribute(key);\r\n return;\r\n }\r\n }\r\n // some properties perform value validation and throw\r\n try {\r\n el[key] = value;\r\n }\r\n catch (e) {\r\n if ((true)) {\r\n (0,_vue_runtime_core__WEBPACK_IMPORTED_MODULE_0__.warn)(`Failed setting prop \"${key}\" on <${el.tagName.toLowerCase()}>: ` +\r\n `value ${value} is invalid.`, e);\r\n }\r\n }\r\n}",
"function patchDOMProp(el, key, value, \n// the following args are passed only due to potential innerHTML/textContent\n// overriding existing VNodes, in which case the old tree must be properly\n// unmounted.\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\n if (key === 'innerHTML' || key === 'textContent') {\n if (prevChildren) {\n unmountChildren(prevChildren, parentComponent, parentSuspense);\n }\n el[key] = value == null ? '' : value;\n return;\n }\n if (key === 'value' && el.tagName !== 'PROGRESS') {\n // store value as _value as well since\n // non-string values will be stringified.\n el._value = value;\n const newValue = value == null ? '' : value;\n if (el.value !== newValue) {\n el.value = newValue;\n }\n return;\n }\n if (value === '' || value == null) {\n const type = typeof el[key];\n if (value === '' && type === 'boolean') {\n // e.g. <select multiple> compiles to { multiple: '' }\n el[key] = true;\n return;\n }\n else if (value == null && type === 'string') {\n // e.g. <div :id=\"null\">\n el[key] = '';\n el.removeAttribute(key);\n return;\n }\n else if (type === 'number') {\n // e.g. <img :width=\"null\">\n el[key] = 0;\n el.removeAttribute(key);\n return;\n }\n }\n // some properties perform value validation and throw\n try {\n el[key] = value;\n }\n catch (e) {\n if ((true)) {\n (0,_vue_runtime_core__WEBPACK_IMPORTED_MODULE_0__.warn)(`Failed setting prop \"${key}\" on <${el.tagName.toLowerCase()}>: ` +\n `value ${value} is invalid.`, e);\n }\n }\n}",
"function updateElementValue(element,attr,value){// Support: IE9 only\n// In IE9 values are converted to string (e.g. `input.value = null` results in `input.value === 'null'`).\nvar propValue=isDefined(value)?value:msie===9?'':null;element.prop('value',propValue);attr.$set('value',value);}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n }",
"set _textWhenEmpty(aValue) {\n if (this._emptyTextNode) {\n this._emptyTextNode.setAttribute(\"value\", aValue);\n }\n this._emptyTextValue = aValue;\n this._showEmptyText();\n }",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n }\n else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n }",
"set value(val) {\n const input = this.refs.myInput\n input.value = val\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n }",
"renderValue(){\n const thisWidget = this;\n \n thisWidget.dom.wrapper.innerHTML = thisWidget.correctvalue;\n }",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if (\n // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = '' + node._wrapperState.initialValue;\n } else if (node.defaultValue !== '' + value) {\n node.defaultValue = '' + value;\n }\n }\n}",
"function patchDOMProp(el, key, value, \n// the following args are passed only due to potential innerHTML/textContent\n// overriding existing VNodes, in which case the old tree must be properly\n// unmounted.\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\n if (key === 'innerHTML' || key === 'textContent') {\n if (prevChildren) {\n unmountChildren(prevChildren, parentComponent, parentSuspense);\n }\n el[key] = value == null ? '' : value;\n return;\n }\n if (key === 'value' && el.tagName !== 'PROGRESS') {\n // store value as _value as well since\n // non-string values will be stringified.\n el._value = value;\n const newValue = value == null ? '' : value;\n if (el.value !== newValue) {\n el.value = newValue;\n }\n if (value == null) {\n el.removeAttribute(key);\n }\n return;\n }\n if (value === '' || value == null) {\n const type = typeof el[key];\n if (value === '' && type === 'boolean') {\n // e.g. <select multiple> compiles to { multiple: '' }\n el[key] = true;\n return;\n }\n else if (value == null && type === 'string') {\n // e.g. <div :id=\"null\">\n el[key] = '';\n el.removeAttribute(key);\n return;\n }\n else if (type === 'number') {\n // e.g. <img :width=\"null\">\n // the value of some IDL attr must be greater than 0, e.g. input.size = 0 -> error\n try {\n el[key] = 0;\n }\n catch (_a) { }\n el.removeAttribute(key);\n return;\n }\n }\n // some properties perform value validation and throw\n try {\n el[key] = value;\n }\n catch (e) {\n if ((true)) {\n (0,_vue_runtime_core__WEBPACK_IMPORTED_MODULE_0__.warn)(`Failed setting prop \"${key}\" on <${el.tagName.toLowerCase()}>: ` +\n `value ${value} is invalid.`, e);\n }\n }\n}",
"function ConstantInputWidget(value) {\n\tWidget.apply(this);\n\tthis.behaviors.value = constant_b(value);\n\tthis.behaviors.inputElems = [];\n\tthis.dom = SPAN();\n}",
"function patchDOMProp(el, key, value, \n// the following args are passed only due to potential innerHTML/textContent\n// overriding existing VNodes, in which case the old tree must be properly\n// unmounted.\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\n if (key === 'innerHTML' || key === 'textContent') {\n if (prevChildren) {\n unmountChildren(prevChildren, parentComponent, parentSuspense);\n }\n el[key] = value == null ? '' : value;\n return;\n }\n if (key === 'value' &&\n el.tagName !== 'PROGRESS' &&\n // custom elements may use _value internally\n !el.tagName.includes('-')) {\n // store value as _value as well since\n // non-string values will be stringified.\n el._value = value;\n const newValue = value == null ? '' : value;\n if (el.value !== newValue ||\n // #4956: always set for OPTION elements because its value falls back to\n // textContent if no value attribute is present. And setting .value for\n // OPTION has no side effect\n el.tagName === 'OPTION') {\n el.value = newValue;\n }\n if (value == null) {\n el.removeAttribute(key);\n }\n return;\n }\n let needRemove = false;\n if (value === '' || value == null) {\n const type = typeof el[key];\n if (type === 'boolean') {\n // e.g. <select multiple> compiles to { multiple: '' }\n value = includeBooleanAttr(value);\n }\n else if (value == null && type === 'string') {\n // e.g. <div :id=\"null\">\n value = '';\n needRemove = true;\n }\n else if (type === 'number') {\n // e.g. <img :width=\"null\">\n value = 0;\n needRemove = true;\n }\n }\n // some properties perform value validation and throw,\n // some properties has getter, no setter, will error in 'use strict'\n // eg. <select :type=\"null\"></select> <select :willValidate=\"null\"></select>\n try {\n el[key] = value;\n }\n catch (e) {\n }\n needRemove && el.removeAttribute(key);\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}",
"function setDefaultValue(node, type, value) {\n if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n type !== 'number' || node.ownerDocument.activeElement !== node) {\n if (value == null) {\n node.defaultValue = toString(node._wrapperState.initialValue);\n } else if (node.defaultValue !== toString(value)) {\n node.defaultValue = toString(value);\n }\n }\n}"
] |
[
"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.576619",
"0.56783444",
"0.56783444",
"0.5671826",
"0.56195354",
"0.5612154",
"0.5599186",
"0.5595747",
"0.55945355",
"0.55930185",
"0.55805725",
"0.5578439",
"0.5562626",
"0.5562626",
"0.5562626",
"0.5562626",
"0.554878",
"0.55413485",
"0.55410635",
"0.5536473",
"0.552818",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5521221",
"0.5519545",
"0.5508883",
"0.5505783",
"0.5503687",
"0.5472595",
"0.545998",
"0.5452829",
"0.5446492",
"0.54374784",
"0.5432161",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5431716",
"0.5420029",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54184544",
"0.54168975",
"0.5413748",
"0.5411093",
"0.54061145",
"0.54061145"
] |
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.lFrame.currentNamespace = null;\n}",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n}",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n}",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n}",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n}",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n}",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n}",
"function getParentObject(){\n var obj = parent;\n if (namespace !== \"\") {\n for (var i = 0, ii = namespace.split(\".\"); i < ii.length; i++) {\n obj = obj[ii[i]];\n }\n }\n return obj.easyXDM;\n }",
"function NamespaceContext(){\n this.ns = null; //full namespace string e.g. www.bond.co.uk/jsocs/something\n this.type_ = {}; //e.g. type_[mytype] types referenceable by rulesets in this or parent context\n //this.rootRuleSet = null; //tree of RuleSets NOT USED?\n this.ns_ = {}; //e.g. ns_[prefix] = {other ns context} other namespace rules this context references\n}",
"function SVGParent() {}",
"function exitNamespace() {\n namespaceStack.shift();\n return fw.utils.currentNamespace();\n}",
"function ParentWithStatic() { }",
"static isNamespace(structure) {\r\n return structure.kind === StructureKind_1.StructureKind.Namespace;\r\n }",
"get namespace() {\r var def = Utils.calculateHash(this.file).slice(0, 10);\r return this.meta.getOrSet('namespace', def);\r }",
"function namespaceHTMLInternal() {\n instructionState.lFrame.currentNamespace = null;\n }",
"function ensureNamespace(namespace){\n var current = exports;\n namespace.split('.').forEach(function(name){\n if(typeof current[name] === 'undefined'){\n current[name] = {};\n }\n current = current[name];\n });\n }",
"isAtRootLevel() {\n return this.namespaceAndFunctionDepth === 0;\n }",
"function namespace(ns) {\n 'use strict';\n \n if (namespaces.indexOf(ns) === -1) {\n var segments = ns.split(\".\").reverse(),\n /*\n Inner recursive function to add a new object if not defined\n */\n createSegment = function (segments, currentSegment) {\n if (segments.length === 0) {\n return;\n }\n var segment = segments.pop();\n // prevent overwriting of existing segment\n if(currentSegment[segment] === undefined) {\n currentSegment[segment] = {};\n }\n createSegment(segments, currentSegment[segment]);\n };\n namespaces.push(ns);\n createSegment(segments, window);\n }\n}",
"function isNamespace(thing) {\n return isObject(thing) && !!thing.__isNamespace;\n}",
"parentFunction(){\n return \"This is coming from the parent!\";\n }",
"function Namespace(inheritedNamespace) { \n function Namespace() {}; \n Namespace.prototype = inheritedNamespace; \n return new Namespace(); \n}",
"function Namespaces() {\n this.nsByPfx = new Object();\n this.pfxByNs = new Object();\n this.index = 0;\n}",
"static GetParentBone() {}",
"function enterNamespaceName(namespaceName) {\n namespaceStack.unshift( namespaceName );\n return fw.namespace( fw.utils.currentNamespaceName() );\n}",
"GetComponentsInParent() {}",
"GetComponentsInParent() {}",
"GetComponentsInParent() {}",
"GetComponentsInParent() {}",
"constructor() {\n super(NameSpace);\n }",
"function TestRoot() {}",
"namespace(source, importAs, importFrom) {\n return ensureNamespaceImportPresent(source.getSourceFile(), importAs, importFrom, statementToAdd => source.addStatement(statementToAdd, true));\n }",
"getParent(){return this.__parent}",
"isRoot () {\r\n return this.parent === null\r\n }",
"function hasNamespace(node) {\n const specifiers = node.specifiers.\n filter(specifier => specifier.type === 'ImportNamespaceSpecifier');\n return specifiers.length > 0;\n}",
"getBaseNamespace(text) {\n const parts = text.split('.');\n if (parts.length > 1) {\n return parts[0];\n }\n }",
"function getNamespace(subtree, path) {\n if (path.length === 1) return subtree\n\n const namespace = path.shift()\n subtree.modules[namespace] = {\n modules: {},\n namespaced: true,\n ...subtree.modules[namespace],\n }\n return getNamespace(subtree.modules[namespace], path)\n}",
"function getNamespace(subtree, path) {\n if (path.length === 1) return subtree\n\n const namespace = path.shift()\n subtree.modules[namespace] = {\n modules: {},\n namespaced: true,\n ...subtree.modules[namespace],\n }\n return getNamespace(subtree.modules[namespace], path)\n}",
"isRoot() {\nreturn this.parent === null;\n}",
"requireParent() {\n return \"SCServer\";\n }",
"function namespaceExists(nameSpace, libNodes)\n{\n var ret = false;\n \n for(var i=0; i<libNodes.length; i++)\n {\n if (libNodes[i].name == nameSpace) {\n ret = true;\n }\n }\n return ret;\n}",
"function enterNamespace(namespace) {\n namespaceStack.unshift( namespace.getName() );\n return namespace;\n}",
"function getNamespace(subtree, path) {\n if (path.length === 1) return subtree\n\n const namespace = path.shift()\n subtree[namespace] = {\n ...subtree[namespace],\n }\n return getNamespace(subtree[namespace], path)\n}",
"static get localizeNamespaces() {}",
"function interiorNamespace(element) {\n if (element && element.namespaceURI === _domHelperBuildHtmlDom.svgNamespace && !_domHelperBuildHtmlDom.svgHTMLIntegrationPoints[element.tagName]) {\n return _domHelperBuildHtmlDom.svgNamespace;\n } else {\n return null;\n }\n}",
"addParent(node, parent) {\n // implement by subclass\n }",
"function interiorNamespace(element) {\n if (element && element.namespaceURI === _domHelperBuildHtmlDom.svgNamespace && !_domHelperBuildHtmlDom.svgHTMLIntegrationPoints[element.tagName]) {\n return _domHelperBuildHtmlDom.svgNamespace;\n } else {\n return null;\n }\n }",
"function interiorNamespace(element) {\n if (element && element.namespaceURI === _domHelperBuildHtmlDom.svgNamespace && !_domHelperBuildHtmlDom.svgHTMLIntegrationPoints[element.tagName]) {\n return _domHelperBuildHtmlDom.svgNamespace;\n } else {\n return null;\n }\n }",
"function Xml_GetNamedAncestor(objNode,strAncestorName,blnEexcludSelf)\r\n{\r\n // Validate recieved arguments.\r\n if(objNode && !Aux_IsNullOrEmpty(strAncestorName))\r\n {\r\n return Xml_SelectSingleNode(\"ancestor\"+(blnEexcludSelf?\"\":\"-or-self\")+\"::\"+strAncestorName+\"[1]\",objNode);\r\n }\r\n \r\n return null;\r\n}",
"create_namespace(dotted_name, value) {\n let parent = this;\n let parts = dotted_name.split('.');\n parts.forEach((part, i) => {\n if (parent[part] === undefined) {\n if (i === parts.length - 1 && value !== undefined) {\n parent[part] = value;\n } else {\n parent[part] = {};\n }\n }\n parent = parent[part];\n });\n return parent;\n }",
"function getNamespace (namespace) {\n let namespaces = namespace.split(\".\");\n let parent = chrome;\n for (let name of namespaces) {\n parent[name] = parent[name] || createObjectIn(unsafeWindow);\n parent = parent[name];\n }\n return parent;\n}",
"function _resyncParent() {\n if (this.parentPath) {\n this.parent = this.parentPath.node;\n }\n}",
"function n(t){if(!t)throw new TypeError(\"argument namespace is required\");function e(t){}return e._file=void 0,e._ignored=!0,e._namespace=t,e._traced=!1,e._warned=Object.create(null),e.function=i,e.property=o,e}",
"function extend( ns, ns_string ) { \n var parts = ns_string.split('.'), \n parent = ns, \n pl, i; \n if (parts[0] == \"CALC\") { \n parts = parts.slice(1); \n } \n pl = parts.length; \n for (i = 0; i < pl; i++) { \n //create a property if it doesnt exist \n if (typeof parent[parts[i]] == 'undefined') { \n parent[parts[i]] = {}; \n } \n parent = parent[parts[i]]; \n } \n return parent; \n }",
"function _getOuterContainerOrSelf(node) {\n\t var view = node.view;\n\t while (_isNgContainer(node.parent, view)) {\n\t node = node.parent;\n\t }\n\t return node;\n\t}",
"function initNameSpace() {\r\n getTopStories();\r\n }",
"getFirstChild() {}",
"get parent () { return this._parent; }",
"function hc_nodeparentnode() {\n var success;\n var doc;\n var elementList;\n var employeeNode;\n var parentNode;\n var parentName;\n doc = load(\"hc_staff\");\n elementList = doc.getElementsByTagName(\"p\");\n employeeNode = elementList.item(1);\n parentNode = employeeNode.parentNode;\n\n parentName = parentNode.nodeName;\n\n assertEqualsAutoCase(\"element\", \"parentNodeName\",\"body\",parentName);\n \n}",
"setParent(prnt) {\nreturn this.parent = prnt;\n}",
"function r(e){if(!e)throw new TypeError(\"argument namespace is required\");function t(e){}return t._file=void 0,t._ignored=!0,t._namespace=e,t._traced=!1,t._warned=Object.create(null),t.function=i,t.property=o,t}",
"function r(e){if(!e)throw new TypeError(\"argument namespace is required\");function t(e){}return t._file=void 0,t._ignored=!0,t._namespace=e,t._traced=!1,t._warned=Object.create(null),t.function=i,t.property=o,t}",
"get ns() {\n return this._ns;\n }",
"function SmalltalkRoot () {\n }",
"function getNSLayer(inNode, inName) {\n\n\tvar node, i;\n\n\tnode = inNode[inName];\n\tfor (i = 0; !node && inNode.layers && i < inNode.layers.length; i++) {\n\t\tnode = getNSLayer(inNode.layers[i].document,inName);\n\t}\n\treturn node;\n}",
"function namespace__(){this.namespace_=( joo.MemberDeclaration.NAMESPACE_INTERNAL);}",
"get parentName () {\n\t\treturn Object.getPrototypeOf(this.constructor).name\n\t}",
"function testGetNamespace() {\r\n\tvar testStencilSet = new ORYX.Core.StencilSet.StencilSet(\"TestStencilSet\")\r\n\tvar namespace = testStencilSet.namespace()\r\n\r\n\tassertEquals(\"Check namespace of testStencilSet\", namespace, \"http://b3mn.org/stencilset/testB#\")\r\n}",
"function namespaceStart(base, test) {\n if (test.namespace === undefined) {\n return namespace_1.isNamespaceDefault(base) && base.path.startsWith(test.path) || !!base.namespace && base.namespace.startsWith(test.path);\n } else {\n return namespace_1.namesEqual(base, test) && base.path.startsWith(test.path);\n }\n}",
"get namespace() {\n return this._namespace\n }",
"function _resyncParent() {\n\t if (this.parentPath) {\n\t this.parent = this.parentPath.node;\n\t }\n\t}",
"function _resyncParent() {\n\t if (this.parentPath) {\n\t this.parent = this.parentPath.node;\n\t }\n\t}",
"getParent() {\nreturn this.parent;\n}",
"function checkSubtree() {\n \n}",
"GetComponentInParent() {}",
"GetComponentInParent() {}",
"GetComponentInParent() {}",
"GetComponentInParent() {}",
"function getFirstParentNative(tNode){var parent=tNode.parent;while(parent&&parent.type===5/* IcuContainer */){parent=parent.parent;}return parent;}",
"function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}",
"function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"static _getSpaceRoot(){\n return process.cwd(); //path.dirname(module.parent.paths[0])\n }",
"constructor () {\n this._isRoot = true;\n }",
"function it(e){e.parent=null,ae(e)}",
"selectNamespace() {\n //alert(JSON.stringify(this.formData.namespaceParent, null, 4));\n var nameSpaceName = null;\n try {\n nameSpaceName = this.formData.namespaceParent['fqn'];\n this.getPointerAccount(nameSpaceName);\n } catch(err) {};\n \n if (nameSpaceName != null) {\n // clear json msg\n this.transMessage ='';\n // Get transactions\n this.getTransactions(false);\n\n } else { //clean if no namespace is selected\n this.formData.pointerAdd = '';\n this.formData.recipient = '';\n this.formData.recipientPublicKey = '';\n this.ip1 ='';\n this.organization = '';\n this.country = '';\n this.address = '';\n this.phone = '';\n this.email = '';\n this.other = '';\n this.charactersLeft = 1024;\n this.formData.message = '';\n this.transMessage ='';\n }\n }",
"initializing() {\n this.getParentProject();\n }",
"function parent() {\r\n // name is accessible here\r\n // likes is not accessible here\r\n function child() {\r\n // Innermost level of the scope chain\r\n // name is also accessible here\r\n var likes = 'Coding';\r\n }\r\n }",
"function isHtmlNamespace(node) {\r\n var ns;\r\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\r\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"function isHtmlNamespace(node) {\n var ns;\n return typeof node.namespaceURI == UNDEF || ((ns = node.namespaceURI) === null || ns == \"http://www.w3.org/1999/xhtml\");\n }",
"static getSymbolParent(symbol) {\n return symbol.parent;\n }"
] |
[
"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.53229856",
"0.53193605",
"0.5313098",
"0.5301471",
"0.5295859",
"0.5295859",
"0.5295859",
"0.5295859",
"0.52877384",
"0.52611893",
"0.5261078",
"0.52534926",
"0.5248971",
"0.52380115",
"0.5237931",
"0.52243704",
"0.52243704",
"0.52125657",
"0.52120775",
"0.5210552",
"0.520527",
"0.52020544",
"0.5198533",
"0.51924735",
"0.51919633",
"0.5177351",
"0.5177351",
"0.5165444",
"0.5161359",
"0.51606065",
"0.5149667",
"0.5135195",
"0.51351124",
"0.51234186",
"0.51139593",
"0.51106435",
"0.51094973",
"0.51002544",
"0.50913143",
"0.50814754",
"0.50814754",
"0.50765157",
"0.50761247",
"0.50760674",
"0.506947",
"0.5066843",
"0.50630665",
"0.5061734",
"0.506166",
"0.50544775",
"0.50544775",
"0.5048569",
"0.5023388",
"0.5022544",
"0.5022544",
"0.5022544",
"0.5022544",
"0.50127286",
"0.4995106",
"0.4995106",
"0.4991204",
"0.4991204",
"0.4991204",
"0.4991204",
"0.4991204",
"0.4991204",
"0.4990565",
"0.49904794",
"0.4982848",
"0.4979333",
"0.4978937",
"0.49788004",
"0.4974179",
"0.497409",
"0.497409",
"0.497409",
"0.497409",
"0.497409",
"0.497409",
"0.4973739"
] |
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 (priority) {\n priority = \" !\" + priority;\n }\n properties[i] = name + \": \" + value + priority + \";\";\n }\n return properties.join(\" \");\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 (priority) {\n priority = \" !\" + priority;\n }\n properties[i] = name + \": \" + value + priority + \";\";\n }\n return properties.join(\" \")\n }",
"get cssText(){\n\t\tvar properties = [];\n\t\tfor (var i=0, length=this.length; i < length; ++i) {\n\t\t\tvar name = this[i];\n\t\t\tvar value = this.getPropertyValue(name);\n\t\t\tvar priority = this.getPropertyPriority(name);\n\t\t\tif (priority) {\n\t\t\t\tpriority = \" !\" + priority;\n\t\t\t}\n\t\t\tproperties[i] = name + \": \" + value + priority + \";\";\n\t\t}\n\t\treturn properties.join(\" \");\n\t}",
"get cssText(){\n\t\tvar properties = [];\n\t\tfor (var i=0, length=this.length; i < length; ++i) {\n\t\t\tvar name = this[i];\n\t\t\tvar value = this.getPropertyValue(name);\n\t\t\tvar priority = this.getPropertyPriority(name);\n\t\t\tif (priority) {\n\t\t\t\tpriority = \" !\" + priority;\n\t\t\t}\n\t\t\tproperties[i] = name + \": \" + value + priority + \";\";\n\t\t}\n\t\treturn properties.join(\" \");\n\t}",
"function evaluateStyle(styleProperties_)\n{\n\tlet s = \"\";\n\tfor(let i = 0; i < styleProperties_.length; ++i)\n\t{\n\t\tif (i != 0)\n\t\t\ts += \";\";\n\t\ts += evaluateStyleRule(styleProperties_[i]);\n\t}\n\treturn s;\n}",
"function evaluateStyleRule(styleProperty_)\n{\n\treturn styleProperty_.name + \": \" + styleProperty_.value;\n}",
"function getCSSStyle(key, value) {\n if(value && value.value) {\n return key + \": \" + value.value +\";\";\n }\n else\n return \"\";\n }",
"function cssToStr(cssProps){var statements=[];$.each(cssProps,function(name,val){if(val!=null){statements.push(name+':'+val);}});return statements.join(';');}",
"getCSSVars(){\n var compStyle = getComputedStyle(this.DOM.scope, null)\n\n const getProp = name => compStyle.getPropertyValue('--'+name)\n\n function seprateUnitFromValue(a){\n if( !a ) return {}\n a = a.trim().split(' ')[0]\n var unit = a.split(/\\d+/g).filter(n=>n).pop().trim(),\n value = +a.split(unit).filter(n=>n)[0].trim()\n return {value, unit}\n }\n\n this.CSSVars = {\n tagHideTransition: (({value, unit}) => unit=='s' ? value * 1000 : value)(seprateUnitFromValue(getProp('tag-hide-transition')))\n }\n }",
"function get_rendered_style(elm, css_rule_str){\n\tvar str_val = \"\";\n\tif(document.defaultView && document.defaultView.getComputedStyle){\n\t\tstr_val = document.defaultView.getComputedStyle(elm, \"\").getPropertyValue(css_rule_str);\n\t}\n\telse if(elm.currentStyle){\n // Catch errors for unsupported browsers (IE <= 5.0)\n try {\n css_rule_str = css_rule_str.replace(/\\-(\\w)/g,\n function (strMatch, p1) {\n return p1.toUpperCase();\n });\n str_val = elm.currentStyle[css_rule_str];\n }\n catch(e) { /* In this case, return \"\" */ }\n\t}\n\treturn str_val;\n}",
"function styleToString(key, value) {\n if (typeof value === 'number' && value !== 0 && !CSS_NUMBER[key]) {\n return key + \":\" + value + \"px\";\n }\n return key + \":\" + value;\n}",
"function styleToString(key, value) {\n if (typeof value === 'number' && value !== 0 && !CSS_NUMBER[key]) {\n return key + \":\" + value + \"px\";\n }\n return key + \":\" + value;\n}",
"function createStyleProperty(el) {\n\tvar style = el.style;\n\tvar output = {};\n\tfor (var i = 0; i < style.length; ++i) {\n\t\tvar item = style.item(i);\n\t\toutput[item] = String(style[item]);\n\t\t// hack to workaround browser inconsistency with url()\n\t\tif (output[item].indexOf('url') > -1) {\n\t\t\toutput[item] = output[item].replace(/\\\"/g, '')\n\t\t}\n\t}\n\treturn { name: 'style', value: output };\n}",
"function sanitizeStyle(value) {\n value = String(value).trim(); // Make sure it's actually a string.\n if (!value)\n return '';\n // Single url(...) values are supported, but only for URLs that sanitize cleanly. See above for\n // reasoning behind this.\n var urlMatch = value.match(URL_RE);\n if ((urlMatch && __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2__url_sanitizer__[\"a\" /* sanitizeUrl */])(urlMatch[1]) === urlMatch[1]) ||\n value.match(SAFE_STYLE_VALUE) && hasBalancedQuotes(value)) {\n return value; // Safe style values.\n }\n if (__webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__angular_core__[\"isDevMode\"])()) {\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1__dom_dom_adapter__[\"a\" /* getDOM */])().log(\"WARNING: sanitizing unsafe style value \" + value + \" (see http://g.co/ng/security#xss).\");\n }\n return 'unsafe';\n}",
"function styleStringToString(name, value) {\n\t if (value == null) {\n\t return '';\n\t }\n\t if (typeof value === 'number' && value !== 0 && !CSS_NUMBER[name]) {\n\t value += 'px';\n\t }\n\t return name + \":\" + String(value).replace(/([\\{\\}\\[\\]])/g, '\\\\$1');\n\t}",
"function styleToString(key, value) {\n if (value && typeof value === \"number\" && !CSS_NUMBER[key]) {\n return `${key}:${value}px`;\n }\n return `${key}:${value}`;\n}",
"function styleToString(key, value) {\n if (value && typeof value === \"number\" && !CSS_NUMBER[key]) {\n return `${key}:${value}px`;\n }\n return `${key}:${value}`;\n}",
"function cssToStr(cssProps) {\n var statements = [];\n $.each(cssProps, function (name, val) {\n if (val != null) {\n statements.push(name + ':' + val);\n }\n });\n return statements.join(';');\n}",
"function cssToStr(cssProps) {\n var statements = [];\n $.each(cssProps, function (name, val) {\n if (val != null) {\n statements.push(name + ':' + val);\n }\n });\n return statements.join(';');\n}",
"function cssToStr(cssProps) {\n var statements = [];\n $.each(cssProps, function (name, val) {\n if (val != null) {\n statements.push(name + ':' + val);\n }\n });\n return statements.join(';');\n}",
"function cssToStr(cssProps) {\n var statements = [];\n $.each(cssProps, function (name, val) {\n if (val != null) {\n statements.push(name + ':' + val);\n }\n });\n return statements.join(';');\n}",
"function GetStyleProperty(oElm, strCssProperty)\n{\n var strValue = \"\";\n if(document.defaultView && document.defaultView.getComputedStyle)\n {\n strValue = document.defaultView.getComputedStyle(oElm, \"\").getPropertyValue(strCssProperty);\n }\n else if(oElm.currentStyle)\n {\n strCssProperty = strCssProperty.replace(/\\-(\\w)/g, function (strMatch, p1){\n return p1.toUpperCase();\n });\n strValue = oElm.currentStyle[strCssProperty];\n }\n return strValue;\n}",
"function getStyleProps(injector) {\n return {\n id: STYLE_ELEMENT_ID,\n nonce: injector.nonce,\n textContent: injector.ruleTexts.join(\"\")\n };\n}",
"function get_computed_value(cs, property)\n{\n var info = gCSSProperties[property];\n if (info.type == CSS_TYPE_TRUE_SHORTHAND ||\n (info.type == CSS_TYPE_SHORTHAND_AND_LONGHAND &&\n (property == \"text-decoration\" || property == \"mask\"))) {\n var results = [];\n for (var idx in info.subproperties) {\n var subprop = info.subproperties[idx];\n results.push(get_computed_value(cs, subprop));\n }\n return results.join(\" ; \");\n }\n if (info.get_computed)\n return info.get_computed(cs, property);\n return cs.getPropertyValue(property);\n}",
"function _sanitizeStyle(value) {\n value = String(value).trim(); // Make sure it's actually a string.\n if (!value)\n return '';\n // Single url(...) values are supported, but only for URLs that sanitize cleanly. See above for\n // reasoning behind this.\n var urlMatch = value.match(URL_RE);\n if ((urlMatch && _sanitizeUrl(urlMatch[1]) === urlMatch[1]) ||\n value.match(SAFE_STYLE_VALUE) && hasBalancedQuotes(value)) {\n return value; // Safe style values.\n }\n if (isDevMode()) {\n console.warn(\"WARNING: sanitizing unsafe style value \" + value + \" (see http://g.co/ng/security#xss).\");\n }\n return 'unsafe';\n}",
"function _sanitizeStyle(value) {\n value = String(value).trim(); // Make sure it's actually a string.\n if (!value)\n return '';\n // Single url(...) values are supported, but only for URLs that sanitize cleanly. See above for\n // reasoning behind this.\n var urlMatch = value.match(URL_RE);\n if ((urlMatch && _sanitizeUrl(urlMatch[1]) === urlMatch[1]) ||\n value.match(SAFE_STYLE_VALUE) && hasBalancedQuotes(value)) {\n return value; // Safe style values.\n }\n if (isDevMode()) {\n console.warn(\"WARNING: sanitizing unsafe style value \" + value + \" (see http://g.co/ng/security#xss).\");\n }\n return 'unsafe';\n}",
"function _sanitizeStyle(value) {\n value = String(value).trim(); // Make sure it's actually a string.\n if (!value)\n return '';\n // Single url(...) values are supported, but only for URLs that sanitize cleanly. See above for\n // reasoning behind this.\n var urlMatch = value.match(URL_RE);\n if ((urlMatch && _sanitizeUrl(urlMatch[1]) === urlMatch[1]) ||\n value.match(SAFE_STYLE_VALUE) && hasBalancedQuotes(value)) {\n return value; // Safe style values.\n }\n if (isDevMode()) {\n console.warn(\"WARNING: sanitizing unsafe style value \" + value + \" (see http://g.co/ng/security#xss).\");\n }\n return 'unsafe';\n}",
"function _sanitizeStyle(value) {\n value = String(value).trim(); // Make sure it's actually a string.\n if (!value)\n return '';\n // Single url(...) values are supported, but only for URLs that sanitize cleanly. See above for\n // reasoning behind this.\n var urlMatch = value.match(URL_RE);\n if ((urlMatch && _sanitizeUrl(urlMatch[1]) === urlMatch[1]) ||\n value.match(SAFE_STYLE_VALUE) && hasBalancedQuotes(value)) {\n return value; // Safe style values.\n }\n if (isDevMode()) {\n console.warn(\"WARNING: sanitizing unsafe style value \" + value + \" (see http://g.co/ng/security#xss).\");\n }\n return 'unsafe';\n}",
"function toStyleProp(prop) {\r\n\t\tif (prop == 'float') {\r\n\t\t\treturn glow.env.ie ? 'styleFloat' : 'cssFloat';\r\n\t\t}\r\n\t\treturn prop.replace(/-(\\w)/g, function(match, p1) {\r\n\t\t\treturn p1.toUpperCase();\r\n\t\t});\r\n\t}",
"function getCss(propertyInfo, value) {\n var rules = void 0;\n\n // Protect against unexpected values\n var valueType = typeof value === 'undefined' ? 'undefined' : _typeof(value);\n if (valueType !== 'string' && valueType !== 'number') {\n if (true) {\n var name = propertyInfo.jsName;\n var encodedValue = JSON.stringify(value);\n console.error('\\uD83D\\uDCE6 ui-box: property \\u201C' + name + '\\u201D was passed invalid value \\u201C' + encodedValue + '\\u201D. Only numbers and strings are supported.');\n }\n return null;\n }\n\n var valueString = (0, _valueToString2.default)(value, propertyInfo.defaultUnit);\n\n var className = (0, _getClassName2.default)(propertyInfo, valueString);\n\n // Avoid running the prefixer when possible because it's slow\n if (propertyInfo.isPrefixed) {\n rules = (0, _prefixer2.default)(propertyInfo.jsName, valueString);\n } else {\n rules = [{ property: propertyInfo.cssName, value: valueString }];\n }\n\n var styles = void 0;\n if (false) { var rulesString; } else {\n var _rulesString = rules.map(function (rule) {\n return ' ' + rule.property + ': ' + rule.value + ';';\n }).join('\\n');\n styles = '\\n.' + className + ' {\\n' + _rulesString + '\\n}';\n }\n\n return { className: className, styles: styles };\n}",
"function getCss(propertyInfo, value) {\n var rules = void 0;\n\n // Protect against unexpected values\n var valueType = typeof value === 'undefined' ? 'undefined' : _typeof(value);\n if (valueType !== 'string' && valueType !== 'number') {\n if (true) {\n var name = propertyInfo.jsName;\n var encodedValue = JSON.stringify(value);\n console.error('\\uD83D\\uDCE6 ui-box: property \\u201C' + name + '\\u201D was passed invalid value \\u201C' + encodedValue + '\\u201D. Only numbers and strings are supported.');\n }\n return null;\n }\n\n var valueString = (0, _valueToString2.default)(value, propertyInfo.defaultUnit);\n\n var className = (0, _getClassName2.default)(propertyInfo, valueString);\n\n // Avoid running the prefixer when possible because it's slow\n if (propertyInfo.isPrefixed) {\n rules = (0, _prefixer2.default)(propertyInfo.jsName, valueString);\n } else {\n rules = [{ property: propertyInfo.cssName, value: valueString }];\n }\n\n var styles = void 0;\n if (false) { var rulesString; } else {\n var _rulesString = rules.map(function (rule) {\n return ' ' + rule.property + ': ' + rule.value + ';';\n }).join('\\n');\n styles = '\\n.' + className + ' {\\n' + _rulesString + '\\n}';\n }\n\n return { className: className, styles: styles };\n}",
"renderCssStyle() {\n this.cssStyle = [\n // `width: ${parseFloat(this.width) != this.width ? this.width : this.width + 'px'};`\n ].join(' ');\n }",
"function css$get$0() {\n if ( !this.cssCached ) this.stringify();\n return this.cssCached;\n }",
"get _style() {\n\n let direction = FlexBox._directions[this.state.direction];\n let justify = FlexBox._justifys[this.state.justify];\n let alignment = FlexBox._alignments[this.state.alignment];\n\n return `flex ${alignment} ${justify} ${direction}`.trim();\n }",
"function stringifyProperties(properties) {\n\t return properties.map(function (p) { return styleToString(p[0], p[1]); }).join(';');\n\t}",
"toString(): string {\n if (Array.isArray(this.style)) {\n let str = ''\n for (let index = 0; index < this.style.length; index++) {\n str += toCss(this.selector, this.style[index])\n if (this.style[index + 1]) str += '\\n'\n }\n return str\n }\n\n return toCss(this.selector, this.style)\n }",
"get hostStyle() {\n const styles = `\n\t\t\tdisplay: flex;\n\t\t\theight: 140px;\n\t\t\tmin-height: 140px;\n\t\t\tmin-width: 180px;\n\t\t\tmax-width: 180px;\n\t\t\tjustify-content: center;\n\t\t\talign-items: center;\n\t\t\tpadding: 0 20px;\n\t\t\tmargin: 10px;\n\t\t\tborder-radius: 5px;\n\t\t\tposition: relative;\n\t\t`;\n return this.sanitizer.bypassSecurityTrustStyle(styles);\n }",
"function getStyle(target, prop) {\n\t try {\n\t if (window.getComputedStyle) {\n\t // gecko and webkit\n\t prop = prop.replace(/([a-z])([A-Z])/, hyphenate); // requires hyphenated, not camel\n\t return window.getComputedStyle(target, null).getPropertyValue(prop);\n\t }\n\t if (target.currentStyle) {\n\t // ie\n\t return target.currentStyle[prop];\n\t }\n\t return target.style[prop];\n\t } catch (e) {}\n\t return \"\";\n\t }",
"getStyle() {\n\t\tvar style = {\n\t\t\t\"color\": this.color || this.default_color,\n\t\t\t\"font-weight\": \"bold\",\n\t\t\t\"cursor\": \"pointer\",\n \"-webkit-text-stroke\": \"0.45px grey\"\n\t\t};\n\n\n\t\treturn _.map(style, (value, key) => `${key}:${value}`).join(';');\n\t}",
"function cssProperty(p, rp) {\n var b = document.body || document.documentElement,\n s = b.style;\n if (typeof s == 'undefined') { return false; }\n if (typeof s[p] == 'string') { return rp ? p : true; }\n var v = ['Moz', 'Webkit', 'Khtml', 'O', 'ms', 'Icab'],\n p = p.charAt(0).toUpperCase() + p.substr(1);\n for (var i = 0; i < v.length; i++) {\n if (typeof s[v[i] + p] == 'string') { return rp ? (v[i] + p) : true; }\n }\n return false;\n }",
"function cssToStr(cssProps) {\n var statements = [];\n\n $.each(cssProps, function (name, val) {\n if (val != null) {\n statements.push(name + ':' + val);\n }\n });\n\n return statements.join(';');\n }",
"function getStyle (target, prop) {\n try {\n if ( window.getComputedStyle ) { // gecko and webkit\n prop = prop.replace(/([a-z])([A-Z])/, hyphenate); // requires hyphenated, not camel\n return window.getComputedStyle(target, null).getPropertyValue(prop);\n }\n if ( target.currentStyle ) { // ie\n return target.currentStyle[prop];\n }\n return target.style[prop];\n }\n catch (e) {\n }\n return \"\";\n }",
"function getStyle(rule, prop) {\n\t try {\n\t return rule.style.getPropertyValue(prop);\n\t } catch (err) {\n\t // IE may throw if property is unknown.\n\t return '';\n\t }\n\t}",
"function _sanitizeStyle(value){value=String(value).trim();// Make sure it's actually a string.\nif(!value)return'';// Single url(...) values are supported, but only for URLs that sanitize cleanly. See above for\n// reasoning behind this.\nvar urlMatch=value.match(URL_RE);if(urlMatch&&_sanitizeUrl(urlMatch[1])===urlMatch[1]||value.match(SAFE_STYLE_VALUE)&&hasBalancedQuotes(value)){return value;// Safe style values.\n}if(isDevMode()){console.warn(\"WARNING: sanitizing unsafe style value \"+value+\" (see http://g.co/ng/security#xss).\");}return'unsafe';}",
"_renderStyle() {\n let render;\n switch (this.xstyle) {\n // no style\n case \"none\": render = \"\";\n break;\n // default styles defined by the DCC\n case \"in\" : if (this.hasAttribute(\"image\"))\n render = \"image-style\"\n else\n render = \"regular-style\"\n break;\n // styles defined by the theme\n case \"out-image\":\n case \"out\": render = this.elementTag() + \"-template\";\n break;\n // style defined directly in the attribute xstyle\n default: render = this.xstyle;\n }\n\n return render;\n }",
"function validStyles(styleAttr){\n\tvar result = '';\n\tvar styleArray = styleAttr.split(';');\n\tangular.forEach(styleArray, function(value){\n\t\tvar v = value.split(':');\n\t\tif(v.length == 2){\n\t\t\tvar key = trim(angular.lowercase(v[0]));\n\t\t\tvar value = trim(angular.lowercase(v[1]));\n\t\t\tif(\n\t\t\t\t(key === 'color' || key === 'background-color') && (\n\t\t\t\t\tvalue.match(/^rgb\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^rgba\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsl\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsla\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^#[0-9a-f]{3,6}$/i)\n\t\t\t\t\t|| value.match(/^[a-z]*$/i)\n\t\t\t\t)\n\t\t\t||\n\t\t\t\tkey === 'text-align' && (\n\t\t\t\t\tvalue === 'left'\n\t\t\t\t\t|| value === 'right'\n\t\t\t\t\t|| value === 'center'\n\t\t\t\t\t|| value === 'justify'\n\t\t\t\t)\n\t\t\t||\n key === 'text-decoration' && (\n value === 'underline'\n || value === 'line-through'\n )\n || \n key === 'font-weight' && (\n value === 'bold'\n )\n ||\n key === 'font-style' && (\n value === 'italic'\n )\n ||\n key === 'float' && (\n value === 'left'\n || value === 'right'\n || value === 'none'\n )\n ||\n key === 'vertical-align' && (\n value === 'baseline'\n || value === 'sub'\n || value === 'super'\n || value === 'test-top'\n || value === 'text-bottom'\n || value === 'middle'\n || value === 'top'\n || value === 'bottom'\n || value.match(/[0-9]*(px|em)/)\n || value.match(/[0-9]+?%/)\n )\n ||\n key === 'font-size' && (\n value === 'xx-small'\n || value === 'x-small'\n || value === 'small'\n || value === 'medium'\n || value === 'large'\n || value === 'x-large'\n || value === 'xx-large'\n || value === 'larger'\n || value === 'smaller'\n || value.match(/[0-9]*\\.?[0-9]*(px|em|rem|mm|q|cm|in|pt|pc|%)/)\n )\n\t\t\t||\n\t\t\t\t(key === 'width' || key === 'height') && (\n\t\t\t\t\tvalue.match(/[0-9\\.]*(px|em|rem|%)/)\n\t\t\t\t)\n\t\t\t|| // Reference #520\n\t\t\t\t(key === 'direction' && value.match(/^ltr|rtl|initial|inherit$/))\n\t\t\t) result += key + ': ' + value + ';';\n\t\t}\n\t});\n\treturn result;\n}",
"function setBrowserSpecificProperty(prop) {\n var style = document.body.style; // No reason for this particular tag, just want the style\n var prefixes = ['Webkit', 'Moz', 'O', 'ms', 'Khtml'];\n var ucProp = prop.charAt(0).toUpperCase() + prop.substr(1);\n var props = prefixes.map(function(prefix){return prefix + ucProp;}).concat(prop);\n\n for (var i in props) {\n if (style[props[i]] !== undefined) {\n return props[i];\n }\n }\n }",
"function getStyle() {\n if (props.white) return styles.white;\n else if (props.red) return styles.red;\n else if (props.blue) return styles.blue;\n else if (props.green) return styles.green;\n else if (props.black) return styles.black;\n else {\n return styles.white;\n }\n }",
"function computedStyle(el, prop, getComputedStyle, style) {\n getComputedStyle = window.getComputedStyle;\n style =\n // If we have getComputedStyle\n getComputedStyle ?\n // Query it\n // TODO: From CSS-Query notes, we might need (node, null) for FF\n getComputedStyle(el) :\n\n // Otherwise, we are in IE and use currentStyle\n el.currentStyle;\n if (style) {\n return style\n [\n // Switch to camelCase for CSSOM\n // DEV: Grabbed from jQuery\n // https://github.com/jquery/jquery/blob/1.9-stable/src/css.js#L191-L194\n // https://github.com/jquery/jquery/blob/1.9-stable/src/core.js#L593-L597\n prop.replace(/-(\\w)/gi, function (word, letter) {\n return letter.toUpperCase();\n })\n ];\n }\n}",
"function getStyle(rule, prop) {\n try {\n return rule.style.getPropertyValue(prop);\n } catch (err) {\n // IE may throw if property is unknown.\n return '';\n }\n}",
"function getStyle(rule, prop) {\n try {\n return rule.style.getPropertyValue(prop);\n } catch (err) {\n // IE may throw if property is unknown.\n return '';\n }\n}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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+(isCustomProperty?styleName:hyphenateStyleName(styleName))+':';serialized+=dangerousStyleValue(styleName,styleValue,isCustomProperty);delimiter=';';}}return serialized||null;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"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;}}",
"getCssString() {\n const text = fs.readFileSync(\"./src/hero.css\", 'utf8');\n return (text.replace(/\\s+/g, ' '));\n }",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function cssToStr(cssProps) {\n\tvar statements = [];\n\n\t$.each(cssProps, function(name, val) {\n\t\tif (val != null) {\n\t\t\tstatements.push(name + ':' + val);\n\t\t}\n\t});\n\n\treturn statements.join(';');\n}",
"function validStyles(styleAttr){\n\tvar result = '';\n\tvar styleArray = styleAttr.split(';');\n\tangular.forEach(styleArray, function(value){\n\t\tvar v = value.split(':');\n\t\tif(v.length == 2){\n\t\t\tvar key = trim(angular.lowercase(v[0]));\n\t\t\tvar value = trim(angular.lowercase(v[1]));\n\t\t\tif(\n\t\t\t\t(key === 'color' || key === 'background-color') && (\n\t\t\t\t\tvalue.match(/^rgb\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^rgba\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsl\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsla\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^#[0-9a-f]{3,6}$/i)\n\t\t\t\t\t|| value.match(/^[a-z]*$/i)\n\t\t\t\t)\n\t\t\t||\n\t\t\t\tkey === 'text-align' && (\n\t\t\t\t\tvalue === 'left'\n\t\t\t\t\t|| value === 'right'\n\t\t\t\t\t|| value === 'center'\n\t\t\t\t\t|| value === 'justify'\n\t\t\t\t)\n\t\t\t||\n\t\t\t\tkey === 'float' && (\n\t\t\t\t\tvalue === 'left'\n\t\t\t\t\t|| value === 'right'\n\t\t\t\t\t|| value === 'none'\n\t\t\t\t)\n\t\t\t||\n\t\t\t\t(key === 'width' || key === 'height') && (\n\t\t\t\t\tvalue.match(/[0-9\\.]*(px|em|rem|%)/)\n\t\t\t\t)\n\t\t\t|| // Reference #520\n\t\t\t\t(key === 'direction' && value.match(/^ltr|rtl|initial|inherit$/))\n\t\t\t) result += key + ': ' + value + ';';\n\t\t}\n\t});\n\treturn result;\n}",
"function getPropertyValue(cssRule, prop) {\n try {\n // Support CSSTOM.\n if (cssRule.attributeStyleMap) {\n return cssRule.attributeStyleMap.get(prop);\n }\n\n return cssRule.style.getPropertyValue(prop);\n } catch (err) {\n // IE may throw if property is unknown.\n return '';\n }\n }",
"function IntObject_UpdateCSSStyleProperty()\n{\n\t//has fixed property?\n\tif (this.StyleProperties && this.StyleProperties.FixedPosition)\n\t{\n\t\t//unregister this as a fixed object\n\t\t__SIMULATOR.Interpreter.NotifyFixedObject(this.DataObject.Id, this, false);\n\t}\n\t//by default: no object is CSS Enabled\n\tthis.StyleProperties = false;\n\t//retrieve out css property\n\tvar strCSS = Get_String(this.Properties[__NEMESIS_PROPERTY_STYLE], null);\n\t//valid?\n\tif (strCSS != null)\n\t{\n\t\t//could have properties, convert into an object\n\t\tthis.StyleProperties = { cssText: \"\", Original: {}, Zoom: null };\n\t\t//split it\n\t\tstrCSS = strCSS.split(\";\");\n\t\t//now loop through all of them\n\t\tfor (var iCSS = 0, cCSS = strCSS.length; iCSS < cCSS; iCSS++)\n\t\t{\n\t\t\t//split this into key value pair\n\t\t\tvar pair = strCSS[iCSS].split(\":\");\n\t\t\t//valid?\n\t\t\tif (pair.length == 2)\n\t\t\t{\n\t\t\t\t//we want to make sure we trim the key\n\t\t\t\tpair[0] = pair[0].Trim();\n\t\t\t\t//store it\n\t\t\t\tthis.StyleProperties.Original[pair[0]] = pair[1];\n\t\t\t\t//switch on it\n\t\t\t\tswitch (pair[0].toLowerCase())\n\t\t\t\t{\n\t\t\t\t\tcase \"pointer-events\":\n\t\t\t\t\t\t//only process this if we arent in designer or if the value is not \"none\"\n\t\t\t\t\t\tif (!__DESIGNER_CONTROLLER || !/none/i.test(pair[1]))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//add it to the css text\n\t\t\t\t\t\t\tthis.StyleProperties.cssText += pair[0] + \":\" + pair[1] + \";\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"zoom\":\n\t\t\t\t\t\t//add it to the css text\n\t\t\t\t\t\tthis.StyleProperties.cssText += pair[0] + \":\" + pair[1] + \";\";\n\t\t\t\t\t\t//but we also need to mark this as a valid zoom object\n\t\t\t\t\t\tthis.StyleProperties.Zoom = Zoom_Register(this, pair[1]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"content\":\n\t\t\t\t\t\t//replace all url(' with url(' plus host\n\t\t\t\t\t\tpair[1] = pair[1].replace(/url\\('(?!data:)/gi, \"url('\" + __HOST_LESSON_RESOURCES);\n\t\t\t\t\t\t//add it to the css text\n\t\t\t\t\t\tthis.StyleProperties.cssText += pair[0] + \":\" + pair[1] + \";\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\t//add it to the css text\n\t\t\t\t\t\tthis.StyleProperties.cssText += pair[0] + \":\" + pair[1] + \";\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//has fixed?\n\t\tif (this.StyleProperties.Original[\"position\"] == \"fixed\")\n\t\t{\n\t\t\t//assume this is fixed\n\t\t\tvar bFixed = true;\n\t\t\t//loop through the parents\n\t\t\tfor (var parent = this.Parent; parent; parent = parent.Parent)\n\t\t\t{\n\t\t\t\t//this parent a real iframe?\n\t\t\t\tif (parent.IsRealIFrame)\n\t\t\t\t{\n\t\t\t\t\t//cannot be fixed\n\t\t\t\t\tbFixed = false;\n\t\t\t\t\t//end loop\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//still fixed?\n\t\t\tif (bFixed)\n\t\t\t{\n\t\t\t\t//create fixed position marker\n\t\t\t\tthis.StyleProperties.FixedPosition = true;\n\t\t\t\t//and register with the interpreter\n\t\t\t\t__SIMULATOR.Interpreter.NotifyFixedObject(this.DataObject.Id, this, true);\n\t\t\t}\n\t\t}\n\t\t//switch on its control type tag\n\t\tswitch (Get_String(this.Properties[__NEMESIS_PROPERTY_CONTROL_TYPE], \"\").toLowerCase())\n\t\t{\n\t\t\tcase \"iframe\":\n\t\t\tcase \"frame\":\n\t\t\tcase \"frameset\":\n\t\t\t\t//not the new iFrame?\n\t\t\t\tif (!Get_Bool(this.Properties[__NEMESIS_PROPERTY_CONTROL_TYPE_FORCED], false))\n\t\t\t\t{\n\t\t\t\t\t//no isolation?\n\t\t\t\t\tif (!this.StyleProperties.Original[\"isolation\"])\n\t\t\t\t\t{\n\t\t\t\t\t\t//force it\n\t\t\t\t\t\tthis.StyleProperties.cssText += \"isolation:isolate;\";\n\t\t\t\t\t}\n\t\t\t\t\t//this ie browser (Edge and IE)\n\t\t\t\t\tif (__BROWSER_TYPE == __BROWSER_IE)\n\t\t\t\t\t{\n\t\t\t\t\t\t//no opacity?\n\t\t\t\t\t\tif (!this.StyleProperties.Original[\"opacity\"])\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//force it\n\t\t\t\t\t\t\tthis.StyleProperties.cssText += \"opacity:0.99;\";\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t//indicate that this is a real iframe\n\t\t\t\t\tthis.IsRealIFrame = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase \"html\":\n\t\t\t\t//get its parent object and check its tag\n\t\t\t\tswitch (this.Parent ? Get_String(this.Parent.Properties[__NEMESIS_PROPERTY_CONTROL_TYPE], \"\").toLowerCase() : \"\")\n\t\t\t\t{\n\t\t\t\t\tcase \"iframe\":\n\t\t\t\t\tcase \"frame\":\n\t\t\t\t\tcase \"frameset\":\n\t\t\t\t\t\t//not the new iFrame?\n\t\t\t\t\t\tif (!Get_Bool(this.Properties[__NEMESIS_PROPERTY_CONTROL_TYPE_FORCED], false))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//check if the parent has scrolling = no\n\t\t\t\t\t\t\tvar attributeScrollingNo = false;\n\t\t\t\t\t\t\t//obtain the parent's\n\t\t\t\t\t\t\tvar attributes = this.Parent.StyleProperties ? Get_String(this.Parent.Properties[__NEMESIS_PROPERTY_HTML_ATTRIBUTES], null) : null;\n\t\t\t\t\t\t\t//valid?\n\t\t\t\t\t\t\tif (attributes != null)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t//parse attributes (lowercase it just in case);\n\t\t\t\t\t\t\t\tattributes = JSON.parse(attributes.toLowerCase());\n\t\t\t\t\t\t\t\t//check for scrolling\n\t\t\t\t\t\t\t\tattributeScrollingNo = !Get_Bool(attributes[\"scrolling\"], true);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t//we need to copy some properties into our parent\n\t\t\t\t\t\t\tvar properties = [\"overflow\", \"overflow-y\", \"overflow-x\"];\n\t\t\t\t\t\t\t//loop through properties\n\t\t\t\t\t\t\tfor (var i = properties.length; i--;)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t//get property\n\t\t\t\t\t\t\t\tvar property = properties[i];\n\t\t\t\t\t\t\t\t//get our value\n\t\t\t\t\t\t\t\tvar ourValue = attributeScrollingNo ? \"hidden\" : this.StyleProperties.Original[property];\n\t\t\t\t\t\t\t\t//valid?\n\t\t\t\t\t\t\t\tif (ourValue)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t//force on parent\n\t\t\t\t\t\t\t\t\tthis.Parent.StyleProperties.Original[property] = ourValue;\n\t\t\t\t\t\t\t\t\tthis.Parent.StyleProperties.cssText += property + \":\" + ourValue + \";\";\n\t\t\t\t\t\t\t\t\t//parent already loaded?\n\t\t\t\t\t\t\t\t\tif (this.Parent.HTML)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t//switch on property\n\t\t\t\t\t\t\t\t\t\tswitch (property)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tcase \"overflow\":\n\t\t\t\t\t\t\t\t\t\t\t\t//apply directly\n\t\t\t\t\t\t\t\t\t\t\t\tthis.Parent.HTML.style.overflow = ourValue;\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\tcase \"overflow-x\":\n\t\t\t\t\t\t\t\t\t\t\t\t//apply directly\n\t\t\t\t\t\t\t\t\t\t\t\tthis.Parent.HTML.style.overflowX = ourValue;\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\tcase \"overflow-y\":\n\t\t\t\t\t\t\t\t\t\t\t\t//apply directly\n\t\t\t\t\t\t\t\t\t\t\t\tthis.Parent.HTML.style.overflowY = ourValue;\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t//regardless of whatever we do to the parent, the HTML always have a forced overflow\n\t\t\t\t\t\t\tthis.StyleProperties.Original[\"overflow\"] = \"visible\";\n\t\t\t\t\t\t\tthis.StyleProperties.Original[\"overflow-x\"] = \"visible\";\n\t\t\t\t\t\t\tthis.StyleProperties.Original[\"overflow-y\"] = \"visible\";\n\t\t\t\t\t\t\tthis.StyleProperties.cssText += \"overflow:visible;overflow-x:visible;overflow-y:visible;\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n}",
"useCSS(_cssText) {\n // Common, standard <style> tag generation in <head>\n const _style = document.createElement('style');\n _style.type = 'text/css';\n _style.media = 'all';\n if (BROWSER_TYPE.safari || BROWSER_TYPE.chrome || BROWSER_TYPE.firefox || BROWSER_TYPE.opera) {\n // This is how to do it in KHTML browsers\n _style.appendChild(document.createTextNode(_cssText));\n }\n else {\n // This works for many others (add more checks, if problems with new browsers)\n _style.textContent = _cssText;\n }\n const _head = document.getElementsByTagName('head')[0];\n _head.appendChild(_style);\n return _style;\n }",
"static get styles() {\n return \"\";\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized +=\n delimiter +\n (isCustomProperty\n ? styleName\n : hyphenateStyleName(styleName)) +\n ':';\n serialized += dangerousStyleValue(\n styleName,\n styleValue,\n isCustomProperty,\n );\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"get styleStaticText() { return Object.assign({}, this.style.common); }",
"function normalizeStyle(styleStr) {\n var serialized = (0,stylis__WEBPACK_IMPORTED_MODULE_8__.serialize)((0,stylis__WEBPACK_IMPORTED_MODULE_9__.compile)(styleStr), stylis__WEBPACK_IMPORTED_MODULE_8__.stringify);\n return serialized.replace(/\\{%%%\\:[^;];}/g, ';');\n}",
"function s(e){return getComputedStyle(e)}",
"function styleString(styleInfo){var o=[];for(var name in styleInfo){var v=styleInfo[name];if(v||v===0){o.push(\"\".concat(camelToDashCase(name),\": \").concat(v));}}return o.join('; ');}",
"function validStyles(styleAttr){\n\tvar result = '';\n\tvar styleArray = styleAttr.split(';');\n\tangular.forEach(styleArray, function(value){\n\t\tvar v = value.split(':');\n\t\tif(v.length == 2){\n\t\t\tvar key = trim(angular.lowercase(v[0]));\n\t\t\tvar value = trim(angular.lowercase(v[1]));\n\t\t\tif(\n\t\t\t\t(key === 'color' || key === 'background-color') && (\n\t\t\t\t\tvalue.match(/^rgb\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^rgba\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsl\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^hsla\\([0-9%,\\. ]*\\)$/i)\n\t\t\t\t\t|| value.match(/^#[0-9a-f]{3,6}$/i)\n\t\t\t\t\t|| value.match(/^[a-z]*$/i)\n\t\t\t\t)\n\t\t\t||\n\t\t\t\tkey === 'text-align' && (\n\t\t\t\t\tvalue === 'left'\n\t\t\t\t\t|| value === 'right'\n\t\t\t\t\t|| value === 'center'\n\t\t\t\t\t|| value === 'justify'\n\t\t\t\t)\n\t\t\t||\n\t\t\t\tkey === 'float' && (\n\t\t\t\t\tvalue === 'left'\n\t\t\t\t\t|| value === 'right'\n\t\t\t\t\t|| value === 'none'\n\t\t\t\t)\n\t\t\t||\n\t\t\t\t(key === 'width' || key === 'height') && (\n\t\t\t\t\tvalue.match(/[0-9\\.]*(px|em|rem|%)/)\n\t\t\t\t)\n\t\t\t) result += key + ': ' + value + ';';\n\t\t}\n\t});\n\treturn result;\n}",
"get styleMsg() { return Object.assign({}, this.style.msg); }",
"function cssToStr(cssProps) {\n var statements = [];\n\n for (var name in cssProps) {\n var val = cssProps[name];\n\n if (val != null && val !== '') {\n statements.push(name + ':' + val);\n }\n }\n\n return statements.join(';');\n }",
"function cssToStr(cssProps) {\n var statements = [];\n for (var name_1 in cssProps) {\n var val = cssProps[name_1];\n if (val != null && val !== '') {\n statements.push(name_1 + ':' + val);\n }\n }\n return statements.join(';');\n}",
"function CLC_FetchCSSRawString(styleSheetObj){\r\n var styleSheetRawString;\r\n if (styleSheetObj.ownerNode.tagName.toLowerCase() == \"style\"){\r\n styleSheetRawString = styleSheetObj.ownerNode.innerHTML;\r\n }\r\n return styleSheetRawString;\r\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n\n var styleValue = styles[styleName];\n\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n delimiter = ';';\n }\n }\n\n return serialized || null;\n }\n }",
"function utilFromCssProperty(cssName) {\n\t\tif (!cssName.includes('-')) {\n\t\t\tswitch (cssName) {\n\t\t\tcase 'bgcolor': return 'backgroundColor';\n\t\t\tcase 'float': return 'cssFloat';\n\t\t\tdefault: return cssName;\n\t\t\t}\n\t\t}\n\n\t\t// Strip the leading hyphen from the `-ms-` vendor prefix, so it stays lowercased.\n\t\tconst normalized = cssName.slice(0, 4) === '-ms-' ? cssName.slice(1) : cssName;\n\n\t\treturn normalized\n\t\t\t.split('-')\n\t\t\t.map((part, i) => i === 0 ? part : part.toUpperFirst())\n\t\t\t.join('');\n\t}",
"function createDangerousStringForStyles(styles) {\n {\n var serialized = '';\n var delimiter = '';\n for (var styleName in styles) {\n if (!styles.hasOwnProperty(styleName)) {\n continue;\n }\n var styleValue = styles[styleName];\n if (styleValue != null) {\n var isCustomProperty = styleName.indexOf('--') === 0;\n serialized += delimiter + hyphenateStyleName(styleName) + ':';\n serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n\n delimiter = ';';\n }\n }\n return serialized || null;\n }\n }"
] |
[
"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.60742265",
"0.60742265",
"0.6071971",
"0.6071952",
"0.60697836",
"0.6061777",
"0.6061777",
"0.6061777",
"0.6061777",
"0.60613453",
"0.60393703",
"0.60393703",
"0.60352707",
"0.5982155",
"0.5980667",
"0.5969921",
"0.5969259",
"0.5967845",
"0.59447616",
"0.5937434",
"0.5936904",
"0.5918973",
"0.5914078",
"0.5910947",
"0.59031904",
"0.5901612",
"0.5895097",
"0.5891428",
"0.5864694",
"0.5858321",
"0.5846928",
"0.5846928",
"0.58438474",
"0.58438474",
"0.58438474",
"0.58438474",
"0.58438474",
"0.5842196",
"0.5842196",
"0.5842196",
"0.5842196",
"0.5842196",
"0.5842196",
"0.5842196",
"0.58300346",
"0.5826102",
"0.5826102",
"0.5826102",
"0.5826102",
"0.5826102",
"0.5826102",
"0.5826102",
"0.5826102",
"0.5823641",
"0.5814597",
"0.5810826",
"0.5804064",
"0.5803555",
"0.5798625",
"0.5792137",
"0.57890713",
"0.57873625",
"0.57805353",
"0.57802176",
"0.57362324",
"0.5721879",
"0.57185316",
"0.57159346",
"0.5715664",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.5712659",
"0.57125825",
"0.5712303"
] |
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 }",
"function Diff() {}",
"function Diff() {}",
"function Diff() {}",
"function Diff() {}",
"function Diff() {}",
"function Diff() {}",
"function objectDiff(object1, object2) {\n let diff = {};\n let differ = false;\n let keys = new Set(Object.keys(object1));\n\n for (let key in object2) {\n keys.add(key);\n }\n for (let key of keys) {\n let foundDiff = computeDiff(object1[key], object2[key]);\n if (foundDiff) {\n diff[key] = foundDiff;\n differ = true;\n }\n }\n if (differ) {\n return diff;\n }\n}",
"function computeDiff(thing1, thing2) {\n if (typeof thing1 === 'object' && typeof thing2 === 'object') {\n if (Array.isArray(thing1) && Array.isArray(thing2)) {\n return arrayDiff(thing1, thing2);\n }\n return objectDiff(thing1, thing2);\n }\n if (thing1 !== thing2) {\n return [thing1, thing2];\n }\n}",
"function diff(obj1, obj2) {\r\n var diff = [];\r\n labels.forEach(function(key) {\r\n if (obj1[key] !== obj2[key]) {\r\n diff.push(key);\r\n }\r\n });\r\n return diff;\r\n }",
"function diff(obj1, obj2) {\n var diff = [];\n labels.forEach(function(key) {\n if (obj1[key] !== obj2[key]) {\n diff.push(key);\n }\n });\n return diff;\n }",
"function objectDiff(obj1, obj2) {\n var diff, update = {}, enter = {}, exit = {}, all = {},\n name,\n obj1 = obj1 || {};\n\n for (name in obj1) {\n if (!(name in obj2))\n exit[name] = all[name] = true;\n else if (obj1[name] != obj2[name])\n update[name] = all[name] = true;\n }\n\n for (name in obj2) {\n if (!(name in obj1))\n enter[name] = all[name] = true;\n }\n\n diff = {\n all: all,\n update: update,\n enter: enter,\n exit: exit\n };\n\n return diff;\n}",
"function difference(a, b) {\n return Math.abs(a - b);\n }",
"function getDiff(a, b) {\n const isBefore = a.isBefore(b)\n const later = isBefore ? b : a\n let earlier = isBefore ? a : b\n earlier = earlier.clone()\n const diff = {\n years: 0,\n months: 0,\n days: 0,\n hours: 0,\n minutes: 0,\n seconds: 0\n }\n Object.keys(diff).forEach((unit) => {\n if (earlier.isSame(later, unit)) {\n return\n }\n let max = earlier.diff(later, unit)\n earlier = earlier.add(max, unit)\n diff[unit] = max\n })\n //reverse it, if necessary\n if (isBefore) {\n Object.keys(diff).forEach((u) => {\n if (diff[u] !== 0) {\n diff[u] *= -1\n }\n })\n }\n return diff\n}",
"function findDifferences(objectA, objectB) {\n var propertyChanges = [];\n var objectGraphPath = [\"this\"];\n (function(a, b) {\n\tif(a.constructor == Array) {\n // BIG assumptions here: That both arrays are same length, that\n // the members of those arrays are _essentially_ the same, and \n // that those array members are in the same order...\n for(var i = 0; i < a.length; i++) {\n\t\tobjectGraphPath.push(\"[\" + i.toString() + \"]\");\n\t\targuments.callee(a[i], b[i]);\n\t\tobjectGraphPath.pop();\n }\n\t} else if(a.constructor == Object || (a.constructor != Number && \n\t\t\t\t\t a.constructor != String && a.constructor != Date && \n\t\t\t\t\t a.constructor != RegExp && a.constructor != Function &&\n\t\t\t\t\t a.constructor != Boolean)) {\n // we can safely assume that the objects have the \n // same property lists, else why compare them?\n for(var property in a) {\n\t\tobjectGraphPath.push((\".\" + property));\n\t\tif(a[property].constructor != Function) {\n\t\t arguments.callee(a[property], b[property]);\n\t\t}\n\t\tobjectGraphPath.pop();\n }\n\t} else if(a.constructor != Function) { // filter out functions\n if(a != b) {\n\t\tpropertyChanges.push({ \"Property\": objectGraphPath.join(\"\"), \"ObjectA\": a, \"ObjectB\": b });\n }\n\t}\n })(objectA, objectB);\n return propertyChanges;\n}",
"function ageDifference(person1, person2) {\n return person1.age - person2.age;\n}",
"function diff(params) {\n var cid = params.cid;\n var rData = params.data;\n\n function _diff(left, right) {\n if (!right || !right._hash) return;\n var delta;\n if (right._hash && left && left._hash && right._hash == left._hash) {\n return;\n }\n\n if (right.properties) {\n if (!left) {\n left = {};\n }\n var rProperties = right.properties;\n var lProperties = left.properties;\n if (!lProperties) {\n if (!delta) {\n delta = {};\n }\n if (!delta.properties) {\n delta.properties = _clone(rProperties);\n }\n } else {\n var keys = Object.keys(rProperties);\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n var rProp = rProperties[key];\n var lProp = lProperties[key];\n var dProperties;\n var rCid = rProp.cid || cid;\n if (!lProp || lProp.cid < rCid) {\n if (!dProperties) {\n delta = {\n properties: {}\n };\n dProperties = delta.properties;\n }\n dProperties[key] = {\n cid: rCid,\n value: _clone(rProp.value)\n };\n if (rProp.type != dProperties[key].type) {\n dProperties[key].type = rProp.type;\n }\n }\n }\n }\n }\n if (right.children) {\n var rChildren = right.children;\n var lChildren = left.children;\n if (!lChildren) {\n if (!delta) {\n delta = {};\n }\n if (!delta.children) {\n delta.children = _clone(right.children);\n }\n } else {\n var keys = Object.keys(rChildren);\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n var rChild = rChildren[key];\n var lChild = lChildren[key];\n if (!lChild) {\n if (!delta) {\n delta = {\n children: {}\n };\n }\n var dChildren = delta.children;\n if (!dChildren) {\n dChildren = {};\n delta.children = dChildren;\n }\n dChildren[key] = rChildren[key];\n } else {\n var cDelta = _diff(lChild, rChild);\n if (cDelta) {\n if (!delta) {\n delta = {\n children: {}\n };\n }\n var dChildren = delta.children;\n if (!dChildren) {\n dChildren = {};\n delta.children = dChildren;\n }\n dChildren[key] = cDelta;\n }\n }\n }\n }\n }\n return delta;\n }\n var delta = _diff(data, rData);\n return delta;\n }",
"function compareObjectReturnDifferencesFromSecondObject(obj1, obj2) {\n\tconst differences = {};\n\tfor (const [key2, value2] of Object.entries(obj2)) {\n\t\tif (obj1[key2] !== undefined && obj1[key2] !== value2) {\n\t\t\tdifferences[key2] = value2;\n\t\t}\n\t}\n\treturn differences;\n}",
"function diff(a, b) {\n if (a == null || b == null || isNaN(a) || isNaN(b))\n return 0;\n else\n return Math.max(a - b, 0);\n}",
"function diff(a, b)\n{\n if (a == null || b == null)\n return 0;\n else\n return Math.max(a - b, 0);\n}",
"function diff(a, b)\n{\n if (a == null || b == null)\n return 0;\n else\n return Math.max(a - b, 0);\n}",
"function Difference(base, head) {\n\t var changes = {}, length = 0;\n\n\t function changed(h, b) {\n\t return h !== b && !_.isEqual(_.omit(h, 'v'), _.omit(b, 'v'));\n\t }\n\n\t _.each(head.entities, function(h, id) {\n\t var b = base.entities[id];\n\t if (changed(h, b)) {\n\t changes[id] = {base: b, head: h};\n\t length++;\n\t }\n\t });\n\n\t _.each(base.entities, function(b, id) {\n\t var h = head.entities[id];\n\t if (!changes[id] && changed(h, b)) {\n\t changes[id] = {base: b, head: h};\n\t length++;\n\t }\n\t });\n\n\t function addParents(parents, result) {\n\t for (var i = 0; i < parents.length; i++) {\n\t var parent = parents[i];\n\n\t if (parent.id in result)\n\t continue;\n\n\t result[parent.id] = parent;\n\t addParents(head.parentRelations(parent), result);\n\t }\n\t }\n\n\t var difference = {};\n\n\t difference.length = function() {\n\t return length;\n\t };\n\n\t difference.changes = function() {\n\t return changes;\n\t };\n\n\t difference.extantIDs = function() {\n\t var result = [];\n\t _.each(changes, function(change, id) {\n\t if (change.head) result.push(id);\n\t });\n\t return result;\n\t };\n\n\t difference.modified = function() {\n\t var result = [];\n\t _.each(changes, function(change) {\n\t if (change.base && change.head) result.push(change.head);\n\t });\n\t return result;\n\t };\n\n\t difference.created = function() {\n\t var result = [];\n\t _.each(changes, function(change) {\n\t if (!change.base && change.head) result.push(change.head);\n\t });\n\t return result;\n\t };\n\n\t difference.deleted = function() {\n\t var result = [];\n\t _.each(changes, function(change) {\n\t if (change.base && !change.head) result.push(change.base);\n\t });\n\t return result;\n\t };\n\n\t difference.summary = function() {\n\t var relevant = {};\n\n\t function addEntity(entity, graph, changeType) {\n\t relevant[entity.id] = {\n\t entity: entity,\n\t graph: graph,\n\t changeType: changeType\n\t };\n\t }\n\n\t function addParents(entity) {\n\t var parents = head.parentWays(entity);\n\t for (var j = parents.length - 1; j >= 0; j--) {\n\t var parent = parents[j];\n\t if (!(parent.id in relevant)) addEntity(parent, head, 'modified');\n\t }\n\t }\n\n\t _.each(changes, function(change) {\n\t if (change.head && change.head.geometry(head) !== 'vertex') {\n\t addEntity(change.head, head, change.base ? 'modified' : 'created');\n\n\t } else if (change.base && change.base.geometry(base) !== 'vertex') {\n\t addEntity(change.base, base, 'deleted');\n\n\t } else if (change.base && change.head) { // modified vertex\n\t var moved = !_.isEqual(change.base.loc, change.head.loc),\n\t retagged = !_.isEqual(change.base.tags, change.head.tags);\n\n\t if (moved) {\n\t addParents(change.head);\n\t }\n\n\t if (retagged || (moved && change.head.hasInterestingTags())) {\n\t addEntity(change.head, head, 'modified');\n\t }\n\n\t } else if (change.head && change.head.hasInterestingTags()) { // created vertex\n\t addEntity(change.head, head, 'created');\n\n\t } else if (change.base && change.base.hasInterestingTags()) { // deleted vertex\n\t addEntity(change.base, base, 'deleted');\n\t }\n\t });\n\n\t return d3.values(relevant);\n\t };\n\n\t difference.complete = function(extent) {\n\t var result = {}, id, change;\n\n\t for (id in changes) {\n\t change = changes[id];\n\n\t var h = change.head,\n\t b = change.base,\n\t entity = h || b;\n\n\t if (extent &&\n\t (!h || !h.intersects(extent, head)) &&\n\t (!b || !b.intersects(extent, base)))\n\t continue;\n\n\t result[id] = h;\n\n\t if (entity.type === 'way') {\n\t var nh = h ? h.nodes : [],\n\t nb = b ? b.nodes : [],\n\t diff, i;\n\n\t diff = _.difference(nh, nb);\n\t for (i = 0; i < diff.length; i++) {\n\t result[diff[i]] = head.hasEntity(diff[i]);\n\t }\n\n\t diff = _.difference(nb, nh);\n\t for (i = 0; i < diff.length; i++) {\n\t result[diff[i]] = head.hasEntity(diff[i]);\n\t }\n\t }\n\n\t addParents(head.parentWays(entity), result);\n\t addParents(head.parentRelations(entity), result);\n\t }\n\n\t return result;\n\t };\n\n\t return difference;\n\t}",
"function getObjectDistance(A, B) {\r\n return (Math.sqrt(Math.pow((A.x - B.x), 2) + Math.pow((A.y - B.y), 2)));\r\n}",
"valDiff(toUpdate) {\n let res = {};\n toUpdate.forEach((entity) => {\n res[entity.id] = {};\n Object.keys(entity).forEach((key) => {\n if (this.frameNew[entity.id][key] === undefined ||\n this.frameOld[entity.id][key] === undefined) {\n res[entity.id][key] = 0;\n } else {\n res[entity.id][key] = this.frameNew[entity.id][key] - this.frameOld[entity.id][key];\n }\n });\n });\n return res;\n }",
"function diffObj(a, b, props) {\n const diffs = {};\n\n // TODO: maybe implement two versions of this algo, one if props is present, one if it isn't,\n // because it's probably faster to outerloop props if it is present\n\n for (const prop in a) {\n if (!a.hasOwnProperty(prop) || (props && !props[prop])) {\n continue;\n }\n\n const av = a[prop],\n bv = b[prop];\n\n if (!Tyr.isEqual(av, bv)) {\n if (bv === undefined) {\n diffs[prop] = O_DELETE;\n } else {\n if (isArray(av)) {\n if (isArray(bv)) {\n diffs[prop] = [T_ARRAY, diffArr(av, bv)];\n } else {\n diffs[prop] = [bv];\n }\n } else if (isArray(bv)) {\n diffs[prop] = [bv];\n } else if (Tyr.isObject(av) && Tyr.isObject(bv)) {\n diffs[prop] = [T_OBJECT, diffObj(av, bv)];\n } else {\n diffs[prop] = [bv];\n }\n }\n }\n }\n\n for (const prop in b) {\n if (!b.hasOwnProperty(prop) || (props && !props[prop])) {\n continue;\n }\n\n if (!(prop in a)) {\n const bv = b[prop];\n\n diffs[prop] = [bv];\n }\n }\n\n return diffs;\n}",
"function getDateDiff( date1, date2 ){\n if(date1 instanceof Date && date2 instanceof Date){\n var d1 = date1.valueOf(), d2 = date2.valueOf();\n \n return d2 - d1;\n }\n else { return 0; }\n }",
"function difference(a, b) {\n var toRemove = keyDiff(a, b);\n var toAdd = keyDiff(b, a);\n return { toRemove: toRemove, toAdd: toAdd };\n}",
"function difference(oldObj, newObj) {\n return lodash.transform(oldObj, (result, value, key) => {\n if (!lodash.isEqual(value, newObj[key])) {\n result[key] = lodash.isObject(value) && lodash.isObject(newObj[key]) ? difference(value, newObj[key]) : newObj[key];\n }\n });\n}",
"function compare(a, b) {\n if (a.totalDifference < b.totalDifference) {\n return -1;\n }\n if (a.totalDifference > b.totalDifference) {\n return 1;\n }\n return 0;\n }",
"function diff_v2(v1, v2) { return [v1[0] - v2[0], v1[1] - v2[1]]; }",
"function diffObject(context, expected, actual, strict) {\n diffType(context, expected, actual);\n let expectedKeys = Object.keys(expected);\n let actualKeys = Object.keys(actual);\n\n if (strict) {\n matchKeys(context, expectedKeys, actualKeys);\n }\n\n expectedKeys.forEach(function(key) {\n diff(context.enter(key), expected[key], actual[key]);\n });\n}",
"function byDistance(a, b) {\n return a.dist - b.dist;\n }",
"function delta(a, b) {\r\n return a - b;\r\n}",
"function compare(a,b){\n var x = a.totalDiff;\n var y = b.totalDiff;\n if (x < y) {return -1;}\n if (x > y) {return 1;}\n return 0;\n }",
"getDiff(start, end, mode) {\n\t\treturn end.diff(start, mode);\n\t}",
"function diffSubtract(date1, date2) {\n\treturn date2 - date1;\n}",
"function diff(left, right) {\n const result = [];\n _.each(left, (leftObject) => {\n const rightObject = _.find(right, (rightObject) => _.isEqual(rightObject[exports.options.uniqueKey], leftObject[exports.options.uniqueKey]));\n if (!rightObject) {\n return;\n }\n const ret = {\n missingKeys: { inLeftButNotRight: [], inRightButNotLeft: [] },\n differentValues: [],\n inLeftButNotRight: [],\n inRightButNotLeft: [],\n left: {},\n right: {}\n };\n const missingKeys = checkMissingKeys(leftObject, rightObject);\n if (!_.isEmpty(missingKeys.inLeftButNotRight) ||\n !_.isEmpty(missingKeys.inRightButNotLeft)) {\n ret.missingKeys = missingKeys;\n }\n const differentValues = checkDifferentValues(leftObject, rightObject);\n if (!_.isEmpty(differentValues)) {\n ret.differentValues = differentValues;\n }\n if (!_.isEmpty(ret)) {\n result.push(_.extend(ret, { left: leftObject, right: rightObject }));\n }\n });\n return result;\n}",
"function comparisonByDistance(a, b) {\n return a.distance - b.distance;\n }",
"getDistance(obj1, obj2) \n {\n return Phaser.Math.Distance.Between(obj1.x, obj1.y, obj2.x, obj2.y);\n }",
"function diffPoints(point1,point2){return{left:point1.left-point2.left,top:point1.top-point2.top};}",
"function calculateDelta(scores1, scores2) {\n var diff = 0;\n for (var i = 0; i < scores1.length; i++) {\n diff += Math.abs(scores1[i] - scores2[i]);\n }\n return diff;\n}",
"function diff( left , right , options ) {\n\tvar i , key , keyPath ,\n\t\tleftKeys , rightKeys , leftTypeof , rightTypeof ,\n\t\tdepth , diffObject , length , arrayMode ;\n\n\tleftTypeof = typeof left ;\n\trightTypeof = typeof right ;\n\n\tif (\n\t\t! left || ( leftTypeof !== 'object' && leftTypeof !== 'function' ) ||\n\t\t! right || ( rightTypeof !== 'object' && rightTypeof !== 'function' )\n\t) {\n\t\tthrow new Error( '[tree] diff() needs objects as argument #0 and #1' ) ;\n\t}\n\n\tif ( ! options || typeof options !== 'object' ) { options = {} ; }\n\n\tdepth = options.depth || 0 ;\n\n\t// Things applied only for the root, not for recursive call\n\tif ( ! depth ) {\n\t\toptions.diffObject = {} ;\n\t\tif ( ! options.path ) { options.path = '' ; }\n\t\tif ( ! options.pathSeparator ) { options.pathSeparator = '.' ; }\n\t}\n\n\tdiffObject = options.diffObject ;\n\n\n\t// Left part\n\tif ( Array.isArray( left ) ) {\n\t\tarrayMode = true ;\n\t\tlength = left.length ;\n\t}\n\telse {\n\t\tarrayMode = false ;\n\t\tleftKeys = Object.keys( left ) ;\n\t\tlength = leftKeys.length ;\n\t}\n\n\tfor ( i = 0 ; i < length ; i ++ ) {\n\t\tkey = arrayMode ? i : leftKeys[ i ] ;\n\t\tkeyPath = options.path + options.pathSeparator + key ;\n\t\t//console.log( 'L keyPath:' , keyPath ) ;\n\n\t\tif ( ! Object.prototype.hasOwnProperty.call( right , key ) ) {\n\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'does not exist in right-hand side' } ;\n\t\t\tcontinue ;\n\t\t}\n\n\t\tleftTypeof = typeof left[ key ] ;\n\t\trightTypeof = typeof right[ key ] ;\n\n\t\tif ( leftTypeof !== rightTypeof ) {\n\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'different typeof: ' + leftTypeof + ' - ' + rightTypeof } ;\n\t\t\tcontinue ;\n\t\t}\n\n\t\tif ( leftTypeof === 'object' || leftTypeof === 'function' ) {\n\t\t\t// Cleanup the 'null is an object' mess\n\t\t\tif ( ! left[ key ] ) {\n\t\t\t\tif ( right[ key ] ) { diffObject[ keyPath ] = { path: keyPath , message: 'different type: null - Object' } ; }\n\t\t\t\tcontinue ;\n\t\t\t}\n\n\t\t\tif ( ! right[ key ] ) {\n\t\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'different type: Object - null' } ;\n\t\t\t\tcontinue ;\n\t\t\t}\n\n\t\t\tif ( Array.isArray( left[ key ] ) && ! Array.isArray( right[ key ] ) ) {\n\t\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'different type: Array - Object' } ;\n\t\t\t\tcontinue ;\n\t\t\t}\n\n\t\t\tif ( ! Array.isArray( left[ key ] ) && Array.isArray( right[ key ] ) ) {\n\t\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'different type: Object - Array' } ;\n\t\t\t\tcontinue ;\n\t\t\t}\n\n\t\t\tdiff( left[ key ] , right[ key ] , {\n\t\t\t\tpath: keyPath , pathSeparator: options.pathSeparator , depth: depth + 1 , diffObject: diffObject\n\t\t\t} ) ;\n\t\t\tcontinue ;\n\t\t}\n\n\t\tif ( left[ key ] !== right[ key ] ) {\n\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'different value: ' + left[ key ] + ' - ' + right[ key ] } ;\n\t\t\tcontinue ;\n\t\t}\n\t}\n\n\n\t// Right part\n\tif ( Array.isArray( right ) ) {\n\t\tarrayMode = true ;\n\t\tlength = right.length ;\n\t}\n\telse {\n\t\tarrayMode = false ;\n\t\trightKeys = Object.keys( right ) ;\n\t\tlength = rightKeys.length ;\n\t}\n\n\tfor ( i = 0 ; i < length ; i ++ ) {\n\t\tkey = arrayMode ? i : rightKeys[ i ] ;\n\t\tkeyPath = options.path + options.pathSeparator + key ;\n\t\t//console.log( 'R keyPath:' , keyPath ) ;\n\n\t\tif ( ! Object.prototype.hasOwnProperty.call( left , key ) ) {\n\t\t\tdiffObject[ keyPath ] = { path: keyPath , message: 'does not exist in left-hand side' } ;\n\t\t\tcontinue ;\n\t\t}\n\t}\n\n\treturn Object.keys( diffObject ).length ? diffObject : null ;\n}",
"function compatibility(arr1, arr2) {\n var totalDiff = 0;\n for (let i in arr1) {\n totalDiff = totalDiff + difference(arr1[i], arr2[i])\n }\n return totalDiff\n}",
"function jsonDiff(a, b) {\n const objA = parseJsonOrThrow(a, 'a'),\n objB = parseJsonOrThrow(b, 'b');\n const changes = [];\n compare(objA, objB, changes, []);\n return changes;\n}",
"function subtraction(obj) {\n var { num1, num2 } = obj;\n var total = num1 - num2;\n return total;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function _VirtualDom_diff(x, y)\n{\n\tvar patches = [];\n\t_VirtualDom_diffHelp(x, y, patches, 0);\n\treturn patches;\n}",
"function compareFee(tx1,tx2){\n return tx2.feeBySize-tx1.feeBySize; //Desc by fee\n}",
"function getScaleDiffFn(points1, points2) {\n\n // Find remaining points with predictable position\n var src = [];\n var dst = [];\n var i, j, a, b, matchJ = 0;\n var len1 = points1.length;\n var len2 = points2.length;\n for (i = 0; i < len1; i++) {\n a = points1[i];\n for (j = matchJ; j < len2; j++) {\n b = points2[j];\n if (a.id === b.id) {\n matchJ = j + 1;\n src.push(a);\n dst.push(b);\n break;\n }\n }\n }\n\n if (src.length < 1 || dst.length < 1) {\n // Applying scale difference will not be possible\n return (d => d);\n }\n\n var numProps = Object.keys(src[0])\n .filter(prop => typeof src[0][prop] === 'number')\n .filter(prop => prop !== 'id');\n\n var propDiffs = {};\n var createPropDiffFn = (a0, b0, a, b) => (c0) => (\n b +\n (c0 - b0) *\n (b - a) /\n (b0 - a0)\n );\n var createSimpleDiffFn = (a0, a) => (c0) => (c0 - a0 + a);\n numProps.forEach(prop => {\n var a0 = src[0][prop];\n var a = dst[0][prop];\n for (var i = src.length - 1, b0, b; i > 0; i--) {\n b0 = src[i][prop];\n if (b0 !== a0) {\n b = dst[i][prop];\n propDiffs[prop] = createPropDiffFn(a0, b0, a, b);\n return;\n }\n }\n propDiffs[prop] = createSimpleDiffFn(a0, a);\n });\n\n return (c0) => {\n var c = Object.assign({}, c0);\n numProps.forEach(p => {\n c[p] = propDiffs[p](c0[p]);\n });\n return c;\n };\n}",
"function datediff(results){\n var created = results.created;\n var date = new Date();\n var a = moment(date);\n var b = moment(created);\n var diff = a.diff(b, 'years', true) //[days, years, months, seconds, ...]\n console.log('sadsad', diff); \n if (diff >=1){\n /*a = p(1+ r/100)^n*/\n var a = results.currentprice / results.price;\n var r = (Math.pow(a.toFixed(2), diff.toFixed(2)) * 100) - 100;\n console.log('cagr annual', r); \n results.annual = r;\n }\n else {\n var b = results.currentprice / results.price;\n console.log('das', b);\n var r = (Math.pow(b, diff * 12) * 1200) - 1200;\n console.log('cagr monthly', r);\n results.monthly = r;\n }\n return results;\n}",
"function distanceTo(obj1x, obj1y, obj2x, obj2y) {\n var dx = obj2x- obj1x;\n var dy = obj2y - obj1y;\n return Math.sqrt(dx * dx + dy * dy)\n }",
"function findDifference(a, b) {\n return Math.abs(a.reduce(function(x,y){return x*y;}) - b.reduce(function(x,y){return x*y;}))\n}",
"function diffDates(date1, date0) { // date1 - date0\n if (largeUnit) {\n return diffByUnit(date1, date0, largeUnit);\n }\n else if (newProps.allDay) {\n return diffDay(date1, date0);\n }\n else {\n return diffDayTime(date1, date0);\n }\n }",
"function compareItems(a,b) {\n return a.cost - b.cost\n}",
"function diff(a, b) {\n if (a == null || b == null || isNaN(a) || isNaN(b))\n return undefined;\n else if (a<b)\n return undefined; // int rolled over, ignore the value\n else\n return a - b;\n}",
"function difference(a, b){\n\t\treturn Math.max(a, b) - Math.min(a, b);\n\t}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\t\tif (largeUnit) {\n\t\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t\t}\n\t\t\t\telse if (newProps.allDay) {\n\t\t\t\t\treturn diffDay(date1, date0);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t\t}\n\t\t\t}",
"function diff (start, end) {\r\n // var start_date = new Date(JSON.stringify(start));\r\n // console.log(`start_date: ${start_date}`)\r\n // var end_date = new Date(JSON.stringify(end));\r\n // console.log(`end_date: ${end_date}`)\r\n console.log(`start_date: ${start}`)\r\n console.log(`end_date: ${end}`)\r\n var diff = end.getTime() - start.getTime();\r\n console.log(`diff: ${diff}`)\r\n return diff;\r\n // var diff_h = Math.floor(diff / 1000 / 60 / 60);\r\n // diff -= diff_h * 1000 * 60 * 60;\r\n // var diff_m = Math.floor(diff / 1000 / 60);\r\n // diff -= diff_m * 1000 * 60;\r\n // var diff_s = Math.floor(diff / 1000);\r\n // var diff_ms = diff - diff_s * 1000;\r\n\r\n // return (diff_h <= 9 ? \"0\":\"\") + diff_h + \":\" + (diff_m <= 9 ? \"0\":\"\") + diff_m + \":\" + (diff_s <= 9 ? \"0\":\"\") + diff_s + \":\" + (diff_ms <= 9 ? \"0\":\"\") + diff_ms;\r\n }",
"function byDate(a, b) {\n return a.date - b.date;\n}",
"function calculateObjectDistance(arr){\n let firstObject = { speed: arr[0] };\n let secondObject = { speed: arr[1] };\n let timeInHours = arr[2] / 60 / 60;\n\n return Math.abs(firstObject.speed * timeInHours - secondObject.speed * timeInHours) * 1000;\n}",
"function dateTimeDiffObj(finalDate, initialDate) {\n var ms = Math.abs(finalDate.getTime() - initialDate.getTime())\n var diff = {}\n\n for (diff.years = 0; ms >= 31536000000; diff.years++ , ms -= 31536000000)\n for (diff.months = 0; ms >= 2628000000; diff.months++ , ms -= 2628000000)\n for (diff.days = 0; ms >= 86400000; diff.days++ , ms -= 86400000)\n for (diff.hours = 0; ms >= 3600000; diff.hours++ , ms -= 3600000)\n for (diff.minutes = 0; ms >= 60000; diff.minutes++ , ms -= 60000)\n for (diff.seconds = 0; ms >= 1000; diff.seconds++ , ms -= 1000)\n diff.milliseconds = ms\n return diff\n}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\tif (largeUnit) {\n\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t}\n\t\t\telse if (newProps.allDay) {\n\t\t\t\treturn diffDay(date1, date0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t}\n\t\t}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\tif (largeUnit) {\n\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t}\n\t\t\telse if (newProps.allDay) {\n\t\t\t\treturn diffDay(date1, date0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t}\n\t\t}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\tif (largeUnit) {\n\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t}\n\t\t\telse if (newProps.allDay) {\n\t\t\t\treturn diffDay(date1, date0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t}\n\t\t}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\tif (largeUnit) {\n\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t}\n\t\t\telse if (newProps.allDay) {\n\t\t\t\treturn diffDay(date1, date0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t}\n\t\t}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\tif (largeUnit) {\n\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t}\n\t\t\telse if (newProps.allDay) {\n\t\t\t\treturn diffDay(date1, date0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t}\n\t\t}",
"function diffDates(date1, date0) { // date1 - date0\n\t\t\tif (largeUnit) {\n\t\t\t\treturn diffByUnit(date1, date0, largeUnit);\n\t\t\t}\n\t\t\telse if (newProps.allDay) {\n\t\t\t\treturn diffDay(date1, date0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn diffDayTime(date1, date0);\n\t\t\t}\n\t\t}",
"function diff(a, b, options) {\n if (a === b) {\n return constants.NO_DIFF_MESSAGE;\n }\n\n var aType = (0, _jestGetType2.default)(a);\n var expectedType = aType;\n var omitDifference = false;\n if (aType === 'object' && typeof a.asymmetricMatch === 'function') {\n if (a.$$typeof !== _Symbol$for('jest.asymmetricMatcher')) {\n // Do not know expected type of user-defined asymmetric matcher.\n return null;\n }\n if (typeof a.getExpectedType !== 'function') {\n // For example, expect.anything() matches either null or undefined\n return null;\n }\n expectedType = a.getExpectedType();\n // Primitive types boolean and number omit difference below.\n // For example, omit difference for expect.stringMatching(regexp)\n omitDifference = expectedType === 'string';\n }\n\n if (expectedType !== (0, _jestGetType2.default)(b)) {\n return ' Comparing two different types of values.' + (' Expected ' + _chalk2.default.green(expectedType) + ' but ') + ('received ' + _chalk2.default.red((0, _jestGetType2.default)(b)) + '.');\n }\n\n if (omitDifference) {\n return null;\n }\n\n switch (aType) {\n case 'string':\n return (0, _diff_strings2.default)(a, b, options);\n case 'number':\n case 'boolean':\n return null;\n case 'map':\n return compareObjects(sortMap(a), sortMap(b), options);\n case 'set':\n return compareObjects(sortSet(a), sortSet(b), options);\n default:\n return compareObjects(a, b, options);\n }\n }",
"function diff(a, b, options) {\n if (a === b) {\n return constants.NO_DIFF_MESSAGE;\n }\n\n var aType = (0, _jestGetType2.default)(a);\n var expectedType = aType;\n var omitDifference = false;\n if (aType === 'object' && typeof a.asymmetricMatch === 'function') {\n if (a.$$typeof !== _Symbol$for('jest.asymmetricMatcher')) {\n // Do not know expected type of user-defined asymmetric matcher.\n return null;\n }\n if (typeof a.getExpectedType !== 'function') {\n // For example, expect.anything() matches either null or undefined\n return null;\n }\n expectedType = a.getExpectedType();\n // Primitive types boolean and number omit difference below.\n // For example, omit difference for expect.stringMatching(regexp)\n omitDifference = expectedType === 'string';\n }\n\n if (expectedType !== (0, _jestGetType2.default)(b)) {\n return ' Comparing two different types of values.' + (' Expected ' + _chalk2.default.green(expectedType) + ' but ') + ('received ' + _chalk2.default.red((0, _jestGetType2.default)(b)) + '.');\n }\n\n if (omitDifference) {\n return null;\n }\n\n switch (aType) {\n case 'string':\n return (0, _diff_strings2.default)(a, b, options);\n case 'number':\n case 'boolean':\n return null;\n case 'map':\n return compareObjects(sortMap(a), sortMap(b), options);\n case 'set':\n return compareObjects(sortSet(a), sortSet(b), options);\n default:\n return compareObjects(a, b, options);\n }\n }",
"dateDiffInDays(a, b) {\n // Discard the time and time-zone information.\n const utc1 = Date.UTC(a.getFullYear(), a.getMonth(), a.getDate());\n const utc2 = Date.UTC(b.getFullYear(), b.getMonth(), b.getDate());\n\n return Math.floor((utc2 - utc1) / _MS_PER_DAY);\n }",
"function getDiffInDays(a, b) {\n var _MS_PER_DAY = 1000 * 60 * 60 * 24;\n // Discard the time and time-zone information.\n var utc1 = Date.UTC(a.getFullYear(), a.getMonth(), a.getDate());\n var utc2 = Date.UTC(b.getFullYear(), b.getMonth(), b.getDate());\n\n return Math.floor((utc2 - utc1) / _MS_PER_DAY);\n }",
"function different_obj(obj) {\n var ret = 0;\n var obj1 = obj;\n for (var x in obj) {\n ret += obj1[x];\n }\n return ret;\n}",
"function diff(a, b, options) {\n if (a === b) {\n return constants.NO_DIFF_MESSAGE;\n }\n\n const aType = (0, _jestGetType2.default)(a);\n let expectedType = aType;\n let omitDifference = false;\n if (aType === 'object' && typeof a.asymmetricMatch === 'function') {\n if (a.$$typeof !== Symbol.for('jest.asymmetricMatcher')) {\n // Do not know expected type of user-defined asymmetric matcher.\n return null;\n }\n if (typeof a.getExpectedType !== 'function') {\n // For example, expect.anything() matches either null or undefined\n return null;\n }\n expectedType = a.getExpectedType();\n // Primitive types boolean and number omit difference below.\n // For example, omit difference for expect.stringMatching(regexp)\n omitDifference = expectedType === 'string';\n }\n\n if (expectedType !== (0, _jestGetType2.default)(b)) {\n return (\n ' Comparing two different types of values.' +\n ` Expected ${_chalk2.default.green(expectedType)} but ` +\n `received ${_chalk2.default.red((0, _jestGetType2.default)(b))}.`\n );\n }\n\n if (omitDifference) {\n return null;\n }\n\n switch (aType) {\n case 'string':\n return (0, _diff_strings2.default)(a, b, options);\n case 'number':\n case 'boolean':\n return null;\n case 'map':\n return compareObjects(sortMap(a), sortMap(b), options);\n case 'set':\n return compareObjects(sortSet(a), sortSet(b), options);\n default:\n return compareObjects(a, b, options);\n }\n}",
"sub(a, b) {\r\n this.data[0] = a.data[0] - b.data[0];\r\n this.data[1] = a.data[1] - b.data[1];\r\n this.data[2] = a.data[2] - b.data[2];\r\n this.data[3] = a.data[3] - b.data[3];\r\n this.data[4] = a.data[4] - b.data[4];\r\n this.data[5] = a.data[5] - b.data[5];\r\n this.data[6] = a.data[6] - b.data[6];\r\n this.data[7] = a.data[7] - b.data[7];\r\n this.data[8] = a.data[8] - b.data[8];\r\n this.data[9] = a.data[9] - b.data[9];\r\n }",
"function vectorDiff(a, b) {\r\n return [b[0] - a[0], b[1] - a[1]];\r\n}",
"function compareCalories(personA, personB) {\n\treturn personA.calories - personB.calories;\n}",
"function diff(oldObj, newObj) {\n const V = 'Version';\n const out = {};\n let hasChange = false;\n for(const key in newObj) {\n if(key.substr(key.length - V.length) === V) { continue; }\n\n if(typeof newObj[key] === 'object') {\n if(newObj[key + V]) {\n if(newObj[key + V] !== oldObj[key + V]) {\n out[key] = 1;\n hasChange = true;\n }\n }\n else if(JSON.stringify(oldObj[key]) !== JSON.stringify(newObj[key])) {\n out[key] = 1;\n hasChange = true;\n }\n }\n else if(oldObj[key] !== newObj[key]) {\n out[key] = 1;\n hasChange = true;\n }\n }\n return hasChange && out;\n}",
"function diff(oldObj, newObj) {\n const V = 'Version';\n const out = {};\n let hasChange = false;\n for(const key in newObj) {\n if(key.substr(key.length - V.length) === V) { continue; }\n\n if(typeof newObj[key] === 'object') {\n if(newObj[key + V]) {\n if(newObj[key + V] !== oldObj[key + V]) {\n out[key] = 1;\n hasChange = true;\n }\n }\n else if(JSON.stringify(oldObj[key]) !== JSON.stringify(newObj[key])) {\n out[key] = 1;\n hasChange = true;\n }\n }\n else if(oldObj[key] !== newObj[key]) {\n out[key] = 1;\n hasChange = true;\n }\n }\n return hasChange && out;\n}",
"refDiff() {\n let res = {\n toAdd: [],\n toRemove: [],\n toUpdate: [],\n };\n Object.keys(this.frameNew).forEach((key) => {\n !this.frameOld[key] && res.toAdd.push(this.frameNew[key]);\n this.frameOld[key] && res.toUpdate.push(this.frameNew[key]);\n });\n Object.keys(this.frameOld).forEach((key) => {\n !this.frameNew[key] && res.toRemove.push(this.frameOld[key]);\n });\n return res;\n }",
"function changes(obj1, obj2){\n return _.reduce(obj1, function(result, value, key) {\n return obj2 && _.isEqual(value, obj2[key]) ? result : result.concat(key);\n }, [])\n}",
"function arrayDiff(a1, a2) {\n\tvar totalDiff = 0;\n\ta2.forEach((elem, index) => {\n\t\ttotalDiff += Math.abs(elem - a1[index]);\n\t});\n\treturn totalDiff;\n}",
"function dateDifference (d1, d2) {\n\t\treturn new Date(Math.abs(d2.getTime() - d1.getTime()));\n\t}",
"function Diff(current, next) {\r\n return delta_1.ValueDelta.Diff(current, next);\r\n }",
"function byX(a, b) {\n return b.x - a.x;\n }",
"calcDiff(otherGene) {\n var val = 0;\n for (var i = 0; i < this.code.length; i++) {\n val += (this.code.charCodeAt(i) - otherGene.charCodeAt(i)) * (this.code.charCodeAt(i) - otherGene.charCodeAt(i));\n }\n this.cost = val;\n }"
] |
[
"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.6314761",
"0.6314761",
"0.63054883",
"0.6287868",
"0.6284168",
"0.62665474",
"0.62639785",
"0.6215159",
"0.6177014",
"0.6168767",
"0.6157447",
"0.61388904",
"0.61364627",
"0.6124553",
"0.60823846",
"0.6081208",
"0.60451585",
"0.6011589",
"0.6008515",
"0.60035765",
"0.5998404",
"0.59755826",
"0.5965681",
"0.5944887",
"0.5939114",
"0.5906918",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5885204",
"0.5872704",
"0.5831273",
"0.58198076",
"0.58090603",
"0.5807374",
"0.5807047",
"0.57964736",
"0.57824147",
"0.57760864",
"0.57755244",
"0.5771821",
"0.57571095",
"0.5755304",
"0.5750969",
"0.57334906",
"0.57334906",
"0.57334906",
"0.57334906",
"0.57334906",
"0.57334906",
"0.5731258",
"0.5731258",
"0.5723712",
"0.5714392",
"0.57132995",
"0.5711106",
"0.5705371",
"0.5698668",
"0.5697478",
"0.5665945",
"0.5665945",
"0.5663411",
"0.5650519",
"0.56459117",
"0.56243205",
"0.56200373",
"0.5612402",
"0.56098217"
] |
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 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 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 in React. Please file an issue.');}// Persistence (when unsupported)",
"function shim() {\n invariant(false, 'The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.');\n } // Persistence (when unsupported)",
"function shim() {\n invariant(false, 'The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.');\n } // Persistence (when unsupported)",
"function shim() {\n invariant(false, 'The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.');\n } // Persistence (when unsupported)",
"function shim() {\n {\n {\n throw Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\");\n }\n }\n} // Persistence (when unsupported)",
"function shim() {\n {\n {\n throw Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\");\n }\n }\n} // Persistence (when unsupported)",
"function shim() {\n {\n {\n throw Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\");\n }\n }\n} // Persistence (when unsupported)",
"function shim() {\n {\n {\n throw Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\");\n }\n }\n} // Persistence (when unsupported)",
"function shim() {\n invariant(false, 'The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.');\n }",
"onExport() {\n\t\t// you can do work before running the export using this method\n\t\t// (e.g. re-ordering paths for plotting)\n\t}",
"function shim() {\n (function () {\n {\n {\n throw ReactError(Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\"));\n }\n }\n })();\n } // Persistence (when unsupported)",
"function shim() {\n (function () {\n {\n {\n throw ReactError(Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\"));\n }\n }\n })();\n} // Persistence (when unsupported)",
"function shim() {\n (function () {\n {\n {\n throw ReactError(Error(\"The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.\"));\n }\n }\n })();\n} // Persistence (when unsupported)",
"export() {\n\t\treturn {}\n\t}",
"function shim() {\n (function () {\n {\n {\n throw ReactError(Error('The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.'));\n }\n }\n })();\n}",
"function shim() {\n (function () {\n {\n {\n throw ReactError(Error('The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.'));\n }\n }\n })();\n}",
"function shim() {\n (0, _invariant2.default)(false, 'The current renderer does not support persistence. ' + 'This error is likely caused by a bug in React. ' + 'Please file an issue.');\n}",
"function shim() {\n (0, _invariant2.default)(false, 'The current renderer does not support persistence. ' + 'This error is likely caused by a bug in React. ' + 'Please file an issue.');\n}",
"function ExportSave() {\n Gameboy.Core.exportSave();\n}",
"function saveAndRender() {\n save();\n render();\n}",
"function saveLocalAndRender() {\n localStorage.setItem(\"myLib\", JSON.stringify(myLibrary));\n render(myLibrary);\n}",
"function render() {\n renderRegistry();\n renderDirectory();\n renderOverride();\n}",
"getExportableObject() {\n return {\n \"Likely Diagnoses\": this.state.listA.map((row) => ({\n Name: row.snomed && row.snomed.display ? row.snomed.display : \"...\",\n \"SNOMED Code\": row.snomed && row.snomed.code ? row.snomed.code : \"...\",\n \"Note\": row.note ? row.note : \"...\"\n })),\n \"Critical Diagnoses\": this.state.listB.map((row) => ({\n Name: row.snomed && row.snomed.display ? row.snomed.display : \"...\",\n \"SNOMED Code\": row.snomed && row.snomed.code ? row.snomed.code : \"...\",\n \"Note\": row.note ? row.note : \"...\"\n })),\n Metadata: {\n // bump this every time you change the format of the export.\n // that way we can handle imports properly.\n \"Schema Version\": 1,\n },\n };\n }",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\n\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n\t}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function __export(m) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}",
"function saveAfterLoad () {\n\t\tif (moduleData) {\n\t\t\tmodule.set(moduleData);\n\t\t\tmoduleData = null;\n\n\t\t\tmodule._remains_ = module.dependencies.length;\n\t\t\tmodule.status = LOADED;\n\t\t\tmodule.emit('loaded', this);\n\t\t\tmodule.loadDependencies();\n\t\t} \n\t}",
"function ExportReportData() {\n BindOrReloadPurchaseTable('Export');\n}",
"function Renderer() {}",
"flush()\n {\n this.setObjectRenderer(this.emptyRenderer);\n }",
"function saveNameToExportMap(index,def,exportsMap){if(exportsMap){if(def.exportAs)exportsMap[def.exportAs]=index;if(def.template)exportsMap['']=index;}}",
"onExport(e) {\n e.preventDefault();\n\n if (!e.target.dataset.action) {\n return;\n }\n\n switch (e.target.dataset.action) {\n case 'copy':\n this.onCopyButtonClick();\n break;\n case 'open-viewer':\n this.sendJSONReport();\n break;\n case 'print':\n this.expandDetailsWhenPrinting();\n window.print();\n break;\n case 'save-json': {\n const jsonStr = JSON.stringify(this.json, null, 2);\n this._saveFile(new Blob([jsonStr], {type: 'application/json'}));\n break;\n }\n case 'save-html': {\n let htmlStr = '';\n\n // Since Viewer generates its page HTML dynamically from report JSON,\n // run the ReportGenerator. For everything else, the page's HTML is\n // already the final product.\n if (e.target.dataset.context !== 'viewer') {\n htmlStr = document.documentElement.outerHTML;\n } else {\n const reportGenerator = new ReportGenerator();\n htmlStr = reportGenerator.generateHTML(this.json, 'cli');\n }\n\n try {\n this._saveFile(new Blob([htmlStr], {type: 'text/html'}));\n } catch (err) {\n logger.error('Could not export as HTML. ' + err.message);\n }\n break;\n }\n }\n\n this.closeExportDropdown();\n document.removeEventListener('keydown', this.onKeyDown);\n }",
"function saveStorage() {\n store.set(planner.list.modules, modules.toJSON());\n }",
"function _Exporter(babylonScene, options) {\r\n /*\r\n * Specifies if root Babylon empty nodes that act as a coordinate space transform should be included in export\r\n */\r\n this._includeCoordinateSystemConversionNodes = false;\r\n this._extensions = {};\r\n this._glTF = {\r\n asset: { generator: \"BabylonJS\", version: \"2.0\" }\r\n };\r\n this._babylonScene = babylonScene;\r\n this._bufferViews = [];\r\n this._accessors = [];\r\n this._meshes = [];\r\n this._scenes = [];\r\n this._nodes = [];\r\n this._images = [];\r\n this._materials = [];\r\n this._materialMap = [];\r\n this._textures = [];\r\n this._samplers = [];\r\n this._animations = [];\r\n this._imageData = {};\r\n this._options = options || {};\r\n this._animationSampleRate = options && options.animationSampleRate ? options.animationSampleRate : 1 / 60;\r\n this._includeCoordinateSystemConversionNodes = options && options.includeCoordinateSystemConversionNodes ? true : false;\r\n this._glTFMaterialExporter = new _GLTFMaterialExporter(this);\r\n this._loadExtensions();\r\n }",
"function Render() {\n ClearScreen();\n RenderEnergeticDroplets();\n ResetRenderingConditions();\n}",
"afterRender() { }",
"afterRender() { }",
"function RendererType2(){}",
"processPresenter() {\n this.exportDict = this.getExportDict()\n }",
"function __export(m) {\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n}",
"function __export(m) {\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n}"
] |
[
"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.53925896",
"0.5349754",
"0.53019285",
"0.52770185",
"0.5275091",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.51660216",
"0.5137303",
"0.5137303",
"0.5137303",
"0.5137303",
"0.5137303",
"0.5137303",
"0.5137303",
"0.5137303",
"0.5131968",
"0.512798",
"0.51223147",
"0.51100576",
"0.51080924",
"0.5107514",
"0.5098896",
"0.50971407",
"0.50904906",
"0.5086873",
"0.5086873",
"0.5082772",
"0.50784546",
"0.5078219",
"0.5078219"
] |
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_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 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) {\n // 加上偏移量以避免10ms以内的与NoWork冲突\n return (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);}",
"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 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\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 getExpirationInSeconds () {\n const nowInSeconds = Math.floor(Date.now() / 1000)\n\n return {\n iat: nowInSeconds,\n exp: nowInSeconds + 30\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 }",
"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 calculateExpire() {\n var expiresIn = Math.round((((messageObject.expiresOn-new Date(Date.now())) % 86400000) % 3600000) / 60000); // minutes\n console.log(expiresIn);\n return expiresIn\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 MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - ((ms / UNIT_SIZE) | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always subtract from the offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n }",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}",
"function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\n}"
] |
[
"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.64938873",
"0.64938873",
"0.64938873",
"0.64938873",
"0.6479297",
"0.6379728",
"0.6379728",
"0.6379728",
"0.6379728",
"0.6379728",
"0.6379728",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934",
"0.63776934"
] |
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 buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n // Don't touching the subtree's expiration time, which has not changed.\n workInProgress.childExpirationTime = current.childExpirationTime;\n if (pendingProps !== current.pendingProps) {\n // This fiber has new props.\n workInProgress.expirationTime = expirationTime;\n } else {\n // This fiber's props have not changed.\n workInProgress.expirationTime = current.expirationTime;\n }\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function InlineWorkerFactory(){\n\t}",
"function createWorkInProgress(current, pendingProps) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n // Needed because Blocks store data on type.\n workInProgress.type = current.type;\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.flags = NoFlags;\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n workInProgress.childLanes = current.childLanes;\n workInProgress.lanes = current.lanes;\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n // Clone the dependencies object. This is mutated during the render phase, so\n // it cannot be shared with the current fiber.\n var currentDependencies = current.dependencies;\n workInProgress.dependencies = currentDependencies === null ? null : {\n lanes: currentDependencies.lanes,\n firstContext: currentDependencies.firstContext\n };\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n {\n workInProgress._debugNeedsRemount = current._debugNeedsRemount;\n switch (workInProgress.tag) {\n case IndeterminateComponent:\n case FunctionComponent:\n case SimpleMemoComponent:\n workInProgress.type = resolveFunctionForHotReloading(current.type);\n break;\n case ClassComponent:\n workInProgress.type = resolveClassForHotReloading(current.type);\n break;\n case ForwardRef:\n workInProgress.type = resolveForwardRefForHotReloading(current.type);\n break;\n }\n }\n return workInProgress;\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n }\n else {\n workInProgress.pendingProps = pendingProps;\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n workInProgress.expirationTime = expirationTime;\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n return workInProgress;\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // Clone the dependencies object. This is mutated during the render phase, so\n // it cannot be shared with the current fiber.\n var currentDependencies = current.dependencies;\n workInProgress.dependencies = currentDependencies === null ? null : {\n expirationTime: currentDependencies.expirationTime,\n firstContext: currentDependencies.firstContext,\n responders: currentDependencies.responders\n };\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n {\n workInProgress._debugNeedsRemount = current._debugNeedsRemount;\n switch (workInProgress.tag) {\n case IndeterminateComponent:\n case FunctionComponent:\n case SimpleMemoComponent:\n workInProgress.type = resolveFunctionForHotReloading(current.type);\n break;\n case ClassComponent:\n workInProgress.type = resolveClassForHotReloading(current.type);\n break;\n case ForwardRef:\n workInProgress.type = resolveForwardRefForHotReloading(current.type);\n break;\n default:\n break;\n }\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // Clone the dependencies object. This is mutated during the render phase, so\n // it cannot be shared with the current fiber.\n var currentDependencies = current.dependencies;\n workInProgress.dependencies = currentDependencies === null ? null : {\n expirationTime: currentDependencies.expirationTime,\n firstContext: currentDependencies.firstContext,\n responders: currentDependencies.responders\n };\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n {\n workInProgress._debugNeedsRemount = current._debugNeedsRemount;\n switch (workInProgress.tag) {\n case IndeterminateComponent:\n case FunctionComponent:\n case SimpleMemoComponent:\n workInProgress.type = resolveFunctionForHotReloading(current.type);\n break;\n case ClassComponent:\n workInProgress.type = resolveClassForHotReloading(current.type);\n break;\n case ForwardRef:\n workInProgress.type = resolveForwardRefForHotReloading(current.type);\n break;\n default:\n break;\n }\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n\t var workInProgress = current.alternate;\n\t if (workInProgress === null) {\n\t // We use a double buffering pooling technique because we know that we'll\n\t // only ever need at most two versions of a tree. We pool the \"other\" unused\n\t // node that we're free to reuse. This is lazily created to avoid allocating\n\t // extra objects for things that are never updated. It also allow us to\n\t // reclaim the extra memory if needed.\n\t workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n\t workInProgress.type = current.type;\n\t workInProgress.stateNode = current.stateNode;\n\t\n\t {\n\t // DEV-only fields\n\t workInProgress._debugID = current._debugID;\n\t workInProgress._debugSource = current._debugSource;\n\t workInProgress._debugOwner = current._debugOwner;\n\t }\n\t\n\t workInProgress.alternate = current;\n\t current.alternate = workInProgress;\n\t } else {\n\t // We already have an alternate.\n\t // Reset the effect tag.\n\t workInProgress.effectTag = NoEffect;\n\t\n\t // The effect list is no longer valid.\n\t workInProgress.nextEffect = null;\n\t workInProgress.firstEffect = null;\n\t workInProgress.lastEffect = null;\n\t }\n\t\n\t workInProgress.expirationTime = expirationTime;\n\t workInProgress.pendingProps = pendingProps;\n\t\n\t workInProgress.child = current.child;\n\t workInProgress.memoizedProps = current.memoizedProps;\n\t workInProgress.memoizedState = current.memoizedState;\n\t workInProgress.updateQueue = current.updateQueue;\n\t\n\t // These will be overridden during the parent's reconciliation\n\t workInProgress.sibling = current.sibling;\n\t workInProgress.index = current.index;\n\t workInProgress.ref = current.ref;\n\t\n\t return workInProgress;\n\t}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n workInProgress._debugHookTypes = current._debugHookTypes;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.contextDependencies = current.contextDependencies;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = 0;\n }\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseTime = current.selfBaseTime;\n workInProgress.treeBaseTime = current.treeBaseTime;\n }\n\n return workInProgress;\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseTime = current.selfBaseTime;\n workInProgress.treeBaseTime = current.treeBaseTime;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseTime = current.selfBaseTime;\n workInProgress.treeBaseTime = current.treeBaseTime;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseTime = current.selfBaseTime;\n workInProgress.treeBaseTime = current.treeBaseTime;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseTime = current.selfBaseTime;\n workInProgress.treeBaseTime = current.treeBaseTime;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n workInProgress.elementType = current.elementType;\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n workInProgress.pendingProps = pendingProps;\n\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n\n if (enableProfilerTimer) {\n // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n // This prevents time from endlessly accumulating in new commits.\n // This has the downside of resetting values for different priority renders,\n // But works for yielding (the common case) and should support resuming.\n workInProgress.actualDuration = 0;\n workInProgress.actualStartTime = -1;\n }\n }\n\n workInProgress.childExpirationTime = current.childExpirationTime;\n workInProgress.expirationTime = current.expirationTime;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n workInProgress.firstContextDependency = current.firstContextDependency;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n if (enableProfilerTimer) {\n workInProgress.selfBaseDuration = current.selfBaseDuration;\n workInProgress.treeBaseDuration = current.treeBaseDuration;\n }\n\n return workInProgress;\n}",
"function Fiber(context2d, params, env, genParams) {\r\n _super.call(this, context2d, params, env, genParams);\r\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double buffering pooling technique because we know that we'll\n // only ever need at most two versions of a tree. We pool the \"other\" unused\n // node that we're free to reuse. This is lazily created to avoid allocating\n // extra objects for things that are never updated. It also allow us to\n // reclaim the extra memory if needed.\n workInProgress = createFiber(current.tag, current.key, current.internalContextTag);\n workInProgress.type = current.type;\n workInProgress.stateNode = current.stateNode;\n\n {\n // DEV-only fields\n workInProgress._debugID = current._debugID;\n workInProgress._debugSource = current._debugSource;\n workInProgress._debugOwner = current._debugOwner;\n }\n\n workInProgress.alternate = current;\n current.alternate = workInProgress;\n } else {\n // We already have an alternate.\n // Reset the effect tag.\n workInProgress.effectTag = NoEffect;\n\n // The effect list is no longer valid.\n workInProgress.nextEffect = null;\n workInProgress.firstEffect = null;\n workInProgress.lastEffect = null;\n }\n\n workInProgress.expirationTime = expirationTime;\n workInProgress.pendingProps = pendingProps;\n\n workInProgress.child = current.child;\n workInProgress.memoizedProps = current.memoizedProps;\n workInProgress.memoizedState = current.memoizedState;\n workInProgress.updateQueue = current.updateQueue;\n\n // These will be overridden during the parent's reconciliation\n workInProgress.sibling = current.sibling;\n workInProgress.index = current.index;\n workInProgress.ref = current.ref;\n\n return workInProgress;\n}",
"function newFiberId() {\n return FiberID(new Date().getTime(), _fiberCounter.getAndIncrement());\n}",
"function Fibonacci() {\n\t// Create a new fiber which yields sequential Fibonacci numbers\n\tvar fiber = Fiber(function() {\n\t\tFiber.yield(0); // F(0) -> 0\n\t\tvar prev = 0, curr = 1;\n\t\twhile (true) {\n\t\t\tFiber.yield(curr);\n\t\t\tvar tmp = prev + curr;\n\t\t\tprev = curr;\n\t\t\tcurr = tmp;\n\t\t}\n\t});\n\t// Return a bound handle to `run` on this fiber\n\treturn fiber.run.bind(fiber);\n}",
"function Fibonacci() {\n\t// Create a new fiber which yields sequential Fibonacci numbers\n\tvar fiber = Fiber(function() {\n\t\tFiber.yield(0); // F(0) -> 0\n\t\tvar prev = 0, curr = 1;\n\t\twhile (true) {\n\t\t\tFiber.yield(curr);\n\t\t\tvar tmp = prev + curr;\n\t\t\tprev = curr;\n\t\t\tcurr = tmp;\n\t\t}\n\t});\n\t// Return a bound handle to `run` on this fiber\n\treturn fiber.run.bind(fiber);\n}",
"function createFiberRoot(containerInfo,isConcurrent,hydrate){// Cyclic construction. This cheats the type system right now because\n// stateNode is any.\nvar uninitializedFiber=createHostRootFiber(isConcurrent);var root=void 0;if(enableSchedulerTracing){root={current:uninitializedFiber,containerInfo:containerInfo,pendingChildren:null,earliestPendingTime:NoWork,latestPendingTime:NoWork,earliestSuspendedTime:NoWork,latestSuspendedTime:NoWork,latestPingedTime:NoWork,pingCache:null,didError:false,pendingCommitExpirationTime:NoWork,finishedWork:null,timeoutHandle:noTimeout,context:null,pendingContext:null,hydrate:hydrate,nextExpirationTimeToWorkOn:NoWork,expirationTime:NoWork,firstBatch:null,nextScheduledRoot:null,interactionThreadID:tracing.unstable_getThreadID(),memoizedInteractions:new Set(),pendingInteractionMap:new Map()};}else{root={current:uninitializedFiber,containerInfo:containerInfo,pendingChildren:null,pingCache:null,earliestPendingTime:NoWork,latestPendingTime:NoWork,earliestSuspendedTime:NoWork,latestSuspendedTime:NoWork,latestPingedTime:NoWork,didError:false,pendingCommitExpirationTime:NoWork,finishedWork:null,timeoutHandle:noTimeout,context:null,pendingContext:null,hydrate:hydrate,nextExpirationTimeToWorkOn:NoWork,expirationTime:NoWork,firstBatch:null,nextScheduledRoot:null};}uninitializedFiber.stateNode=root;// The reason for the way the Flow types are structured in this file,\n// Is to avoid needing :any casts everywhere interaction tracing fields are used.\n// Unfortunately that requires an :any cast for non-interaction tracing capable builds.\n// $FlowFixMe Remove this :any cast and replace it with something better.\nreturn root;}",
"function createFiberRoot(containerInfo,isConcurrent,hydrate){// Cyclic construction. This cheats the type system right now because\n// stateNode is any.\nvar uninitializedFiber=createHostRootFiber(isConcurrent);var root=void 0;if(enableSchedulerTracing){root={current:uninitializedFiber,containerInfo:containerInfo,pendingChildren:null,earliestPendingTime:NoWork,latestPendingTime:NoWork,earliestSuspendedTime:NoWork,latestSuspendedTime:NoWork,latestPingedTime:NoWork,pingCache:null,didError:false,pendingCommitExpirationTime:NoWork,finishedWork:null,timeoutHandle:noTimeout,context:null,pendingContext:null,hydrate:hydrate,nextExpirationTimeToWorkOn:NoWork,expirationTime:NoWork,firstBatch:null,nextScheduledRoot:null,interactionThreadID:tracing.unstable_getThreadID(),memoizedInteractions:new Set(),pendingInteractionMap:new Map()};}else{root={current:uninitializedFiber,containerInfo:containerInfo,pendingChildren:null,pingCache:null,earliestPendingTime:NoWork,latestPendingTime:NoWork,earliestSuspendedTime:NoWork,latestSuspendedTime:NoWork,latestPingedTime:NoWork,didError:false,pendingCommitExpirationTime:NoWork,finishedWork:null,timeoutHandle:noTimeout,context:null,pendingContext:null,hydrate:hydrate,nextExpirationTimeToWorkOn:NoWork,expirationTime:NoWork,firstBatch:null,nextScheduledRoot:null};}uninitializedFiber.stateNode=root;// The reason for the way the Flow types are structured in this file,\n// Is to avoid needing :any casts everywhere interaction tracing fields are used.\n// Unfortunately that requires an :any cast for non-interaction tracing capable builds.\n// $FlowFixMe Remove this :any cast and replace it with something better.\nreturn root;}",
"createLaxFiber(context, func) {\n if (typeof context !== 'object' && context !== this.LAX_EMPTY_CONTEXT) {\n throw new Error(this.Errors.ERR_NO_CONTEXT.replace('{num}', 'first'));\n }\n\n if (typeof func !== 'function') {\n throw new Error(this.Errors.ERR_NO_FUNCTION.replace('{num}', 'second'));\n }\n\n // Get the matching context\n let ctext = context === this.LAX_EMPTY_CONTEXT ? null : context;\n\n // Drop context and func from arguments\n let args = __arguments.drop(arguments, 2);\n\n // Run\n //noinspection JSUnresolvedFunction\n Fiber(function () {\n func.apply(ctext, args);\n }).run();\n }",
"function Fiber(util, supervisor, aff) {\n // Monotonically increasing tick, increased on each asynchronous turn.\n var runTick = 0;\n\n // The current branch of the state machine.\n var status = SUSPENDED;\n\n // The current point of interest for the state machine branch.\n var step = aff; // Successful step\n var fail = null; // Failure step\n var interrupt = null; // Asynchronous interrupt\n\n // Stack of continuations for the current fiber.\n var bhead = null;\n var btail = null;\n\n // Stack of attempts and finalizers for error recovery. Every `Cons` is also\n // tagged with current `interrupt` state. We use this to track which items\n // should be ignored or evaluated as a result of a kill.\n var attempts = null;\n\n // A special state is needed for Bracket, because it cannot be killed. When\n // we enter a bracket acquisition or finalizer, we increment the counter,\n // and then decrement once complete.\n var bracketCount = 0;\n\n // Each join gets a new id so they can be revoked.\n var joinId = 0;\n var joins = null;\n var rethrow = true;\n\n // Each invocation of `run` requires a tick. When an asynchronous effect is\n // resolved, we must check that the local tick coincides with the fiber\n // tick before resuming. This prevents multiple async continuations from\n // accidentally resuming the same fiber. A common example may be invoking\n // the provided callback in `makeAff` more than once, but it may also be an\n // async effect resuming after the fiber was already cancelled.\n function run(localRunTick) {\n var tmp, result, attempt;\n while (true) {\n tmp = null;\n result = null;\n attempt = null;\n\n switch (status) {\n case STEP_BIND:\n status = CONTINUE;\n step = bhead(step);\n if (btail === null) {\n bhead = null;\n } else {\n bhead = btail._1;\n btail = btail._2;\n }\n break;\n\n case STEP_RESULT:\n if (util.isLeft(step)) {\n status = RETURN;\n fail = step;\n step = null;\n } else if (bhead === null) {\n status = RETURN;\n } else {\n status = STEP_BIND;\n step = util.fromRight(step);\n }\n break;\n\n case CONTINUE:\n switch (step.tag) {\n case BIND:\n if (bhead) {\n btail = new Aff(CONS, bhead, btail);\n }\n bhead = step._2;\n status = CONTINUE;\n step = step._1;\n break;\n\n case PURE:\n if (bhead === null) {\n status = RETURN;\n step = util.right(step._1);\n } else {\n status = STEP_BIND;\n step = step._1;\n }\n break;\n\n case SYNC:\n status = STEP_RESULT;\n step = runSync(util.left, util.right, step._1);\n break;\n\n case ASYNC:\n status = PENDING;\n step = runAsync(util.left, step._1, function (result) {\n return function () {\n if (runTick !== localRunTick) {\n return;\n }\n runTick++;\n Scheduler.enqueue(function () {\n // It's possible to interrupt the fiber between enqueuing and\n // resuming, so we need to check that the runTick is still\n // valid.\n if (runTick !== localRunTick + 1) {\n return;\n }\n status = STEP_RESULT;\n step = result;\n run(runTick);\n });\n };\n });\n return;\n\n case THROW:\n status = RETURN;\n fail = util.left(step._1);\n step = null;\n break;\n\n // Enqueue the Catch so that we can call the error handler later on\n // in case of an exception.\n case CATCH:\n if (bhead === null) {\n attempts = new Aff(CONS, step, attempts, interrupt);\n } else {\n attempts = new Aff(CONS, step, new Aff(CONS, new Aff(RESUME, bhead, btail), attempts, interrupt), interrupt);\n }\n bhead = null;\n btail = null;\n status = CONTINUE;\n step = step._1;\n break;\n\n // Enqueue the Bracket so that we can call the appropriate handlers\n // after resource acquisition.\n case BRACKET:\n bracketCount++;\n if (bhead === null) {\n attempts = new Aff(CONS, step, attempts, interrupt);\n } else {\n attempts = new Aff(CONS, step, new Aff(CONS, new Aff(RESUME, bhead, btail), attempts, interrupt), interrupt);\n }\n bhead = null;\n btail = null;\n status = CONTINUE;\n step = step._1;\n break;\n\n case FORK:\n status = STEP_RESULT;\n tmp = Fiber(util, supervisor, step._2);\n if (supervisor) {\n supervisor.register(tmp);\n }\n if (step._1) {\n tmp.run();\n }\n step = util.right(tmp);\n break;\n\n case SEQ:\n status = CONTINUE;\n step = sequential(util, supervisor, step._1);\n break;\n }\n break;\n\n case RETURN:\n bhead = null;\n btail = null;\n // If the current stack has returned, and we have no other stacks to\n // resume or finalizers to run, the fiber has halted and we can\n // invoke all join callbacks. Otherwise we need to resume.\n if (attempts === null) {\n status = COMPLETED;\n step = interrupt || fail || step;\n } else {\n // The interrupt status for the enqueued item.\n tmp = attempts._3;\n attempt = attempts._1;\n attempts = attempts._2;\n\n switch (attempt.tag) {\n // We cannot recover from an interrupt. Otherwise we should\n // continue stepping, or run the exception handler if an exception\n // was raised.\n case CATCH:\n // We should compare the interrupt status as well because we\n // only want it to apply if there has been an interrupt since\n // enqueuing the catch.\n if (interrupt && interrupt !== tmp) {\n status = RETURN;\n } else if (fail) {\n status = CONTINUE;\n step = attempt._2(util.fromLeft(fail));\n fail = null;\n }\n break;\n\n // We cannot resume from an interrupt or exception.\n case RESUME:\n // As with Catch, we only want to ignore in the case of an\n // interrupt since enqueing the item.\n if (interrupt && interrupt !== tmp || fail) {\n status = RETURN;\n } else {\n bhead = attempt._1;\n btail = attempt._2;\n status = STEP_BIND;\n step = util.fromRight(step);\n }\n break;\n\n // If we have a bracket, we should enqueue the handlers,\n // and continue with the success branch only if the fiber has\n // not been interrupted. If the bracket acquisition failed, we\n // should not run either.\n case BRACKET:\n bracketCount--;\n if (fail === null) {\n result = util.fromRight(step);\n // We need to enqueue the Release with the same interrupt\n // status as the Bracket that is initiating it.\n attempts = new Aff(CONS, new Aff(RELEASE, attempt._2, result), attempts, tmp);\n // We should only coninue as long as the interrupt status has not changed or\n // we are currently within a non-interruptable finalizer.\n if (interrupt === tmp || bracketCount > 0) {\n status = CONTINUE;\n step = attempt._3(result);\n }\n }\n break;\n\n // Enqueue the appropriate handler. We increase the bracket count\n // because it should not be cancelled.\n case RELEASE:\n bracketCount++;\n attempts = new Aff(CONS, new Aff(FINALIZED, step, fail), attempts, interrupt);\n status = CONTINUE;\n // It has only been killed if the interrupt status has changed\n // since we enqueued the item.\n if (interrupt && interrupt !== tmp) {\n step = attempt._1.killed(util.fromLeft(interrupt))(attempt._2);\n } else if (fail) {\n step = attempt._1.failed(util.fromLeft(fail))(attempt._2);\n } else {\n step = attempt._1.completed(util.fromRight(step))(attempt._2);\n }\n fail = null;\n break;\n\n case FINALIZER:\n bracketCount++;\n attempts = new Aff(CONS, new Aff(FINALIZED, step, fail), attempts, interrupt);\n status = CONTINUE;\n step = attempt._1;\n break;\n\n case FINALIZED:\n bracketCount--;\n status = RETURN;\n step = attempt._1;\n fail = attempt._2;\n break;\n }\n }\n break;\n\n case COMPLETED:\n for (var k in joins) {\n if (joins.hasOwnProperty(k)) {\n rethrow = rethrow && joins[k].rethrow;\n runEff(joins[k].handler(step));\n }\n }\n joins = null;\n // If we have an interrupt and a fail, then the thread threw while\n // running finalizers. This should always rethrow in a fresh stack.\n if (interrupt && fail) {\n setTimeout(function () {\n throw util.fromLeft(fail);\n }, 0);\n // If we have an unhandled exception, and no other fiber has joined\n // then we need to throw the exception in a fresh stack.\n } else if (util.isLeft(step) && rethrow) {\n setTimeout(function () {\n // Guard on reathrow because a completely synchronous fiber can\n // still have an observer which was added after-the-fact.\n if (rethrow) {\n throw util.fromLeft(step);\n }\n }, 0);\n }\n return;\n case SUSPENDED:\n status = CONTINUE;\n break;\n case PENDING: return;\n }\n }\n }\n\n function onComplete(join) {\n return function () {\n if (status === COMPLETED) {\n rethrow = rethrow && join.rethrow;\n join.handler(step)();\n return function () {};\n }\n\n var jid = joinId++;\n joins = joins || {};\n joins[jid] = join;\n\n return function() {\n if (joins !== null) {\n delete joins[jid];\n }\n };\n };\n }\n\n function kill(error, cb) {\n return function () {\n if (status === COMPLETED) {\n cb(util.right(void 0))();\n return function () {};\n }\n\n var canceler = onComplete({\n rethrow: false,\n handler: function (/* unused */) {\n return cb(util.right(void 0));\n }\n })();\n\n switch (status) {\n case SUSPENDED:\n interrupt = util.left(error);\n status = COMPLETED;\n step = interrupt;\n run(runTick);\n break;\n case PENDING:\n if (interrupt === null) {\n interrupt = util.left(error);\n }\n if (bracketCount === 0) {\n if (status === PENDING) {\n attempts = new Aff(CONS, new Aff(FINALIZER, step(error)), attempts, interrupt);\n }\n status = RETURN;\n step = null;\n fail = null;\n run(++runTick);\n }\n break;\n default:\n if (interrupt === null) {\n interrupt = util.left(error);\n }\n if (bracketCount === 0) {\n status = RETURN;\n step = null;\n fail = null;\n }\n }\n\n return canceler;\n };\n }\n\n function join(cb) {\n return function () {\n var canceler = onComplete({\n rethrow: false,\n handler: cb\n })();\n if (status === SUSPENDED) {\n run(runTick);\n }\n return canceler;\n };\n }\n\n return {\n kill: kill,\n join: join,\n onComplete: onComplete,\n isSuspended: function () {\n return status === SUSPENDED;\n },\n run: function () {\n if (status === SUSPENDED) {\n if (!Scheduler.isDraining()) {\n Scheduler.enqueue(function () {\n run(runTick);\n });\n } else {\n run(runTick);\n }\n }\n }\n };\n }"
] |
[
"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.5643758",
"0.5633511",
"0.5633312",
"0.5633312",
"0.56136906",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5612424",
"0.5611189",
"0.5609434",
"0.5609434",
"0.5604888",
"0.5604888",
"0.5604888",
"0.5604888",
"0.56043625",
"0.56043625",
"0.56043625",
"0.56043625",
"0.56043625",
"0.56043625",
"0.56043625",
"0.56043625",
"0.56043625",
"0.55982053",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5596114",
"0.5562668",
"0.54921514",
"0.54921514",
"0.5392008",
"0.5392008",
"0.5322467",
"0.5307912"
] |
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() {}",
"function InternalBreakpointState() {}",
"function prologuetoBattleMapStateChangeStarter() {\n activeGameState.battleMap1ActiveState = battleMap1ActiveState;\n\n store.dispatch( {\n type: DIFFICULTY_CHANGE,\n payload: {\n activeGameState: activeGameState,\n towerTypes: towerTypes\n }\n });\n\n store.dispatch( {\n type: MENU_CHANGE,\n payload: {\n currentPage: 'BATTLE_MAP',\n previousPage: 'PROLOGUE'\n }\n });\n store.dispatch( {\n type: BATTLE_ON,\n payload: {\n battleState: 'BATTLE_ON',\n activeGameState: activeGameState\n }\n });\n }",
"function Particulate() {\n this.old = 'empty';\n this.fresh = 'empty';\n }",
"updateFighterStatus(){ logMessage( 'class FightState updateFighterStatus: do nothing', 'logUpdateFighterStatus' ); }",
"function battleMapTowerBuildStateChangeStarter(gold) {\n let tempGamestate = store.getState().activeGameState;\n tempGamestate.battleMap1ActiveState.gold = gold;\n\n store.dispatch( {\n type: BUILD_START,\n payload: {\n activeGameState: tempGamestate\n }\n });\n }",
"function initWarmUps()\n{\n for(i = 0; i < 12; i++)\n {\n warmUps[i] = false;\n }\n\n}",
"if (newFirstUpdate === null) {\n // This is the first skipped update. It will be the first update in\n // the new list.\n newFirstUpdate = update;\n // Since this is the first update that was skipped, the current result\n // is the new base state.\n newBaseState = resultState;\n }",
"function proactiveStalenessCleaner() {\n console.log(\"Sweeping the cache for old entries\");\n cache.prune();\n}",
"toHold() {\n return {\n compare(actual) {\n /* global window */\n const quiet = window && !/verbose=true/.test(window.location.search);\n\n const r = jsc.check(actual, { quiet });\n\n const pass = r === true;\n let message = '';\n\n if (pass) {\n message = 'Expected property not to hold.';\n } else {\n message = `Expected property to hold. Counterexample found: ${r.counterexamplestr}`;\n }\n\n return {\n pass,\n message,\n };\n },\n };\n }",
"sharpen(){cov_14q771vu2z.f[3]++;cov_14q771vu2z.s[22]++;if(this.length===0){cov_14q771vu2z.b[6][0]++;cov_14q771vu2z.s[23]++;throw new Error('Your pencil has a length and durability of 0! You need a new one!');}else{cov_14q771vu2z.b[6][1]++;cov_14q771vu2z.s[24]++;this.pencilDurability=40000;cov_14q771vu2z.s[25]++;this.length-=1;}}",
"get IsInWork() {\n return this.#isWorking\n }",
"gotPowerup() {\n if (this.status === \"small\") {\n return this.status = \"Big\"\n\n }\n if (this.status === \"Big\") {\n return this.status = \"Power up\"\n\n }\n if (this.status === \"Power up\") {\n return this.hasStar = true\n }\n }",
"get reconfigured() { return this.startState.config != this.state.config; }",
"pushBlockPropertiesToTrials() {\n // Update trials with new info\n const blocks = this.blocks;\n this.trials.forEach(t => {\n if(t.blockType === \"core\") {\n for(let k in blocks[t.block]) {\n if(blocks[t.block].hasOwnProperty(k)) {\n t[k] = blocks[t.block][k];\n }\n }\n }\n })\n }",
"if (newFirstCapturedUpdate === null) {\n // This is the first skipped captured update. It will be the first\n // update in the new list.\n newFirstCapturedUpdate = update;\n // If this is the first update that was skipped, the current result is\n // the new base state.\n if (newFirstUpdate === null) {\n newBaseState = resultState;\n }\n }",
"_uiPropertyUnmortgaged (data) {\n this.uiService.propertyUnmortgaged(data.squares);\n\n // mark each square as unmortgaged\n data.squares.forEach(squareId => {\n this.mapData.squares[squareId].isMortgaged = false\n })\n\n // remove funds for paying off mortgage from player\n this.playersData[data.playerId].removeFunds(data.cash);\n\n this.uiService.updatePlayerList({\n name: data.playerId,\n cash: this.playersData[data.playerId].getCurrentCash(),\n squares: this.playersData[data.playerId].getCurrentSquares()\n });\n }",
"setPrecUnmuteVal(value) { // prev, new \n let precUnmuteVal = this.getSetting(\"prec-unmute-val\"); \n if (value != \"true\" && value != \"false\") {\n this.logColouredText(\"blue\", \"PUM: \" + precUnmuteVal); \n return precUnmuteVal; \n } else {\n this.setSetting(\"prec-unmute-val\", value); \n /*\n I done this so the unit test wouldn't fail [not good], but I'd like to ensure the number of read/writes are as small as possible \n */ \n precUnmuteVal = this.getSetting(\"prec-unmute-val\"); \n // console.log(precUnmuteVal)\n this.logColouredText(\"blue\", \"[changes made] PUM: \" + value); \n // console.log(precUnmuteVal); \n return precUnmuteVal; \n } \n }",
"function hackTheSystem() {\n if (isSystemHacked === false) {\n isSystemHacked = true;\n const me = {\n firstName: \"Sasia\",\n lastName: \"Dagnoli\",\n house: \"Gryffindor\",\n expelled: false,\n bloodStatus: \"Pureblood\",\n inquisitorial: false,\n prefect: false,\n };\n\n Object.defineProperty(me, \"expelled\", { writable: false });\n arrayOfStudentObjects.push(me);\n\n arrayOfStudentObjects.forEach((student) => {\n if (student.bloodStatus === \"Halfblood\") {\n student.bloodStatus = \"Pureblood\";\n } else if (student.bloodStatus === \"Mudblood\") {\n student.bloodStatus = \"Pureblood\";\n } else {\n let randomBloodStatus = Math.floor(Math.random() * 3 + 1);\n if (randomBloodStatus === 1) {\n student.bloodStatus = \"Halfblood\";\n } else if (randomBloodStatus === 2) {\n student.bloodStatus = \"Pureblood\";\n } else {\n student.bloodStatus = \"Mudblood\";\n }\n }\n });\n\n buildList();\n console.log(arrayOfStudentObjects);\n }\n}",
"function battleMapRestartStateChangeStarter() {\n getJsonData('xp_webtech_krf_battle_map_1.json', function(response) {\n battleMap1ActiveState = response;\n activeGameState.battleMap1ActiveState = battleMap1ActiveState;\n\n store.dispatch( {\n type: RESTART,\n payload: {\n activeGameState: activeGameState\n }\n });\n });\n }",
"getFullState () {\n return {\n buzzer: this.buzzer,\n players: this.getPlayers(),\n questions: this.formatQuestions(),\n state: this.state\n }\n }",
"startSkipUpdates() {\n\t\tthis.skipUpdates_ = true;\n\t}",
"private internal function m248() {}",
"getFullState () {\n return {\n buzzer: this.buzzer,\n players: this.getPlayers(),\n questions: this.getQuestions(),\n state: this.state\n }\n }",
"isFresh(tileId) {\n return this.props.dbCurrentPlayer !== null && this.props.dbCurrentPlayer >= 0 \n && this.props.dbPrevRacks[this.props.dbCurrentPlayer].indexOf(tileId) >= 0;\n }",
"static stagedByBillGates(){\n return false;\n }",
"generateBoard(currentStatus, move, targetPlayer) {\n var tempStatus = [...currentStatus];\n tempStatus[move] = targetPlayer;\n return tempStatus;\n }",
"resetVars() {\r\n this._current = undefined;\r\n this._nextRevisionNr = exports.INITIAL_REVISION_NEXT_NR;\r\n }",
"updateShip(iteration){\n //----[ adds normal wear and tear ]----//\n if (this.inFlight && (this.tick % this.integrity) == 0){\n this.parts[\"engine\"] -= 1;\n this.parts[\"shields\"] -= 1;\n if (this.parts[\"shields\"] <= 0){\n this.parts[\"hull\"] -= 1;\n }\n this.parts[\"thrusters\"] -= 1;\n this.parts[\"life-support systems\"] -= 1;\n }\n\n //------[ update the Things ]------//\n //-> age; remove thing from this.things if necessary\n for (var i = 0; i < this.things.length; i++){\n this.things[i].lastsFor -= 1;\n if (this.things[i].lastsFor <= 0 || this.things[i].markedForRemoval){\n //time's up: remove the item\n console.log(\"Removing \" + this.things[i].what + \" from the ship.\");\n this.things.splice(i, 1);\n }\n }\n\n //----------------------//\n //--[ activate and deactivate any neccessary warnings ]--//\n var warningsToActivate = [];\n var warningsToDeactivate = [];\n var LOW_SHIELD_PERCENTAGE = 15;\n var CRITICAL_HULL_PERCENTAGE = 15;\n //-----//\n if (this.parts[\"shields\"] < LOW_SHIELD_PERCENTAGE){\n warningsToActivate.push(\"SHIELDS LOW\");\n }\n if (this.parts[\"shields\"] >= LOW_SHIELD_PERCENTAGE){\n warningsToDeactivate.push(\"SHIELDS LOW\")\n }\n //-----//\n if (this.parts[\"shields\"] <= 0){\n warningsToActivate.push(\"SHIELDS DOWN\");\n }\n if (this.parts[\"shields\"] > 0){\n warningsToDeactivate.push(\"SHIELDS DOWN\")\n }\n //-----//\n if (this.parts[\"hull\"] < CRITICAL_HULL_PERCENTAGE){\n warningsToActivate.push(\"CRITICAL DAMAGE TO HULL\");\n }\n if (this.parts[\"hull\"] >= CRITICAL_HULL_PERCENTAGE){\n warningsToDeactivate.push(\"CRITICAL DAMAGE TO HULL\");\n }\n //-------------//\n this._activateWarnings(warningsToActivate);\n this._deactivateWarnings(warningsToDeactivate);\n //----------------------------------------//\n\n //--------//\n //--add some debris... I guess\n if (random(2) == 0){\n this.addAThing(\"garbage\",\"a bit of debris\");\n }\n //-----------//\n\n //--[make sure all the parts are above 0]--//\n this._ensurePartsAboveZero();\n //----------------------------------------//\n\n //---------//\n //pay wages. Each person is paid [x] units per day.\n this.funds -= WAGES_PPPD; //TODO: add ability to turn this off temporarily (when low on funds)\n //reduce provisions. Each person consume [x] provision per day.\n this.provisions -= (this.people.length * PROVISIONS_PPPD);\n if (this.provisions < 0){\n this.provisions = 0;\n }\n //use up fuel IF TRAVELLING. Ship consume [x]% of fuel per day.\n if (this.currentJourney !== null){\n this.fuel -= this.fuelRate;\n }\n //---------//\n\n }",
"rollback () {\n this.staged = this.cached\n }",
"function loadSavedMenuGameslotUnusedStateChangeStarter(value) {\n store.dispatch( {\n type: UNUSED_SAVESLOT,\n payload: {\n saveSlottoInit: value\n }\n });\n }",
"invalidateBuild(player, title) {\n // <<-- Creer-Merge: invalidate-build -->>\n let towerIndex = -1;\n if (title === \"arrow\") {\n towerIndex = 1;\n }\n else if (title === \"ballista\") {\n towerIndex = 2;\n }\n else if (title === \"cleansing\") {\n towerIndex = 3;\n }\n else if (title === \"aoe\") {\n towerIndex = 4;\n }\n if (towerIndex === -1) {\n return `Invalid tower type!`;\n }\n if (!player || player !== this.game.currentPlayer) {\n return `It isn't your turn, ${player}.`;\n }\n if (!this) {\n return `This unit does not exist!`;\n }\n if (this.owner !== player || this.owner === undefined) {\n return `${this} isn't owned by you.`;\n }\n // Make sure the unit hasn't acted.\n if (this.acted) {\n return `${this} has already acted this turn.`;\n }\n // Make sure the unit is alive.\n if (this.health <= 0) {\n return `${this} is dead, for now.`;\n }\n // Make sure the unit is on a tile.\n if (!this.tile) {\n return `${this} is not on a tile.`;\n }\n if (player.gold < this.game.towerJobs[towerIndex].goldCost\n || player.mana < this.game.towerJobs[towerIndex].manaCost) {\n return `You don't have enough gold or mana to build this tower.`;\n }\n if (this.tile !== this.tile) {\n return `${this} must be on the target tile to build!`;\n }\n if (this.tile.isGoldMine) {\n return `You can not build on a gold mine.`;\n }\n if (this.tile.isIslandGoldMine) {\n return `You can not build on the island.`;\n }\n if (this.tile.isPath) {\n return `You can not build on the path.`;\n }\n if (this.tile.isRiver) {\n return `You can not build on the river.`;\n }\n if (this.tile.isTower) {\n return `You can not build on top another tower.`;\n }\n if (this.tile.isWall) {\n return `You can not build on a wall.`;\n }\n // <<-- /Creer-Merge: invalidate-build -->>\n }",
"sharpen(){cov_1rtpcx8cw8.f[3]++;cov_1rtpcx8cw8.s[21]++;if(this.length===0){cov_1rtpcx8cw8.b[8][0]++;cov_1rtpcx8cw8.s[22]++;throw new Error('Your pencil has a length and durability of 0! You need a new one!');}else{cov_1rtpcx8cw8.b[8][1]++;cov_1rtpcx8cw8.s[23]++;this.durability=40000;cov_1rtpcx8cw8.s[24]++;this.length-=1;}}",
"getNotUsedAnymoreUpdateObject() {\n return {\n $set: {\n avaible: true,\n used: false,\n socket: null,\n requeriments: []\n }\n };\n }",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoMode);\n }\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.dependencies = source.dependencies;\n target.mode = source.mode;\n target.flags = source.flags;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.lanes = source.lanes;\n target.childLanes = source.childLanes;\n target.alternate = source.alternate;\n {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugNeedsRemount = source._debugNeedsRemount;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n }",
"function modifiedPreprocessor() {\n this.remove_extra_properties = true; //false will remove the extra properties from the input data.\n this.isChecked = false;\n this.isModified = false;\n this.out = {};\n}",
"function refactor() {facts = [].concat(favourites, trays[current_tray], specials);}",
"loadIncompleteProject() {\n const { onStepChange, onProjectUpdate } = this.props\n const incompleteProjectStr = window.localStorage.getItem(LS_INCOMPLETE_PROJECT)\n if(incompleteProjectStr) {\n const incompleteProject = JSON.parse(incompleteProjectStr)\n this.setState({\n project: update(this.state.project, { $merge : incompleteProject }),\n dirtyProject: update(this.state.dirtyProject, { $merge : incompleteProject }),\n wizardStep: WZ_STEP_FILL_PROJ_DETAILS\n }, () => {\n typeof onProjectUpdate === 'function' && onProjectUpdate(this.state.dirtyProject, false)\n typeof onStepChange === 'function' && onStepChange(this.state.wizardStep, this.state.dirtyProject)\n })\n }\n }",
"getSnapshotBeforeUpdate() {\n //create a backup of the current way things are\n //IMPORTANT: not very common\n }",
"prepareUpdate(instance, type, oldProps, newProps, rootContainerInstance, hostContext) {\n log('TODO: prepareUpdate');\n //return null;\n //return diffProperties(instance, type, oldProps, newProps, rootContainerInstance, hostContext);\n return newProps;\n }",
"reset() {\n this.hasStepped = false;\n this[BARGS] = [].concat(this[OARGS])\n this[SDATA] = []\n }",
"get detune() {return 0}",
"function resetSSEState() {\n repository.deployState = \"\";\n repository.deployCalloutType = \"info\";\n repository.deployedTaskInformation = null;\n\n sseObj = null;\n }",
"function resetSSEState() {\n repository.deployState = \"\";\n repository.deployCalloutType = \"info\";\n repository.deployedTaskInformation = null;\n\n sseObj = null;\n }",
"static get properties() {\n return {\n displayNewTile: {type:String},\n tileTitle: {type:String},\n tileComments:{type:String},\n tilePicture: {type:String},\n tileDetails:{type:String},\n newImagePath:{type:String}\n };\n }",
"shotStatus( cellNum ){\n const currentPlayer = this.state.activePlayer;\n\n //opponents ships\n const ships = currentPlayer === 1 ? this.state.ships.player2 : this.state.ships.player1;\n\n //current players shots\n let shots = this.state.shots;\n\n //returnable data\n let result = {\n status: \"miss\",\n ship: null\n };\n\n //check if the shot hits a ship\n const hitShip = ships.filter( ( s ) => {\n return s.cells.indexOf( cellNum ) > -1;\n } );\n if( hitShip.length > 0 ){\n let ship = hitShip[0];\n\n //push the into the hitCells array\n ship.hitCells.push( cellNum );\n\n //if all cells are hit - ship is sunk\n if( ship.cells.length === ship.hitCells.length ){\n ship.status = \"sunk\";\n console.log( \"ship is sunk\" );\n }\n\n //result of shot\n result.status = \"hit\";\n result.ship = ship;\n }\n\n //log the shot to current player so opponent has access to shots against their ships\n const shotData = {\n cell: cellNum,\n status: result.status\n };\n if( currentPlayer === 1 ){\n shots.player1.push( shotData );\n }else{\n shots.player2.push( shotData );\n }\n\n\n //if all ships are sunk\n let sunkShips = ships.filter( ( s ) => {\n return s.status === \"sunk\";\n } );\n if( sunkShips.length === ships.length ){\n this.setState( {\n step: data.steps[ 2 ]\n } );\n return false;\n }\n\n //if not all ships are sunk, continue with the game\n //set delay so that players can switch\n else{\n this.switchPlayer( 750, true, shots );\n return result;\n }\n }",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoMode);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.dependencies = source.dependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugNeedsRemount = source._debugNeedsRemount;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoMode);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.dependencies = source.dependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugNeedsRemount = source._debugNeedsRemount;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"setBurned(stage){\n if(this.burned == null){\n console.log(\"here\");\n }\n for(let i = stage; i < this.burned.length; i++){\n this.burned[i] = true; //set all future stages to true\n }\n }",
"winConditionMet() {\n return this.Players[1].board.ship.isSunk\n }",
"function rndrPatch(){\n \n if(String(app.project.activeItem)=='[object CompItem]'){ \n var myComp = app.project.activeItem;\n var item =app.project.renderQueue.items.add(myComp);\n item.timeSpanStart = app.project.activeItem.workAreaStart;\n item.timeSpanDuration = app.project.activeItem.workAreaDuration;\n return 'Done'\n }else{\n return 'Error'\n }\n}",
"beforeStep() {\n this.clearKeys();\n this.slimesChase();\n this.clearTempBuff();\n this.handleOnGoingSkills();\n this.updateAttackTimer();\n this.slimesAttack();\n }",
"fold() {\n this.status = -1;\n }",
"static getNewProperties() {\n return {};\n }",
"preset () { return false }",
"undo(){\n let state = this.getState();\n for(let key in state) this[key] = state[key];\n }",
"function liftReducer(reducer, initialState) { // 87\n var initialLiftedState = { // 88\n committedState: initialState, // 89\n stagedActions: [INIT_ACTION], // 90\n skippedActions: {}, // 91\n currentStateIndex: 0, // 92\n monitorState: { // 93\n isVisible: true // 94\n }, // 95\n timestamps: [Date.now()] // 96\n }; // 97\n // 98\n /** // 99\n * Manages how the DevTools actions modify the DevTools state. // 100\n */ // 101\n return function liftedReducer(liftedState, liftedAction) { // 102\n if (liftedState === undefined) liftedState = initialLiftedState; // 103\n var committedState = liftedState.committedState; // 104\n var stagedActions = liftedState.stagedActions; // 105\n var skippedActions = liftedState.skippedActions; // 106\n var computedStates = liftedState.computedStates; // 107\n var currentStateIndex = liftedState.currentStateIndex; // 108\n var monitorState = liftedState.monitorState; // 109\n var timestamps = liftedState.timestamps; // 110\n // 111\n switch (liftedAction.type) { // 112\n case ActionTypes.RESET: // 113\n committedState = initialState; // 114\n stagedActions = [INIT_ACTION]; // 115\n skippedActions = {}; // 116\n currentStateIndex = 0; // 117\n timestamps = [liftedAction.timestamp]; // 118\n break; // 119\n case ActionTypes.COMMIT: // 120\n committedState = computedStates[currentStateIndex].state; // 121\n stagedActions = [INIT_ACTION]; // 122\n skippedActions = {}; // 123\n currentStateIndex = 0; // 124\n timestamps = [liftedAction.timestamp]; // 125\n break; // 126\n case ActionTypes.ROLLBACK: // 127\n stagedActions = [INIT_ACTION]; // 128\n skippedActions = {}; // 129\n currentStateIndex = 0; // 130\n timestamps = [liftedAction.timestamp]; // 131\n break; // 132\n case ActionTypes.TOGGLE_ACTION: // 133\n skippedActions = toggle(skippedActions, liftedAction.index); // 134\n break; // 135\n case ActionTypes.JUMP_TO_STATE: // 136\n currentStateIndex = liftedAction.index; // 137\n break; // 138\n case ActionTypes.SWEEP: // 139\n stagedActions = stagedActions.filter(function (_, i) { // 140\n return !skippedActions[i]; // 141\n }); // 142\n timestamps = timestamps.filter(function (_, i) { // 143\n return !skippedActions[i]; // 144\n }); // 145\n skippedActions = {}; // 146\n currentStateIndex = Math.min(currentStateIndex, stagedActions.length - 1);\n break; // 148\n case ActionTypes.PERFORM_ACTION: // 149\n if (currentStateIndex === stagedActions.length - 1) { // 150\n currentStateIndex++; // 151\n } // 152\n stagedActions = [].concat(stagedActions, [liftedAction.action]);\n timestamps = [].concat(timestamps, [liftedAction.timestamp]); // 154\n break; // 155\n case ActionTypes.SET_MONITOR_STATE: // 156\n monitorState = liftedAction.monitorState; // 157\n break; // 158\n case ActionTypes.RECOMPUTE_STATES: // 159\n stagedActions = liftedAction.stagedActions; // 160\n timestamps = liftedAction.timestamps; // 161\n committedState = liftedAction.committedState; // 162\n currentStateIndex = stagedActions.length - 1; // 163\n skippedActions = {}; // 164\n break; // 165\n default: // 166\n break; // 167\n } // 168\n // 169\n computedStates = recomputeStates(reducer, committedState, stagedActions, skippedActions);\n // 171\n return { // 172\n committedState: committedState, // 173\n stagedActions: stagedActions, // 174\n skippedActions: skippedActions, // 175\n computedStates: computedStates, // 176\n currentStateIndex: currentStateIndex, // 177\n monitorState: monitorState, // 178\n timestamps: timestamps // 179\n }; // 180\n }; // 181\n} // 182",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.contextDependencies = source.contextDependencies;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n target._debugHookTypes = source._debugHookTypes;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseTime = source.selfBaseTime;\n target.treeBaseTime = source.treeBaseTime;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n }",
"getSnapshotBeforeUpdate(props, state) {\n console.log(props, state);\n return 'Fuck';\n }",
"incomplete(item) {\n\t\tlet unfinishedKey = this.props.finished.indexOf( item );\n\t\tlet unfinishedVal = this.props.finished[ unfinishedKey ];\n\n\t\tif ( this.props.todos.indexOf( unfinishedVal ) !== -1 ) {\n\t\t\tthis.dupeWarn();\n\t\t\treturn;\n\t\t}\n\n\t\tthis.props.finished.splice( unfinishedKey, 1 );\n\t\tthis.props.todos.push( unfinishedVal );\n\t\tlocalStorage.setItem( 'todos', JSON.stringify( this.props.todos ) );\n\t\tlocalStorage.setItem( 'finished', JSON.stringify( this.props.finished ) );\n\t\tthis.setState( {\n\t\t\ttodos: this.props.todos,\n\t\t\tfinished: this.props.finished,\n\t\t} );\n\t}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.elementType = source.elementType;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"static get properties() { return {\nstate: {type:Object} \n}}",
"function memoizeProps(workInProgress, nextProps) {\n\t workInProgress.memoizedProps = nextProps;\n\t }",
"function shouldUpdateSlack() {\n var currStatusStr = JSON.stringify(status);\n console.log('curr', currStatusStr, \"last\", lastStatusStr)\n // only update if we have a defined endpoint\n if (process.env.ENDPOINT &&\n currStatusStr !== lastStatusStr) {\n updateSlack();\n }\n lastStatusStr = currStatusStr;\n}",
"set BuildTimeOnly(value) {}",
"constructor() {\n this.reward = 0\n this.episodes = 0\n this.steps = 0\n this.obs_spec = null\n this.action_spec = null\n }",
"static fix20170405(battle) {\n if (battle.time >= 1491372000000)\n return battle\n for (const packet of battle.packet) {\n for (const k of ['api_ship_ke', 'api_ship_ke_combined']) {\n if (packet[k] != null)\n packet[k] = packet[k].map(n => n > 500 ? n + 1000 : n)\n }\n }\n return battle\n }",
"function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}",
"function assignFiberPropertiesInDEV(target, source) {\n if (target === null) {\n // This Fiber's initial properties will always be overwritten.\n // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n target = createFiber(IndeterminateComponent, null, null, NoContext);\n }\n\n // This is intentionally written as a list of all properties.\n // We tried to use Object.assign() instead but this is called in\n // the hottest path, and Object.assign() was too slow:\n // https://github.com/facebook/react/issues/12502\n // This code is DEV-only so size is not a concern.\n\n target.tag = source.tag;\n target.key = source.key;\n target.type = source.type;\n target.stateNode = source.stateNode;\n target.return = source.return;\n target.child = source.child;\n target.sibling = source.sibling;\n target.index = source.index;\n target.ref = source.ref;\n target.pendingProps = source.pendingProps;\n target.memoizedProps = source.memoizedProps;\n target.updateQueue = source.updateQueue;\n target.memoizedState = source.memoizedState;\n target.firstContextDependency = source.firstContextDependency;\n target.mode = source.mode;\n target.effectTag = source.effectTag;\n target.nextEffect = source.nextEffect;\n target.firstEffect = source.firstEffect;\n target.lastEffect = source.lastEffect;\n target.expirationTime = source.expirationTime;\n target.childExpirationTime = source.childExpirationTime;\n target.alternate = source.alternate;\n if (enableProfilerTimer) {\n target.actualDuration = source.actualDuration;\n target.actualStartTime = source.actualStartTime;\n target.selfBaseDuration = source.selfBaseDuration;\n target.treeBaseDuration = source.treeBaseDuration;\n }\n target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}"
] |
[
"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.49120292",
"0.49079183",
"0.48850125",
"0.48767743",
"0.48756367",
"0.4869501",
"0.48631784",
"0.48603675",
"0.48544642",
"0.48505232",
"0.48358122",
"0.4830418",
"0.48291793",
"0.4826367",
"0.48205715",
"0.48143813",
"0.48092178",
"0.4801054",
"0.47989425",
"0.4790927",
"0.47892112",
"0.4787368",
"0.4782092",
"0.47741264",
"0.4768762",
"0.4768762",
"0.4758337",
"0.47518465",
"0.47430575",
"0.47430575",
"0.4741613",
"0.47410557",
"0.474085",
"0.47363946",
"0.4735775",
"0.47292665",
"0.47281715",
"0.4727977",
"0.4727417",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47266462",
"0.47194785",
"0.47191614",
"0.4716529",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47158477",
"0.47147024",
"0.47142532",
"0.47058734",
"0.47027883",
"0.47007626",
"0.47004217",
"0.4699599",
"0.46963736",
"0.46963736",
"0.46963736",
"0.46963736",
"0.46963736",
"0.46963736",
"0.46963736"
] |
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 render() {\n\t\t\t}",
"render() { return super.render(); }",
"render() {\n\t\treturn null;\n\t}",
"render() {}",
"render() {}",
"render() {}",
"render() { }",
"function render() {\n\t\t\n\t}",
"afterRender() { }",
"afterRender() { }",
"onAfterRendering() {}",
"getRenderer () {}",
"render( ) {\n return null;\n }",
"render() {\n\t\treturn (\n\t\t\tnull\n\t\t)\n\t}",
"onBeforeRendering() {}",
"render() {\n return null;\n }",
"render() {\n return null;\n }",
"function render() {\n\t}",
"function TextRenderer() {} // no need for block level renderers",
"function TextRenderer() {} // no need for block level renderers",
"render() {\n return super.render();\n }",
"render(){if(this.renderer){this.renderer.call(this.owner,this.content,this.owner,this.model)}}",
"postRender()\n {\n super.postRender();\n }",
"function render() {\r\n\r\n}",
"function render() {\r\n\r\n}",
"render(){\r\n\r\n\t}",
"render() {\n return super.render();\n }",
"render() {\n return super.render();\n }",
"function Renderer() {}",
"_afterRender () {\n this.adjust();\n }",
"render() {\n }",
"onRender () {\n\n }",
"render() {\n\n }",
"render() {\r\n return;\r\n }",
"function Renderer(args) {\n\n\n}",
"get renderElement() {\n return this.view.renderer.renderElement;\n }",
"get renderOrder() {}",
"renderPrep() {\n }",
"render() {\n return super.render();\n }",
"render() {\n return super.render();\n }",
"render() {\n return super.render();\n }",
"render() {\n return super.render();\n }",
"renderHTML() {\n \n }",
"render() {\n\n }",
"render() {\n\n }",
"render() {\n\n }",
"rendererDefaultData() {\n return 0;\n }",
"function Renderer() {\n}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"function TextRenderer() {}",
"render() {\n return null;\n }",
"render() {\n return null;\n }",
"render() {\n return null;\n }",
"render() {\n return null;\n }",
"render() {\n return null;\n }",
"render() {\n return null;\n }",
"render() {\n }",
"render() {\n }",
"renderContent() {\n return null;\n }",
"Render(){\n throw new Error(\"Render() method must be implemented in child!\");\n }",
"get renderer() {\n return this._renderer;\n }",
"render()\n {\n return super.render();\n }",
"getRenderingInstructions () {\n return []\n }",
"render() {\n return '';\n }",
"render() {\n return renderNotImplemented;\n }",
"render() {\n return renderNotImplemented;\n }",
"function RendererType2() {}",
"function RendererType2() {}",
"function RendererType2() {}",
"render() {\n if (this.renderer) {\n this.renderer.call(this.owner, this.content, this.owner, this.model);\n }\n }",
"render () {\n throw new Error('render function must be override!')\n }",
"beforeRender() { }",
"rendererCallback () {\n // TODO: cannot move code here because tests expects renderer function to still exist on constructor!\n return this.constructor.renderer(this);\n }",
"rendererCallback () {\n // TODO: cannot move code here because tests expects renderer function to still exist on constructor!\n return this.constructor.renderer(this);\n }",
"_requestRender() { this._invalidateProperties(); }",
"function AfterTextRenderHook() {}",
"function RenderEvent() {}",
"render(map)\n\t{\n\t\tthrow new Error(\"Not implemented\");\n\t}"
] |
[
"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.6321588",
"0.62466794",
"0.62082034",
"0.62025964",
"0.6184514",
"0.6184514",
"0.61759144",
"0.61648965",
"0.61648965",
"0.61625654",
"0.6156075",
"0.6118475",
"0.61148727",
"0.61148727",
"0.61135715",
"0.60791916",
"0.60791916",
"0.60776764",
"0.6069591",
"0.6068791",
"0.60628396",
"0.5989632",
"0.59694815",
"0.59688115",
"0.5962468",
"0.59359694",
"0.5933279",
"0.5930756",
"0.5930756",
"0.5930756",
"0.5930756",
"0.5915947",
"0.58974093",
"0.58974093",
"0.58974093",
"0.5885218",
"0.58580744",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5841388",
"0.5804627",
"0.5804627",
"0.5804627",
"0.5804627",
"0.5804627",
"0.5804627",
"0.5801747",
"0.5801747",
"0.5790464",
"0.57858485",
"0.57630825",
"0.5750007",
"0.5723631",
"0.57195723",
"0.5714861",
"0.5714861",
"0.5712061",
"0.5712061",
"0.5712061",
"0.5694311",
"0.56736195",
"0.5673009",
"0.5672324",
"0.5672324",
"0.56619805",
"0.5656745",
"0.565574",
"0.56311256"
] |
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 }\n }",
"function runMountCallback() {\n if (!hasMountCallbackRun && currentMountCallback) {\n hasMountCallbackRun = true;\n reflow(popper);\n currentMountCallback();\n }\n }",
"function viewWillMount() {\n // stub\n }",
"function mount() {\n hasMountCallbackRun = false;\n var isInLooseFollowCursorMode = getIsInLooseFollowCursorMode();\n\n if (instance.popperInstance) {\n setFlipModifierEnabled(instance.popperInstance.modifiers, instance.props.flip);\n\n if (!isInLooseFollowCursorMode) {\n instance.popperInstance.reference = reference;\n instance.popperInstance.enableEventListeners();\n }\n\n instance.popperInstance.scheduleUpdate();\n } else {\n createPopperInstance();\n\n if (!isInLooseFollowCursorMode) {\n instance.popperInstance.enableEventListeners();\n }\n }\n\n var appendTo = instance.props.appendTo;\n var parentNode = appendTo === 'parent' ? reference.parentNode : invokeWithArgsOrReturn(appendTo, [reference]);\n\n if (!parentNode.contains(popper)) {\n parentNode.appendChild(popper);\n instance.props.onMount(instance);\n instance.state.isMounted = true;\n }\n }",
"willMount() {\n }",
"_mountComponent() {\n\t\t// wait next frame\n\t\tthis.mutate(() => {\n\t\t\t// sometimes, the component has been unmounted between the\n\t\t\t// fastdom execution, so we stop here if it's the case\n\t\t\tif ( ! this._componentAttached) return;\n\t\t\t// init\n\t\t\tthis.componentMount();\n\t\t\t// render\n\t\t\tthis.render();\n\t\t\t// component did mount\n\t\t\tthis.componentDidMount();\n\t\t});\n\n\t}",
"function mount() {\n hasMountCallbackRun = false;\n var isInLooseFollowCursorMode = getIsInLooseFollowCursorMode();\n\n if (instance.popperInstance) {\n setFlipModifierEnabled(instance.popperInstance.modifiers, instance.props.flip);\n\n if (!isInLooseFollowCursorMode) {\n instance.popperInstance.reference = reference;\n instance.popperInstance.enableEventListeners();\n }\n\n instance.popperInstance.scheduleUpdate();\n } else {\n createPopperInstance();\n\n if (!isInLooseFollowCursorMode) {\n instance.popperInstance.enableEventListeners();\n }\n }\n\n var appendTo = instance.props.appendTo;\n var parentNode = appendTo === 'parent' ? reference.parentNode : invokeWithArgsOrReturn(appendTo, [reference]);\n\n if (!parentNode.contains(popper)) {\n parentNode.appendChild(popper);\n instance.props.onMount(instance);\n instance.state.isMounted = true;\n }\n }",
"componentDidMount() {\n this._isMounted = true;\n if (!this.manuallyBindClickAway) {\n this._bindClickAway();\n }\n }",
"unMount() {\n if (this.hasOptions)\n this.options.unMount();\n if (this.isOptionView)\n try {\n this.viewClass.unMount();\n } catch (e) {\n console.log(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}",
"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 proxiedComponentDidMount(){mountedInstances.push(this);if(typeof current.componentDidMount==='function'){return current.componentDidMount.apply(this,arguments);}}",
"function proxiedComponentDidMount(){mountedInstances.push(this);if(typeof current.componentDidMount==='function'){return current.componentDidMount.apply(this,arguments);}}",
"createdCallback() {\n\t // component will mount only if part of the active document\n\t this.componentWillMount();\n\t}",
"componentDidMount() {\n const instance = this,\n props = instance.props,\n onMount = props.onMount;\n instance._domNode._itsa_focuscontainer = instance; // to have a reference to the instance\n // on every render-cycle, we need to re-calculate this._keysUp and this._keysDown:\n instance.defineMovementKeys();\n if (props.initialFocus!==undefined) {\n instance.setInitialFocus();\n }\n onMount && onMount();\n }",
"function proxiedComponentDidMount() {\n\t mountedInstances.push(this);\n\t if (typeof current.componentDidMount === 'function') {\n\t return current.componentDidMount.apply(this, arguments);\n\t }\n\t }",
"function proxiedComponentDidMount() {\n\t mountedInstances.push(this);\n\t if (typeof current.componentDidMount === 'function') {\n\t return current.componentDidMount.apply(this, arguments);\n\t }\n\t }",
"beforeMount(){\n console.log('beforeMount');\n }",
"function onMount(fn) {\n get_current_component().$$.on_mount.push(fn);\n}",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function proxiedComponentDidMount() {\n mountedInstances.push(this);\n if (typeof current.componentDidMount === 'function') {\n return current.componentDidMount.apply(this, arguments);\n }\n }",
"function mount() {\n if (!_html) {\n throw new Error('Component ' + _id + ' cannot mount with no HTML. Call render() first');\n }\n\n if (this.viewWillMount) {\n this.viewWillMount();\n }\n\n _isMounted = true;\n\n // Go out to the standard render function. DOM element is returned in callback\n _noriEvents.renderView(_mountPoint, _html, _id, onViewRendered.bind(this));\n }",
"mount(el) {\n if (el.firstElementChild) {\n el.firstElementChild.remove();\n }\n this.preRendered = this.render();\n if (this.preRendered) {\n el.appendChild(this.preRendered.render());\n }\n }",
"attachedCallback() {\n\t\t// update attached status\n\t\tthis._componentAttached = true;\n\n\t\t// wait until dependencies are ok\n\t\tthis._whenMountDependenciesAreOk().then(() => {\n\t\t\t// switch on the mountWhen prop\n\t\t\tswitch(this.props.mountWhen) {\n\t\t\t\tcase 'inViewport':\n\t\t\t\t__whenInViewport(this).then(() => {\n\t\t\t\t\tthis._mountComponent();\n\t\t\t\t});\n\t\t\t\tbreak;\n\t\t\t\tcase 'mouseover':\n\t\t\t\t\tthis.addEventListener('mouseover', this._onMouseoverComponentMount.bind(this));\n\t\t\t\tbreak;\n\t\t\t\tcase 'isVisible':\n\t\t\t\t\t__whenVisible(this).then(() => {\n\t\t\t\t\t\tthis._mountComponent();\n\t\t\t\t\t});\n\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t// mount component directly\n\t\t\t\t\tthis._mountComponent();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t});\n\t}",
"mount() {\n let me = this,\n child, childIds;\n\n if (!me.vnode) {\n throw new Error('Component vnode must be generated before mounting, use Component.render()');\n }\n\n // In case the component was already mounted, got unmounted and received vdom changes afterwards,\n // a new render() call is mandatory since delta updates could not get applied.\n // We need to clear the hasUnmountedVdomChanges state for all child components\n if (me.hasUnmountedVdomChanges) {\n // todo: the hasUnmountedVdomChanges flag changes should happen on render\n me.hasUnmountedVdomChanges = false;\n\n childIds = _manager_Component_mjs__WEBPACK_IMPORTED_MODULE_1__.default.getChildIds(me.vnode);\n\n childIds.forEach(id => {\n child = Neo.getComponent(id);\n\n if (child) {\n child._hasUnmountedVdomChanges = false; // silent update\n }\n });\n // end todo\n\n me.render(true);\n } else {\n Neo.currentWorker.promiseMessage('main', {\n action : 'mountDom',\n appName : me.appName,\n id : me.id,\n html : me.vnode.outerHTML,\n parentId : me.parentId,\n parentIndex: me.parentIndex\n }).then(() => {\n me.mounted = true;\n });\n }\n }",
"mount() {\r\n return null;\r\n }",
"didMount() {\n }",
"componentDidMount() {\n this._isMounted = true;\n this.getLocation();\n this.getGame();\n }",
"componentDidMount() {\n this.isMounted_ = true;\n this.loadPlayer();\n }",
"handleViewMounted() {\n if (this._afterViewMounted)\n this._afterViewMounted();\n\n delete this._advancingToIndex;\n delete this._afterViewMounted;\n }",
"componentDidMount() {\n this.mounted = true;\n if (this.props.notes && this.props.notes.length === 0 && this.mounted)\n this.getNotes({ start: 0, loadAmount: 20 });\n }",
"componentDidMount() {\n let state = this.state;\n this.mounted = true;\n this.setState( state );\n }",
"finalizeInitialChildren(newElement, type, props, rootContainerInstance) {\n if (typeof newElement.finalizeBeforeMount === 'function') {\n newElement.finalizeBeforeMount(type, props, rootContainerInstance);\n }\n }",
"componentWillUnmount() {\n this._isMounted = false\n }",
"componentWillUnmount() {\n this._isMounted = false\n }",
"static unMount() {\n if (this.rootComponentMounted) {\n// Fire componentWillUnmount event, then remove component...\n Events.fire('componentWillUnmount', this.rootComponent)\n this.rootComponent.remove()\n\n// Reset componentMounted flag...\n this.rootComponentMounted = false\n } else {\n try {\n throw this.Errors.UnmountError\n }\n catch (err) {\n console.error(err.message)\n }\n }\n }",
"componentWillUnmount() {\n this._isMounted = false;\n }",
"componenetDidMount() { }",
"function flushMountQueue () {\n\t while (mountQueue.length > 0) {\n\t var entityId = mountQueue.shift()\n\t var entity = entities[entityId]\n\t trigger('afterRender', entity, [entity.context, entity.nativeElement])\n\t trigger('afterMount', entity, [entity.context, entity.nativeElement, setState(entity)])\n\t }\n\t }",
"beforeMount() {\n this.initGame()\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate, instance = workInProgress.stateNode, state = instance.state || null, props = workInProgress.pendingProps;\n invariant(props, \"There must be pending props for an initial mount. This error is \" + \"likely caused by a bug in React. Please file an issue.\");\n var unmaskedContext = getUnmaskedContext$2(workInProgress);\n if (instance.props = props, instance.state = workInProgress.memoizedState = state, \n instance.refs = emptyObject, instance.context = getMaskedContext$2(workInProgress, unmaskedContext), \n ReactFeatureFlagsWww.enableAsyncSubtreeAPI && null != workInProgress.type && null != workInProgress.type.prototype && !0 === workInProgress.type.prototype.unstable_isAsyncReactComponent && (workInProgress.internalContextTag |= AsyncUpdates$1), \n \"function\" == typeof instance.componentWillMount) {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n null !== updateQueue && (instance.state = processUpdateQueue$1(current, workInProgress, updateQueue, instance, props, renderExpirationTime));\n }\n \"function\" == typeof instance.componentDidMount && (workInProgress.effectTag |= Update$1);\n }",
"componentDidMount() {\n //this.assignPhotos();\n this.noFocusElements();\n }",
"componentWillUnmount() {\n this._isMounted = false;\n }",
"componentDidMount(){\n this.setupEffectController();\n this.initView();\n this.display();\n }",
"componentDidMount(){\n this.updateEventCards().then( () => {\n this.componentMounted = true;\n });\n }",
"function proxiedComponentWillUnmount(){var index=mountedInstances.indexOf(this); // Unless we're in a weird environment without componentDidMount\n\tif(index!==-1){mountedInstances.splice(index,1);}if(typeof current.componentWillUnmount==='function'){return current.componentWillUnmount.apply(this,arguments);}}",
"function proxiedComponentWillUnmount(){var index=mountedInstances.indexOf(this); // Unless we're in a weird environment without componentDidMount\n\tif(index!==-1){mountedInstances.splice(index,1);}if(typeof current.componentWillUnmount==='function'){return current.componentWillUnmount.apply(this,arguments);}}",
"componentDidMount() {\n // console.log(\"currentUserContainer Mounted\")\n this.init()\n }",
"unMount() {\n this.removeListeners();\n SimpleBar.instances.delete(this.el);\n }",
"beforeUnmount() {\n // reference to detached method\n const { detached } = this.$options;\n\n // no longer attached, clean up\n if (!this.$el.offsetParent) {\n detached.call(this);\n return;\n }\n\n // if we're still attached it's likely a transition is running, we need to\n // determine the moment when we're no longer attached to the DOM so we can\n // clean up properly\n const mutationHandler = (mutations, observer) => {\n const removedNodes = (mutations[0] || {}).removedNodes || [];\n const removedNode = removedNodes[0];\n if (!removedNode || !removedNode.contains(this.$el)) return;\n observer.disconnect();\n detached.call(this);\n };\n\n // start observing parent element for changes to the DOM\n const observer = new MutationObserver(mutationHandler);\n observer.observe(document.documentElement, {\n childList: true,\n subtree: true,\n });\n }",
"componentDidMount() {\n this._isMounted = true;\n if (this._isMounted) {\n this.timer = setInterval(() => this.getItems(), 500);\n }\n }",
"componentWillUnmount() {\n\t\tthis._isMounted = false;\n\t}",
"componentWillUnmount() {\n\t\tthis._isMounted = false;\n\t}",
"unMount() {\n this.removeListeners();\n SimpleBar.instances.delete(this.el);\n }",
"componentDidMount() {\n\t\tthis.startup();\n\t}",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var ctor = workInProgress.type;\n var current = workInProgress.alternate;\n {\n checkClassInstance(workInProgress);\n }\n var instance = workInProgress.stateNode;\n var props = workInProgress.pendingProps;\n var unmaskedContext = getUnmaskedContext(workInProgress);\n instance.props = props;\n instance.state = workInProgress.memoizedState;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n {\n if (workInProgress.mode & StrictMode) {\n ReactStrictModeWarnings.recordUnsafeLifecycleWarnings(workInProgress, instance);\n }\n if (warnAboutDeprecatedLifecycles) {\n ReactStrictModeWarnings.recordDeprecationWarnings(workInProgress, instance);\n }\n }\n // In order to support react-lifecycles-compat polyfilled components,\n // Unsafe lifecycles should not be invoked for components using the new APIs.\n if (typeof ctor.getDerivedStateFromProps !== 'function' && typeof instance.getSnapshotBeforeUpdate !== 'function' && (typeof instance.UNSAFE_componentWillMount === 'function' || typeof instance.componentWillMount === 'function')) {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n\t var current = workInProgress.alternate;\n\t\n\t {\n\t checkClassInstance(workInProgress);\n\t }\n\t\n\t var instance = workInProgress.stateNode;\n\t var state = instance.state || null;\n\t\n\t var props = workInProgress.pendingProps;\n\t !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\t\n\t var unmaskedContext = getUnmaskedContext(workInProgress);\n\t\n\t instance.props = props;\n\t instance.state = workInProgress.memoizedState = state;\n\t instance.refs = emptyObject;\n\t instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\t\n\t if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n\t workInProgress.internalContextTag |= AsyncUpdates;\n\t }\n\t\n\t if (typeof instance.componentWillMount === 'function') {\n\t callComponentWillMount(workInProgress, instance);\n\t // If we had additional state updates during this life-cycle, let's\n\t // process them now.\n\t var updateQueue = workInProgress.updateQueue;\n\t if (updateQueue !== null) {\n\t instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n\t }\n\t }\n\t if (typeof instance.componentDidMount === 'function') {\n\t workInProgress.effectTag |= Update;\n\t }\n\t }",
"function componentMountHandler(item)\n \t{\n \t\t// Check if there is already an instance of the item being mounted, if so remove it\n \t\tvar i = 0,\n \t\t\tiL = _data.length;\n \t\tfor(; i < iL; i++)\n \t\t{\n \t\t\tif(_data[i] === item)return;\n \t\t}\n \t\t_data.push(item);\n \t\t// Do the main callback if it exists\n \t\tif(item.props._mountCallback)item.props._mountCallback(item);\n \t}",
"componentDidMount() {\n this._isMounted = true;\n this.fetchClients();\n }",
"componentDidMount() {\n this.stopList();\n this.routeList()\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);}}}",
"__initMountedQueue() {\n this._triggerFlagStack.push(this._shouldTrigger);\n this._shouldTrigger = false;\n if (!this.mountedQueue || this.mountedQueue.done) {\n // get from parent\n let tmp;\n if ((tmp = this.context) && (tmp = tmp.__parent) && (tmp = tmp.mountedQueue)) {\n if (!tmp.done) {\n this.mountedQueue = tmp;\n return;\n }\n }\n this._shouldTrigger = true;\n this._initMountedQueue();\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function viewDidMount() {\n // stub\n }",
"function tryOnMounted(fn) {\n var sync = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n if ((0,vue__WEBPACK_IMPORTED_MODULE_0__.getCurrentInstance)()) (0,vue__WEBPACK_IMPORTED_MODULE_0__.onMounted)(fn);else if (sync) fn();else (0,vue__WEBPACK_IMPORTED_MODULE_0__.nextTick)(fn);\n}",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\n }",
"function mountClassInstance(workInProgress, renderExpirationTime) {\n var current = workInProgress.alternate;\n\n {\n checkClassInstance(workInProgress);\n }\n\n var instance = workInProgress.stateNode;\n var state = instance.state || null;\n\n var props = workInProgress.pendingProps;\n !props ? invariant(false, 'There must be pending props for an initial mount. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n var unmaskedContext = getUnmaskedContext(workInProgress);\n\n instance.props = props;\n instance.state = workInProgress.memoizedState = state;\n instance.refs = emptyObject;\n instance.context = getMaskedContext(workInProgress, unmaskedContext);\n\n if (enableAsyncSubtreeAPI && workInProgress.type != null && workInProgress.type.prototype != null && workInProgress.type.prototype.unstable_isAsyncReactComponent === true) {\n workInProgress.internalContextTag |= AsyncUpdates;\n }\n\n if (typeof instance.componentWillMount === 'function') {\n callComponentWillMount(workInProgress, instance);\n // If we had additional state updates during this life-cycle, let's\n // process them now.\n var updateQueue = workInProgress.updateQueue;\n if (updateQueue !== null) {\n instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);\n }\n }\n if (typeof instance.componentDidMount === 'function') {\n workInProgress.effectTag |= Update;\n }\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.6077832",
"0.6077832",
"0.6054554",
"0.60391444",
"0.60338795",
"0.60338795",
"0.60338795",
"0.60338795",
"0.60338795",
"0.60338795",
"0.60338795",
"0.60338795",
"0.6030894",
"0.5961583",
"0.595522",
"0.5930764",
"0.59093904",
"0.58773404",
"0.5876151",
"0.58699787",
"0.584099",
"0.58121777",
"0.58063626",
"0.5795344",
"0.5777097",
"0.5777097",
"0.57675713",
"0.5766451",
"0.5760152",
"0.5741973",
"0.57257074",
"0.57221264",
"0.57201445",
"0.57164913",
"0.57156736",
"0.57113296",
"0.5707358",
"0.5707358",
"0.57022464",
"0.5702181",
"0.56878746",
"0.56783783",
"0.56769323",
"0.56769323",
"0.5651015",
"0.5650898",
"0.5650425",
"0.5617726",
"0.56064385",
"0.56028825",
"0.5592692",
"0.55925226",
"0.55925226",
"0.55925226",
"0.55804634",
"0.5567039",
"0.5567039",
"0.5545517",
"0.55248547",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358",
"0.5515358"
] |
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){\n return false;\n }\n return true;\n }",
"shouldUpdate() {\n //should update if not render before\n if (!this._lastRender) {\n return true;\n }\n // make sure this have no side effect to this component\n const html = this.getTemplate().call(this, (this.getData()));\n return (html != this._lastRender.html) || !this._isSameMountPoint(this.getMountPoint(), this._lastRender.mountPoint);\n }",
"shouldComponentUpdate() {\n \n }",
"shouldComponentUpdate (...args) {\n return shouldComponentUpdate.apply(this, args)\n }",
"shouldComponentUpdate(){\n\t\tconsole.log('Should component update')\n\t\treturn true;\n\t}",
"shouldComponentUpdate() {\n // FIXME: Not tested\n if (+new Date() - this.lastUpdate <= 32) {\n this.lastUpdate = +new Date()\n clearTimeout(this.updateTimer)\n return true\n } else {\n this.updateTimer = setTimeout(() => {\n this.forceUpdate()\n }, 100)\n }\n return false\n }",
"shouldComponentUpdate(){\n console.log('Life Cycle A - shouldComponentUpdate');\n return true;\n }",
"shouldComponentUpdate() {\n\t\treturn false;\n\t}",
"checkUpdate() {\n if (this.updating === true) return false\n // check if we has changes\n if (this.hassEntities && this.hassEntities.length && this._hass) {\n this.hasChanged = false\n // reload the hass entities\n this.hassEntities = this.entities\n .map((x) => this._hass.states[x.entity])\n .filter((notUndefined) => notUndefined !== undefined)\n\n // check for update and set the entity state last and update flag\n for (let entity of this.entities) {\n const h = this.hassEntities.find((x) => x.entity_id === entity.entity)\n entity.laststate = entity.state\n entity.update = false\n if (h && entity.last_changed !== h.last_changed && entity.state !== h.state) {\n entity.last_changed = h.last_changed\n entity.state = h.state\n entity.update = true\n this.hasChanged = true\n }\n }\n\n if (this.hasChanged) {\n // refresh and update the graph\n this.updateGraph(true)\n }\n return this.hasChanged\n }\n }",
"shouldComponentUpdate() {\n if (this.lastUpdatedAt) {\n const diff = new Date().valueOf() - this.lastUpdatedAt;\n const shouldRender = diff > 1000;\n\n if (!shouldRender && !this.forceRenderTimer) {\n this.forceRenderTimer = setTimeout(() => {\n this.forceUpdate();\n this.forceRenderTimer = null;\n }, 1000 - diff);\n }\n return shouldRender;\n } else {\n return true;\n }\n }",
"shouldComponentUpdate() {\n if (this.lastUpdatedAt) {\n const diff = new Date().valueOf() - this.lastUpdatedAt;\n const shouldRender = diff > 1000;\n\n if (!shouldRender && !this.forceRenderTimer) {\n this.forceRenderTimer = setTimeout(() => {\n this.forceUpdate();\n this.forceRenderTimer = null;\n }, 1000 - diff);\n }\n return shouldRender;\n } else {\n return true;\n }\n }",
"shouldUpdate(e){return!0}",
"shouldComponentUpdate(){\n console.log(\"LifeCcyleB shouldComponeentUpdate\")\n return true\n }",
"shouldUpdate() {\n return this.active;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate(){\n console.log(\"LifecycleA shouldComponentUpdate\");\n return true;\n }",
"shouldComponentUpdate (nextProps, nextState) {\n return nextState.update;\n }",
"shouldComponentUpdate() {\n\t\tconsole.log('Function called: %s', 'shouldComponentUpdate');\n\t}",
"shouldComponentUpdate() {\n return true;\n }",
"shouldComponentUpdate() {\n return true;\n }",
"shouldComponentUpdate() {\n return true;\n }",
"shouldComponentUpdate() {\n return true;\n }",
"shouldRerender () {\n return false\n }",
"checkUpdate() {\n if (this.updating === true) return false\n this.hasChanged = false\n const _entityList = this.entity_items.getEntitieslist()\n if (this.hassEntities && this.hassEntities.length && this._hass) {\n this.hassEntities = _entityList\n .map((x) => this._hass.states[x.entity])\n .filter((notUndefined) => notUndefined !== undefined)\n this.hasChanged = this.entity_items.hasChanged(this.hassEntities)\n if (this.hasChanged) {\n /**\n * refresh and update the graph\n */\n this.updateGraph(true)\n }\n }\n return this.hasChanged\n }",
"checkUpdate() {\n if (this.updating === true) return false\n this.hasChanged = false\n const _entityList = this.entity_items.getEntitieslist()\n if (this.hassEntities && this.hassEntities.length && this._hass) {\n this.hassEntities = _entityList\n .map((x) => this._hass.states[x.entity])\n .filter((notUndefined) => notUndefined !== undefined)\n this.hasChanged = this.entity_items.hasChanged(this.hassEntities)\n if (this.hasChanged) {\n /**\n * refresh and update the graph\n */\n this.updateGraph(true)\n }\n }\n return this.hasChanged\n }",
"shouldComponentUpdate(newProps, newState) {\n // console.log(\"=========================> shouldComponentUpdate\", newProps, newState);\n return true;\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 }",
"shouldRerender(newProps) {\n if (newProps.disabled !== this.props.disabled) return true\n // TODO: we should still detect when the document has changed,\n // see https://github.com/substance/substance/issues/543\n return false\n }",
"shouldRerender(newProps) {\n if (newProps.disabled !== this.props.disabled) return true\n // TODO: we should still detect when the document has changed,\n // see https://github.com/substance/substance/issues/543\n return false\n }",
"willUpdate() {\n }",
"shouldComponentUpdate(nextProps, nextState) {}",
"shouldUpdate(_changedProperties){return!0}",
"shouldComponentUpdate(nxtProps, nxtState) {\n const { data, loading } = this.props;\n if (data.length > 0 && !loading) {\n return false;\n }\n return true;\n }",
"shouldComponentUpdate(){\n if(this.props.debug)console.log(\"Child - shouldComponentUpdate\");\n return false; // this ensures parent render wont render this component\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"shouldComponentUpdate() {\n return false;\n }",
"update() {\n this._checkEvents();\n }",
"shouldUpdate(_changedProperties) {\n return true;\n }",
"shouldComponentUpdate( nextProps ) {\n if ( this.props.data !== nextProps.data ) {\n return true;\n }\n if ( this.props.isVisible !== nextProps.isVisible ) {\n return true;\n }\n if ( nextProps.isVisible === false ) {\n return false;\n }\n return true;\n }",
"shouldComponentUpdate() {\n return false\n }",
"shouldUpdate(_changedProperties) {\n return true;\n }",
"shouldUpdate(_changedProperties) {\n return true;\n }",
"shouldUpdate(_changedProperties) {\n return true;\n }",
"shouldComponentUpdate(nextProps) {\n return nextProps.complete != this.props.complete;\n }",
"shouldUpdate(_changedProperties) {\n return super.shouldUpdate();\n }",
"shouldComponentUpdate () {\n return false\n }",
"shouldComponentUpdate(nextProp, nextState) {\n console.log('Child Should Update');\n return true;\n }",
"shouldUpdate(_changedProperties){return true;}",
"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 }",
"async update() {\n this.emit('updating');\n for (let retry = 0; retry < UPDATE_RETRIES; retry++) {\n Log('update:', retry);\n try {\n if (await this.connect()) {\n await this.read();\n return true;\n }\n }\n catch (e) {\n Log(e);\n Log('error during update');\n this._validated = false;\n this.detach();\n }\n }\n return false;\n }",
"shouldComponentUpdate( nextProps ) {\n if ( this.props.isVisible !== nextProps.isVisible ) {\n return true;\n }\n if ( !nextProps.isVisible ) {\n return false;\n }\n return true;\n }",
"shouldComponentUpdate( nextProps ) {\n if ( this.props.isVisible !== nextProps.isVisible ) {\n return true;\n }\n if ( !nextProps.isVisible ) {\n return false;\n }\n return true;\n }",
"shouldComponentUpdate( nextProps ) {\n if ( this.props.isVisible !== nextProps.isVisible ) {\n return true;\n }\n if ( !nextProps.isVisible ) {\n return false;\n }\n return true;\n }",
"async _enqueueUpdate(){this._updateState=this._updateState|STATE_UPDATE_REQUESTED;try{// Ensure any previous update has resolved before updating.\n// This `await` also ensures that property changes are batched.\nawait this._updatePromise;}catch(e){// Ignore any previous errors. We only care that the previous cycle is\n// done. Any error should have been handled in the previous update.\n}const result=this.performUpdate();// If `performUpdate` returns a Promise, we await it. This is done to\n// enable coordinating updates with a scheduler. Note, the result is\n// checked to avoid delaying an additional microtask unless we need to.\nif(result!=null){await result;}return !this._hasRequestedUpdate;}",
"shouldComponentUpdate(newProps, newState) {\n console.log('Component Should UPDATE!', this.props);\n console.log('newProps: ', newProps);\n console.log('newState: ', newState);\n return true;\n }",
"function shouldUpdate (entity) {\n if (!entity.dirty) return false\n if (!entity.component.shouldUpdate) return true\n var nextProps = entity.pendingProps\n var nextState = entity.pendingState\n var bool = entity.component.shouldUpdate(entity.context, nextProps, nextState)\n return bool\n }",
"shouldUpdate(_changedProperties) {\n return true;\n }",
"function shouldUpdate (entity) {\n\t if (!entity.dirty) return false\n\t if (!entity.component.shouldUpdate) return true\n\t var nextProps = entity.pendingProps\n\t var nextState = entity.pendingState\n\t var bool = entity.component.shouldUpdate(entity.context, nextProps, nextState)\n\t return bool\n\t }",
"update() {\n this.checkIfWon();\n }",
"shouldComponentUpdate(nextProps, nextState) {\n // return a boolean value\n return true;\n }",
"shouldComponentUpdate() {\n console.log(\"inside shouldComponentUpdate\");\n\n console.log(this.state.count);\n //return true;\n return this.state.count > 0 ? true: false;\n\n }",
"update(...props) {\n if (this.onUpdate && this._) {\n return this.onUpdate(...props);\n }\n }",
"shouldComponentUpdate(nextProps, nextStat) {\n\n console.log(FILE_NAME + \"In shouldComponentUpdate\");\n console.log(\"New Props are - \", nextProps);\n console.log(\"New State is - \", nextStat);\n\n return true;\n }",
"static postUpdate() {\n return false;\n }",
"shouldComponentUpdate(props, newState) {\n if (this.state.count%3 === 0) {\n return true;\n } else {\n return false;\n }\n }",
"componentDidUpdate () {\n\n if (this.props.recalculatePages === true) {\n this.checkForUpdate();\n };\n }",
"_triggerUpdated() {\n\t if (!this.updating) {\n\t this.updating = true;\n\t const update = () => {\n\t this.updating = false;\n\t const registry = storage.getRegistry(this._instance);\n\t const events = registry.events;\n\t events.fire('view-updated', this);\n\t };\n\t if (this._checkSync()) {\n\t update();\n\t }\n\t else {\n\t setTimeout(update);\n\t }\n\t }\n\t }",
"forceUpdate() {\n this.updating = true;\n m.redraw();\n }",
"shouldComponentUpdate(nextProps, nextState){\n console.log(\"shouldComponentUpdate = true\");\n return true;\n }",
"shouldComponentUpdate(nextProps, nextState) {\n return this.props !== nextProps; //check if props have changed\n }",
"update() {\n if (!this.visible)\n\t return;\n }",
"shouldComponentUpdate(nextProps, nextState) {\n const {\n creature,\n active,\n focused,\n round,\n } = this.props;\n\n const {\n expanded,\n } = this.state;\n\n const shouldUpdate = JSON.stringify(nextProps.creature) !== JSON.stringify(creature)\n || nextProps.active !== active\n || nextProps.focused !== focused\n || nextState.expanded !== expanded\n || nextProps.round !== round;\n\n return shouldUpdate;\n }",
"needsUpdate()\n\t{\n\t\treturn this.position.toScreen(this.tree.camera).distanceSquared(\n\t\t\tthis.posSmooth.toScreen(this.tree.camera)) > 1;\n\t}",
"shouldComponentUpdate(nextProps, nextState) {\n // return true if we want to update\n // return false if we dont want\n return true;\n }",
"shouldComponentUpdate() {\n // don't update the component until the button has been clicked 5 times\n if(this.props.buttonClicks >= 5) {\n return true;\n } else {\n return false;\n }\n }",
"function refresh(){\n setUpdate(!update)\n }",
"forceUpdate() {\n return this._startUpdate();\n }",
"shouldComponentUpdate(nextProps) {\n return !isEqual(this.props, nextProps);\n }",
"shouldComponentUpdate(newProps) {\n let componentShouldUpdate = false;\n\n if (this.props.polls && newProps.polls) {\n if (this.props.polls.length !== newProps.polls.length) {\n return true;\n }\n\n this.props.polls.map((poll, key) => {\n if (poll._id !== newProps.polls[key]._id) {\n componentShouldUpdate = true;\n }\n });\n } else {\n return true;\n }\n\n return componentShouldUpdate;\n }",
"update () {\n /* istanbul ignore else */\n if (this.lazy) {\n this.dirty = true;\n } else if (this.sync) {\n this.run();\n } else {\n queueWatcher(this);\n }\n }",
"shouldComponentUpdate(props, state) {\n return !reactEqual(this.props, props) || !reactEqual(this.state, state)\n }",
"shouldUpdateState({oldProps, props, context, changeFlags}) {\n return changeFlags.propsOrDataChanged;\n }",
"get canUpdate() {\n return this._canUpdate;\n }",
"shouldComponentUpdate(nextProps, nextState) {\n console.log(\"App.js: Should Component update\");\n return true;\n }",
"function processState(propName, updater) {\n if (prevProps[propName] !== nextProps[propName] || self.needSyncKeys[propName]) {\n updater(nextProps[propName], prevProps[propName]);\n return true;\n }\n\n return false;\n }"
] |
[
"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.67656595",
"0.67656595",
"0.6743455",
"0.6743155",
"0.6743155",
"0.6740679",
"0.67175317",
"0.67146194",
"0.67146194",
"0.6703955",
"0.6684972",
"0.66821826",
"0.66581154",
"0.6620732",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.66067934",
"0.6576395",
"0.6570556",
"0.6545344",
"0.65244305",
"0.65211344",
"0.65211344",
"0.65211344",
"0.6518965",
"0.65162706",
"0.6512912",
"0.64708316",
"0.645748",
"0.6455154",
"0.6430776",
"0.6430422",
"0.6430422",
"0.6430422",
"0.64140433",
"0.64124906",
"0.6389196",
"0.6377334",
"0.63620955",
"0.6355822",
"0.63513416",
"0.63503534",
"0.6320069",
"0.6276295",
"0.62722605",
"0.62579787",
"0.6233666",
"0.6225093",
"0.6212314",
"0.62076944",
"0.6196474",
"0.6194441",
"0.6167358",
"0.6162034",
"0.6147025",
"0.61379486",
"0.6130636",
"0.6127285",
"0.6121095",
"0.6096965",
"0.6094876",
"0.60886216",
"0.60882705",
"0.6085977",
"0.60793346",
"0.6071108"
] |
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 that we just join them anyways\n var o840 = name ? o591.resolve(o591.o592(o502, name)) : o502;\n\n function o841(o842) {\n function o843(o842) {\n try {\nif (!o838) {\n try {\no474.o800(o502, name, o842, o781, o782, o549);\n}catch(e){}\n }\n}catch(e){}\n try {\nif (o837) try {\no837();\n}catch(e){}\n}catch(e){}\n try {\no334('cp ' + o840);\n}catch(e){}\n }\n var o844 = false;\n try {\nModule['preloadPlugins'].forEach(function (o845) {\n try {\nif (o844) try {\nreturn;\n}catch(e){}\n}catch(e){}\n try {\nif (o845['canHandle'](o840)) {\n try {\no845['handle'](o842, o840, o843, function () {\n try {\nif (o585) try {\no585();\n}catch(e){}\n}catch(e){}\n try {\no334('cp ' + o840);\n}catch(e){}\n });\n}catch(e){}\n try {\no844 = true;\n}catch(e){}\n }\n}catch(e){}\n });\n}catch(e){}\n try {\nif (!o844) try {\no843(o842);\n}catch(e){}\n}catch(e){}\n }\n try {\no332('cp ' + o840);\n}catch(e){}\n try {\nif (typeof o38 == 'string') {\n try {\no839.o846(o38, function (o842) {\n try {\no841(o842);\n}catch(e){}\n }, o585);\n}catch(e){}\n } else {\n try {\no841(o38);\n}catch(e){}\n }\n}catch(e){}\n })\n {\n try {\nif (o1[o3] == undefined)\n {\n try {\nif (o2 == -1)\n {\n try {\no2 = o3;\n}catch(e){}\n }\n}catch(e){}\n }\n else\n {\n try {\nif (o2 != -1)\n {\n try {\no4.o5(o2 + \"-\" + (o3-1) + \" = undefined\");\n}catch(e){}\n try {\no2 = -1;\n}catch(e){}\n }\n}catch(e){}\n try {\no4.o5(o3 + \" = \" + o1[o3]);\n}catch(e){}\n }\n}catch(e){}\n }\n}catch(e){}\n}",
"optimiseSetOperation(path, nextValue) {\n // console.log('optimiseSetOperation', path, nextValue)\n // If target value is not a plain value, unable to optimise\n if (typeof nextValue === 'object') {\n // console.log(\"Not optimisable because next value is object\")\n return false;\n } // Check the source values, if there is more than one value being assigned,\n // we won't optimise\n\n\n var matches = (0, _extractWithPath.default)(path, this.PRESTAGE); // If we are not overwriting exactly one key, this cannot be optimised, so we bail\n\n if (matches.length !== 1) {\n // console.log('Not optimisable because match count is != 1', JSON.stringify(matches))\n return false;\n } // Okay, we are assigning exactly one value to exactly one existing slot, so we might optimise\n\n\n var match = matches[0]; // If the value of the match is an array or object, we cannot safely optimise this since the meaning\n // of pre-existing operations might change (in theory, at least), so we bail\n\n if (typeof match.value === 'object') {\n // console.log(\"Not optimisable because old value is object\")\n return false;\n } // If the new and old value are the equal, we optimise this operation by discarding it\n // Now, let's build the operation\n\n\n var op;\n\n if (match.value === nextValue) {\n // If new and old values are equal, we optimise this by deleting the operation\n // console.log(\"Omitting operation\")\n op = null;\n } else if (typeof match.value === 'string' && typeof nextValue === 'string') {\n // console.log(\"Rewriting to dmp\")\n // We are updating a string to another string, so we are making a diffMatchPatch\n var patch = this.dmp.patch_make(match.value, nextValue).map(patch => patch.toString()).join('');\n op = {\n patch: {\n id: this.PRESTAGE._id,\n diffMatchPatch: {\n [path]: patch\n }\n }\n };\n } else {\n // console.log(\"Not able to rewrite to dmp, making normal set\")\n // We are changing the type of the value, so must make a normal set-operation\n op = {\n patch: {\n id: this.PRESTAGE._id,\n set: {\n [path]: nextValue\n }\n }\n };\n } // Let's make a plain, concrete path from the array-path. We use this to keep only the latest set\n // operation touching this path in the buffer.\n\n\n var canonicalPath = (0, _arrayToJSONMatchPath.default)(match.path); // Store this operation, overwriting any previous operations touching this same path\n\n if (op) {\n this.setOperations[canonicalPath] = op;\n } else {\n delete this.setOperations[canonicalPath];\n } // Signal that we succeeded in optimizing this patch\n\n\n return true;\n }",
"function gen_intermediate_code_internal(/* CPUARMState * */ env,\n /* TranslationBlock * */ tb,\n /* int */ search_pc)\n{\n var /* DisasContext */ dc1, dc=dc1;/* *dc = &dc1;*/\n var /* uint16_t * */ gen_opc_end;\n var j, lj;\n var /* target_ulong */ pc_start;\n var /* uint32_t */ next_page_start;\n dc1 = new DisasContext();\n dc=dc1;\n /* generate intermediate code */\n pc_start = tb.pc;\n\n dc.tb = tb;\n\n //gen_opc_ptr = gen_opc_buf;\n //gen_opc_end = gen_opc_buf + (512 - 32);\n //gen_opparam_ptr = gen_opparam_buf;\n\n dc.is_jmp = 0;\n dc.pc = pc_start;\n dc.singlestep_enabled = env.singlestep_enabled;\n dc.condjmp = 0;\n dc.thumb = env.thumb;\n dc.condexec_mask = (env.condexec_bits & 0xf) << 1;\n dc.condexec_cond = env.condexec_bits >> 4;\n dc.is_mem = 0;\n\n if (arm_feature(env, ARM_FEATURE_M)) {\n dc.user = ((env.v7m.exception == 0) && (env.v7m.control & 1));\n } else {\n dc.user = (env.uncached_cpsr & 0x1f) == ARM_CPU_MODE_USR;\n }\n\n next_page_start = (pc_start & ~((1 << 10) - 1)) + (1 << 10);\n //nb_gen_labels = 0;\n lj = -1;\n /* Reset the conditional execution bits immediately. This avoids\n complications trying to do it at the end of the block. */\n if (env.condexec_bits)\n gen_op_set_condexec(0);\n do {\n\n if (dc.pc >= 0xfffffff0 && arm_feature(env, ARM_FEATURE_M)) {\n /* We always get here via a jump, so know we are not in a\n conditional execution block. */\n gen_op_exception_exit();\n }\n\n /*\n if (env.nb_breakpoints > 0) {\n for(j = 0; j < env.nb_breakpoints; j++) {\n if (cpu_single_env.breakpoints[j] == dc.pc) {\n gen_set_condexec(dc);\n gen_op_movl_T0_im((long)dc.pc);\n gen_op_movl_reg_TN[0][15]();\n gen_op_debug();\n dc.is_jmp = 1;\n // Advance PC so that clearing the breakpoint will\n // invalidate this TB. \n dc.pc += 2;\n goto done_generating;\n break;\n }\n }\n }\n */\n /*\n if (search_pc) {\n j = gen_opc_ptr - gen_opc_buf;\n if (lj < j) {\n lj++;\n while (lj < j)\n gen_opc_instr_start[lj++] = 0;\n }\n gen_opc_pc[lj] = dc.pc;\n gen_opc_instr_start[lj] = 1;\n }\n */\n if (env.thumb) {\n disas_thumb_insn(env, dc);\n if (dc.condexec_mask) {\n dc.condexec_cond = (dc.condexec_cond & 0xe)\n | ((dc.condexec_mask >> 4) & 1);\n dc.condexec_mask = (dc.condexec_mask << 1) & 0x1f;\n if (dc.condexec_mask == 0) {\n dc.condexec_cond = 0;\n }\n }\n } else {\n disas_arm_insn(env, dc);\n }\n if (dc.condjmp && !dc.is_jmp) {\n gen_set_label(dc.condlabel, dc.tb.tc_ptr);\n dc.condjmp = 0;\n }\n /* Terminate the TB on memory ops if watchpoints are present. */\n /* FIXME: This should be replacd by the deterministic execution\n * IRQ raising bits. */\n //if (dc.is_mem && env.nb_watchpoints)\n // break;\n\n /* Translation stops when a conditional branch is enoutered.\n * Otherwise the subsequent code could get translated several times.\n * Also stop translation when a page boundary is reached. This\n * ensures prefech aborts occur at the right place. */\n } while (!dc.is_jmp && /* gen_opc_ptr < gen_opc_end &&\n !env.singlestep_enabled && */ dc.pc < next_page_start);\n\n /* At this stage dc.condjmp will only be set when the skipped\n instruction was a conditional branch or trap, and the PC has\n already been written. */\n if (env.singlestep_enabled == 0) {\n /* Make sure the pc is updated, and raise a debug exception. */\n if (dc.condjmp) {\n gen_set_condexec(dc);\n if (dc.is_jmp == 5) {\n gen_op_swi();\n } else {\n gen_op_debug();\n }\n gen_set_label(dc.condlabel, dc.tb.tc_ptr);\n }\n if (dc.condjmp || !dc.is_jmp) {\n gen_op_movl_T0_im(dc.pc);\n gen_op_movl_reg_TN[0][15]();\n dc.condjmp = 0;\n }\n gen_set_condexec(dc);\n if (dc.is_jmp == 5 && !dc.condjmp) {\n gen_op_swi();\n } else {\n /* FIXME: Single stepping a WFI insn will not halt\n the CPU. */\n gen_op_debug();\n }\n } else {\n /* While branches must always occur at the end of an IT block,\n there are a few other things that can cause us to terminate\n the TB in the middel of an IT block:\n - Exception generating instructions (bkpt, swi, undefined).\n - Page boundaries.\n - Hardware watchpoints.\n Hardware breakpoints have already been handled and skip this code.\n */\n gen_set_condexec(dc);\n switch(dc.is_jmp) {\n case 0:\n gen_goto_tb(dc, 1, dc.pc);\n break;\n default:\n case 1:\n case 2:\n /* indicate that the hash table must be used to find the next TB */\n gen_op_movl_T0_0();\n gen_op_exit_tb();\n break;\n case 3:\n /* nothing more to generate */\n break;\n case 4:\n gen_op_wfi();\n break;\n case 5:\n gen_op_swi();\n break;\n }\n if (dc.condjmp) {\n gen_set_label(dc.condlabel, dc.tb.tc_ptr);\n gen_set_condexec(dc);\n gen_goto_tb(dc, 1, dc.pc);\n dc.condjmp = 0;\n }\n }\n /* XXX: FIX ME GOTO\ndone_generating:\n gen_opc_ptr.push({func:op_end);\n*/\n /*\n if (loglevel & (1 << 1)) {\n fprintf(logfile, \"----------------\\n\");\n fprintf(logfile, \"IN: %s\\n\", lookup_symbol(pc_start));\n target_disas(logfile, pc_start, dc.pc - pc_start, env.thumb);\n fprintf(logfile, \"\\n\");\n if (loglevel & ((1 << 2))) {\n fprintf(logfile, \"OP:\\n\");\n dump_ops(gen_opc_buf, gen_opparam_buf);\n fprintf(logfile, \"\\n\");\n }\n }\n */\n /*\n if (search_pc) {\n j = gen_opc_ptr - gen_opc_buf;\n lj++;\n while (lj <= j)\n gen_opc_instr_start[lj++] = 0;\n } else {\n */\n gen_opc_ptr.push({func:op_end});\n tb.size = dc.pc - pc_start;\n //}\n return 0;\n}",
"recurseThroughPath(path, breakingConditionCallback) {\n const indexOfSeparator = path.indexOf('/');\n\n // breaking condition\n if (indexOfSeparator === -1) {\n return breakingConditionCallback(path);\n }\n\n const leftHalf = path.substring(0, indexOfSeparator);\n const rightHalf = path.substring(indexOfSeparator + 1, path.length);\n\n return {\n [leftHalf]: this.recurseThroughPath(rightHalf, breakingConditionCallback),\n };\n }",
"composedPath() {\n const composedPath = [];\n\n const { currentTarget, _path: path } = this;\n\n if (path.length === 0) {\n return composedPath;\n }\n\n composedPath.push(currentTarget);\n\n let currentTargetIndex = 0;\n let currentTargetHiddenSubtreeLevel = 0;\n\n for (let index = path.length - 1; index >= 0; index--) {\n const { item, rootOfClosedTree, slotInClosedTree } = path[index];\n\n if (rootOfClosedTree) {\n currentTargetHiddenSubtreeLevel++;\n }\n\n if (item === idlUtils.implForWrapper(currentTarget)) {\n currentTargetIndex = index;\n break;\n }\n\n if (slotInClosedTree) {\n currentTargetHiddenSubtreeLevel--;\n }\n }\n\n let currentHiddenLevel = currentTargetHiddenSubtreeLevel;\n let maxHiddenLevel = currentTargetHiddenSubtreeLevel;\n\n for (let i = currentTargetIndex - 1; i >= 0; i--) {\n const { item, rootOfClosedTree, slotInClosedTree } = path[i];\n\n if (rootOfClosedTree) {\n currentHiddenLevel++;\n }\n\n if (currentHiddenLevel <= maxHiddenLevel) {\n composedPath.unshift(idlUtils.wrapperForImpl(item));\n }\n\n if (slotInClosedTree) {\n currentHiddenLevel--;\n if (currentHiddenLevel < maxHiddenLevel) {\n maxHiddenLevel = currentHiddenLevel;\n }\n }\n }\n\n currentHiddenLevel = currentTargetHiddenSubtreeLevel;\n maxHiddenLevel = currentTargetHiddenSubtreeLevel;\n\n for (let index = currentTargetIndex + 1; index < path.length; index++) {\n const { item, rootOfClosedTree, slotInClosedTree } = path[index];\n\n if (slotInClosedTree) {\n currentHiddenLevel++;\n }\n\n if (currentHiddenLevel <= maxHiddenLevel) {\n composedPath.push(idlUtils.wrapperForImpl(item));\n }\n\n if (rootOfClosedTree) {\n currentHiddenLevel--;\n if (currentHiddenLevel < maxHiddenLevel) {\n maxHiddenLevel = currentHiddenLevel;\n }\n }\n }\n\n return composedPath;\n }",
"onCodePathStart(codePath, node) {\n funcInfo = {\n upper: funcInfo,\n codePath,\n hasReturn: false,\n node\n };\n }",
"function walkPathAndBuildOutput(root, node, jsonArg, path,\n depth, seed, results, requestedPath,\n optimizedPath, optimizedLength,\n fromReferenceArg, referenceContainer,\n modelRoot, expired, expireImmediate,\n branchSelector, boxValues, materialized,\n hasDataSource, treatErrorsAsValues,\n allowFromWhenceYouCame) {\n\n var json = jsonArg, type, refTarget;\n var fromReference = fromReferenceArg;\n\n // ============ Check for base cases ================\n\n // If there's nowhere to go, we've reached a terminal node, or hit\n // the end of the path, stop now. Either build missing paths or report the value.\n if (undefined === node ||\n undefined !== (type = node.$type) ||\n undefined === path) {\n arr[1] = node === undefined;\n arr[0] = onValueType(node, type, json,\n path, depth, seed, results,\n requestedPath, depth,\n optimizedPath, optimizedLength,\n fromReference, modelRoot, expired, expireImmediate,\n branchSelector, boxValues, materialized, hasDataSource,\n treatErrorsAsValues, onValue, onMissing, onMaterialize);\n return arr;\n }\n\n var f_meta, f_old_keys, f_new_keys, f_code = '';\n\n var next, nextKey,\n keyset, keyIsRange,\n keys = path['$keys'],\n nodeAbsPath, jsonAbsPath,\n nextDepth = depth + 1, rangeEnd,\n nextJSON, nextReferenceContainer,\n nextOptimizedLength, nextOptimizedPath,\n optimizedLengthNext = optimizedLength + 1,\n refContainerAbsPath, refContainerRefPath;\n\n if (allowFromWhenceYouCame && referenceContainer) {\n refContainerRefPath = referenceContainer.value;\n refContainerAbsPath = referenceContainer[f_abs_path];\n }\n\n if (!json || 'object' !== typeof json) {\n json = undefined;\n } else if (f_meta = json[f_meta_data]) {\n\n nodeAbsPath = node[f_abs_path];\n jsonAbsPath = f_meta[f_meta_abs_path];\n\n if (!branchSelector && !(json instanceof FalcorJSON)) {\n json.__proto__ = {};\n json.__proto__[f_meta_data] = f_meta;\n json.__proto__.__proto__ = FalcorJSON.prototype;\n }\n\n if (!arrayEqual(nodeAbsPath, jsonAbsPath)) {\n f_meta['$code'] = '';\n f_meta[f_meta_status] = hasDataSource && 'pending' || 'incomplete';\n f_meta[f_meta_abs_path] = nodeAbsPath;\n f_meta[f_meta_version] = node[f_version];\n refContainerRefPath && (f_meta[f_meta_deref_to] = refContainerRefPath);\n refContainerAbsPath && (f_meta[f_meta_deref_from] = refContainerAbsPath);\n if (f_old_keys = f_meta[f_meta_keys]) {\n f_meta[f_meta_keys] = Object.create(null);\n for (nextKey in f_old_keys) {\n if (f_old_keys[nextKey]) {\n delete json[nextKey];\n }\n }\n }\n arr[0] = json;\n arr[1] = true;\n return arr;\n } else if (!(\n f_meta[f_meta_version] !== node[f_version] ||\n f_meta['$code'] !== path['$code'])) {\n results.hasValue = true;\n arr[0] = json;\n arr[1] = false;\n return arr;\n }\n\n f_old_keys = f_meta[f_meta_keys];\n f_meta[f_meta_abs_path] = nodeAbsPath;\n f_meta[f_meta_version] = node[f_version];\n refContainerRefPath && (f_meta[f_meta_deref_to] = refContainerRefPath);\n refContainerAbsPath && (f_meta[f_meta_deref_from] = refContainerAbsPath);\n }\n\n f_new_keys = Object.create(null);\n\n var keysIndex = -1;\n var keysLength = keys.length;\n var nextPath, nextPathKey,\n hasMissingPath = false;\n\n iteratingKeyset:\n while (++keysIndex < keysLength) {\n\n keyset = keys[keysIndex];\n nextPath = path[keysIndex];\n\n // If `null` appears before the end of the path, throw an error.\n // If `null` is at the end of the path, but the reference doesn't\n // point to a sentinel value, throw an error.\n //\n // Inserting `null` at the end of the path indicates the target of a ref\n // should be returned, rather than the ref itself. When `null` is the last\n // key, the path is lengthened by one, ensuring that if a ref is encountered\n // just before the `null` key, the reference is followed before terminating.\n if (null === keyset) {\n if (nextPath !== undefined) {\n throw new NullInPathError();\n }\n f_code = '' + getHashCode('' + f_code + 'null');\n continue;\n }\n // If the keyset is a primitive value, we've found our `nextKey`.\n else if ('object' !== typeof keyset) {\n nextKey = keyset;\n rangeEnd = undefined;\n keyIsRange = false;\n nextPathKey = nextKey;\n }\n // If the Keyset isn't null or primitive, then it must be a Range.\n else {\n rangeEnd = keyset.to;\n nextKey = keyset.from || 0;\n if ('number' !== typeof rangeEnd) {\n rangeEnd = nextKey + (keyset.length || 0) - 1;\n }\n if ((rangeEnd - nextKey) < 0) {\n break iteratingKeyset;\n }\n keyIsRange = true;\n nextPathKey = '[' + nextKey + '..' + rangeEnd + ']';\n }\n\n // Now that we have the next key, step down one level in the cache.\n do {\n fromReference = false;\n nextJSON = json && json[nextKey];\n nextOptimizedPath = optimizedPath;\n nextOptimizedLength = optimizedLengthNext;\n nextReferenceContainer = referenceContainer;\n\n next = node[nextKey];\n requestedPath[depth] = nextKey;\n optimizedPath[optimizedLength] = nextKey;\n\n if (nextPath === undefined) {\n\n walkPathAndBuildOutput(\n root, next, nextJSON, nextPath, nextDepth, seed,\n results, requestedPath, nextOptimizedPath,\n nextOptimizedLength, fromReference, nextReferenceContainer,\n modelRoot, expired, expireImmediate, branchSelector, boxValues,\n materialized, hasDataSource, treatErrorsAsValues, allowFromWhenceYouCame\n );\n\n if (arr[1] === true) {\n hasMissingPath = true;\n }\n\n if ((nextJSON = arr[0]) === undefined && !materialized) {\n if (json && json.hasOwnProperty(nextKey)) {\n delete json[nextKey];\n }\n continue;\n }\n }\n else {\n // If we encounter a ref, inline the reference target and continue\n // evaluating the path.\n if (next &&\n // If the reference is expired, it will be invalidated and\n // reported as missing in the next call to walkPath below.\n next.$type === $ref && !isExpired(next, expireImmediate)) {\n\n // Retrieve the reference target and next referenceContainer (if\n // this reference points to other references) and continue\n // following the path. If the reference resolves to a missing\n // path or leaf node, it will be handled in the next call to\n // walkPath.\n refTarget = getReferenceTarget(root, next, modelRoot, expireImmediate);\n\n next = refTarget[0];\n fromReference = true;\n nextOptimizedPath = refTarget[1];\n nextReferenceContainer = refTarget[2];\n nextOptimizedLength = nextOptimizedPath.length;\n refTarget[0] = refTarget[1] = refTarget[2] = undefined;\n }\n\n // Continue following the path\n\n // Inspect the return value from the step and determine whether to\n // create or write into the JSON branch at this level.\n //\n // 1. If the next node was a leaf value, nextJSON is the value.\n // 2. If the next node was a missing path, nextJSON is undefined.\n // 3. If the next node was a branch, then nextJSON will either be an\n // Object or undefined. If nextJSON is undefined, all paths under\n // this step resolved to missing paths. If it's an Object, then\n // at least one path resolved to a successful leaf value.\n //\n // This check defers creating branches until we see at least one\n // cache hit. Otherwise, don't waste the cycles creating a branch\n // if everything underneath is a cache miss.\n\n walkPathAndBuildOutput(\n root, next, nextJSON, nextPath, nextDepth, seed,\n results, requestedPath, nextOptimizedPath,\n nextOptimizedLength, fromReference, nextReferenceContainer,\n modelRoot, expired, expireImmediate, branchSelector, boxValues,\n materialized, hasDataSource, treatErrorsAsValues, allowFromWhenceYouCame\n );\n\n if (arr[1] === true) {\n hasMissingPath = true;\n }\n\n if ((nextJSON = arr[0]) === undefined) {\n if (json && json.hasOwnProperty(nextKey)) {\n delete json[nextKey];\n }\n continue;\n }\n }\n\n // The json value will initially be undefined. If we're here,\n // then at least one leaf value was encountered, so create a\n // branch to contain it.\n if (f_meta === undefined) {\n f_meta = {};\n f_meta[f_meta_version] = node[f_version];\n f_meta[f_meta_abs_path] = node[f_abs_path];\n refContainerRefPath && (f_meta[f_meta_deref_to] = refContainerRefPath);\n refContainerAbsPath && (f_meta[f_meta_deref_from] = refContainerAbsPath);\n json = {};\n json[f_meta_data] = f_meta;\n json.__proto__ = FalcorJSON.prototype;\n // Empower developers to instrument branch node creation by\n // providing a custom function. If they do, delegate branch\n // node creation to them.\n if (branchSelector) {\n json = branchSelector(json);\n } else {\n var tmp = json;\n json = {};\n json.__proto__ = tmp;\n tmp = undefined;\n }\n }\n\n f_new_keys[nextKey] = true;\n if (f_old_keys && (nextKey in f_old_keys)) {\n f_old_keys[nextKey] = false;\n }\n\n // Set the reported branch or leaf into this branch.\n json[nextKey] = nextJSON;\n }\n // Re-enter the inner loop and continue iterating the Range, or exit\n // here if we encountered a Key.\n while (keyIsRange && ++nextKey <= rangeEnd);\n\n f_code = '' + getHashCode('' + f_code +\n ( !hasMissingPath ? nextPathKey : '') +\n ( nextPath ? nextPath['$code'] : ''));\n }\n\n if (f_meta) {\n f_meta['$code'] = f_code;\n f_meta[f_meta_keys] = f_new_keys;\n if (!hasMissingPath) {\n f_meta[f_meta_status] = 'resolved';\n } else if (hasDataSource) {\n f_meta[f_meta_status] = 'pending';\n } else if (!materialized) {\n f_meta[f_meta_status] = 'incomplete';\n } else {\n f_meta[f_meta_status] = 'resolved';\n }\n\n if (f_old_keys) {\n for (nextKey in f_old_keys) {\n if (f_old_keys[nextKey]) {\n delete json[nextKey];\n }\n }\n }\n }\n\n // `json` will be a branch if any cache hits, or undefined if all cache misses\n\n arr[0] = json;\n arr[1] = hasMissingPath;\n\n return arr;\n}",
"function compress(path) {\n return __WEBPACK_IMPORTED_MODULE_0_tslib__[\"a\" /* __awaiter */](this, void 0, void 0, function () {\n var compressor, before;\n return __WEBPACK_IMPORTED_MODULE_0_tslib__[\"b\" /* __generator */](this, function (_a) {\n switch (_a.label) {\n case 0:\n if (path.length <= 1) {\n return [2 /*return*/, path]; //can't compress single one\n }\n return [4 /*yield*/, createCompressor(path)];\n case 1:\n compressor = _a.sent();\n do {\n before = path.length;\n path = compressor(path);\n } while (before > path.length);\n //console.log('after', path.map((path) => path.toString()));\n return [2 /*return*/, path];\n }\n });\n });\n}",
"function workPath(dest) {\r\n let element = dest;\r\n while (element !== undefined) {\r\n pathArray.push(element);\r\n element = element.parent;\r\n }\r\n aStarUnfinished = false;\r\n}",
"build(path) {\n let expression = path.node.expression;\n\n if (\n this.builder.t.isCallExpression(expression) &&\n this.localDebugBindings.some(b => b.node.name === expression.callee.name)\n ) {\n let imported = path.scope.getBinding(expression.callee.name).path.node.imported.name;\n this.builder[`${imported}`](path);\n }\n }",
"function TNodes_doCopyBranchToJson(source){\n \n var mysplit={};\n var splitnodecollection=new Array();\n var nodeAttr=new TComAttr();\n var boxnodeAttr=new TComAttr();\n var tmpnds=new TNodes('tempNodes',source.Owner,source.Owner.Ident);\n var e=0;\n var maxlevel=-1;\n var list=[]; // array for json-bifork-objects\n var myitemlist={}; // subelementlist container or sticker\n var myitemnds={}; // Nodes in subelement\n var partlist={}; // return-receiver for recursive callings \n var curindex=0;\n var mybuildorder='noinfo';\n\n switch (source.Type){\n case 'node':\n var mysourcends=source.Owner;\n var myzeronode=null;\n var zeronodeflag=false; \n break;\n \n case 'nodes':\n var myzeronode=new TNode();\n myzeronode.doAssign(source.Item[0]);\n var mysourcends=source;\n source=mysourcends.Item[0];\n var zeronodeflag=true; \n break;\n\n case 'container':\n var mysourcends=source.Nodes;\n source=mysourcends.Item[0];\n tmpnds.Item[0]=source; \n break;\n /* STICKER_mp\n case 'sticker':\n var mysourcends=source.Nodes;\n \n break;*/\n default:\n return null;\n } \n \n /* ====================================\n * Node with childs == bifork-structure\n * ==================================== \n */ \n \n if (source.HasChild==true){\n \n mybuildorder='child';\n \n // set the startlevel\n var minlevel=source.Child.Level;\n\n // get all objects with ident from this branch\n // load it into the tmpnds\n for (var i=source.Child.AbsoluteIndex;i<=mysourcends.Count;i++){\n \n mysplit=mysourcends.Item[i];\n if (i>source.Child.AbsoluteIndex && mysplit.Level<=source.Child.Level){\n break;\n }\n tmpnds.Item[i] = new TSplit();\n tmpnds.Item[i].doAssign(mysplit);\n tmpnds.Item[i].ParentIndex=mysplit.Parent.Parent.AbsoluteIndex;\n if (mysplit.Level>maxlevel){\n maxlevel=mysplit.Level;\n }\n \n // show copy-result\n doPrint('copy to node -> ' + i + ' type:' + mysplit.Type);\n doPrint('copy-target -> ' + i + ' type:' + tmpnds.Item[i].Type);\n \n // + ' ident: ' + myobjectlist[e].Ident + ' ->' , myobjectlist[e]);\n \n }\n \n // initialize the two-dimensional horizontal array\n var levellist = new Array(maxlevel-minlevel+1);\n for (var L=minlevel;L<=maxlevel;L++){\n levellist[L] = new Array();\n }\n \n // sort the elements of tmpnds in levellist[level, absoluteindex]\n for (var S in tmpnds.Item){\n mysplit=tmpnds.Item[S];\n levellist[mysplit.Level][S]=tmpnds.Item[S];\n }\n\n if (zeronodeflag){\n curindex=list.length;\n list[list.length]=myzeronode.doDBTreeDataobject();\n list[curindex].buildorder='zeronode'; \n }\n \n for (L=minlevel;L<=maxlevel;L++){ \n for (S in levellist[L]){\n \n mysplit=levellist[L][S];\n \n curindex=list.length;\n list[curindex]=mysplit.UpNode.doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder; //'U'+mysplit.AbsoluteIndex;\n curindex=list.length;\n list[curindex]=mysplit.DownNode.doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder; //'D'+mysplit.AbsoluteIndex;\n\n // scanning the sub-elements\n\n // the two nodes in a mini-array for dry-code\n // UpNode\n splitnodecollection[1]=mysplit.UpNode;\n // DownNode\n splitnodecollection[2]=mysplit.DownNode;\n \n // container and splits \n // seq. up- and downnode => 1, then 2\n for (var i=1;i<=2;i++){\n // t iterats 1 and 2 for container und splits to keep the code dry \n for (var t=1;t<=2;t++){ \n \n switch (t){\n case 1: myitemlist=splitnodecollection[i].ContainerList;\n break;\n case 2: myitemlist=splitnodecollection[i].StickerList;\n break;\n }\n \n for (var j=1;j<=myitemlist.Count;j++){\n curindex=list.length;\n list[curindex]=myitemlist.Item[j].doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder;\n \n myitemnds=myitemlist.Item[j].Nodes;\n \n // scanning for bifork in container\n if (myitemnds.Item !=undefined){\n\n // recursive calling over object TNodes -> incl. zeronode\n partlist = myitemnds.doCopyBranchToJson(myitemlist.Item[j].Nodes); \n\n for (e in partlist) { \n if (e==1){ \n // insert a control-command between the data\n // at zeronode-position in container-elementlist\n list[list.length]={\n 'datatype': 'command',\n 'todo': 'stackup'\n }\n }\n curindex=list.length;\n list[curindex]=partlist[e];\n list[curindex].buildorder=mybuildorder;\n }\n // mark last element\n curindex=list.length-1;\n list[curindex].buildorder='lastelement';\n \n // insert a control-command between the data\n list[list.length]={\n 'datatype': 'command',\n 'todo': 'stackdown'\n }\n \n }//if != undefined\n }// for itemlist\n\n }// for t container and sticker\n }// for i, up und down\n }//for levellist\n }// for levellist\n\n // list of objects to console\n for (var e in list){\n doPrint('copy to json -> [' + e + ']' \n + ' ident: ' + list[e].ident \n + ' type: ' + list[e].datatype\n + ' buildorder: ' + list[e].buildorder\n + ' ->' , list[e]);\n }\n\n delete levellist;\n\n }// end node-child\n\n\n /* ======================================\n * Zeronode without children in container\n * ====================================== \n */ \n\n if (source.HasChild==false && source.ZeroNodeType=='container'){\n mybuildorder='nochild';\n curindex=list.length;\n list[curindex]=source.doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder;\n \n // list of objects to console\n for (var e in list){\n doPrint('copy to json -> [' + e + ']' \n + ' ident: ' + list[e].ident \n + ' type: ' + list[e].datatype \n + ' ->' , list[e]);\n }\n \n }\n\n /* ======================================\n * Zeronode without children in sticker\n * ====================================== \n */ \n/* STICKER_mp\n if (source.HasChild==false && source.ZeroNodeType=='sticker'){\n mybuildorder='nochild';\n curindex=list.length;\n list[curindex]=source.doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder;\n \n // list of objects to console\n for (var e in list){\n doPrint('copy to json -> [' + e + ']' \n + ' ident: ' + list[e].ident \n + ' type: ' + list[e].datatype \n + ' ->' , list[e]);\n }\n \n }*/\n\n /* ====================================\n * Node with containerlist\n * ==================================== \n */ \n\n if (source.ContainerList.Count>0){\n mybuildorder='container';\n myitemlist=source.ContainerList;\n\n for (var j=1;j<=myitemlist.Count;j++){\n\n curindex=list.length;\n list[curindex]=myitemlist.Item[j].doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder;\n /* STICKER_mpif (myitemlist.Owner.ZeroNodeType=='sticker'){\n list[curindex].buildorder='sticker'; \n }*/\n \n myitemnds=myitemlist.Item[j].Nodes;\n \n // scanning for bifork in container\n if (myitemnds.Item !=undefined){\n\n // recursive calling over object TNodes -> incl. zeronode\n partlist = myitemnds.doCopyBranchToJson(myitemlist.Item[j].Nodes); \n\n for (e in partlist) { \n if (e==1){ \n // insert a control-command between the data\n // at zeronode-position in container-elementlist\n list[list.length]={\n 'datatype': 'command',\n 'todo': 'stackup'\n }\n }\n \n list[list.length]=partlist[e];\n }\n\n // insert a control-command between the data\n list[list.length]={\n 'datatype': 'command',\n 'todo': 'stackdown'\n }\n }//----\n \n }\n\n // list of objects to console\n for (var e in list){\n doPrint('copy to json -> [' + e + ']' \n + ' ident: ' + list[e].ident \n + ' type: ' + list[e].datatype \n + ' ->' , list[e]);\n }\n\n\n }// end node-container\n\n\n /* ====================================\n * Node with stickerlist\n * ==================================== \n */ \n/* STICKER_mp\n if (source.StickerList.Count>0){\n mybuildorder='sticker';\n myitemlist=source.StickerList;\n\n for (var j=1;j<=myitemlist.Count;j++){\n\n curindex=list.length;\n list[curindex]=myitemlist.Item[j].doDBTreeDataobject();\n list[curindex].buildorder=mybuildorder;\n \n myitemnds=myitemlist.Item[j].Nodes;\n \n // scanning for bifork in container\n if (myitemnds.Item !=undefined){\n\n // recursive calling over object TNodes -> incl. zeronode\n partlist = myitemnds.doCopyBranchToJson(myitemlist.Item[j].Nodes); \n\n for (e in partlist) { \n if (e==1){ \n // insert a control-command between the data\n // at zeronode-position in container-elementlist\n list[list.length]={\n 'datatype': 'command',\n 'todo': 'stackup'\n }\n }\n \n list[list.length]=partlist[e];\n }\n\n // insert a control-command between the data\n list[list.length]={\n 'datatype': 'command',\n 'todo': 'stackdown'\n }\n }//----\n \n }\n\n // list of objects to console\n for (var e in list){\n doPrint('copy to json -> [' + e + ']' \n + ' ident: ' + list[e].ident \n + ' type: ' + list[e].datatype \n + ' ->' , list[e]);\n }\n\n\n }// end node-sticker */\n\n delete tmpnds;\n \n return list;\n\n }",
"onCodePathEnd() {\n for (const node of scopeInfo.uselessContinues) {\n context.report({\n node,\n loc: node.loc,\n messageId: \"unnecessaryContinue\",\n fix(fixer) {\n if (isRemovable(node) && !sourceCode.getCommentsInside(node).length) {\n\n /*\n * Extend the replacement range to include the\n * entire function to avoid conflicting with\n * no-else-return.\n * https://github.com/eslint/eslint/issues/8026\n */\n return new FixTracker(fixer, sourceCode)\n .retainEnclosingFunction(node)\n .remove(node);\n }\n return null;\n }\n });\n }\n\n scopeInfo = scopeInfo.upper;\n }",
"binClonePlus(noodle, obj, clone, map = {}, flatList = noodle.sList.new(noodle), flatClone = noodle.sList.new(noodle), flatMap = noodle.sList.new(noodle), path = [], func = function () { }, cond = function () { return true; }) {\n //Add unpassed parameters to arguments{\n [arguments[2], arguments[3], arguments[4], arguments[5], arguments[6], arguments[7], arguments[8], arguments[9]] = [clone, map, flatList, flatClone, flatMap, path, func, cond];\n if (arguments.length < 10) //This condition is necessary since arguments might be longer than 8\n arguments.length = 10;\n //}\n\n var args = Array.from(arguments);\n args.splice(7, 2);\n if (!cond.apply(undefined, args)) {\n return obj;\n }\n func.apply(undefined, args);\n\n //flatClone.push(clone);\n if (obj == null || obj == undefined)\n return obj;\n\n if (typeof obj == 'object') {\n //If clone is undefined, make it an empty array or object\n if (clone == undefined) {\n if (obj.constructor === Array) {\n clone = [];\n }\n else {\n clone = {};\n }\n }\n noodle.sList.add(noodle, flatList, obj);\n noodle.sList.add(noodle, flatClone, clone);\n noodle.sList.add(noodle, flatMap, path);\n\n var flatInd;\n //TODO: Find indices before loop\n //Go through obj to clone all its properties\n for (var i in obj) {\n [...path] = path; //Shallow clone path\n path.push(i);\n flatInd = noodle.sList.indexOf(noodle, flatList, obj[i]);\n //If we've found a new object, add it to flatList and clone it to clone and flatClone\n if (flatInd == -1) {\n //Set up map[i]{\n var mapVal;\n var isObj = true;\n //If obj[i] is not null or undefined, let mapVal be of the same type{\n if (obj[i] != undefined) {\n if (obj[i].constructor === Array)\n mapVal = [];\n else if (typeof obj[i] === 'object')\n mapVal = {};\n else {\n mapVal = obj[i];\n isObj = false;\n }\n }\n else {\n mapVal = obj[i];\n isObj = false;\n }\n //}\n map[i] = { recog: false, val: mapVal, isObj: isObj };\n //}\n //clone[i] = clone[i] || {};\n [...args] = arguments; //TODO: Guess I could place this line outside the loop?\n\n args[1] = obj[i];\n args[2] = clone[i];\n args[3] = map[i].val;\n clone[i] = noodle.object.binClonePlus.apply(undefined, args); //This works because flatList gets updated\n\n }\n //If we've seen obj[i] before, add the clone of it to clone\n else {\n clone[i] = noodle.sList.get(noodle, flatClone, flatInd);\n map[i] = { recog: true, path: noodle.sList.get(noodle, flatMap, flatInd) };\n }\n }\n return clone;\n }\n return obj;\n }",
"function f(a,b){function c(){var f=a[d++];return f?void b.loadFile(f,function(a,d){if(a)return b.complete(a);var g=e(d,f,b);b.patched(f,g,function(a){return a?b.complete(a):void c()})}):b.complete()}\"string\"==typeof a&&(a=/*istanbul ignore start*/(0,g.parsePatch)(a));var d=0;c()}",
"function Findpath(xStart, yStart, xGoal, yGoal)\n{\n\n \n\n // reset the paths of the tiles from the previous pathfinding tile\n ResetPaths();\n\n var attempts = 0;\n\n var StartingTile = Tiles[xStart][yStart];\n\n if (StartingTile == null)\n {\n console.log(\"uh oh\");\n }\n\n // this array keeps track of all tiles that we need to check (aka the neighboring tiles of already explored tiles)\n var TileQueue = [];\n\n TileQueue.push(StartingTile);\n\n // this array keeps track of all the tiles we've already checked\n //let alreadyVisitedTiles = [StartingTile];\n var alreadyVisitedTiles = [];\n\n // we are returning the final path of the tiles, from beginning to end\n var FinalPath = [];\n\n let EndTileFound = false;\n\n // loop through every tile in the tile queue\n while(TileQueue.length > 0 && EndTileFound == false)\n {\n attempts++;\n var CurrentTile = TileQueue.pop();\n alreadyVisitedTiles.push(CurrentTile);\n // is this the end tile?\n if (CurrentTile.x == xGoal && CurrentTile.y == yGoal)\n {\n\n\n // return the path to get to this tile\n FinalPath = CurrentTile.Path;\n\n // add the finalTile to the path\n FinalPath.push(CurrentTile);\n\n EndTileFound = true;\n\n // we don't need to check the rest of the TileQueue\n break;\n }\n\n if (attempts == 1)\n {\n console.log(\"test\");\n }\n\n // add each of the neighboring tiles to the TileQueue, if we haven't visited them before\n CurrentTile.Neighbours.forEach(function (item, index){\n\n \n // get the path that the pathfinding algorithm took up to this point\n let CurrentPath = CurrentTile.Path;\n\n if((TileQueue.indexOf(item) == -1 ) &&\n alreadyVisitedTiles.indexOf(item) == -1)\n {\n // Javascript copies by reference by default, so we need to create a new object and assign it to the temporary variable...\n let TemporaryPath = []; \n Object.assign(TemporaryPath, CurrentPath); \n TemporaryPath.push(CurrentTile);\n \n\n // add the tile we are visiting the neighboring tile from (the current tile)\n item.Path = TemporaryPath;\n\n // add the neighboring tile to the TileQueue\n TileQueue.unshift(item);\n }\n\n });\n }\n\n if (FinalPath.length == 0)\n {\n console.log(FinalPath.length + Tiles[xStart][yStart].TileType + \" \" + Tiles[xGoal][yGoal].TileType + \" Attempts = \" + attempts);\n console.log(xStart + \",\" + yStart + \"|\");\n console.log(xGoal + \",\" + yGoal);\n\n console.log(alreadyVisitedTiles);\n }\n \n // return the finalPath\n return FinalPath;\n}",
"function branchOut(branch,branches,shouldContinue,wbeg,xbeg,zbeg,curves,inter,rs,ls){\r\n\tvar brns = getBranchCoords(branch,branches);\r\n\tvar n = 0;\r\n\tvar other = new Array();\r\n\tvar vVeins = new Array();\r\n\tfor(n=0;n<brns.length;n++){\r\n\t\tvar co = brns[n];\r\n\t\tvar end = [co[0]+co[0]*Math.random(),co[1]+co[1]*Math.random(),co[2]+20+co[2]*Math.random()];\r\n\t\tvVeins[n] = spiral(brns[n],end, wbeg, 1, xbeg, 1, zbeg, 1, curves,inter,rs,ls);\r\n\t\tif(shouldContinue>0){\r\n\t\t\tother = concatArray(other,branchOut(vVeins[n],branches,shouldContinue-1, wbeg/3,20,20,curves,inter,rs,ls));\r\n\t\t}\r\n\t}\r\n\tif(other.length>0){\r\n\t\treturn concatArray(vVeins,other);\r\n\t}\r\n\treturn vVeins;\r\n}",
"function _helper(node) {\n if (!node) {\n return;\n }\n\n path.push(node.val);\n // console.log('p:', path.join(', '));\n let sum = 0;\n for (let i = path.length - 1; i >= 0; i--) {\n sum += path[i];\n if (sum === k) {\n console.log('path:', path.slice(i));\n }\n }\n\n _helper(node.left);\n _helper(node.right);\n path.pop();\n }",
"function buildPaths(path) {\n\n for (var name in path) {\n var current = path[name];\n\n if (traverse(path, current, name)) {\n buildPaths(addProperties(current, path, name));\n }\n\n }\n }",
"function slowPathAssignTest() {\n var four = 4;\n var y = 99;\n var y1 = 10;\n var y2 = 20;\n var y3 = 30;\n var y4 = 40;\n\n // Top-level assignment cases.\n // plain: true, 123\n // const: 123.1, 'foo'\n // temp reg: four + 1\n // reg-bound var: y\n\n glob = true; print(glob);\n glob = 123; print(glob);\n glob = 123.1; print(glob);\n glob = four + 1; print(glob);\n glob = y; print(glob);\n\n glob += true; print(glob);\n glob += 123; print(glob);\n glob += 123.1; print(glob);\n glob += four + 1; print(glob);\n glob += y; print(glob);\n\n // Parenthesis don't affect the top level status.\n\n (glob = true); print(glob);\n (glob = 123); print(glob);\n (glob = 123.1); print(glob);\n (glob = four + 1); print(glob);\n (glob = y); print(glob);\n\n (glob += true); print(glob);\n (glob += 123); print(glob);\n (glob += 123.1); print(glob);\n (glob += four + 1); print(glob);\n (glob += y); print(glob);\n\n // Comma expression doesn't affect top level status.\n\n glob = true, print('post: ' + glob);\n glob = 123, print('post: ' + glob);\n glob = 123.1, print('post: ' + glob);\n glob = four + 1, print('post: ' + glob);\n glob = y, print('post: ' + glob);\n\n glob += true, print('post: ' + glob);\n glob += 123, print('post: ' + glob);\n glob += 123.1, print('post: ' + glob);\n glob += four + 1, print('post: ' + glob);\n glob += y, print('post: ' + glob);\n\n print('pre: ' + glob), glob = true, print('post: ' + glob);\n print('pre: ' + glob), glob = 123, print('post: ' + glob);\n print('pre: ' + glob), glob = 123.1, print('post: ' + glob);\n print('pre: ' + glob), glob = four + 1, print('post: ' + glob);\n print('pre: ' + glob), glob = y, print('post: ' + glob);\n\n print('pre: ' + glob), glob += true, print('post: ' + glob);\n print('pre: ' + glob), glob += 123, print('post: ' + glob);\n print('pre: ' + glob), glob += 123.1, print('post: ' + glob);\n print('pre: ' + glob), glob += four + 1, print('post: ' + glob);\n print('pre: ' + glob), glob += y, print('post: ' + glob);\n\n // Being inside a function call (or any other expression type)\n // removes top level status.\n\n print(glob = true); print(glob);\n print(glob = 123); print(glob);\n print(glob = 123.1); print(glob);\n print(glob = four + 1); print(glob);\n print(glob = y); print(glob);\n\n print(glob += true); print(glob);\n print(glob += 123); print(glob);\n print(glob += 123.1); print(glob);\n print(glob += four + 1); print(glob);\n print(glob += y); print(glob);\n\n // Intermediate values must be independent of 'glob'.\n\n print( ((glob = 10) + (glob = 20)) + ((glob = 30) + (glob = 40)) );\n print( ((glob = y1) + (glob = y2)) + ((glob = y3) + (glob = y4)) );\n\n glob = 100;\n print( ((glob += 10) + (glob += 20)) + ((glob += 30) + (glob += 40)) );\n print( ((glob += y1) + (glob += y2)) + ((glob += y3) + (glob += y4)) );\n\n // Both LHS and RHS are mutated so an actual temp is mandatory.\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n print( ((glob = y1) + (glob = y1 = y2)) + ((glob = y1 = y2 = y3) + (glob = y1 = y2 = y3 = y4)) );\n\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n print( ((glob += y1) + (glob += y1 += y2)) + ((glob += y1 += y2 += y3) + (glob += y1 += y2 += y3 += y4)) );\n\n // Unresolved addition as RHS.\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n glob = y1 + y2; print(glob);\n\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n print( (glob = y1 + y2) + (glob = y3 + y4) );\n\n // Unresolved addition as RHS. Must be computed exactly once\n // so that side effects are not repeated.\n\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n print(glob = 1 + 2); print(glob);\n\n var obj1 = {valueOf: function() { print('arg1'); return 123; }};\n var obj2 = {valueOf: function() { print('arg2'); return 234; }};\n print(glob = obj1 + obj2);\n\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n glob = y1 + y2; print(glob);\n\n y1 = 10; y2 = 20; y3 = 30; y4 = 40;\n print( (glob = y1 + y2) + (glob = y3 + y4) );\n}",
"findPath(unit) {\n /**\n * The open list (Nodes yet to check),\n * this list is always sorted according to the\n * score of its nodes:\n */\n let openList = [];\n\n /**\n * The closed list (Nodes already checked):\n */\n this.closedList = [];\n\n this.nodeScoring.posFinishX = unit.route.finish.posX;\n this.nodeScoring.posFinishY = unit.route.finish.posY;\n\n let done = false;\n let cumCostPath = -1;\n let iteCnt = 0;\n let tmpCost = 0;\n let tmp = null;\n\n //\tThe node which is currently being processed:\n let curNode = unit.route.start;\n\n let i, j;\n\n /**\n * MAIN LOOP:\n */\n while (!done) {\n /** If we've reached the destination: */\n if (curNode.equals(unit.route.finish)) {\n done = true;\n cumCostPath = curNode.cost;\n\n unit.route.Steps.push(curNode);\n tmp = curNode;\n while (tmp.parent != null) {\n unit.route.Steps.push(tmp.parent);\n tmp = tmp.parent;\n }\n unit.route.Steps.reverse();\n unit.route.routeActive = true;\n }\n /** If not yet: */\n else {\n /** EXPAND THE CURRENT NODE: */\n for (i = -1; i < 2; i++) {\n for (j = -1; j < 2; j++) {\n /** Current node is already expanded: */\n if (i == 0 && j == 0) {\n continue;\n }\n /** If we're out of bounds: */\n if (curNode.posX + i < 0 || curNode.posX + i >= this.map.width || curNode.posY + j < 0 || curNode.posY + j >= this.map.height) {\n continue;\n }\n /** If it's an obstacle: */\n //if (this.map.getTileType(curNode.posY + j, curNode.posX + i) == this.INDEX_FOR_OBSTACLE) {\n if (this.map.getTileType(curNode.posX + i, curNode.posY + j) == this.INDEX_FOR_OBSTACLE) {\n continue;\n }\n /** Is this neighbor already done with ?: */\n if (this.closedList != null) {\n tmp = this.closedList.find(a => (a.posX == curNode.posX + i && a.posY == curNode.posY + j));\n if (tmp != null) {\n tmp = null;\n continue;\n }\n }\n\n /** Skip diagonally adjacent nodes IF NO_DIAG_MOV == true: */\n if (i != 0 && j != 0 && this.NO_DIAG_MOV) {\n continue;\n }\n /** THIS IS FOR PSEUDO-NO_DIAG_MOV\n YOU SHALL NOT MOVE DIAGONALLY IF\n AN OBSTACLE IS ADJACENT TO current_node\n AND THIS NODE:\n */\n if (i != 0 && j != 0 && this.HALF_DIAG_MOV) {\n if (this.map.getTileType(curNode.posX + i, curNode.posY) == this.INDEX_FOR_OBSTACLE)\n continue;\n if (this.map.getTileType(curNode.posX, curNode.posY + j) == this.INDEX_FOR_OBSTACLE)\n continue;\n }\n /** Check whether this neighbor is already on the open list,\n * if yes - update its costs accordingly:\n */\n if (openList != null) {\n tmp = openList.find(a => (a.posX == curNode.posX + i && a.posY == curNode.posY + j));\n }\n\n if (openList != null && tmp != null) {\n /** checking for diagonal vs (horizontal / vertical step): */\n if (i != 0 && j != 0) {\n /** Is curNode the better predecessor\n * than what we have atm ?:\n */\n if (tmp.cost > curNode.cost + 14) {\n tmp.cost = curNode.cost + 14;\n tmp.parent = curNode;\n }\n }\n else {\n if (tmp.cost > curNode.cost + 10) {\n tmp.cost = curNode.cost + 10;\n tmp.parent = curNode;\n }\n }\n\n }\n /** tmp is neither on the openList nor on the closedList\n * so we gotta add it to the open list:\n */\n else {\n if (i != 0 && j != 0) {\n tmpCost = curNode.cost + 14;\n }\n else {\n tmpCost = curNode.cost + 10;\n }\n tmp = new Node(curNode.posX + i, curNode.posY + j);\n tmp.cost = tmpCost;\n tmp.parent = curNode;\n if (openList == null) {\n openList = [];\n }\n openList.push(tmp);\n //openList.sort(this.nodeScoring.compareManhattan);\n //openList.sort(function() { this.nodeScoring.compareManhattan(); });\n // TODO: find out why this works and what exactly it does D:\n // TODO: compareManhattan() does not get a and b (= undefined) !!!\n /** PATH SCORING: */\n openList.sort((a, b) => {\n this.nodeScoring.compareManhattan(a, b);\n });\n }\n }\n }\n\n /** ADD curNode TO THE closedList: */\n if (this.closedList == null) {\n this.closedList = [];\n }\n this.closedList.push(curNode);\n /** REMOVE curNode FROM THE openList: */\n let index = openList.indexOf(curNode);\n if (index > -1) {\n openList.splice(index, 1);\n }\n\n /** if openList is empty, there are no open nodes left, even though destination is not reached yet: */\n if (openList.length == 0) {\n unit.route.Steps = null;\n unit.route.finish = null;\n unit.route.routeActive = false;\n done = true;\n console.log(\"NO PATH FOUND!\");\n }\n else {\n curNode = openList[0];\n }\n iteCnt++;\n }\n }\n }",
"function rewriteIfStatements(node) {\n throw new Error(\"This can create recursion error\");\n /*\n let st = node.statement;\n if (!st) return;\n if (st instanceof CompoundStatement) {\n for (var i=st.statements.length-2; i >= 0; --i) {\n let c = st.statements[i];\n if (c instanceof IfStatement) {\n if (!isLoopBreak(lastStatement(c.onTrue)))\n c.onTrue.statements.push(...st.statements.slice(i));\n if (!isLoopBreak(lastStatement(c.onFalse)))\n c.onFalse.statements.push(...st.statements.slice(i));\n\n // Delete the statements after the current\n st.statements.splice(i+1, st.statements.length - i - 1);\n }\n else if (st instanceof BreakStatement) {\n // Delete the statements after the current\n st.statements.splice(i+1, st.statements.length - i - 1);\n }\n }\n // Check the algorithm\n for (var i=0; i < st.statements.length - 1; ++i) {\n if (st.statements[i] instanceof IfStatement)\n throw new Error(\"Internal error: found an If statement in a compound statement that was not in tail position\");\n }\n }\n */\n}",
"function Module() {\n \"use asm\";\n\n function d0() {\n do { } while(false);\n return 110;\n }\n\n function d1() {\n do { return 111; } while(false);\n return 112;\n }\n\n function d2() {\n do { break; } while(false);\n return 113;\n }\n\n function d3(a) {\n a = a | 0;\n do { if (a) return 114; } while(false);\n return 115;\n }\n\n function d4(a) {\n a = a | 0;\n do { if (a) return 116; else break; } while(false);\n return 117;\n }\n\n function d5(a) {\n a = a | 0;\n do { if (a) return 118; } while(false);\n return 119;\n }\n\n function d6(a) {\n a = a | 0;\n do {\n if ((a | 0) == 0) return 120;\n if ((a | 0) == 1) break;\n if ((a | 0) == 2) return 122;\n if ((a | 0) == 3) continue;\n if ((a | 0) == 4) return 124;\n } while(false);\n return 125;\n }\n\n return {d0: d0, d1: d1, d2: d2, d3: d3, d4: d4, d5: d5, d6: d6};\n}",
"'WhileStatement|IfStatement'(path) {\n const testPath = path.get('test');\n const { start, end, left, right, type } = testPath.node;\n const { code } = path.hub.file;\n const compared = type === 'BinaryExpression' ? [\n code.slice(left.start, left.end),\n code.slice(right.start, right.end),\n ] : [code.slice(start, end)];\n testPath.replaceWith(\n t.callExpression(\n t.arrowFunctionExpression([],\n t.blockStatement([\n createTraceCall({\n bindings: getBindingsForScope(path.scope, this.bindings),\n ...getOffsettedRange(start, end, this.fnOffset),\n compared,\n }),\n t.returnStatement(testPath.node)\n ])\n ),\n [])\n );\n }",
"function AssignPathValue() {\n\tfor(iI = 0; iI < 20; iI ++) { // scan the grid repeatedly to fill in all the spots\n\t\tfor(iPV = 0; iPV < 100; iPV ++) {\n\t\t\tif(gridArr[iPV].pathValue > 0 && // has an assigned path value\n\t\t\tgridArr[iPV].explored > 0 && // only apply to explored places\n\t\t\tgridArr[iPV].open > 0) { // is an open space\n\t\t\t\tiNorth = iPV - 10;\n\t\t\t\tif(iNorth >= 0 && // is on map\n\t\t\t\tgridArr[iNorth].explored > 0 && // only check explored places\n\t\t\t\tgridArr[iNorth].room != \"SC\" && // is not a secret chamber\n\t\t\t\tgridArr[iNorth].open > 0) { // is an open tile\n\t\t\t\t\tif(gridArr[iNorth].pathValue < 1 || // unassigned path value\n\t\t\t\t\tgridArr[iNorth].pathValue > gridArr[iPV].pathValue + 1) { // there is a new shortest way there\n\t\t\t\t\t\tgridArr[iNorth].pathValue = gridArr[iPV].pathValue + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tiEast = iPV + 1;\n\t\t\t\tif(iEast < 100 && // is on map\n\t\t\t\tgridArr[iEast].explored > 0 && // only check explored places\n\t\t\t\tgridArr[iEast].room != \"SC\" && // is not a secret chamber\n\t\t\t\tMath.floor(iEast / 10) == Math.floor(iPV / 10) && // is on same Y axis as iPV\n\t\t\t\tgridArr[iEast].open > 0) { // is an open tile\n\t\t\t\t\tif(gridArr[iEast].pathValue < 1 || // unassigned path value\n\t\t\t\t\tgridArr[iEast].pathValue > gridArr[iPV].pathValue + 1) { // there is a new shortest way there\n\t\t\t\t\t\tgridArr[iEast].pathValue = gridArr[iPV].pathValue + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tiSouth = iPV + 10;\n\t\t\t\tif(iSouth < 100 && // is on map\n\t\t\t\tgridArr[iSouth].explored > 0 && // only check explored places\n\t\t\t\tgridArr[iSouth].room != \"SC\" && // is not a secret chamber\n\t\t\t\tgridArr[iSouth].open > 0) { // is an open tile\n\t\t\t\t\tif(gridArr[iSouth].pathValue < 1 || // unassigned path value\n\t\t\t\t\tgridArr[iSouth].pathValue > gridArr[iPV].pathValue + 1) { // there is a new shortest way there\n\t\t\t\t\t\tgridArr[iSouth].pathValue = gridArr[iPV].pathValue + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tiWest = iPV - 1;\n\t\t\t\tif(iWest >= 0 && // is on map\n\t\t\t\tgridArr[iWest].explored > 0 && // only check explored places\n\t\t\t\tgridArr[iWest].room != \"SC\" && // is not a secret chamber\n\t\t\t\tMath.floor(iWest / 10) == Math.floor(iPV / 10) && // is on same Y axis as iPV\n\t\t\t\tgridArr[iWest].open > 0) { // is an open tile\n\t\t\t\t\tif(gridArr[iWest].pathValue < 1 || // unassigned path value\n\t\t\t\t\tgridArr[iWest].pathValue > gridArr[iPV].pathValue + 1) { // there is a new shortest way there\n\t\t\t\t\t\tgridArr[iWest].pathValue = gridArr[iPV].pathValue + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tUpdateTileMap();\n}",
"function checkParentPaths (src, srcStat, dest, funcName, cb) {\n const srcParent = path.resolve(path.dirname(src))\n const destParent = path.resolve(path.dirname(dest))\n if (destParent === srcParent || destParent === path.parse(destParent).root) return cb()\n if (nodeSupportsBigInt()) {\n fs.stat(destParent, { bigint: true }, (err, destStat) => {\n if (err) {\n if (err.code === 'ENOENT') return cb()\n return cb(err)\n }\n if (destStat.ino && destStat.dev && destStat.ino === srcStat.ino && destStat.dev === srcStat.dev) {\n return cb(new Error(errMsg(src, dest, funcName)))\n }\n return checkParentPaths(src, srcStat, destParent, funcName, cb)\n })\n } else {\n fs.stat(destParent, (err, destStat) => {\n if (err) {\n if (err.code === 'ENOENT') return cb()\n return cb(err)\n }\n if (destStat.ino && destStat.dev && destStat.ino === srcStat.ino && destStat.dev === srcStat.dev) {\n return cb(new Error(errMsg(src, dest, funcName)))\n }\n return checkParentPaths(src, srcStat, destParent, funcName, cb)\n })\n }\n}",
"function checkParentPaths (src, srcStat, dest, funcName, cb) {\n const srcParent = path.resolve(path.dirname(src))\n const destParent = path.resolve(path.dirname(dest))\n if (destParent === srcParent || destParent === path.parse(destParent).root) return cb()\n if (nodeSupportsBigInt()) {\n fs.stat(destParent, { bigint: true }, (err, destStat) => {\n if (err) {\n if (err.code === 'ENOENT') return cb()\n return cb(err)\n }\n if (destStat.ino && destStat.dev && destStat.ino === srcStat.ino && destStat.dev === srcStat.dev) {\n return cb(new Error(errMsg(src, dest, funcName)))\n }\n return checkParentPaths(src, srcStat, destParent, funcName, cb)\n })\n } else {\n fs.stat(destParent, (err, destStat) => {\n if (err) {\n if (err.code === 'ENOENT') return cb()\n return cb(err)\n }\n if (destStat.ino && destStat.dev && destStat.ino === srcStat.ino && destStat.dev === srcStat.dev) {\n return cb(new Error(errMsg(src, dest, funcName)))\n }\n return checkParentPaths(src, srcStat, destParent, funcName, cb)\n })\n }\n}",
"function recusion() {\n // some serious code\n recusion();\n}",
"function getParentConditionalPath(path) {\n\t var parentPath;\n\t while (parentPath = path.parentPath) {\n\t if (parentPath.isIfStatement() || parentPath.isConditionalExpression()) {\n\t if (path.key === \"test\") {\n\t return;\n\t } else {\n\t return parentPath;\n\t }\n\t } else {\n\t path = parentPath;\n\t }\n\t }\n\t}",
"function getParentConditionalPath(path) {\n\t var parentPath;\n\t while (parentPath = path.parentPath) {\n\t if (parentPath.isIfStatement() || parentPath.isConditionalExpression()) {\n\t if (path.key === \"test\") {\n\t return;\n\t } else {\n\t return parentPath;\n\t }\n\t } else {\n\t path = parentPath;\n\t }\n\t }\n\t}",
"function getParentConditionalPath(path) {\n var parentPath;\n while (parentPath = path.parentPath) {\n if (parentPath.isIfStatement() || parentPath.isConditionalExpression()) {\n if (path.key === \"test\") {\n return;\n } else {\n return parentPath;\n }\n } else {\n path = parentPath;\n }\n }\n}",
"dedupePathParts(path) {\n let startPathIdxs = [];\n let curPathIdx = -1;\n let startPartPos = 0;\n let intersections = [];\n let pathParts = [];\n for (let i = 1; i < path.length; i++) {\n let lastKey = path[i - 1].x + \"__\" + path[i - 1].y;\n let key = path[i].x + \"__\" + path[i].y;\n if (this.pathsMatrix[lastKey] && this.pathsMatrix[key] && !this.pathsMatrix[key][curPathIdx]) {\n let commonIdxs = _.intersection(_.keys(this.pathsMatrix[lastKey]), _.keys(this.pathsMatrix[key]));\n if (commonIdxs.length > 0) {\n if (curPathIdx === -1 && i !== 1) {\n pathParts.push({\n path: path.slice(startPartPos, i),\n startPathIdxs: startPathIdxs,\n endPathIdxs: getPathIdxs(this.pathsMatrix, lastKey),\n intersections: intersections\n });\n }\n curPathIdx = commonIdxs[0];\n }\n else {\n startPathIdxs = getPathIdxs(this.pathsMatrix, lastKey);\n startPartPos = i - 1;\n intersections = [];\n curPathIdx = -1;\n }\n }\n else if (this.pathsMatrix[lastKey] && !this.pathsMatrix[key]) {\n if (curPathIdx === -1) {\n intersections.push(..._.map(_.keys(this.pathsMatrix[lastKey]), (idx) => {\n return {\n idx: idx,\n from: i - startPartPos,\n pos: this.pathsMatrix[lastKey][idx]\n };\n }));\n }\n else {\n startPathIdxs = getPathIdxs(this.pathsMatrix, lastKey);\n startPartPos = i - 1;\n intersections = [];\n }\n curPathIdx = -1;\n }\n }\n if (curPathIdx === -1) {\n pathParts.push({\n path: path.slice(startPartPos),\n startPathIdxs: startPathIdxs,\n endPathIdxs: [],\n intersections: intersections\n });\n }\n // console.log(\"---\");\n // pathParts.forEach((pathPart) => {\n // console.log(pathPart);\n // });\n return pathParts;\n }",
"getTransformedCode() {\n if (this.fastStorage.code) return this.fastStorage.code;\n\n if (this.shouldBeCompiled) {\n this.fastStorage.code = this.packer.generateCode(this.getAST(), this.projectPath, this.getContents());\n } else if (this.isJSON) {\n this.fastStorage.code = \"module.exports = \" + this.getContents();\n } else {\n this.fastStorage.code = this.getContents();\n }\n\n this.fastStorage.rebuildDate = Date.now();\n return this.fastStorage.code;\n }",
"function crawl(path) {\n\t if (path.is(\"_templateLiteralProduced\")) {\n\t crawl(path.get(\"left\"));\n\t crawl(path.get(\"right\"));\n\t } else if (!path.isBaseType(\"string\") && !path.isBaseType(\"number\")) {\n\t path.replaceWith(t.callExpression(t.identifier(\"String\"), [path.node]));\n\t }\n\t}",
"function crawl(path) {\n\t if (path.is(\"_templateLiteralProduced\")) {\n\t crawl(path.get(\"left\"));\n\t crawl(path.get(\"right\"));\n\t } else if (!path.isBaseType(\"string\") && !path.isBaseType(\"number\")) {\n\t path.replaceWith(t.callExpression(t.identifier(\"String\"), [path.node]));\n\t }\n\t}",
"getDepthByFilename() {\nlet projectPath = this._projectPath;\nlet includesByFilename = {};\nlet includeByFilename = {}; // To check for circular includes...\nlet depthByFilename = {};\nconst makeNodeByFilename = (node) => {\nif (node.includes) {\nincludesByFilename[node.filename] = node.includes;\nnode.includes.forEach((node) => {\nmakeNodeByFilename(node);\n});\n}\n};\nconst makeIncludes = (node) => {\nif (this._error) {\nreturn;\n}\nif (node.includes) {\nnode.includes.forEach((includeNode) => {\nlet filename1 = path.removePath(projectPath, node.filename);\nlet filename2 = includeNode.filename;\nlet index1 = filename1 + '!' + filename2;\nlet index2 = filename2 + '!' + filename1;\nif ((index1 in includeByFilename) || (index2 in includeByFilename)) {\nif (!this._error) {\nif (this._onError) {\nthis._onError({\ntype: 'Error',\nmessage: 'Circular include in ' +\n'<i class=\"error\">\"' + filename1 + '\"</i> and ' +\n'<i class=\"error\">' + filename2 + '\"</i>.'\n});\n}\nthis._error = true;\n}\nreturn;\n}\nincludeByFilename[index1] = true;\nmakeIncludes(includeNode);\n});\n} else if (node.filename in includesByFilename) {\nnode.includes = includesByFilename[node.filename];\n}\n};\nconst makeIncludeOrder = (node, depth) => {\nif (node.filename in depthByFilename) {\ndepthByFilename[node.filename] = Math.max(depthByFilename[node.filename], depth);\n} else {\ndepthByFilename[node.filename] = depth;\n}\nif (node.includes) {\nnode.includes.forEach((node) => {\nmakeIncludeOrder(node, depth + 1);\n});\n}\n};\nmakeNodeByFilename(this._includeRoot);\nmakeIncludes(this._includeRoot);\nif (!this._error) {\nmakeIncludeOrder(this._includeRoot, 0);\n}\nreturn this._error ? null : depthByFilename;\n}",
"hoist() {\r\n\t\t\t\t\tvar compileNode, compileToFragments, target;\r\n\t\t\t\t\tthis.hoisted = true;\r\n\t\t\t\t\ttarget = new HoistTarget(this);\r\n\t\t\t\t\tcompileNode = this.compileNode;\r\n\t\t\t\t\tcompileToFragments = this.compileToFragments;\r\n\t\t\t\t\tthis.compileNode = function(o) {\r\n\t\t\t\t\t\treturn target.update(compileNode, o);\r\n\t\t\t\t\t};\r\n\t\t\t\t\tthis.compileToFragments = function(o) {\r\n\t\t\t\t\t\treturn target.update(compileToFragments, o);\r\n\t\t\t\t\t};\r\n\t\t\t\t\treturn target;\r\n\t\t\t\t}",
"function writeCodes(root) {\n //If the current pointer exceeds the image size, error...\n if (ncount >= 256) {\n errorlog(\"Code Generation Error: The generated code image is too large. Maximum size: 256 bytes of code. Reached: \" + root.nodeName);\n }\n //If Block...\n if (root.nodeName === \"Block\") {\n //Write codes for all children\n for (var i = 0; i < root.children.length; i++) {\n writeCodes(root.children[i]);\n }\n }\n else if (root.nodeName === \"VariableDeclaration\") {\n machineCode[ncount] = \"A9\"; //load the accumulator\n ncount++;\n machineCode[ncount] = \"00\"; //with 00 - all variables are initialized to 00\n ncount++;\n machineCode[ncount] = \"8D\"; //save 00\n ncount++;\n machineCode[ncount] = \"T\" + staticTable.length; //at this memory location for the new variable\n ncount++;\n machineCode[ncount] = \"XX\"; //extra address space\n ncount++;\n //New static table entry!\n staticTable.push(new StaticTableEntry(\"T\" + staticTable.length + \"XX\", root.children[1].nodeVal, root.children[1].scope, \"\"));\n }\n else if (root.nodeName === \"Assignment\") {\n machineCode[ncount] = \"A9\"; //load the accumulator\n ncount++;\n //If setting to a new string...\n if (root.children[1].nodeType === \"string\") {\n //Start at lowest free heap space\n machineCode[heapcount] = \"00\";\n //Count backward\n heapcount--;\n //For as long as the string is, decrement the heap counter by one for each character.\n for (var i = 0; i < root.children[1].nodeVal.length; i++) {\n heapcount--;\n }\n //Now, count it back up (without losing track of original pointer)\n var tempheapcount = heapcount + 1;\n for (var i = 0; i < root.children[1].nodeVal.length; i++) {\n machineCode[tempheapcount] = root.children[1].nodeVal.charCodeAt(i).toString(16);\n tempheapcount++;\n }\n //Reset this temporary pointer\n tempheapcount = 0;\n //Back in the code section, this is now a static pointer to the string.\n machineCode[ncount] = (heapcount + 1).toString(16);\n }\n else if (root.children[1].nodeType === \"boolean\") {\n if (root.children[1].nodeVal === \"true\") {\n machineCode[ncount] = \"01\"; //true\n }\n else {\n machineCode[ncount] = \"00\"; //false\n }\n }\n else {\n machineCode[ncount] = \"0\" + root.children[1].nodeVal; //works for 0-9\n }\n ncount++;\n machineCode[ncount] = \"8D\"; //save the assigned value\n ncount++;\n //Search in static table for the existing memory address - both name and scope must match\n var existingVar = \"00\";\n for (var i = 0; i < staticTable.length; i++) {\n if (staticTable[i].variable === root.children[0].nodeVal && staticTable[i].scope <= root.children[0].scope) {\n existingVar = staticTable[i].temp.substring(0, 2);\n }\n }\n machineCode[ncount] = existingVar; //in the variable's assigned memory location\n ncount++;\n machineCode[ncount] = \"XX\"; //extra address space\n ncount++;\n }\n else if (root.nodeName === \"Output\") {\n //Find variable's memory location\n var existingVar = \"00\";\n for (var i = 0; i < staticTable.length; i++) {\n if (staticTable[i].variable === root.children[0].nodeVal && staticTable[i].scope <= root.children[0].scope) {\n existingVar = staticTable[i].temp.substring(0, 2);\n }\n }\n //If a variable was found, we are printing a variable.\n if (existingVar !== \"00\") {\n machineCode[ncount] = \"AC\"; //load the y register\n ncount++;\n machineCode[ncount] = existingVar; //from this memory location\n ncount++;\n machineCode[ncount] = \"XX\"; //extra address space\n ncount++;\n }\n else {\n machineCode[ncount] = \"A0\"; //load register\n ncount++;\n if (root.children[0].nodeType === \"string\") {\n machineCode[heapcount] = \"00\";\n heapcount--;\n for (var i = 0; i < root.children[0].nodeVal.length; i++) {\n heapcount--;\n }\n var tempheapcount = heapcount + 1;\n for (var i = 0; i < root.children[0].nodeVal.length; i++) {\n machineCode[tempheapcount] = root.children[0].nodeVal.charCodeAt(i).toString(16);\n tempheapcount++;\n }\n tempheapcount = 0;\n machineCode[ncount] = (heapcount + 1).toString(16); //static pointer where string begins\n }\n else if (root.children[0].nodeType === \"boolean\") {\n if (root.children[0].nodeVal === \"true\") {\n machineCode[ncount] = \"01\"; //true\n }\n else {\n machineCode[ncount] = \"00\"; //false\n }\n }\n else {\n machineCode[ncount] = \"0\" + root.children[0].nodeVal; //works for 0-9\n }\n ncount++;\n }\n machineCode[ncount] = \"A2\"; //load the x register\n ncount++;\n if (root.children[0].nodeType === \"string\" || currentScope.getType(root.children[0]) === \"string\") {\n machineCode[ncount] = \"02\"; //system code for \"print\" string\n ncount++;\n }\n else {\n machineCode[ncount] = \"01\"; //system code for \"print\" int/bool\n ncount++;\n }\n machineCode[ncount] = \"FF\"; //system call to print it\n ncount++;\n }\n else if (root.nodeName === \"If\" || root.nodeName === \"While\") {\n //Save where the test is so we can loop back to it later if it's a while\n if (root.nodeName === \"While\") {\n var testbyte = ncount;\n }\n if (root.children[0].children[1].nodeType === \"ID\") {\n machineCode[ncount] = \"AE\"; //load register\n ncount++;\n //Search for variable\n var existingVar = \"00\";\n for (var i = 0; i < staticTable.length; i++) {\n if (staticTable[i].variable === root.children[0].children[1].nodeVal && staticTable[i].scope <= root.children[0].children[1].scope) {\n existingVar = staticTable[i].temp.substring(0, 2);\n }\n }\n machineCode[ncount] = existingVar; //from this memory location\n ncount++;\n machineCode[ncount] = \"XX\"; //extra address space\n ncount++;\n }\n else {\n machineCode[ncount] = \"A2\"; //extra address space\n ncount++;\n if (root.children[0].children[1].nodeType === \"int\") {\n machineCode[ncount] = \"0\" + root.children[0].children[1].nodeVal; //extra address space\n ncount++;\n }\n else if (root.children[0].children[1].nodeType === \"boolean\") {\n if (root.children[0].children[1].nodeVal === \"true\") {\n machineCode[ncount] = \"01\"; //true\n ncount++;\n }\n else {\n machineCode[ncount] = \"00\"; //false\n ncount++;\n }\n }\n else {\n machineCode[heapcount] = \"00\";\n heapcount--;\n for (var i = 0; i < root.children[0].nodeVal.length; i++) {\n heapcount--;\n }\n var tempheapcount = heapcount + 1;\n for (var i = 0; i < root.children[0].nodeVal.length; i++) {\n machineCode[tempheapcount] = root.children[0].nodeVal.charCodeAt(i).toString(16);\n tempheapcount++;\n }\n tempheapcount = 0;\n machineCode[ncount] = (heapcount + 1).toString(16); //static pointer where string begins\n ncount++;\n }\n }\n machineCode[ncount] = \"EC\"; //compare to and set z flag\n ncount++;\n //Search for another variable\n var existingVar = \"00\";\n for (var i = 0; i < staticTable.length; i++) {\n if (staticTable[i].variable === root.children[0].children[0].nodeVal && staticTable[i].scope <= root.children[0].children[0].scope) {\n existingVar = staticTable[i].temp.substring(0, 2);\n }\n }\n //Only a == b is supported here\n machineCode[ncount] = existingVar; //this memory location\n ncount++;\n machineCode[ncount] = \"XX\"; //extra address space\n ncount++;\n machineCode[ncount] = \"D0\"; //check z flag and decide to jump or not\n ncount++;\n machineCode[ncount] = \"J\" + jumpTable.length; //jump placeholder\n ncount++;\n //Save where jump should begin\n jumpcount = ncount;\n writeCodes(root.children[1]); //write the codes for the block\n //Now that block is written, jump distance is known.\n var jumpDist = ncount - jumpcount;\n //New Jump Table entry & done, in the case of an If. Will simply evaluate this Jump once.\n if (root.nodeName === \"If\") {\n jumpTable.push(new JumpTableEntry(\"J\" + jumpTable.length, jumpDist.toString(16)));\n }\n //If it's a While, we must loop.\n if (root.nodeName === \"While\") {\n //Unconditional jump\n machineCode[ncount] = \"EC\"; //compare to and set z flag\n ncount++;\n machineCode[ncount] = \"AA\"; //00 byte\n ncount++;\n machineCode[ncount] = \"00\"; //address space\n ncount++;\n machineCode[ncount] = \"D0\"; //check z flag and decide to jump or not\n ncount++;\n //This is the next jump - not the initial one\n var nextJump = jumpTable.length + 1;\n //Put a placeholder\n machineCode[ncount] = \"J\" + nextJump;\n ncount++;\n //The original test must now jump down here to skip the loop entirely. Create an entry for the original test here\n jumpDist = ncount - jumpcount;\n jumpTable.push(new JumpTableEntry(\"J\" + jumpTable.length, jumpDist.toString(16)));\n //Loop jump - must jump past the end of the image and back into the code, to where the original test will be\n jumpcount = ncount;\n var loopDist = (255 - ncount) + (testbyte + 1);\n jumpTable.push(new JumpTableEntry(\"J\" + jumpTable.length, loopDist.toString(16))); //will evaluate the test ad infinitum\n }\n }\n else if (root.nodeName === \"Add\") {\n }\n}",
"_calculatePath() {\n\t\tlet startNode = { x: this.gridX, y: this.gridY };\n\t\tlet goalNode = { x: window.uncover.player.gridX, y: window.uncover.player.gridY };\n\t\tstartNode.g = 0;\n\t\tstartNode.f = Math.pow(startNode.x - goalNode.x, 2) + Math.pow(startNode.y - goalNode.y, 2);\n\n\t\tlet openList = [startNode];\n\t\tlet closedList = [];\n\n\t\tconst neighborPositions = [{ dx: 0, dy: -1}, { dx: 1, dy: 0}, { dx: 0, dy: 1}, { dx: -1, dy: 0}];\n\n\t\tlet iterations = 0;\n\t\twhile (openList.length > 0) {\n\t\t\titerations++;\n\t\t\tif (iterations >= this._maxIterations) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Find node with minimum f\n\t\t\tlet currentNodeIndex = 0;\n\t\t\tfor (let i = 1; i < openList.length; i++) {\n\t\t\t\tif (openList[i].f < openList[currentNodeIndex].f) {\n\t\t\t\t\tcurrentNodeIndex = i;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlet currentNode = openList[currentNodeIndex];\n\t\t\topenList.splice(currentNodeIndex, 1);\n\t\t\tclosedList.push(currentNode);\n\n\t\t\t// Found the goal node, create path\n\t\t\tif (currentNode.x === goalNode.x && currentNode.y === goalNode.y) {\n\t\t\t\treturn this._constructPath(currentNode);\n\t\t\t}\n\n\t\t\t// Create adjacent neighbors\n\t\t\tconst neighbors = []; \n\t\t\tfor (let neighborPosition of neighborPositions) {\n\t\t\t\tconst xPosition = currentNode.x + neighborPosition.dx;\n\t\t\t\tconst yPosition = currentNode.y + neighborPosition.dy;\n\t\t\t\tif (xPosition < 0 || xPosition >= window.uncover.gameGrid.gridSize || yPosition < 0 || yPosition >= window.uncover.gameGrid.gridSize) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tconst isNeighborInClosedList = closedList.some((node) => node.x === xPosition && node.y === yPosition);\n\t\t\t\tif (isNeighborInClosedList) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (window.uncover.gameGrid.grid[xPosition][yPosition] != GridType.FILLED) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} \n\n\t\t\t\tneighbors.push({ x: xPosition, y: yPosition, parent: currentNode });\n\t\t\t}\n\n\t\t\tfor (let neighbor of neighbors) {\n\t\t\t\tneighbor.g = currentNode.g + 1;\n\t\t\t\tneighbor.h = Math.pow(neighbor.x - goalNode.x, 2) + Math.pow(neighbor.y - goalNode.y, 2);\n\t\t\t\tneighbor.f = neighbor.g + neighbor.h;\n\n\t\t\t\tconst neighborInOpenListIndex = openList.findIndex((node) => node.x === neighbor.x && node.y === neighbor.y);\n\t\t\t\tconst isNeighborInOpenList = neighborInOpenListIndex >= 0;\n\t\t\t\tif (isNeighborInOpenList) {\n\t\t\t\t\tif (neighbor.g > openList[neighborInOpenListIndex].g) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\topenList.push(neighbor);\n\t\t\t}\n\t\t}\n\n\t\treturn [];\n\t}",
"function GetPath2() : int {\n\t\tnumberOfHops = 0; \n\t\tnumberOfHops1 = 0; \n\t\tvar ToMovePos : int; \n\t\tvar ToMovePos2 : int; \n\n\t\tvar i : int = 0;\n\t\tfor(var a : int = 0; a < ClosedNodes.Length; a++){ \n\t\t\tif (ClosedNodes[a] != 0){ \n\t\t\t\ti++; \n\t\t\t\t//Debug.Log(parent_Closed[a]+\" \"+ClosedNodes[a]);\n\t\t\t\t} }\n\n\t\tvar match_name = targetLeaf;\n\t\tfor(var b : int = (i-1); b >= 0 ; b--){\n\t\t\tif (ClosedNodes[b] == match_name){\n\t\t\t\tnumberOfHops++;\n\t\t\t\tmatch_name = parent_Closed[b];\n\t\t\t\tif (match_name == frogLeaf ){\n\t\t\t\t\tToMovePos = ClosedNodes[b];\n\t\t\t\t\tb = -20;\n\t\t\t\t\t//Debug.Log(\"ToMovePos \"+ToMovePos);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\tvar match_name2 = targetLeaf2;\n\t\t\tfor(var c : int = (i-1); c >= 0 ; c--){\n\t\t\tif (ClosedNodes[c] == match_name2){\n\t\t\t\tnumberOfHops1++;\n\t\t\t\t//Debug.Log(parent_Closed[b]);\n\t\t\t\tmatch_name2 = parent_Closed[c];\n\t\t\t\tif (match_name2 == frogLeaf ){\n\t\t\t\t\tToMovePos2 = ClosedNodes[c];\n\t\t\t\t\tc = -20;\n\t\t\t\t\t//Debug.Log(\"ToMovePos \"+ToMovePos);\n\t\t\t\t}\n\t\t\t}\n\t\t} \n\n\t\tif (numberOfHops1 !=0){\n\t\t\tif (numberOfHops1 < numberOfHops){\n\t\t\t\t//Debug.Log(\"ToMovePos2 \"+ToMovePos2);\n\t\t\t\treturn ToMovePos2;\n\t\t\t\t}\n\t\t\telse if(numberOfHops !=0){\n\t\t\t\t\t//Debug.Log(\"ToMovePos \"+ToMovePos); \n\t\t\t\t\treturn ToMovePos;\n\t\t\t\t\t}\n\t\t\t\t else{\n\t\t\t\t \t//Debug.Log(\"ToMovePos2 \"+ToMovePos2); \n\t\t\t\t \treturn ToMovePos2;\n\t\t\t\t \t}\n\t\t\t}\n\t\telse {\n\t\t\t//Debug.Log(\"ToMovePos \"+ToMovePos); \n\t\t\treturn ToMovePos;\n\t\t\t}\n\t}",
"fillMazeProcedural(mazeTemplateCompressed) {\n const template = this.Utilities.uncompressTemplate(mazeTemplateCompressed);\n // tslint:disable-next-line:prefer-const\n let path = template.MazePath.split(\"\");\n this.StartLocation = template.StartLocation;\n this.EndLocation = template.EndLocation;\n this.BestPath = template.BestPath;\n this.MazeDifficulty = template.MazeDifficulty;\n this.GridWidth = template.GridWidth;\n this.GridHeight = template.GridHeight;\n this.GridLayers = template.GridLayers;\n this.MazeGrid = this.generateGrid();\n // MazePath: myMaze.MazePath,\n // Start: JSON.stringify(myMaze.StartLocation),\n // End: JSON.stringify(myMaze.EndLocation),\n // BestPath: myMaze.BestPath,\n // Difficulty: myMaze.MazeDifficulty,\n // tslint:disable-next-line:prefer-const\n let cellsList = [new Cell(0, 0, 0)];\n let next;\n let mazePath = \"\";\n let index = -1;\n while (cellsList.length > 0) {\n // index is the newest\n index = cellsList.length - 1;\n const currentCell = cellsList[index];\n next = path.shift();\n if (next === \"\" || next === undefined) {\n break;\n }\n else if (next === this.Utilities.Back) {\n cellsList.splice(index, 1);\n }\n else {\n const nextCell = this.directionModifier(cellsList[index], next);\n // const result2: any = \n this.carvePathBetweenCells(currentCell, nextCell, next);\n this.MazeGrid[currentCell.Z][currentCell.Y][currentCell.X] = currentCell;\n this.MazeGrid[nextCell.Z][nextCell.Y][nextCell.X] = nextCell;\n cellsList.push(nextCell);\n index = -1;\n }\n if (index !== -1) {\n cellsList.splice(index, 1);\n }\n mazePath += next;\n }\n return mazePath;\n }",
"function recurse(tree,path) \n{\n for (var key in tree) \n {\n\tif (key == 'model') \n\t{\n\t compile(tree[key], path);\n\t continue;\n\t}\n\n\trecurse(tree[key], path == '' ? key : path + '.' + key)\n }\n}",
"onCodePathStart(codePath) {\n scopeInfo = {\n upper: scopeInfo,\n uselessContinues: [],\n codePath\n };\n }",
"compileAll () {\n const { from } = this.data\n globby.sync(from, { onlyFiles: true })\n .map(fromRelative => this.switchCallback('change', fromRelative, false))\n }",
"function crawl(path) {\n if (path.is(\"_templateLiteralProduced\")) {\n crawl(path.get(\"left\"));\n crawl(path.get(\"right\"));\n } else if (!path.isBaseType(\"string\") && !path.isBaseType(\"number\")) {\n path.replaceWith(t.callExpression(t.identifier(\"String\"), [path.node]));\n }\n}",
"function crawl(path) {\n if (path.is(\"_templateLiteralProduced\")) {\n crawl(path.get(\"left\"));\n crawl(path.get(\"right\"));\n } else if (!path.isBaseType(\"string\") && !path.isBaseType(\"number\")) {\n path.replaceWith(t.callExpression(t.identifier(\"String\"), [path.node]));\n }\n}",
"function expandShorthandsIn(jsCode) {\r\n var describeCode = \"(node => node.nodeName + (node.id ? '#' + node.id : '') + (node.classList.length ? '.' + node.classList[0] : ''))(\";\r\n if (\"ActiveXObject\" in window) { /* ie hack */\r\n describeCode = \"(function(node){ return node.nodeName + (node.id ? '#' + node.id : '') + (node.classList.length ? '.' + node.classList[0] : '') })(\";\r\n }\r\n return (jsCode\r\n .replace(/^\\$\\$\\(/g, 'document.querySelectorAll(')\r\n .replace(/^\\$\\(/g, 'document.querySelector(')\r\n .replace(/\\b\\$\\$\\(/g, 'document.querySelectorAll(')\r\n .replace(/\\b\\$\\(/g, 'document.querySelector(')\r\n .replace(/(\\;|\\,|\\(|\\)|\\+|\\-|\\*|\\/|\\=|\\<|\\>|\\||\\&|\\\\|\\s)\\$\\$\\(/g, '$1document.querySelectorAll(')\r\n .replace(/(\\;|\\,|\\(|\\)|\\+|\\-|\\*|\\/|\\=|\\<|\\>|\\||\\&|\\\\|\\s)\\$\\(/g, '$1document.querySelector(')\r\n .replace(/^eFP\\(/g, 'document.elementFromPoint(')\r\n .replace(/^eFP\\b/g, 'document.elementFromPoint.bind(document)')\r\n .replace(/\\beFP\\(/g, 'document.elementFromPoint(')\r\n .replace(/\\beFP\\b/g, 'document.elementFromPoint.bind(document)')\r\n .replace(/^gCS\\(/g, 'getComputedStyle(')\r\n .replace(/^gCS\\b/g, 'getComputedStyle.bind(window)')\r\n .replace(/^rAF\\(/g, 'requestAnimationFrame(')\r\n .replace(/^rAF\\b/g, 'requestAnimationFrame.bind(window)')\r\n .replace(/\\bgCS\\(/g, 'getComputedStyle(')\r\n .replace(/\\bgCS\\b/g, 'getComputedStyle.bind(window)')\r\n .replace(/\\brAF\\(/g, 'requestAnimationFrame(')\r\n .replace(/\\brAF\\b/g, 'requestAnimationFrame.bind(window)')\r\n .replace(/\\.gBCW\\(\\)/g, '.getBoundingClientRect().width')\r\n .replace(/\\.gBCH\\(\\)/g, '.getBoundingClientRect().height')\r\n .replace(/\\.gBCL\\(\\)/g, '.getBoundingClientRect().left')\r\n .replace(/\\.gBCT\\(\\)/g, '.getBoundingClientRect().top')\r\n .replace(/\\.gBCR\\(\\)/g, '.getBoundingClientRect().right')\r\n .replace(/\\.gBCB\\(\\)/g, '.getBoundingClientRect().bottom')\r\n .replace(/^describe\\(/g, describeCode)\r\n .replace(/\\bdescribe\\(/g, describeCode));\r\n}",
"async function traversePaths(canvas) {\n log(\"Traversing all paths...\");\n\n if (DEBUG_PATH) {\n drawing.canvasClear(tilesOverlay);\n drawing.canvasDrawLine(tilesOverlay, 0, 0, tilesOverlay.width, 0, [0xff, 0, 0, 0xff], 3);\n drawing.canvasDrawLine(tilesOverlay, tilesOverlay.width, 0, tilesOverlay.width, tilesOverlay.height, [0xff, 0, 0, 0xff], 3);\n drawing.canvasDrawLine(tilesOverlay, tilesOverlay.width, tilesOverlay.height, 0, tilesOverlay.height, [0xff, 0, 0, 0xff], 3);\n drawing.canvasDrawLine(tilesOverlay, 0, tilesOverlay.height, 0, 0, [0xff, 0, 0, 0xff], 3);\n }\n\n // top paths\n for (let i = 0; i < metaInfo.topPaths.length; i++) {\n const path = metaInfo.topPaths[i];\n path.x0 = path.offset;\n path.y0 = metaInfo.topEdge;\n await traversePath(canvas, path, DIR.BOTTOM);\n }\n // right paths\n for (let i = 0; i < metaInfo.rightPaths.length; i++) {\n const path = metaInfo.rightPaths[i];\n path.x0 = metaInfo.rigthEdge;\n path.y0 = path.offset;\n await traversePath(canvas, path, DIR.LEFT);\n }\n // bottom paths\n for (let i = 0; i < metaInfo.bottomPaths.length; i++) {\n const path = metaInfo.bottomPaths[i];\n path.x0 = path.offset;\n path.y0 = metaInfo.bottomEdge;\n await traversePath(canvas, path, DIR.TOP);\n }\n // left paths\n for (let i = 0; i < metaInfo.leftPaths.length; i++) {\n const path = metaInfo.leftPaths[i];\n path.x0 = metaInfo.leftEdge;\n path.y0 = path.offset;\n await traversePath(canvas, path, DIR.RIGHT);\n }\n}",
"IfStatement(__node) {current_function.complexity += 1;}",
"getPaths(regex, point = new Coordinate(0,0)){\n // Paths will be a multi-dimension array that basically \n // substitutes the parenthesis in the regex\n // We can traverse down any path this way\n let paths = [[0]];\n let i = 0;\n let j = 0;\n let char = -1;\n\n // Keeps track of where we are\n let location = new Coordinate(point.x, point.y);\n this.visited[location] = true;\n\n // Navigate through the regex\n while(++char < regex.length){\n // New path\n if(regex[char] == '|'){\n paths[++i] = [0];\n j = 0;\n location = new Coordinate(point.x, point.y);\n }\n // Another layer found, recurse down\n else if(regex[char] == '('){\n let inner = this.getPaths(regex.substring(char + 1), location);\n // Offset what character we are looking at to avoid infinite recursion\n char += inner.end;\n // Group the inner paths with the outer path\n paths[i][++j] = inner.paths;\n // True if the path doesn't need to traverse down into deeper layers\n // Example: EESS(WNSE|)SSS\n if(regex[char + 1] && regex[char + 1] != '|' && regex[char + 1] != ')'){ \n paths[i][++j] = 0;\n }\n }\n // Layer ends\n else if(regex[char] == ')'){\n break;\n }\n // Add to the path\n else{\n // Move our location\n switch(regex[char]){\n case 'N': location.north(); break;\n case 'S': location.south(); break;\n case 'E': location.east(); break;\n case 'W': location.west(); break;\n }\n // We have not been here before, count it\n if(!this.visited[location]){\n this.visited[location] = true;\n paths[i][j]++;\n }\n }\n }\n // Return where we ended and the paths created\n return {\n end: char + 1,\n paths: paths\n }\n }",
"function test() {\n function opt() {\n let _1337;\n\n s = \"\";\n s = \"\" & s.hasOwnProperty(\"\");\n var s = 0x1337;\n\n for (i = 0; i < 1; i++) {\n _1337 = s.hasOwnProperty(\"x\");\n }\n } // trigger the full jit\n\n\n for (let i = 0; i < 100; i++) {\n opt();\n }\n}",
"function assignPathIfUnique(results, path, $fragment) {\n var pathCounts = {},\n i;\n\n for (i = 0; i < results.length; i += 1) {\n if (pathCounts[results[i].path] == null) pathCounts[results[i].path] = 0;\n pathCounts[results[i].path] += 1;\n }\n\n for (i = 0; i < results.length; i += 1) {\n if (pathCounts[results[i].path] == 1) {\n results[i].parentPath = path;\n results[i].$el = $fragment;\n }\n }\n }",
"function path() {\n if (finds(loc + 61) && tmp - 1 == result[loc + 61]) //bottom node to destinations node\n value = loc + 61;\n else if (finds(loc - 61) && tmp - 1 == result[loc - 61]) //top node to destinations node\n {\n value = loc - 61;\n } else if (\n (loc - 1) % 61 < loc % 61 &&\n finds(loc - 1) &&\n tmp - 1 == result[loc - 1]\n )\n //left side node to destination node\n value = loc - 1;\n else if (\n (loc + 1) % 61 > loc % 61 &&\n finds(loc + 1) &&\n tmp - 1 == result[loc + 1]\n )\n //right side node to destination node\n value = loc + 1;\n else if (\n finds(loc - 62) &&\n (loc - 62) % 61 < loc % 61 &&\n tmp - 1 == result[loc - 62]\n )//top right side node to destination node\n value = loc - 62;\n else if (\n finds(loc - 60) &&\n (loc - 60) % 61 > loc % 61 &&\n tmp - 1 == result[loc - 60]\n )//top left side node to destination node\n value = loc - 60;\n else if (\n finds(loc + 60) &&\n (loc + 60) % 61 < loc % 61 &&\n tmp - 1 == result[loc + 60]\n )//bottom right side node to destination node\n value = loc + 60;\n else if (\n finds(loc + 62) &&\n (loc + 62) % 61 > loc % 61 &&\n tmp - 1 == result[loc + 62]\n )//bottom right side node to destination node\n value = loc + 62;\n\n tmp = result[value];\n loc = value;\n if (loc != source)\n //this gives moving effect to bot\n {\n d[loc].style.backgroundColor = destinationColor;\n \n }\n}",
"function simplifyPaths(arcs, opts) {\n var simplifyPath = getSimplifyFunction(opts);\n arcs.setThresholds(new Float64Array(arcs.getPointCount())); // Create array to hold simplification data\n if (opts.spherical) {\n simplifyPaths3D(arcs, simplifyPath);\n protectWorldEdges(arcs);\n } else {\n simplifyPaths2D(arcs, simplifyPath);\n }\n if (opts.lock_box) {\n protectContentEdges(arcs);\n }\n }",
"function rewriteCompressedIfStatements(ast) {\n // BEFORE: x && y && (z(), zz = 1);\n // AFTER: if(x && y) { z(); zz = 1; }\n query(ast, 'ExpressionStatement > LogicalExpression[right.type=/SequenceExpression|CallExpression|AssignmentExpression/]').forEach(function (node) {\n // NOTE: Logicals are parsed right to left\n // So node.left contains the entire conditional we care about\n // How convenient!\n node.parent.expression = {\n type: \"IfStatement\",\n // if the operator is `||` we need to negate the whole conditional\n test: node.operator === \"&&\" ? node.left : {\n type: \"UnaryExpression\",\n operator: \"!\",\n prefix: true,\n argument: node.left\n },\n consequent: {\n type: \"BlockStatement\",\n body: [{\n type: \"ExpressionStatement\",\n expression: node.right\n }]\n }\n };\n // Clean up .parent references\n node.left.parent = node.parent.expression.test;\n node.right.parent = node.parent.expression.consequent.body[0];\n node.parent.expression.parent = node.parent;\n node.parent.expression.test.parent = node.parent.expression;\n node.parent.expression.consequent.parent = node.parent.expression;\n node.parent.expression.consequent.body[0].parent = node.parent.expression.consequent;\n });\n\n // BEFORE: x ? y() : z();\n // AFTER: if (x) { y(); } else { z(); }\n query(ast, '*:matches(ExpressionStatement, SequenceExpression) > ConditionalExpression').forEach(function (node) {\n node.type = \"IfStatement\";\n node.consequent = {\n type: \"BlockStatement\",\n body: [{\n type: \"ExpressionStatement\",\n expression: node.consequent\n }]\n };\n node.alternate = node.alternate && {\n type: \"BlockStatement\",\n body: [{\n type: \"ExpressionStatement\",\n expression: node.alternate\n }]\n };\n // Clean up .parent references\n node.consequent.parent = node;\n node.consequent.body[0].parent = node.consequent;\n node.consequent.body[0].expression.parent = node.consequent.body[0];\n if (node.alternate) {\n node.alternate.parent = node;\n node.alternate.body[0].parent = node.alternate;\n node.alternate.body[0].expression.parent = node.alternate.body[0];\n }\n });\n}",
"function findPaths(c, paths) {\n if (c.length > 1){\n let path1 = paths.slice()\n let path2 = paths.slice()\n\n path1 = (c[1] !== 1)\n ? [...path1, 1]\n : 0\n\n path2 = (c[2] !== 2)\n ? [...path2, 2]\n : 0\n\n if (path1 === 0 && path2 === 0){\n paths = 0\n } else if (path1 !== 0 && path2 === 0){\n return findPaths(c.slice(1), path1)\n } else if (path1 === 0 && path2 !== 0){\n return findPaths(c.slice(2), path2)\n } else if (path1 !== 0 && path2 !== 0){\n path1 = findPaths(c.slice(1), path1)\n path2 = findPaths(c.slice(2), path2)\n return (path1.length < path2.length)\n ? path1\n : path2\n }\n }\n return paths\n}",
"function alternatingPath(amountOfSurroundingTiles) {\n if (amountOfSurroundingTiles === 0) {\n for (var i = visitedTiles.length - 1; i >= 0 ; i--) {\n var backStepY = parseInt(visitedTiles[i].visibleTile.dataset['yco']);\n var backStepX = parseInt(visitedTiles[i].visibleTile.dataset['xco']);\n\n tiles[backStepX + '|' + backStepY].closed = false;\n\n newStart = checkNeighbours(newStart, backStepX, backStepY);\n /*uppon finding an opportunity to walk by it jumps out the function*/\n if (newStart.length > 0) {\n return newStart;\n };\n\n tiles[backStepX + '|' + backStepY].closed = true;\n };\n } else {\n return;\n };\n}",
"function branchingProcess() {\n var implicantsPowerSet = powerSet(remainingImplicants);\n validSolutions = filterPowerSet(implicantsPowerSet); //array contains valid cominations\n var currentValidSolutions = validSolutions.slice();\n minimalSolutions = filterPossibleSolutions(currentValidSolutions); //array contains valid combainations with least cost\n}",
"createPathOps(path) {\n const ops = [];\n let parent = otClient.documentByPathImmediate('.');\n let parentId = parent.docId;\n\n // eslint-disable-next-line func-names\n path.forEach(function(segment) {\n let childId;\n // eslint-disable-next-line no-cond-assign\n if (parent && (childId = parent.children[segment])) {\n // Walking existing dirs\n parent = otClient.documentImmediate(childId);\n // eslint-disable-next-line no-return-assign\n return (parentId = parent.docId);\n // eslint-disable-next-line no-else-return\n } else {\n // Creating new dirs\n const newDirId = randomId();\n ops.push({\n type: 'add',\n name: segment,\n docId: newDirId,\n docType: 'directory',\n parentId,\n });\n\n parent = null;\n // eslint-disable-next-line no-return-assign\n return (parentId = newDirId);\n }\n });\n\n const leafId = parent ? parent.docId : parentId;\n\n return {\n ops,\n leafId,\n };\n }",
"function solvePath(){\n var grid = cGrid;\n stepCount = 0; //resetStep\n startRow = 0;\n exitRow = grid.length-1;\n var point = {\n row: 0,\n col: 0\n };\n\n //1. Loop start row , find the start col and mark\n let startCol = point.col;\n for ( ;startCol < grid[startRow].length; startCol++){\n noEntry = true;\n if (grid[startRow][startCol] == colValues.OPEN){\n point.row = startRow;\n point.col = startCol;\n noEntry = false;\n break;\n }\n }\n if(noEntry){\n writeResults();\n return;\n }\n \n //2. loop and find open path and mark as walked\n do {\n let step = {};\n for( var direct in directions){\n step = movable(point, grid, direct);\n if(step.canMove && step.colValue == colValues.OPEN){\n //mark current step as walked , move and add step count\n grid[point.row][point.col] = colValues.PATH;\n document.getElementById(`${point.row}:${point.col}`).setAttribute(\"blockValue\", \"step\");\n point = getNextPoint(point, direct);\n stepCount ++;\n break;\n }\n }\n //3. Test exit condition\n if ( point.row == exitRow){\n exitReached = true;\n grid[point.row][point.col] = colValues.PATH;\n document.getElementById(`${point.row}:${point.col}`).setAttribute(\"blockValue\", \"step\");\n break;\n }\n } while(true);\n\n writeResults();\n}",
"pathFinding(celdaInicial, celdaFinal) {\n let inicial = this.nodos[celdaInicial.indiceX][celdaInicial.indiceY];\n let destino = this.nodos[celdaFinal.indiceX][celdaFinal.indiceY]\n\n for (let i = 0; i < this.col; i++) {\n for (let c = 0; c < this.fil; c++) {\n this.nodos[i][c].resetear(destino);\n }\n }\n\n destino.esFin = true;\n destino.valor = 0;\n\n let recorrido = [];\n recorrido.push(inicial);\n inicial.visitada = true;\n\n if (this.pathFindingAux(recorrido)) { //camino encontrado\n return this.crearCamino(destino);\n } else { //camino no disponible\n return null;\n }\n }",
"function f(){for(var f=-1*l;f<=l;f+=2){var g=/*istanbul ignore start*/void 0,h=n[f-1],m=n[f+1],o=(m?m.newPos:0)-f;h&&(\n// No one else is going to attempt to use this value, clear it\nn[f-1]=void 0);var p=h&&h.newPos+1<j,q=m&&0<=o&&o<k;if(p||q){\n// If we have hit the end of both strings, then we are done\nif(\n// Select the diagonal that we want to branch from. We select the prior\n// path whose position in the new string is the farthest from the origin\n// and does not pass the bounds of the diff graph\n!p||q&&h.newPos<m.newPos?(g=e(m),i.pushComponent(g.components,void 0,!0)):(g=h,// No need to clone, we've pulled it from the list\ng.newPos++,i.pushComponent(g.components,!0,void 0)),o=i.extractCommon(g,b,a,f),g.newPos+1>=j&&o+1>=k)return c(d(i,g.components,b,a,i.useLongestToken));\n// Otherwise track this path as a potential candidate and continue.\nn[f]=g}else\n// If this path is a terminal then prune\nn[f]=void 0}l++}",
"generatePathJSON(vehicleData) {\n let locationCache = pathHistory,\n filteredJSON = {}\n if(Object.keys(locationCache).length === 0){\n vehicleData.map((vehicleObj) => {\n let x = mapProjection([vehicleObj.lon,vehicleObj.lat])[0],\n y = mapProjection([vehicleObj.lon,vehicleObj.lat])[1],\n tempArr = []\n tempArr.push([x,y])\n locationCache[vehicleObj.id] = tempArr\n return null\n })\n } else {\n vehicleData.forEach((vehicleObj) => {\n let x = mapProjection([vehicleObj.lon,vehicleObj.lat])[0],\n y = mapProjection([vehicleObj.lon,vehicleObj.lat])[1]\n if(locationCache[vehicleObj.id]) {\n if(locationCache[vehicleObj.id].length > 1) {\n locationCache[vehicleObj.id].shift()\n }\n locationCache[vehicleObj.id].push([x,y])\n } else {\n let tempArr = []\n tempArr.push([x,y])\n locationCache[vehicleObj.id] = tempArr\n }\n })\n }\n if(Object.keys(locationCache).length !== vehicleData.length) {\n vehicleData.map((vehicle)=> {\n filteredJSON[vehicle.id] = locationCache[vehicle.id]\n return null\n })\n pathHistory = {...filteredJSON}\n } else {\n pathHistory = {...locationCache}\n }\n return pathHistory\n }",
"genAllPaths() {\n const startTime = moment.now()\n let iterations = 0\n \n const edges = this.get('edges')\n const root = this.get('root')\n const startNode = root.source\n const endNode = root.target\n\n let open = []\n let paths = []\n let pathObjects = []\n let curr = [startNode] //Not sure if needed\n\n while(curr != null){\n for(let j = 0; j < edges.length; j++){\n if(edges[j].source == curr[curr.length-1] && edges[j].target != startNode && !curr.includes(edges[j].target)){\n let newPath = curr.concat(edges[j].target)\n if(edges[j].target == endNode && edges[j].target != startNode && paths.toString().indexOf(curr.toString()) < 0){\n paths[paths.length] = newPath.copy()\n pathObjects.push({path: newPath.copy(), degredationVariance: Math.abs(this.calcDegredation(newPath) - root.data)})\n }else{\n open[open.length] = newPath.copy()\n }\n }else if(edges[j].target == curr[curr.length-1] && edges[j].source != startNode && !curr.includes(edges[j].source)){\n let newPath = curr.concat(edges[j].source)\n if(edges[j].source == endNode && paths.toString().indexOf(curr.toString()) < 0){\n paths[paths.length] = newPath.copy()\n pathObjects.push({path: newPath.copy(), degredationVariance: Math.abs(this.calcDegredation(newPath) - root.data)})\n }else{\n open[open.length] = newPath.copy()\n }\n }\n iterations++\n }\n if(open.length > 0){\n curr = open.pop()\n }else{\n curr = null\n }\n }\n\n this.setStats({'time': (moment.now() - startTime) /1000, 'iterations': iterations})\n this.set('allPaths', pathObjects.sort(function(a, b) { return a.degredationVariance - b.degredationVariance}))\n }",
"function extendLightningPaths(branch, parentPath){\n parentPath = parentPath || [];\n branch.childs.forEach(function(child, i){\n extendLightningPaths(child, branch.path.slice(0, i));\n });\n branch.path = parentPath.concat(branch.path);\n}",
"compileMethodCallSelfPointer(opts) {\nif ((opts.selfPointerStackOffset !== false) || !this.getMakeMethodCall(opts.identifier)) {\nreturn;\n}\n// It's a method call...\nthis._scope.incStackOffset();\n// Save the self pointer of the object on the stack.\n// This value is passed to CompileCall.compile from the compileProcCall method in this class.\nif (this._selfPointerStackOffset === false) {\nthis._scope.incStackOffset();\nthis._selfPointerStackOffset = this._scope.getStackOffset();\n}\nhelper.saveSelfPointerToLocal(this._program, this._selfPointerStackOffset, opts.reg);\n}",
"function CalcualtePlayerPaths(lvl, ghostBoxes, boxPaths) {\n var playerPaths = [];\n var bestPath = -1;\n var lowestCost = 100000000;\n for (var i = 0; i < ghostBoxes.length; i++) {\n var newX = ghostBoxes[i].x;\n var newY = ghostBoxes[i].y;\n if (boxPaths[i][0][0].x == ghostBoxes[i].x + 1) {\n newX -= 1;\n } else if (boxPaths[i][0][0].x == ghostBoxes[i].x - 1) {\n newX += 1;\n } else if (boxPaths[i][0][0].y == ghostBoxes[i].y + 1) {\n newY -= 1;\n } else {\n newY += 1;\n }\n var solver = new Pathfinder(lvl, lvl.playerX, lvl.playerY, newX, newY);\n playerPaths.push(solver.returnPath(false));\n if (playerPaths[i][1] < lowestCost) {\n lowestCost = playerPaths[i][1];\n bestPath = i;\n }\n }\n return ([playerPaths, bestPath]);\n\n}",
"preOrder() { //DLR\n let results = [];\n\n let _walk = node => {\n results.push(node.value); //executing code\n if(node.left) _walk(node.left); //go left - if node,left is null, we are at a leaf - traversing\n if(node.right) _walk(node.right); // go right - if node.right=null then we are at a leaf - traversing\n };\n console.log(_walk(this.root));\n _walk(this.root); // for whiteboard use ll.root instead of this.root, unless using a class constructor\n return results;\n }",
"getFunctions(options) {\n\n let _this = this,\n allFunctions = [],\n foundFunctions = [];\n\n // Get all\n for (let i = 0; i < Object.keys(_this.project.components).length; i++) {\n let component = _this.project.components[Object.keys(_this.project.components)[i]];\n if (!component.modules) continue;\n for (let j = 0; j < Object.keys(component.modules).length; j++) {\n let module = component.modules[Object.keys(component.modules)[j]];\n if (!module.functions) continue;\n for (let k = 0; k < Object.keys(module.functions).length; k++) {\n allFunctions.push(module.functions[Object.keys(module.functions)[k]]);\n }\n }\n }\n\n // Return if no options specified\n if (!options) return allFunctions;\n if (options && Object.keys(options).length === 1 && options.returnPaths === true) return allFunctions.map(function(d) { return d._config.sPath });\n\n // If options specified, loop through and find the ones specified\n for (let i = 0; i < allFunctions.length; i++) {\n let func = allFunctions[i];\n\n if (options.component && options.module && options.function) {\n if (func._config.component == options.component && func._config.module == options.module && func.name == options.function) {\n foundFunctions.push(options.returnPaths ? func._config.sPath : func);\n }\n continue;\n }\n if (options.component && options.module) {\n if (func._config.component == options.component && func._config.module == options.module) {\n foundFunctions.push(options.returnPaths ? func._config.sPath : func);\n }\n continue;\n }\n if (options.component) {\n if (func._config.component == options.component) {\n foundFunctions.push(options.returnPaths ? func._config.sPath : func);\n }\n continue;\n }\n if (options.paths && options.paths.indexOf(func._config.sPath) !== -1) {\n foundFunctions.push(func);\n continue;\n }\n }\n\n return foundFunctions;\n }",
"function makeJITCompiledFunction() {\n\tfunction target(x) {\n\t\treturn x;\n\t}\n\tfor (var i = 0; i < 1000; i++) {\n\t\ttarget(i);\n\t}\n\treturn target;\n}",
"function process2(state, instruction) {\n /* eslint-enable */\n processCpyValue(state, instruction);;;;;;;;;;;;;;;;; //whoops, we forgot to return!\n }",
"changeState(leftBoarderDistance, downDistance, board, bS, next) {\n let distanceB = Math.round(downDistance / blockSize); // Distance in blocks to bottom border\n let distance = (Math.round(leftBoarderDistance / blockSize)); // Distance in blocks to left border\n if (this.calc == false) {\n if (this.check(leftBoarderDistance, downDistance, board, bS, next) == false) {\n return;\n }\n }\n switch (this.blockNumber) { // Switch depending on block\n case 1: {\n switch (this.state) { //Check state\n case 1: {\n if (distance < 5) {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].y = 3 * blockSize;\n this.res.children[i].x = (i) * blockSize;\n }\n }\n else {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].y = 3 * blockSize;\n this.res.children[i].x = (i - 3) * blockSize;\n }\n }\n this.state = 2;\n break;\n }\n case 2: {\n if (distance < 5) {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].x = 0;\n this.res.children[i].y = blockSize * i;\n }\n }\n else {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].x = 0;\n this.res.children[i].y = blockSize * i;\n }\n }\n this.state = 1;\n break;\n }\n }\n }\n case 2: {\n break;\n }\n case 3: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * (i + 1);\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * (i - 2);\n this.res.children[i].x = blockSize;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 4: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i == 0) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = (i - 1) * blockSize;\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i == 0) {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = (i - 1) * blockSize;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i == 0) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = 2 * blockSize;\n }\n else {\n this.res.children[i].y = (i - 1) * blockSize;\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = i * blockSize;\n }\n else {\n this.res.children[i].y = 2 * blockSize;\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 5: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 6: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = 0;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = 0;\n this.res.children[i].x = 0;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 7: {\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * (i + 1);\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize * (i - 2);\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * (i + 1);\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = blockSize * (i - 2);\n this.res.children[i].x = blockSize;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n }\n }",
"_removeDeadCode1(n, end) {\n for (; n && n != end;) {\n if (n.assign && n.assign.isCopy) {\n n.assign.writeCount--;\n n.assign = n.assign.copiedValue;\n n.assign.writeCount++;\n }\n // Remove assignments to variables which are not read\n if ((n.kind == \"call\" || n.kind == \"call_indirect\") && n.assign && n.assign.readCount == 0) {\n n.assign.writeCount--;\n n.assign = null;\n }\n else if (n.kind == \"end\" && n.prev[1]) { // The 'end' belongs to an 'if'?\n this._removeDeadCode1(n.prev[1], n.blockPartner);\n }\n else if (n.kind == \"decl_param\" || n.kind == \"decl_result\" || n.kind == \"decl_var\" || n.kind == \"return\") {\n // Do nothing by intention\n }\n else if (n.kind == \"copy\" && n.args[0] instanceof Variable && n.args[0].writeCount == 1 && n.args[0].readCount == 1) {\n let v = n.args[0];\n v.isCopy = true;\n v.copiedValue = n.assign;\n n.assign.writeCount--;\n v.readCount--;\n let n2 = n.prev[0];\n Node.removeNode(n);\n n = n2;\n continue;\n }\n else if (n.kind == \"copy\" && typeof (n.args[0]) == \"number\") {\n n.kind = \"const\";\n }\n else if ((n.kind != \"call\" && n.kind != \"call_indirect\" && n.kind != \"spawn\" && n.kind != \"spawn_indirect\") && n.assign && n.assign.readCount == 0) {\n let n2 = n.prev[0];\n for (let a of n.args) {\n if (a instanceof Variable) {\n a.readCount--;\n }\n }\n n.assign.writeCount--;\n Node.removeNode(n);\n n = n2;\n continue;\n }\n n = n.prev[0];\n }\n }",
"function checkPathOfIndivue(individue)\n{\n var path = [];\n var position = Object.assign({},init_position);\n var steps = individue.data\n steps.forEach(function(doubleNible){\n var firstSetOfMovements = posible_directions[doubleNible & filter[1] >>> 4];\n var secondSetOfMovements = posible_directions[doubleNible & filter[0]];\n\n firstSetOfMovements.forEach(function(step){\n switch(step)\n {\n case lft:\n if(position.y-1>=0)\n {\n var temp_element=map[position.x][position.y-1];\n if(!Object.is(temp_element,wall_character)){ position.y--; path.push(step);}\n }\n break;\n case rgt:\n if(position.y+1<map.length)\n {\n var temp_element=map[position.x][position.y+1];\n if(!Object.is(temp_element,wall_character)){ position.y++; path.push(step); }\n }\n break;\n case up_:\n if(position.x-1>=0)\n {\n var temp_element=map[position.x-1][position.y];\n if(!Object.is(temp_element,wall_character)){ position.x--; path.push(step); }\n }\n break;\n case dwn:\n if(position.x+1<map[0].length)\n {\n var temp_element=map[position.x+1][position.y];\n if(!Object.is(temp_element,wall_character)){ position.x++; path.push(step); }\n }\n break;\n }\n })\n secondSetOfMovements.forEach(function(step){\n switch(step)\n {\n case lft:\n if(position.y-1>=0)\n {\n var temp_element=map[position.x][position.y-1];\n if(!Object.is(temp_element,wall_character)){ position.y--; path.push(step);}\n }\n break;\n case rgt:\n if(position.y+1<map.length)\n {\n var temp_element=map[position.x][position.y+1];\n if(!Object.is(temp_element,wall_character)){ position.y++; path.push(step); }\n }\n break;\n case up_:\n if(position.x-1>=0)\n {\n var temp_element=map[position.x-1][position.y];\n if(!Object.is(temp_element,wall_character)){ position.x--; path.push(step); }\n }\n break;\n case dwn:\n if(position.x+1<map[0].length)\n {\n var temp_element=map[position.x+1][position.y];\n if(!Object.is(temp_element,wall_character)){ position.x++; path.push(step); }\n }\n break;\n }\n })\n })\n return path;\n}",
"function getBinPathWithPreferredGopathGorootWithExplanation(toolName, preferredGopaths, preferredGoroot, alternateTool, useCache = true) {\n if (alternateTool && path.isAbsolute(alternateTool) && executableFileExists(alternateTool)) {\n binPathCache[toolName] = alternateTool;\n return { binPath: alternateTool, why: 'alternateTool' };\n }\n // FIXIT: this cache needs to be invalidated when go.goroot or go.alternateTool is changed.\n if (useCache && binPathCache[toolName]) {\n return { binPath: binPathCache[toolName], why: 'cached' };\n }\n const binname = alternateTool && !path.isAbsolute(alternateTool) ? alternateTool : toolName;\n const found = (why) => binname === toolName ? why : 'alternateTool';\n const pathFromGoBin = getBinPathFromEnvVar(binname, process.env['GOBIN'], false);\n if (pathFromGoBin) {\n binPathCache[toolName] = pathFromGoBin;\n return { binPath: pathFromGoBin, why: binname === toolName ? 'gobin' : 'alternateTool' };\n }\n for (const preferred of preferredGopaths) {\n if (typeof preferred === 'string') {\n // Search in the preferred GOPATH workspace's bin folder\n const pathFrompreferredGoPath = getBinPathFromEnvVar(binname, preferred, true);\n if (pathFrompreferredGoPath) {\n binPathCache[toolName] = pathFrompreferredGoPath;\n return { binPath: pathFrompreferredGoPath, why: found('gopath') };\n }\n }\n }\n // Check GOROOT (go, gofmt, godoc would be found here)\n const pathFromGoRoot = getBinPathFromEnvVar(binname, preferredGoroot || getCurrentGoRoot(), true);\n if (pathFromGoRoot) {\n binPathCache[toolName] = pathFromGoRoot;\n return { binPath: pathFromGoRoot, why: found('goroot') };\n }\n // Finally search PATH parts\n const pathFromPath = getBinPathFromEnvVar(binname, exports.envPath, false);\n if (pathFromPath) {\n binPathCache[toolName] = pathFromPath;\n return { binPath: pathFromPath, why: found('path') };\n }\n // Check common paths for go\n if (toolName === 'go') {\n const defaultPathsForGo = process.platform === 'win32' ? ['C:\\\\Go\\\\bin\\\\go.exe'] : ['/usr/local/go/bin/go', '/usr/local/bin/go'];\n for (const p of defaultPathsForGo) {\n if (executableFileExists(p)) {\n binPathCache[toolName] = p;\n return { binPath: p, why: 'default' };\n }\n }\n return { binPath: '' };\n }\n // Else return the binary name directly (this will likely always fail downstream)\n return { binPath: toolName };\n}",
"function getBinPathWithPreferredGopathGorootWithExplanation(toolName, preferredGopaths, preferredGoroot, alternateTool, useCache = true) {\n if (alternateTool && path.isAbsolute(alternateTool) && executableFileExists(alternateTool)) {\n binPathCache[toolName] = alternateTool;\n return { binPath: alternateTool, why: 'alternateTool' };\n }\n // FIXIT: this cache needs to be invalidated when go.goroot or go.alternateTool is changed.\n if (useCache && binPathCache[toolName]) {\n return { binPath: binPathCache[toolName], why: 'cached' };\n }\n const binname = alternateTool && !path.isAbsolute(alternateTool) ? alternateTool : toolName;\n const found = (why) => binname === toolName ? why : 'alternateTool';\n const pathFromGoBin = getBinPathFromEnvVar(binname, process.env['GOBIN'], false);\n if (pathFromGoBin) {\n binPathCache[toolName] = pathFromGoBin;\n return { binPath: pathFromGoBin, why: binname === toolName ? 'gobin' : 'alternateTool' };\n }\n for (const preferred of preferredGopaths) {\n if (typeof preferred === 'string') {\n // Search in the preferred GOPATH workspace's bin folder\n const pathFrompreferredGoPath = getBinPathFromEnvVar(binname, preferred, true);\n if (pathFrompreferredGoPath) {\n binPathCache[toolName] = pathFrompreferredGoPath;\n return { binPath: pathFrompreferredGoPath, why: found('gopath') };\n }\n }\n }\n // Check GOROOT (go, gofmt, godoc would be found here)\n const pathFromGoRoot = getBinPathFromEnvVar(binname, preferredGoroot || getCurrentGoRoot(), true);\n if (pathFromGoRoot) {\n binPathCache[toolName] = pathFromGoRoot;\n return { binPath: pathFromGoRoot, why: found('goroot') };\n }\n // Finally search PATH parts\n const pathFromPath = getBinPathFromEnvVar(binname, exports.envPath, false);\n if (pathFromPath) {\n binPathCache[toolName] = pathFromPath;\n return { binPath: pathFromPath, why: found('path') };\n }\n // Check common paths for go\n if (toolName === 'go') {\n const defaultPathsForGo = process.platform === 'win32' ? ['C:\\\\Go\\\\bin\\\\go.exe'] : ['/usr/local/go/bin/go', '/usr/local/bin/go'];\n for (const p of defaultPathsForGo) {\n if (executableFileExists(p)) {\n binPathCache[toolName] = p;\n return { binPath: p, why: 'default' };\n }\n }\n return { binPath: '' };\n }\n // Else return the binary name directly (this will likely always fail downstream)\n return { binPath: toolName };\n}",
"function logic() {\n\n\t// Generate maze until done, then initialize for path finding\n\tif (generatingMaze) {\n\t\tlet completed = generateMazeStep();\n\t\tgeneratingMaze = !completed;\n\t\tpathFinding = completed;\n\t\tif (completed) {\n\t\t\tinitializePathFinding();\n\t\t}\n\t}\n\n\t// While pathfinding, perform step and get path to current\n\telse if (pathFinding) {\n\t\tlet result = astarStep();\n\t\tif (result) foundPath = result;\n\t}\n}",
"prune() {\n return map(tree => tree.assign({\n meta: {\n path: tree.path.slice(this.path.length)\n }\n }), this);\n }",
"computeDrawPathBuffers() {\n const buffer = this._pathBuffer;\n let preview,current,next;\n const cList = $objs.cases_s;\n for (let i=0, l=buffer.length; i<l; i++) {\n const preview = buffer[i-1];\n const current = buffer[i ];\n const next = buffer[i+1];\n const preview_id = preview && cList.indexOf(preview);\n const current_id = current && cList.indexOf(current);\n const next_id = next && cList.indexOf(next);\n //TODO: FIXME: compute distance via global position for Math.hypot\n if(preview){\n current.pathConnexion[String(preview_id)] = Math.hypot(preview.x-current.x, preview.y-current.y);\n };\n if(next){\n current.pathConnexion[String(next_id)] = Math.hypot(next.x-current.x, next.y-current.y);\n };\n };\n console.log0('PathsBuffers: ', buffer);\n this._pathBuffer = [];\n this.refreshPath();\n }",
"applyMapping(insertedPath) {\r\n var currentDir = '';\r\n var workspacePath = vs.workspace.rootPath;\r\n Object.keys(config.pathMappings || {})\r\n .map((key) => {\r\n var candidatePath = config.pathMappings[key];\r\n if (workspacePath) {\r\n candidatePath = candidatePath.replace('${workspace}', workspacePath);\r\n }\r\n candidatePath = candidatePath.replace('${home}', config.homeDirectory);\r\n return {\r\n key: key,\r\n path: candidatePath\r\n };\r\n })\r\n .some((mapping) => {\r\n if (insertedPath.startsWith(mapping.key)) {\r\n currentDir = mapping.path;\r\n insertedPath = insertedPath.replace(mapping.key, '');\r\n return true;\r\n }\r\n return false;\r\n });\r\n return { currentDir, insertedPath };\r\n }",
"function build_path(path) {\r\n var paths = config.dir['base'] + \",\" + (config.dir[program.architec] || '') + ',' + (config.custum_dir.tpl[program.template] || '') + ',' + (config.custum_dir.css[program.css] || 'less');\r\n return paths.replace(/,+/g, ',').split(',');\r\n}",
"function optimize(ast) {\n }",
"function optimize(ast) {\n }",
"function smoothBranch()\n\t\t\t{\n\t\t\t\tsharpStoneBank--;\n\t\t\t\tbranchBank--;\n\t\t\t\tsmoothBranchBank++;\n\t\t\t\taction(1,1,1);\n\t\t\t\tadvanceTime();\n\t\t\t\tupdateDisp();\n\t\t\t}",
"function getPathObject(ob, path, ltOb, fn) {\n // Iterate through path to late paths: @a.b.c paths\n // Return \"\" (or noop if leaf is a function @a.b.c(...) ) if intermediate object not yet available\n var prevOb,\n tokens,\n l,\n i = 0;\n\n if (ltOb === 1) {\n fn = 1;\n ltOb = undefined;\n } // Paths like ^a^b^c or ~^a^b^c will not throw if an object in path is undefined.\n\n\n if (path) {\n tokens = path.split(\".\");\n l = tokens.length;\n\n for (; ob && i < l; i++) {\n prevOb = ob;\n ob = tokens[i] ? ob[tokens[i]] : ob;\n }\n }\n\n if (ltOb) {\n ltOb.lt = ltOb.lt || i < l; // If i < l there was an object in the path not yet available\n }\n\n return ob === undefined ? fn ? noop : \"\" : fn ? function () {\n return ob.apply(prevOb, arguments);\n } : ob;\n }",
"function addLiveNodePaths() {\n const initialLiveNodePathsSize = liveNodePaths.size;\n\n [...liveNodePaths].forEach((subRoot) => {\n j(subRoot)\n .find(j.Identifier)\n .filter((path) => {\n /**\n * We only want to look up identifiers that are being used to reference other variables in a higher sope.\n * (For now) allowlist allowed pointer types.\n *\n * e.g.\n * - in `console.log(foo)` we want to look up `foo`\n * - in `const foo = bar` we want to look up `bar`\n * - in `const foo = { bar: baz }` we want to look up `baz`\n *\n * be careful though! not every Identifier is a reference to a variable:\n * - in `console.log(foo)` we do NOT want to look up `log`\n * - in `const foo = 'bar'` we do NOT want to look up `foo`\n * - in `const foo = { bar: baz }` we do NOT want to look up `bar`\n */\n if (!path.parentPath.value.type) return true;\n if (path.parentPath.value.type === 'ReturnStatement') return true;\n if (path.parentPath.value.type === 'CallExpression') return true;\n if (path.parentPath.value.type === 'JSXOpeningElement') return true;\n })\n .forEach((path) => {\n const name = path.value.name;\n const reference = getReferenceFromScope(j, path, name);\n\n if (!reference) {\n // Check if the tag being referenced is a DOM tag\n if (path.value.type === 'JSXIdentifier' && DOM_TAGS.includes(name)) {\n return;\n }\n\n // Otherwise, we're trying to reference a variable or function that does not exist\n // (Or a global that this codemod doesn't know about yet)\n throw new Error(\n [\n `The definition for ${name} does not exist.`,\n \"Either your code is invalid, or that's a global we haven't added yet.\",\n ].join('\\n'),\n );\n }\n\n liveNodePaths.add(reference);\n liveNodes.add(reference.value);\n });\n });\n\n if (liveNodePaths.size > initialLiveNodePathsSize) {\n addLiveNodePaths();\n }\n }",
"function tailCallOptimise(input) {\n\tif (typeof(input) === \"string\" || typeof(input) === \"function\") {\n\t\tvar ast = require(\"esprima\").parse(input.toString());\n\t\tvar optimised = mapTree(ast, {});\n\t\tvalidate(optimised);\n\t\treturn require(\"escodegen\").generate(optimised);\n\t}\n\treturn mapTree(input, {});\n}",
"function splitIfPath(tail): Array {\n if (tail.type !== 'path') {\n return [tail, null]\n }\n const nodes = tail.nodes\n if (nodes.length === 0) {\n return [null, null]\n } else if (nodes.length === 1) {\n return [nodes[0], null]\n }\n return [nodes[0], {type: 'path', nodes: nodes.slice(1)}]\n}",
"_removeDeadCode2(n, end) {\n let dead = false;\n for (; n && n != end;) {\n if (dead) {\n this.removeDeadNode(n);\n let n2 = n.next[0];\n Node.removeNode(n);\n n = n2;\n continue;\n }\n if (n.kind == \"return\" || n.kind == \"br\") {\n dead = true;\n }\n if (n.kind == \"if\") {\n if (typeof (n.args[0]) == \"number\") {\n let val = n.args[0];\n if (n.next[1]) {\n if (!val) {\n let next = n.next[1];\n n.next[1] = n.next[0];\n n.next[0] = next;\n let end = n.blockPartner.prev[1];\n n.blockPartner.prev[1] = n.blockPartner.prev[0];\n n.blockPartner.prev[0] = end;\n }\n let n2 = n.blockPartner.next[0];\n this.removeDeadStrain(n.next[1], n.blockPartner);\n n.next.splice(1, 1);\n n.blockPartner.prev.splice(1, 1);\n this.removeDeadNode(n);\n Node.removeNode(n.blockPartner);\n Node.removeNode(n);\n n = n2;\n }\n else {\n if (!val) {\n let n2 = n.blockPartner.next[0];\n this.removeDeadStrain(n.next[0], n.blockPartner);\n this.removeDeadNode(n);\n let end = n.blockPartner;\n for (let x = n; x != end;) {\n let x2 = x.next[0];\n Node.removeNode(x);\n x = x2;\n }\n Node.removeNode(n.blockPartner);\n Node.removeNode(n);\n n = n2;\n }\n else {\n let n2 = n.next[0];\n if (n2 == n.blockPartner) {\n n2 = n2.next[0];\n }\n Node.removeNode(n.blockPartner);\n Node.removeNode(n);\n n = n2;\n }\n }\n continue;\n }\n else {\n this._removeDeadCode2(n.next[0], n.blockPartner);\n if (n.next[1]) {\n this._removeDeadCode2(n.next[1], n.blockPartner);\n }\n n = n.blockPartner;\n }\n }\n else if (n.kind == \"block\" || n.kind == \"loop\") {\n this._removeDeadCode2(n.next[0], n.blockPartner);\n n = n.blockPartner;\n }\n n = n.next[0];\n }\n }",
"genComputedPaths() {\n const allPaths = this.get('allPaths')\n const objectMap = this.get('objectMap')\n let computedPaths = []\n\n for(const path of allPaths){\n let computedPath = []\n let firstPath = objectMap.get(path[0] + '-' + path[1]) || objectMap.get(path[1] + '-' + path[0])\n let sum = 0\n for(let i = 0; i< firstPath.length; i++){\n sum += firstPath.data\n }\n computedPath.push({\n 'label': path[0], \n 'data': firstPath.data,\n 'sum': sum\n })\n\n for(let i = 1; i < path.length; i++){\n let nextPath = objectMap.get(path[i-1] + '-' + path[i]) || objectMap.get(path[i] + '-' + path[i-1])\n \n computedPath.push({\n 'label': path[i], \n 'data': nextPath\n })\n }\n \n computedPaths.push(computedPath)\n \n }\n this.set('computedPaths', computedPaths) \n }",
"function initCompSyntaxTools()\n{\n quadruples = [];\n quadruples[0] = [Operation.GOTO, null, null, null]; //first quadruple should be goint to main\n dirProcs = {};\n constMem = 45000;\n constants = {};\n}",
"function getOutPath(path, info) {\n let outPath = info.mapInOutPaths.get(path);\n if (!outPath) {\n // get file name without extensions\n const fileName = Path.basename(path).replace(FSHARP_EXT, \"\").replace(JAVASCRIPT_EXT, \"\");\n // flat folder structure (one level deep)\n const pathDir = Path.dirname(path);\n // If pathDir is same as entry dir don't create nested folder\n const newPath = pathDir === Path.dirname(info.entry)\n ? fileName : Path.basename(pathDir) + \"/\" + fileName;\n // dedup output path\n let i = 0;\n outPath = newPath;\n while (info.dedupOutPaths.has(outPath)) {\n outPath = `${newPath}.${++i}`;\n }\n info.dedupOutPaths.add(outPath);\n info.mapInOutPaths.set(path, outPath);\n }\n return outPath;\n}",
"function mapPath(wire){\r\n\t// Start at origin\r\n\t\tlet x = 0;\r\n\t\tlet y = 0;\r\n\t\tlet steps = 0;\r\n\r\n\t// Create an empty array to pass back after filling\r\n\t\tvar xyArray = new Array();\r\n\t\r\n\tfor(let i=0; i<wire.length; i++){\r\n\t\tlet instruction = wire[i];\r\n\t\tlet direction = instruction.substring(0,1);\r\n\t\tlet travelDist = Number(instruction.substring(1,instruction.length));\r\n\r\n\t\t\tswitch(direction){\r\n\t\t\t\tcase \"R\":\r\n\t\t\t\t\t//Moving X in a positive direction, but Y remains the same...\r\n\t\t\t\t\tfor(let z=0; z<travelDist; z++){\r\n\t\t\t\t\t\tx = x+1;\r\n\t\t\t\t\t\tsteps++;\r\n\t\t\t\t\t\txyArray.push(x + \",\" + y + \",\" + steps);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"L\":\r\n\t\t\t\t\t//Moving X in a negative direction, but Y remains the same.\r\n\t\t\t\t\tfor(let z=0; z<travelDist; z++){\r\n\t\t\t\t\t\tx = x-1;\r\n\t\t\t\t\t\tsteps++;\r\n\t\t\t\t\t\txyArray.push(x + \",\" + y + \",\" + steps);\r\n\t\t\t\t\t}\t\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"U\":\r\n\t\t\t\t\t//Moving Y in a postive direction, but X stays the same.\r\n\t\t\t\t\tfor(let z=0; z<travelDist; z++){\r\n\t\t\t\t\t\ty = y+1;\r\n\t\t\t\t\t\tsteps++;\r\n\t\t\t\t\t\txyArray.push(x + \",\" + y + \",\" + steps);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"D\":\r\n\t\t\t\t\t//Moving Y in a negative direction, but X stays the same.\r\n\t\t\t\t\tfor(let z=0; z<travelDist; z++){\r\n\t\t\t\t\t\ty = y-1;\r\n\t\t\t\t\t\tsteps++;\r\n\t\t\t\t\t\txyArray.push(x + \",\" + y + \",\" + steps);\r\n\t\t\t\t\t}\t\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\tconsole.log(\"Should never be here....!!!!!\");\r\n\t\t\t}\r\n\r\n\t}\r\n\t\r\n\treturn xyArray;\r\n\t\r\n}",
"extractHoistedCalls() {\n // We're handling a chain of calls where `jest` may or may not need to be inserted for each call\n // in the chain, so remove the initial `jest` to make the loop implementation cleaner.\n this.tokens.removeToken();\n // Track some state so that multiple non-hoisted chained calls in a row keep their chaining\n // syntax.\n let followsNonHoistedJestCall = false;\n\n // Iterate through all chained calls on the jest object.\n while (this.tokens.matches3(_types.TokenType.dot, _types.TokenType.name, _types.TokenType.parenL)) {\n const methodName = this.tokens.identifierNameAtIndex(this.tokens.currentIndex() + 1);\n const shouldHoist = HOISTED_METHODS.includes(methodName);\n if (shouldHoist) {\n // We've matched e.g. `.mock(...)` or similar call.\n // Replace the initial `.` with `function __jestHoist(){jest.`\n const hoistedFunctionName = this.nameManager.claimFreeName(\"__jestHoist\");\n this.hoistedFunctionNames.push(hoistedFunctionName);\n this.tokens.replaceToken(`function ${hoistedFunctionName}(){${JEST_GLOBAL_NAME}.`);\n this.tokens.copyToken();\n this.tokens.copyToken();\n this.rootTransformer.processBalancedCode();\n this.tokens.copyExpectedToken(_types.TokenType.parenR);\n this.tokens.appendCode(\";}\");\n followsNonHoistedJestCall = false;\n } else {\n // This is a non-hoisted method, so just transform the code as usual.\n if (followsNonHoistedJestCall) {\n // If we didn't hoist the previous call, we can leave the code as-is to chain off of the\n // previous method call. It's important to preserve the code here because we don't know\n // for sure that the method actually returned the jest object for chaining.\n this.tokens.copyToken();\n } else {\n // If we hoisted the previous call, we know it returns the jest object back, so we insert\n // the identifier `jest` to continue the chain.\n this.tokens.replaceToken(`${JEST_GLOBAL_NAME}.`);\n }\n this.tokens.copyToken();\n this.tokens.copyToken();\n this.rootTransformer.processBalancedCode();\n this.tokens.copyExpectedToken(_types.TokenType.parenR);\n followsNonHoistedJestCall = true;\n }\n }\n\n return true;\n }",
"function strhack_blanket(path, data) {\n data = data.split(\"\\n\");\n var str = '';\n for (i = 0; i < data.length; i++) {\n str = str + i + \": 0, \";\n }\n var head = 'if (process.__blanket === undefined) { process.__blanket = {}; }; process.__blanket[\"' + path + '\"] = {'+ str +'};';\n var lineno = 1;\n data = data.map(function(line) {\n if (line.indexOf(';') != -1) {\n line = '; (process.__blanket[\"' + path + '\"]['+ lineno +']++); ' + line;\n }\n lineno++;\n return line;\n });\n final_code = data.join(\"\\n\");\n return head + final_code;\n}",
"copyTo(target) {\n let paths = this.paths;\n\n if (paths !== undefined) {\n let path;\n\n for (path in paths) {\n if (paths[path] > 0) {\n target.add(path);\n }\n }\n }\n }",
"function findPaths_nX(from, to, n, lineBanList, costBound) {\n //console.log(\"nX finder (\" + n + \") from \" + from.getName() + \" to \" + to.getName())\n // Basically:\n // f(0) => f(0)\n // f(1) => f(1)\n // f(n) = f(0) + f(n-1) for n >= 2\n var results = new Array();\n if (n <= 0) {\n var tempResult = findPaths_0X(from, to);\n // Need to exclude possibility of some results overapping with the lineStack.\n for (var i = 0; i < tempResult.length; i++) {\n if (lineBanList.indexOf(tempResult[i].connections[0].getLine()) == -1) {\n // Line unused previously. Add it.\n results.push(tempResult[i]);\n }\n }\n return results;\n }\n if (n == 1) {\n var tempResult = findPaths_1X(from, to, costBound);\n // Need to exclude possibility of some results overapping with the lineStack.\n for (var i = 0; i < tempResult.length; i++) {\n var currentPath = tempResult[i];\n var notInvolvedInLinestack = true;\n for (var j = 0; j < 2; j++) {\n if (lineBanList.indexOf(currentPath.connections[j].getLine()) != -1) {\n notInvolvedInLinestack = false;\n }\n }\n if (notInvolvedInLinestack) {\n results.push(currentPath);\n }\n }\n return results;\n }\n for (var i = 0; i < HK18_ALL_LINES.length; i++) {\n var L1 = HK18_ALL_LINES[i];\n if (lineBanList.indexOf(L1) != -1) {\n // It is already being considered. Move on.\n continue;\n }\n var L1_beginCheckIndex = L1.getIndexOfWaypoint(from);\n if (L1_beginCheckIndex == -1) {\n // Line does not call at FROM, user will never be able to leave using Line\n continue;\n }\n // Here, user definitely can depart from FROM.\n // But will he ever reach the destination with paths satisfying the above parameters?\n // There's no easy way to find out except brute-force checking everyone.\n // For each waypoint of L1:\n var L1_stops = L1.getStops();\n var degree = n - 1;\n var newBanList = lineBanList.concat(L1);\n for (var j = L1_beginCheckIndex + 1; j < L1_stops.length; j++) {\n // Conduct search\n var checkingStop = L1_stops[j];\n if (checkingStop.isInternal()) {\n // Interchanging at internal stations is banned. Next ine.\n continue;\n }\n // Find the possible results\n var probableResults = findPaths_nX(checkingStop, to, degree, newBanList, costBound);\n if (probableResults.length == 0) {\n // No results. Next.\n continue;\n }\n // Have results. Prepend/unshift the paths to include this line, then filter by cost bound.\n var thisConnection = new Connection(L1, L1_beginCheckIndex, j);\n for (var k = 0; k < probableResults.length; k++) {\n var currentResult = probableResults[k];\n currentResult.connections.unshift(thisConnection);\n // Add to result if the final cost is lower than costBound.\n if (currentResult.getTotalAdjustedCost() < costBound) {\n console.log(\"Adding path result:\");\n console.log(currentResult);\n results.push(currentResult);\n }\n }\n }\n /*\n let stops = L1.getStops();\n let degree = n - 1;\n let tempLineStack = lineBanList.concat(L1);\n //console.log(\"LineStack = \" + tempLineStack)\n let fromIndex = -1;\n // Check from index = 1 (exclude the 1st) so that the line is effective.\n for (let j = L1_fromIndex + 1; j < stops.length; j++)\n {\n // First check that L1 is contains FROM.\n if (stops[j] == from || stops[j].isNeighborOf(from))\n {\n fromIndex = j;\n break;\n }\n }\n if (fromIndex == -1)\n {\n // User can never depart from FROM using L1. Next line.\n continue;\n }\n \n // We know the user may depart at some index -> FROM.\n // But at which waypoint should the user interchange?\n // Check every waypoint down the line.\n for (let j = fromIndex + 1; j < stops.length; j++)\n {\n \n }\n */\n }\n // Again, having to interchange is a very significant cost already, so we aim to minimize the travel cost.\n var minCost = Infinity;\n for (var i = 0; i < results.length; i++) {\n var calcCost = results[i].getTotalAdjustedCost();\n if (calcCost < minCost) {\n minCost = calcCost;\n }\n }\n for (var i = results.length - 1; i >= 0; i--) {\n if (results[i].getTotalAdjustedCost() > minCost) {\n results.splice(i, 1);\n }\n }\n // Here, we need additional work.\n // Sometimes, you may obtain results where several lines travel along the same path towards the destination.\n // The algorithm may wrongly identify several interchange points and suggests interchanges,\n // but as we humans observe the results, we find that those suggestions are quite similar.\n // We need to eliminate results that are similar.\n var tempResults = results;\n results = [];\n // Transfer tempResults back to results\n for (var i = 0; i < tempResults.length; i++) {\n var shouldAdd = true;\n for (var j = 0; j < results.length; j++) {\n if (!tempResults[i].isDistinctComparedToOther(results[j])) {\n shouldAdd = false;\n break;\n }\n }\n if (shouldAdd) {\n results.push(tempResults[i]);\n }\n }\n // Supposedly, all is done. Return the results.\n return results;\n}",
"function countPathsRecursivelyWithMemo(grid, startRow, startCol, pathsMemo) {\n if (startRow === undefined) startRow = 0;\n if (startCol === undefined) startCol = 0;\n\n //initialize our paths memory\n if (!pathsMemo) {\n pathsMemo = [];\n for (let i=0; i<grid.length; i++) {\n pathsMemo[i] = [];\n }\n }\n\n //check if off map or blocked path\n if (startRow >= grid.length || startCol >= grid[startRow].length || grid[startRow][startCol] === 1) { //invalid square here\n return 0;\n }\n\n if (pathsMemo[startRow][startCol]) {\n return pathsMemo[startRow][startCol];\n }\n\n\n\n //check if at end\n if (startRow === grid.length - 1 && startCol === grid[grid.length - 1].length - 1) {//found end\n pathsMemo[startRow][startCol] = 1;\n return 1;\n } else {\n pathsMemo[startRow+1][startCol] = countPathsRecursively(grid, startRow + 1, startCol, pathsMemo);\n pathsMemo[startRow][startCol+1] = countPathsRecursively(grid, startRow, startCol + 1, pathsMemo);\n\n return pathsMemo[startRow + 1][startCol] + pathsMemo[startRow][startCol + 1];\n }\n}",
"function sameBranch(p1, p2) {\n if (p1.type == p2.type\n && (p1.parameter == p2.parameter)\n && (p1.location && p2.location)\n && (p1.location == p2.location)\n && (p1.modelName && p2.modelName)\n && (p1.modelName == p2.modelName)\n && (p1.modelSource && p2.modelSource)\n && (p1.modelSource == p2.modelSource)\n && (p1.level && p2.level)\n && (p1.level == p2.level)) {\n return true;\n }\n else {\n return false;\n }\n }",
"static prepare(_branch, _options = {}, _mtxWorld = FudgeCore.Matrix4x4.IDENTITY(), _lights = new Map(), _shadersUsed = null) {\n let firstLevel = (_shadersUsed == null);\n if (firstLevel) {\n _shadersUsed = [];\n Render.timestampUpdate = performance.now();\n Render.nodesSimple.reset();\n Render.nodesAlpha.reset();\n Render.nodesPhysics.reset();\n Render.dispatchEvent(new Event(\"renderPrepareStart\" /* RENDER_PREPARE_START */));\n }\n if (!_branch.isActive)\n return; // don't add branch to render list if not active\n _branch.nNodesInBranch = 1;\n _branch.radius = 0;\n _branch.dispatchEventToTargetOnly(new Event(\"renderPrepare\" /* RENDER_PREPARE */));\n _branch.timestampUpdate = Render.timestampUpdate;\n if (_branch.cmpTransform && _branch.cmpTransform.isActive)\n _branch.mtxWorld.set(FudgeCore.Matrix4x4.MULTIPLICATION(_mtxWorld, _branch.cmpTransform.mtxLocal));\n else\n _branch.mtxWorld.set(_mtxWorld); // overwrite readonly mtxWorld of the current node\n let cmpRigidbody = _branch.getComponent(FudgeCore.ComponentRigidbody);\n if (cmpRigidbody && cmpRigidbody.isActive) { //TODO: support de-/activation throughout\n Render.nodesPhysics.push(_branch); // add this node to physics list\n if (!_options?.ignorePhysics)\n this.transformByPhysics(_branch, cmpRigidbody);\n }\n let cmpLights = _branch.getComponents(FudgeCore.ComponentLight);\n for (let cmpLight of cmpLights) {\n if (!cmpLight.isActive)\n continue;\n let type = cmpLight.light.getType();\n let lightsOfType = _lights.get(type);\n if (!lightsOfType) {\n lightsOfType = [];\n _lights.set(type, lightsOfType);\n }\n lightsOfType.push(cmpLight);\n }\n let cmpMesh = _branch.getComponent(FudgeCore.ComponentMesh);\n let cmpMaterial = _branch.getComponent(FudgeCore.ComponentMaterial);\n if (cmpMesh && cmpMesh.isActive && cmpMaterial && cmpMaterial.isActive) {\n // TODO: careful when using particlesystem, pivot must not change node position\n cmpMesh.mtxWorld = FudgeCore.Matrix4x4.MULTIPLICATION(_branch.mtxWorld, cmpMesh.mtxPivot);\n let shader = cmpMaterial.material.getShader();\n if (_shadersUsed.indexOf(shader) < 0)\n _shadersUsed.push(shader);\n _branch.radius = cmpMesh.radius;\n if (cmpMaterial.sortForAlpha)\n Render.nodesAlpha.push(_branch); // add this node to render list\n else\n Render.nodesSimple.push(_branch); // add this node to render list\n }\n for (let child of _branch.getChildren()) {\n Render.prepare(child, _options, _branch.mtxWorld, _lights, _shadersUsed);\n _branch.nNodesInBranch += child.nNodesInBranch;\n let cmpMeshChild = child.getComponent(FudgeCore.ComponentMesh);\n let position = cmpMeshChild ? cmpMeshChild.mtxWorld.translation : child.mtxWorld.translation;\n _branch.radius = Math.max(_branch.radius, FudgeCore.Vector3.DIFFERENCE(position, _branch.mtxWorld.translation).magnitude + child.radius);\n }\n if (firstLevel) {\n Render.dispatchEvent(new Event(\"renderPrepareEnd\" /* RENDER_PREPARE_END */));\n for (let shader of _shadersUsed)\n Render.setLightsInShader(shader, _lights);\n }\n //Calculate Physics based on all previous calculations \n // Render.setupPhysicalTransform(_branch);\n }",
"function hoistMethods(\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndestination, \n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nsource, exclusions) {\n if (exclusions === void 0) { exclusions = REACT_LIFECYCLE_EXCLUSIONS; }\n var hoisted = [];\n var _loop_1 = function (methodName) {\n if (typeof source[methodName] === 'function' &&\n destination[methodName] === undefined &&\n (!exclusions || exclusions.indexOf(methodName) === -1)) {\n hoisted.push(methodName);\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n destination[methodName] = function () {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n source[methodName].apply(source, args);\n };\n }\n };\n for (var methodName in source) {\n _loop_1(methodName);\n }\n return hoisted;\n}",
"function hoistMethods(\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndestination, \n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nsource, exclusions) {\n if (exclusions === void 0) { exclusions = REACT_LIFECYCLE_EXCLUSIONS; }\n var hoisted = [];\n var _loop_1 = function (methodName) {\n if (typeof source[methodName] === 'function' &&\n destination[methodName] === undefined &&\n (!exclusions || exclusions.indexOf(methodName) === -1)) {\n hoisted.push(methodName);\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n destination[methodName] = function () {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n source[methodName].apply(source, args);\n };\n }\n };\n for (var methodName in source) {\n _loop_1(methodName);\n }\n return hoisted;\n}"
] |
[
"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.47891727",
"0.4788133",
"0.47801295",
"0.4778189",
"0.4762878",
"0.4762878",
"0.47587237",
"0.4750028",
"0.4750028",
"0.47397593",
"0.47303233",
"0.4715221",
"0.47116017",
"0.47116017",
"0.4710118",
"0.47099054",
"0.47082072",
"0.47080505",
"0.46989605",
"0.46931314",
"0.46861252",
"0.4676788",
"0.46671972",
"0.46666968",
"0.46666968",
"0.46647355",
"0.46600237",
"0.46525744",
"0.4649844",
"0.4641263",
"0.46102583",
"0.458948",
"0.45829567",
"0.458222",
"0.4572605",
"0.45683208",
"0.45681986",
"0.45668948",
"0.4564574",
"0.45618823",
"0.45515954",
"0.45408952",
"0.45369083",
"0.4532081",
"0.45283294",
"0.45225862",
"0.4518386",
"0.4516957",
"0.4515158",
"0.4513867",
"0.45133397",
"0.45081145",
"0.45072585",
"0.45035213",
"0.45035213",
"0.45003948",
"0.4499047",
"0.44874376",
"0.44818038",
"0.44800994",
"0.44766784",
"0.44766784",
"0.44756806",
"0.44726792",
"0.4471821",
"0.44708532",
"0.44699734",
"0.4469035",
"0.44668624",
"0.44605064",
"0.44596696",
"0.44570157",
"0.44550103",
"0.44536516",
"0.44515634",
"0.4451083",
"0.44502902",
"0.44500667",
"0.44486752",
"0.44455492",
"0.44455492"
] |
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 const match = error.message.match(regex);\n const fieldName = match[1] || match[2];\n return new APIError({\n message: `${fieldName} already exists`,\n status: httpStatus.CONFLICT,\n isPublic: true,\n stack: error.stack,\n });\n }\n return error;\n }",
"function testInsert_UniqueKeyViolation_SingleColumn() {\n var table = env.schema.table('tableE');\n var emailIndexSchema = table.getIndices()[1];\n assertTrue(emailIndexSchema.isUnique);\n var emailIndex = env.indexStore.get(emailIndexSchema.getNormalizedName());\n var rowIdIndex = env.indexStore.get(table.getRowIdIndexName());\n\n var journal = createJournal([table]);\n var row1 = table.createRow({'id': 'pk1', 'email': 'emailAddress1'});\n journal.insert(table, [row1]);\n journal.commit();\n assertTrue(emailIndex.containsKey(row1.payload()['email']));\n assertTrue(rowIdIndex.containsKey(row1.id()));\n assertEquals(1, env.cache.getCount());\n\n journal = createJournal([table]);\n var row2 = table.createRow({'id': 'pk2', 'email': 'emailAddress1'});\n lf.testing.util.assertThrowsError(\n 201, // Duplicate keys are not allowed.\n journal.insert.bind(journal, table, [row2]));\n journal.rollback();\n\n assertEquals(row1.id(), emailIndex.get(row1.payload()['email'])[0]);\n assertTrue(rowIdIndex.containsKey(row1.id()));\n assertEquals(1, env.cache.getCount());\n}",
"function getKeyError(err){\n var regex = /index\\:\\ (?:.*\\.)?\\$?(?:([_a-z0-9]*)(?:_\\d*)|([_a-z0-9]*))\\s*dup key/i,\n match = err.match(regex);\n return match[1] || match[2]; \n}",
"isUniqueConstraintViolation(error) {\n return /duplicate key value violates unique constraint/.test(String(error));\n }",
"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$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);break;default:break;}}return knownKeys;}",
"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;}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);break;}}return knownKeys;}",
"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$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);break;default:break;}}return knownKeys;}",
"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;}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);break;}}return knownKeys;}",
"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;}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);break;}}return knownKeys;}",
"function warnOnInvalidKey(child,knownKeys){{if((typeof child==='undefined'?'undefined':_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$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);break;default:break;}}return knownKeys;}",
"function warnOnInvalidKey(child,knownKeys){{if((typeof child==='undefined'?'undefined':_typeof(child))!=='object'||child===null){return knownKeys;}switch(child.$$typeof){case REACT_ELEMENT_TYPE:case REACT_CALL_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$1());break;default:break;}}return knownKeys;}",
"function warnOnInvalidKey(child,knownKeys){{if((typeof child==='undefined'?'undefined':_typeof(child))!=='object'||child===null){return knownKeys;}switch(child.$$typeof){case REACT_ELEMENT_TYPE:case REACT_CALL_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$1());break;default:break;}}return knownKeys;}",
"function warnOnInvalidKey(child,knownKeys){{if((typeof child==='undefined'?'undefined':_typeof(child))!=='object'||child===null){return knownKeys;}switch(child.$$typeof){case REACT_ELEMENT_TYPE:case REACT_CALL_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$1());break;default:break;}}return knownKeys;}",
"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 warnOnInvalidKey(child,knownKeys){{if((typeof child==='undefined'?'undefined':_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 warnOnInvalidKey(child,knownKeys,returnFiber){{if(_typeof(child)!=='object'||child===null){return knownKeys;}switch(child.$$typeof){case REACT_ELEMENT_TYPE:case REACT_PORTAL_TYPE:warnForMissingKey(child,returnFiber);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;}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);break;}}return knownKeys;}",
"function testInsert_PrimaryKeyViolation3() {\n var table = env.schema.table('tableA');\n var pkIndexSchema = table.getConstraint().getPrimaryKey();\n var pkIndex = env.indexStore.get(pkIndexSchema.getNormalizedName());\n\n var rows = [];\n for (var i = 0; i < 3; i++) {\n rows.push(table.createRow(\n {'id': 'pk' + i.toString(), 'name': 'DummyName'}));\n }\n for (var j = 0; j < 3; j++) {\n rows.push(table.createRow({'id': 'samePk', 'name': 'DummyName'}));\n }\n\n var journal = createJournal([table]);\n lf.testing.util.assertThrowsError(\n 201, // Duplicate keys are not allowed.\n journal.insert.bind(journal, table, rows));\n journal.rollback();\n\n assertEquals(0, env.cache.getCount());\n var rowIdIndex = env.indexStore.get(table.getRowIdIndexName());\n assertEquals(0, pkIndex.getRange().length);\n assertEquals(0, rowIdIndex.getRange().length);\n}",
"function warnOnInvalidKey(child,knownKeys,returnFiber){{if(typeof child!=='object'||child===null){return knownKeys;}switch(child.$$typeof){case REACT_ELEMENT_TYPE:case REACT_PORTAL_TYPE:warnForMissingKey(child,returnFiber);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;}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);break;}}return knownKeys;}",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"function makeEnsureExistsCallback(callback) {\n return function ensureExistsCallback(error,success) {\n //winston.log('info',sprintf(\"ensureExistsCallback:(%s,%s)\",JSON.stringify(error),JSON.stringify(success)));\n if (!error) {\n callback(null,1);\n }\n else if (error['code'] == mongo.errors.duplicateKeyError) {\n callback(null,0);\n } \n else {\n callback(error);\n }\n }\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 }",
"checkForDuplicates(state, indexDictionary) {\n const data = state.dictionaries[indexDictionary].content;\n\n data.forEach((value) => {\n state.dictionaries[indexDictionary].content = data.map((pair, index) => {\n // Make sure the object is not itself\n if (data.indexOf(pair) !== data.indexOf(value)) {\n if (pair.domain === value.domain && pair.range === value.range) {\n if (\n data[index].validity.status\n && data[index].validity.reason === ''\n ) {\n // Change validity of the pair to false and assign the reason why\n data[index].validity.status = false;\n data[index].validity.reason = reasonNotValid.duplicate;\n }\n }\n }\n return pair;\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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"async testValidateKeyMissingKeyData() {\n const key = createKey().setKeyData(null);\n\n try {\n await Util.validateKey(key);\n } catch (e) {\n assertEquals(\n ExceptionText.InvalidKeyMissingKeyData(key.getKeyId()), e.toString());\n return;\n }\n fail('An exception should be thrown.');\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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }"
] |
[
"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.59782195",
"0.59782195",
"0.59782195",
"0.5968301",
"0.5958314",
"0.59582865",
"0.5956432",
"0.59424883",
"0.59424883",
"0.59424883",
"0.59424883",
"0.59424883",
"0.59424883",
"0.5940093",
"0.59280837",
"0.59280837",
"0.59275055",
"0.5918077",
"0.59043187",
"0.59043187",
"0.59043187",
"0.59043187",
"0.5888681",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.58638847",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966",
"0.5862966"
] |
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 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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 = 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 } // 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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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 }",
"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}",
"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 }",
"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.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}"
] |
[
"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"
] |
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,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);}"
] |
[
"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"
] |
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 = 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 }"
] |
[
"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"
] |
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\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}"
] |
[
"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"
] |
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.",
"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 }"
] |
[
"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"
] |
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 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 }"
] |
[
"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"
] |
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 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}"
] |
[
"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"
] |
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 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 }"
] |
[
"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"
] |
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 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 }"
] |
[
"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"
] |
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. 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}"
] |
[
"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"
] |
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 = 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}"
] |
[
"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"
] |
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 = 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}"
] |
[
"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"
] |
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 = 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}"
] |
[
"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"
] |
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 }",
"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 }"
] |
[
"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"
] |
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 }",
"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 }"
] |
[
"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"
] |
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.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; }"
] |
[
"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"
] |
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=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}"
] |
[
"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"
] |
0.6344786
|
65
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.