\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 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 }"],"string":"[\n \"function mapWrapper(key)\\n{\\n\\tthis.key = key;\\n}\",\n \"function Map() {\\n this.container = new Object();\\n}\",\n \"function Map() {\\r\\n this.keys = [];\\r\\n this.values = [];\\r\\n}\",\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}\",\n \"function InvokeDefinitionMap() {\\n this.map = [];\\n this.lookup_table = {}; // Just for building dictionary\\n}\",\n \"function Map() {\\n\\t\\tthis._values = {};\\n\\t}\",\n \"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}\",\n \"function ValueMap(data) {\\n this.data = data || {};\\n}\",\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 }\",\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}\",\n \"function Map() {}\",\n \"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 }\",\n \"function CachedMap(mappingFunction) {\\n this._map = mappingFunction || null;\\n this._cachedOutput = null;\\n this._cachedInput = Number.NaN; //never valid as input\\n }\",\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}\",\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}\",\n \"function getInstanceContext(instanceId) {\\n return instanceMap[instanceId]; \\n }\",\n \"function get(key){return key._reactInternals;}\",\n \"function get(key){return key._reactInternals;}\",\n \"function h$Map() {\\n this._pairsKeys = [];\\n this._pairsValues = [];\\n this._keys = [];\\n this._size = 0;\\n}\",\n \"function h$Map() {\\n this._pairsKeys = [];\\n this._pairsValues = [];\\n this._keys = [];\\n this._size = 0;\\n}\",\n \"function h$Map() {\\n this._pairsKeys = [];\\n this._pairsValues = [];\\n this._keys = [];\\n this._size = 0;\\n}\",\n \"function h$Map() {\\n this._pairsKeys = [];\\n this._pairsValues = [];\\n this._keys = [];\\n this._size = 0;\\n}\",\n \"function mapState(state) {\\n return {\\n counterValue: state.counterValue\\n }\\n}\",\n \"function Map() {\\n this.members = {};\\n this.length = 0;\\n }\",\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 }\",\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}\",\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 }\",\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 }\",\n \"constructor () {\\n this.storage = immutable.Map()\\n }\",\n \"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 }\",\n \"function MapCache() {\\n this.__data__ = {};\\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 }\",\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 }\",\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 }\",\n \"function LazyMap() {\\n this.store = {};\\n}\",\n \"function LazyMap() {\\n this.store = {};\\n}\",\n \"function LazyMap() {\\n this.store = {};\\n}\",\n \"function LazyMap() {\\n this.store = {};\\n}\",\n \"function LazyMap() {\\n this.store = {};\\n}\",\n \"function LazyMap() {\\n this.store = {};\\n}\",\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}\",\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}\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\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}\",\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 }\",\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}\",\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 }\",\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 }\",\n \"function Map() {\\n\\t this.items = Object.create(null);\\n\\t this.length = 0;\\n\\t this.next = 0;\\n\\t }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\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 }\",\n \"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}\",\n \"function createMap() {\\n return Object.create(null)\\n}\",\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;}\",\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;}\",\n \"_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)}})}\",\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 }\",\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 }\",\n \"function mapData(instances) {\\n const diffData = {}\\n instances.forEach((instance, idx) => {\\n diffData[instance.name.toLowerCase()] = idx\\n })\\n return diffData\\n}\",\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 }\",\n \"function MapCache() {\\n this.__data__ = {};\\n }\",\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 }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.56250936","0.5444014","0.54394263","0.54297894","0.52931684","0.5229124","0.52213204","0.5153877","0.5149647","0.5146485","0.5124302","0.5117343","0.5113928","0.51124424","0.5056032","0.50448793","0.50252193","0.50252193","0.49983275","0.49983275","0.49983275","0.49983275","0.49909443","0.49803767","0.4962937","0.4955822","0.4953732","0.49308357","0.49193725","0.49101692","0.49062556","0.4883781","0.4883781","0.4883781","0.4881514","0.4881514","0.4881514","0.4881514","0.4881514","0.4881514","0.48750275","0.48641154","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48534456","0.48524112","0.48321706","0.4826128","0.4821695","0.4821695","0.48125446","0.4810177","0.48087206","0.4801939","0.47919175","0.47887778","0.47887778","0.47789326","0.47722894","0.47722894","0.47636974","0.47591412","0.47533804","0.4751104"],"string":"[\n \"0.56250936\",\n \"0.5444014\",\n \"0.54394263\",\n \"0.54297894\",\n \"0.52931684\",\n \"0.5229124\",\n \"0.52213204\",\n \"0.5153877\",\n \"0.5149647\",\n \"0.5146485\",\n \"0.5124302\",\n \"0.5117343\",\n \"0.5113928\",\n \"0.51124424\",\n \"0.5056032\",\n \"0.50448793\",\n \"0.50252193\",\n \"0.50252193\",\n \"0.49983275\",\n \"0.49983275\",\n \"0.49983275\",\n \"0.49983275\",\n \"0.49909443\",\n \"0.49803767\",\n \"0.4962937\",\n \"0.4955822\",\n \"0.4953732\",\n \"0.49308357\",\n \"0.49193725\",\n \"0.49101692\",\n \"0.49062556\",\n \"0.4883781\",\n \"0.4883781\",\n \"0.4883781\",\n \"0.4881514\",\n \"0.4881514\",\n \"0.4881514\",\n \"0.4881514\",\n \"0.4881514\",\n \"0.4881514\",\n \"0.48750275\",\n \"0.48641154\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48534456\",\n \"0.48524112\",\n \"0.48321706\",\n \"0.4826128\",\n \"0.4821695\",\n \"0.4821695\",\n \"0.48125446\",\n \"0.4810177\",\n \"0.48087206\",\n \"0.4801939\",\n \"0.47919175\",\n \"0.47887778\",\n \"0.47887778\",\n \"0.47789326\",\n \"0.47722894\",\n \"0.47722894\",\n \"0.47636974\",\n \"0.47591412\",\n \"0.47533804\",\n \"0.4751104\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.4917855"},"document_rank":{"kind":"string","value":"38"}}},{"rowIdx":80665,"cells":{"query":{"kind":"string","value":"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."},"document":{"kind":"string","value":"function findRootContainerNode(inst){// TODO: It may be a good idea to cache this to prevent unnecessary DOM\n// traversal, but caching is difficult to do correctly without using a\n// mutation observer to listen for all DOM changes.\nwhile(inst.return){inst=inst.return;}if(inst.tag!==HostRoot){// This can happen if we're in a detached tree.\nreturn null;}return inst.stateNode.containerInfo;}// Used to store ancestor hierarchy in top level callback"},"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 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}"],"string":"[\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"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;}\",\n \"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;}\",\n \"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;}\",\n \"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;}\",\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 }\",\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 }\",\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 }\",\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 }\",\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}\",\n \"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 }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6876151","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.6797642","0.67871845","0.67871845","0.67871845","0.67871845","0.67871845","0.67871845","0.67871845","0.67806417","0.67806417","0.67806417","0.67806417","0.6759185","0.6759185","0.6759185","0.6752743","0.6723364","0.6699298","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304","0.66683304"],"string":"[\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6876151\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.6797642\",\n \"0.67871845\",\n \"0.67871845\",\n \"0.67871845\",\n \"0.67871845\",\n \"0.67871845\",\n \"0.67871845\",\n \"0.67871845\",\n \"0.67806417\",\n \"0.67806417\",\n \"0.67806417\",\n \"0.67806417\",\n \"0.6759185\",\n \"0.6759185\",\n \"0.6759185\",\n \"0.6752743\",\n \"0.6723364\",\n \"0.6699298\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\",\n \"0.66683304\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80666,"cells":{"query":{"kind":"string","value":"Implements an host component that warns when `selected` is set."},"document":{"kind":"string","value":"function validateProps(element,props){{// This mirrors the codepath above, but runs for hydration too.\n// Warn about invalid children here so that client and hydration are consistent.\n// TODO: this seems like it could cause a DEV-only throw for hydration\n// if children contains a non-element object. We should try to avoid that.\nif(_typeof(props.children)==='object'&&props.children!==null){React.Children.forEach(props.children,function(child){if(child==null){return;}if(typeof child==='string'||typeof child==='number'){return;}if(typeof child.type!=='string'){return;}if(!didWarnInvalidChild){didWarnInvalidChild=true;warning$1(false,'Only strings and numbers are supported as <option> children.');}});}// TODO: Remove support for `selected` in <option>.\nif(props.selected!=null&&!didWarnSelectedSetOnOption){warning$1(false,'Use the `defaultValue` or `value` props on <select> instead of '+'setting `selected` on <option>.');didWarnSelectedSetOnOption=true;}}}"},"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":["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 }","_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 }","get selected() { return this.selectionList.selectedOptions.isSelected(this); }","get selected() { return this.selectionList.selectedOptions.isSelected(this); }","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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 }","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}","_checkSelectIsAble () {\n return 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._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 }"],"string":"[\n \"get _shouldUpdateSelection(){return this.selected!=null;}\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"get selected() { return this._selected; }\",\n \"select() { this.selected = true; }\",\n \"get _shouldUpdateSelection(){return this.selected!=null||this.selectedValues!=null&&this.selectedValues.length;}\",\n \"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>.');}}\",\n \"get disallowEmptySelection() {\\n return this.state.disallowEmptySelection;\\n }\",\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>.');}}\",\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>.');}}\",\n \"select () {\\n this.selected = true;\\n }\",\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;}}}\",\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;}}}\",\n \"_hideSelected() {\\n this.props.hideSelected();\\n }\",\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 }\",\n \"_setSelectedOption() {\\n if (this.options.length > 1) super._setSelectedOption();\\n }\",\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 }\",\n \"_selectViaInteraction() {\\n if (!this.disabled) {\\n this._selected = this.multiple ? !this._selected : true;\\n this._changeDetectorRef.markForCheck();\\n this._emitSelectionChangeEvent(true);\\n }\\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 }\",\n \"_selectViaInteraction() {\\n if (!this.disabled) {\\n this._selected = this.multiple ? !this._selected : true;\\n this._changeDetectorRef.markForCheck();\\n this._emitSelectionChangeEvent(true);\\n }\\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 }\",\n \"get selected() { return this.selectionList.selectedOptions.isSelected(this); }\",\n \"get selected() { return this.selectionList.selectedOptions.isSelected(this); }\",\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 }\",\n \"get selected() {\\n return this._selected;\\n }\",\n \"get selected() {\\n return this._selected;\\n }\",\n \"get selected() {\\n return this._selected;\\n }\",\n \"_canItemBeSelected(item) {\\n return item.disabled === false && item.templateApplied !== true;\\n }\",\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 }\",\n \"mounted(el, { value }) {\\r\\n setSelected(el, value);\\r\\n }\",\n \"mounted(el, { value }) {\\r\\n setSelected(el, value);\\r\\n }\",\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 }\",\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 }\",\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 }\",\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 }\",\n \"set selected(value) {\\n this._selected = value;\\n this._selectedTimestamp = value ? new Date() : undefined;\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"mounted(el, { value }) {\\n setSelected(el, value);\\n }\",\n \"function handleSelection(value) {\\n setCategory(value);\\n setVisible(false);\\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 }\",\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}\",\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}\",\n \"'state.selected_diagnostics'() {\\n if (this.state.selected_diagnostics.length !== 0) {\\n this.uncheckLabelsButtons();\\n this.createPlot();\\n }\\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}\",\n \"get hidden() {\\n return !this.selected;\\n }\",\n \"setSelected(selected) {\\n if (selected !== this.state.selected) {\\n this.setState({ selected })\\n }\\n }\",\n \"select(item) {\\n if (this.state.selected !== item) {\\n this.state.selected = item;\\n this.props.updateFilter(this.state.selected);\\n }\\n }\",\n \"getSelectedTarget() {\\n this.socket.emit('get_selected_target');\\n return false;\\n }\",\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 }\",\n \"mounted (el, { value }) {\\n setSelected(el, value);\\n }\",\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}\",\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}\",\n \"set Selected(value) {\\n this._selected = value;\\n if (value) {\\n selectedInput = this;\\n }\\n else {\\n selectedInput = null;\\n }\\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"get selectable() { return this._selectable; }\",\n \"get selectable() { return this._selectable; }\",\n \"__$$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}\",\n \"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 }\",\n \"constructor(value, selected) {\\r\\n this.value = value;\\r\\n this.selected = selected;\\r\\n }\",\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 }\",\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}\",\n \"_checkSelectIsAble () {\\n return true\\n }\",\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._changeDetector.markForCheck();\\n return true;\\n }\",\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 }\",\n \"selectHandler(e) {\\n const { trigger } = this.props;\\n trigger(e);\\n }\",\n \"function option(value, selected) {\\n return {\\n selected: observable(has(selected) ? selected : allCheckbox()),\\n value: has(value) ? value.toString() : \\\"\\\"\\n };\\n }\",\n \"@className('is-invalid')\\n @computed('selectedColor')\\n get _isInvalid() {\\n return !this._validateColor(this.get('selectedColor'));\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5835138","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.5717058","0.56534386","0.55851144","0.5576835","0.5574898","0.55625105","0.55625105","0.5542894","0.55244917","0.55244917","0.5513038","0.5443834","0.5435288","0.5418387","0.5413063","0.5413063","0.5413063","0.5413063","0.5412548","0.5412548","0.53901887","0.53684646","0.53684646","0.53684646","0.53647757","0.5356113","0.53322697","0.53322697","0.53093964","0.53039145","0.53039145","0.5297552","0.5277064","0.52712804","0.52712804","0.52712804","0.52712804","0.52712804","0.52712804","0.52712804","0.52655303","0.5262013","0.5258836","0.5254594","0.5252073","0.5246993","0.524382","0.52432406","0.52172583","0.52165884","0.5214721","0.5213948","0.5211734","0.52097267","0.519453","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.5188785","0.518406","0.51572895","0.51572895","0.51396114","0.51368636","0.5132361","0.5119722","0.51153034","0.5114101","0.51056343","0.510285","0.5101597","0.5100261","0.50969684"],"string":"[\n \"0.5835138\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.5717058\",\n \"0.56534386\",\n \"0.55851144\",\n \"0.5576835\",\n \"0.5574898\",\n \"0.55625105\",\n \"0.55625105\",\n \"0.5542894\",\n \"0.55244917\",\n \"0.55244917\",\n \"0.5513038\",\n \"0.5443834\",\n \"0.5435288\",\n \"0.5418387\",\n \"0.5413063\",\n \"0.5413063\",\n \"0.5413063\",\n \"0.5413063\",\n \"0.5412548\",\n \"0.5412548\",\n \"0.53901887\",\n \"0.53684646\",\n \"0.53684646\",\n \"0.53684646\",\n \"0.53647757\",\n \"0.5356113\",\n \"0.53322697\",\n \"0.53322697\",\n \"0.53093964\",\n \"0.53039145\",\n \"0.53039145\",\n \"0.5297552\",\n \"0.5277064\",\n \"0.52712804\",\n \"0.52712804\",\n \"0.52712804\",\n \"0.52712804\",\n \"0.52712804\",\n \"0.52712804\",\n \"0.52712804\",\n \"0.52655303\",\n \"0.5262013\",\n \"0.5258836\",\n \"0.5254594\",\n \"0.5252073\",\n \"0.5246993\",\n \"0.524382\",\n \"0.52432406\",\n \"0.52172583\",\n \"0.52165884\",\n \"0.5214721\",\n \"0.5213948\",\n \"0.5211734\",\n \"0.52097267\",\n \"0.519453\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.5188785\",\n \"0.518406\",\n \"0.51572895\",\n \"0.51572895\",\n \"0.51396114\",\n \"0.51368636\",\n \"0.5132361\",\n \"0.5119722\",\n \"0.51153034\",\n \"0.5114101\",\n \"0.51056343\",\n \"0.510285\",\n \"0.5101597\",\n \"0.5100261\",\n \"0.50969684\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80667,"cells":{"query":{"kind":"string","value":"Validation function for `value` and `defaultValue`."},"document":{"kind":"string","value":"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());}}}"},"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":["'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}"],"string":"[\n \"'validateValue'(value) {}\",\n \"function checkValue(value, defaultValue) {\\n return (value ? value : defaultValue)\\n }\",\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}\",\n \"function requireValue(field, value) { }\",\n \"function validatedata($attr, $defaultValue) {\\n \\\"use strict\\\";\\n if ($attr !== undefined) {\\n return $attr\\n }\\n return $defaultValue;\\n}\",\n \"function validatedata($attr, $defaultValue) {\\n \\\"use strict\\\";\\n if ($attr !== undefined) {\\n return $attr\\n }\\n return $defaultValue;\\n}\",\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}\",\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}\",\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}\",\n \"function validatedata($attr, $defaultValue) {\\n \\\"use strict\\\";\\n if ($attr !== undefined) {\\n return $attr\\n }\\n return $defaultValue;\\n }\",\n \"function valueCheck(props, ...args) {\\n if (props.multiple) return p.arrayOf(valueShape).isRequired(props, ...args)\\n return valueShape(props, ...args)\\n}\",\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 }\",\n \"validateValue (value) {\\n return TypeNumber.isNumber(value) && !isNaN(value)\\n }\",\n \"function defaulted(value,defaultValue){return value!==undefined?value:defaultValue;}\",\n \"function validator(value) {\\n if (value === undefined || value === null)\\n return true;\\n if (Number.isNaN(value))\\n return false;\\n return true;\\n}\",\n \"validate(value) {\\n if (value < 0) return 0;\\n else if (value > 5) return 5;\\n }\",\n \"validateRequired(propValue, value) {\\n return !(propValue && _isEmpty(value));\\n }\",\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}\",\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 }\",\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\",\n \"function defaultValue(v) { }\",\n \"function customValidation(input) { \\n}\",\n \"validate(_value, _utils) {\\n return false;\\n }\",\n \"function canBeValue() { }\",\n \"function customValidation(input){\\n return input;\\n \\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}\",\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 }\",\n \"function vaildator(value){\\n if(value!=''){\\n return value;\\n }\\n else{\\n return '(name not given)';\\n }\\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 }\",\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}\",\n \"function validateValueWithFunc(value, parseFunc, type) {\\n if (parseFunc(value))\\n console.log('Invalid ' + type);\\n else\\n console.log('Valid ' + type);\\n}\",\n \"isValid(value){\\n return !isNaN(value);\\n }\",\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 }\",\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 }\",\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);}\",\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);}\",\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);}\",\n \"function isInvalid(value) {\\n return value === undefined || value !== value;\\n}\",\n \"function isInvalid(value) {\\n return value === undefined || value !== value;\\n}\",\n \"function isInvalid(value) {\\n return value === undefined || value !== value;\\n}\",\n \"function isInvalid(value) {\\n return value === undefined || value !== value;\\n}\",\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 }\",\n \"validate(value) {\\n if(value < 0){\\n throw new Error('Age must be positive')\\n }\\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 }\",\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}\",\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}\",\n \"validate(value) {\\n if (value < 0) {\\n throw new Error(\\\"age must be a positive number\\\");\\n }\\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}\",\n \"function default_missing_values(default_val)\\n{\\n\\treturn default_val;\\n}\",\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}\",\n \"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}\",\n \"function validateUser({ name = \\\"unknown\\\" }) {\\n return name === \\\"john\\\";\\n}\",\n \"validate( _value, _utils ) {\\n\\t\\t\\treturn false;\\n\\t\\t}\",\n \"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}\",\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 }\",\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 }\",\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 }\",\n \"_checkValue(value) {\\n if (!_.isFunction(value)) {\\n throw new Error('functionsDict._checkValue: must provide only Function as values.');\\n }\\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 }\",\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 }\",\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}\",\n \"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}\",\n \"validate(value) {\\n if (value < 0) {\\n throw new Error('Age must be a positive number');\\n }\\n }\",\n \"function calculateValue(testValue, defaultValue) {\\n if (testValue) {\\n return testValue;\\n }\\n else {\\n return defaultValue;\\n }\\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 }\",\n \"function checkValidInput(value) {\\n if (!value || value === \\\"\\\") {\\n return false;\\n } else {\\n return true;\\n }\\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 }\",\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}\",\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}\",\n \"validate(value){\\n if(value < 0) throw new Error('The age must be a positive number')\\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}\",\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}\",\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}\",\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 }\",\n \"shouldSetInputTextToDefaultValue (props) {\\n let result = (this.previousDefaultValue != props.defaultValue) || (this.previousChangeIndicator != props.changeIndicator)\\n return result\\n }\",\n \"function defaulted(value, defaultValue) {\\r\\n return value !== undefined ? value : defaultValue;\\r\\n}\",\n \"function defaulted(value, defaultValue) {\\r\\n return value !== undefined ? value : defaultValue;\\r\\n}\",\n \"function defaulted(value, defaultValue) {\\r\\n return value !== undefined ? value : defaultValue;\\r\\n}\",\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}\",\n \"preValidate(key, value, errors, values) {}\",\n \"function defaultValue(test,defaultValue) {\\r\\n\\treturn (typeof test !== 'undefined' ? test : defaultValue);\\r\\n}\",\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}\",\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 }\",\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}\",\n \"function validateUser({ name = \\\"unknown\\\" } = {}) {\\n return name === \\\"john\\\";\\n}\",\n \"validate(value){\\n if (!validator.isEmail(value)){\\n throw new Error('Email invalid')\\n }\\n }\",\n \"function validateValue(value) {\\n return (VALID_VALUE_BASE_REGEX.test(value) &&\\n !INVALID_VALUE_COMMA_EQUAL_REGEX.test(value));\\n}\",\n \"function validateValue(value) {\\n return (VALID_VALUE_BASE_REGEX.test(value) &&\\n !INVALID_VALUE_COMMA_EQUAL_REGEX.test(value));\\n}\",\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}\",\n \"function value(val) { return control_1.default(val); }\",\n \"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 }\",\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);}\",\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);}\",\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);}\",\n \"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}\",\n \"function valueOrDefault(value, defaultValue) {\\n\\t\\treturn typeof value === 'undefined' ? defaultValue : value;\\n\\t}\",\n \"function validateNamedOptionalPropertyEquals(functionName,inputName,optionName,input,expected){if(input!==undefined){validateNamedPropertyEquals(functionName,inputName,optionName,input,expected);}}\",\n \"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}\",\n \"function defaulted(value, defaultValue) {\\n return value !== undefined ? value : defaultValue;\\n }\",\n \"function undefinedDefault(value, defaultValue) {\\n return (value !== undefined) ? value : defaultValue;\\n}\",\n \"function _validateIsNotBlank(def){\\n return !isEmpty(def.attrValue);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["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"],"string":"[\n \"0.7436162\",\n \"0.6856192\",\n \"0.65868\",\n \"0.6431272\",\n \"0.64279246\",\n \"0.64279246\",\n \"0.6416799\",\n \"0.6416799\",\n \"0.6416799\",\n \"0.6316331\",\n \"0.6230596\",\n \"0.6195563\",\n \"0.616348\",\n \"0.61238676\",\n \"0.6050824\",\n \"0.6044303\",\n \"0.6036909\",\n \"0.59743184\",\n \"0.59359854\",\n \"0.58691984\",\n \"0.58653325\",\n \"0.5850534\",\n \"0.58382624\",\n \"0.5832495\",\n \"0.5827688\",\n \"0.581331\",\n \"0.58104706\",\n \"0.57828456\",\n \"0.57550627\",\n \"0.57483244\",\n \"0.5705512\",\n \"0.56952184\",\n \"0.5676993\",\n \"0.5666483\",\n \"0.5665817\",\n \"0.5665817\",\n \"0.5665817\",\n \"0.56593883\",\n \"0.56593883\",\n \"0.56593883\",\n \"0.56593883\",\n \"0.565329\",\n \"0.5645423\",\n \"0.56385815\",\n \"0.5634249\",\n \"0.5631972\",\n \"0.561746\",\n \"0.55995023\",\n \"0.5598736\",\n \"0.5596319\",\n \"0.55823517\",\n \"0.5581123\",\n \"0.5576831\",\n \"0.55748844\",\n \"0.5567295\",\n \"0.555334\",\n \"0.55509\",\n \"0.5537622\",\n \"0.5533782\",\n \"0.55309516\",\n \"0.55252206\",\n \"0.5524409\",\n \"0.5519985\",\n \"0.55082774\",\n \"0.54966646\",\n \"0.54965717\",\n \"0.54833883\",\n \"0.5482924\",\n \"0.5481612\",\n \"0.54746187\",\n \"0.5464223\",\n \"0.5464223\",\n \"0.5461036\",\n \"0.5458784\",\n \"0.5458329\",\n \"0.5455748\",\n \"0.5455748\",\n \"0.5455748\",\n \"0.54516596\",\n \"0.54510033\",\n \"0.54487586\",\n \"0.5434088\",\n \"0.54293984\",\n \"0.54275113\",\n \"0.54243594\",\n \"0.5423496\",\n \"0.5421067\",\n \"0.5421067\",\n \"0.54184175\",\n \"0.54169947\",\n \"0.54120696\",\n \"0.54086924\",\n \"0.54086924\",\n \"0.54086924\",\n \"0.5408298\",\n \"0.54062825\",\n \"0.53942436\",\n \"0.53923774\",\n \"0.53907543\",\n \"0.5384356\",\n \"0.5383341\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80668,"cells":{"query":{"kind":"string","value":"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."},"document":{"kind":"string","value":"function getHostProps$2(element,props){return _assign({},props,{value:undefined});}"},"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 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}"],"string":"[\n \"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.\\\");}}}\",\n \"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.\\\");}}}\",\n \"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}\",\n \"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}\",\n \"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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"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}\",\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}\",\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 }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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());}}}}\",\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());}}}}\",\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());}}}}\",\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){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());}}}\",\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){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());}}}\",\n \"constructor(value, selected) {\\r\\n this.value = value;\\r\\n this.selected = selected;\\r\\n }\",\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());}}}\",\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());}}}\",\n \"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());}}}\",\n \"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());}}}\",\n \"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());}}}\",\n \"setOptions(prop, value) {\\n\\t\\t\\t\\tset({ options: true, prop }, value);\\n\\t\\t\\t}\",\n \"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());}}}}\",\n \"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());}}}}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60985404","0.6063396","0.5824173","0.5824173","0.57353365","0.5712244","0.57057315","0.57057315","0.57057315","0.57057315","0.57057315","0.56855667","0.56825453","0.5640067","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.56325287","0.5575192","0.5523022","0.5523022","0.5523022","0.5523022","0.5523022","0.5523022","0.5523022","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.5512539","0.54465693","0.54465693","0.54465693","0.54404366","0.54404366","0.5435471","0.54341644","0.54341644","0.543048","0.543048","0.543048","0.54229355","0.5415838","0.5415838","0.5399433","0.5399433","0.5399433","0.5399433","0.5399433","0.5399433","0.5399433","0.5399433","0.5399433","0.5399433","0.53887117","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075","0.5387075"],"string":"[\n \"0.60985404\",\n \"0.6063396\",\n \"0.5824173\",\n \"0.5824173\",\n \"0.57353365\",\n \"0.5712244\",\n \"0.57057315\",\n \"0.57057315\",\n \"0.57057315\",\n \"0.57057315\",\n \"0.57057315\",\n \"0.56855667\",\n \"0.56825453\",\n \"0.5640067\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.56325287\",\n \"0.5575192\",\n \"0.5523022\",\n \"0.5523022\",\n \"0.5523022\",\n \"0.5523022\",\n \"0.5523022\",\n \"0.5523022\",\n \"0.5523022\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.5512539\",\n \"0.54465693\",\n \"0.54465693\",\n \"0.54465693\",\n \"0.54404366\",\n \"0.54404366\",\n \"0.5435471\",\n \"0.54341644\",\n \"0.54341644\",\n \"0.543048\",\n \"0.543048\",\n \"0.543048\",\n \"0.54229355\",\n \"0.5415838\",\n \"0.5415838\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.5399433\",\n \"0.53887117\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\",\n \"0.5387075\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80669,"cells":{"query":{"kind":"string","value":"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)."},"document":{"kind":"string","value":"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\n// get reset if `textContent` is mutated. We could add a check in setTextContent\n// to only set the value if/when the value differs from the node value (which would\n// completely solve this IE9 bug), but Sebastian+Sophie seemed to like this\n// solution. The value can be a boolean or object so that's why it's forced\n// to be a string.\nvar hostProps=_assign({},props,{value:undefined,defaultValue:undefined,children:toString(node._wrapperState.initialValue)});return hostProps;}"},"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":["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 }","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 }","set value(val) {\n const input = this.refs.myInput\n input.value = val\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}"],"string":"[\n \"set value(val) {\\n if (this.#el) this.#el.value = val;\\n else this.#value = val;\\n }\",\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 }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this._renderer.setProperty(this._elementRef.nativeElement, 'value', normalizedValue);\\n }\",\n \"setValue(value) {\\n ReactDOM.findDOMNode(this).value = value;\\n }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\n \"constructor(value, parentNode = null){\\n this.children = [];\\n this.value = value;\\n this.parent = parentNode;\\n }\",\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}\",\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 }\",\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 }\",\n \"setValue(value) {\\n //this.findDOMNode(this).value = value;\\n }\",\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 }\",\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 }\",\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}\",\n \"writeValue(value) {\\n const normalizedValue = value == null ? '' : value;\\n this.setProperty('value', normalizedValue);\\n }\",\n \"constructor(defaultValue) {\\n\\t\\tsuper(); \\n\\t\\tthis.defaultValue = defaultValue;\\n\\t}\",\n \"function value(val) { return control_1.default(val); }\",\n \"setValue(value) {\\n this.value = value;\\n }\",\n \"setValue(value, options = {}) {\\n return super.setValue(value, options);\\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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}\",\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 }\",\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 }\",\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 }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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 }\",\n \"set value(_value) {\\n this.setValue(_value);\\n }\",\n \"set value(value) {}\",\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 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}\",\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}\",\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);}\",\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 }\",\n \"set _textWhenEmpty(aValue) {\\n if (this._emptyTextNode) {\\n this._emptyTextNode.setAttribute(\\\"value\\\", aValue);\\n }\\n this._emptyTextValue = aValue;\\n this._showEmptyText();\\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\n \"set value(val) {\\n const input = this.refs.myInput\\n input.value = val\\n }\",\n \"renderValue(){\\n const thisWidget = this;\\n \\n thisWidget.dom.wrapper.innerHTML = thisWidget.correctvalue;\\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"function ConstantInputWidget(value) {\\n\\tWidget.apply(this);\\n\\tthis.behaviors.value = constant_b(value);\\n\\tthis.behaviors.inputElems = [];\\n\\tthis.dom = SPAN();\\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' &&\\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}\",\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}\",\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}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.64213157","0.5995463","0.59781355","0.59781355","0.59781355","0.59781355","0.59781355","0.59781355","0.59781355","0.5954646","0.5930495","0.5902076","0.588062","0.588062","0.588062","0.588062","0.588062","0.588062","0.588062","0.5823171","0.57667893","0.56788015","0.56788015","0.5673774","0.56212133","0.56118727","0.559969","0.5595349","0.5595123","0.5594345","0.5581201","0.5579534","0.5564653","0.5564653","0.5564653","0.5564653","0.55506825","0.5543594","0.55430865","0.5538494","0.55306435","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.5523078","0.55202335","0.550967","0.55065906","0.55040085","0.5472968","0.54601705","0.5454596","0.5448652","0.54392946","0.5433665","0.5433665","0.5433665","0.5433665","0.5433665","0.5433665","0.5433665","0.5433665","0.5433665","0.5432702","0.54229116","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5420084","0.5417257","0.541501","0.54115516","0.5407917","0.5407917"],"string":"[\n \"0.64213157\",\n \"0.5995463\",\n \"0.59781355\",\n \"0.59781355\",\n \"0.59781355\",\n \"0.59781355\",\n \"0.59781355\",\n \"0.59781355\",\n \"0.59781355\",\n \"0.5954646\",\n \"0.5930495\",\n \"0.5902076\",\n \"0.588062\",\n \"0.588062\",\n \"0.588062\",\n \"0.588062\",\n \"0.588062\",\n \"0.588062\",\n \"0.588062\",\n \"0.5823171\",\n \"0.57667893\",\n \"0.56788015\",\n \"0.56788015\",\n \"0.5673774\",\n \"0.56212133\",\n \"0.56118727\",\n \"0.559969\",\n \"0.5595349\",\n \"0.5595123\",\n \"0.5594345\",\n \"0.5581201\",\n \"0.5579534\",\n \"0.5564653\",\n \"0.5564653\",\n \"0.5564653\",\n \"0.5564653\",\n \"0.55506825\",\n \"0.5543594\",\n \"0.55430865\",\n \"0.5538494\",\n \"0.55306435\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.5523078\",\n \"0.55202335\",\n \"0.550967\",\n \"0.55065906\",\n \"0.55040085\",\n \"0.5472968\",\n \"0.54601705\",\n \"0.5454596\",\n \"0.5448652\",\n \"0.54392946\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5433665\",\n \"0.5432702\",\n \"0.54229116\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5420084\",\n \"0.5417257\",\n \"0.541501\",\n \"0.54115516\",\n \"0.5407917\",\n \"0.5407917\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80670,"cells":{"query":{"kind":"string","value":"Assumes there is no parent namespace."},"document":{"kind":"string","value":"function getIntrinsicNamespace(type){switch(type){case'svg':return SVG_NAMESPACE;case'math':return MATH_NAMESPACE;default:return HTML_NAMESPACE$1;}}"},"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 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 }"],"string":"[\n \"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}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n}\",\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 }\",\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}\",\n \"function SVGParent() {}\",\n \"function exitNamespace() {\\n namespaceStack.shift();\\n return fw.utils.currentNamespace();\\n}\",\n \"function ParentWithStatic() { }\",\n \"static isNamespace(structure) {\\r\\n return structure.kind === StructureKind_1.StructureKind.Namespace;\\r\\n }\",\n \"get namespace() {\\r var def = Utils.calculateHash(this.file).slice(0, 10);\\r return this.meta.getOrSet('namespace', def);\\r }\",\n \"function namespaceHTMLInternal() {\\n instructionState.lFrame.currentNamespace = null;\\n }\",\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 }\",\n \"isAtRootLevel() {\\n return this.namespaceAndFunctionDepth === 0;\\n }\",\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}\",\n \"function isNamespace(thing) {\\n return isObject(thing) && !!thing.__isNamespace;\\n}\",\n \"parentFunction(){\\n return \\\"This is coming from the parent!\\\";\\n }\",\n \"function Namespace(inheritedNamespace) { \\n function Namespace() {}; \\n Namespace.prototype = inheritedNamespace; \\n return new Namespace(); \\n}\",\n \"function Namespaces() {\\n this.nsByPfx = new Object();\\n this.pfxByNs = new Object();\\n this.index = 0;\\n}\",\n \"static GetParentBone() {}\",\n \"function enterNamespaceName(namespaceName) {\\n namespaceStack.unshift( namespaceName );\\n return fw.namespace( fw.utils.currentNamespaceName() );\\n}\",\n \"GetComponentsInParent() {}\",\n \"GetComponentsInParent() {}\",\n \"GetComponentsInParent() {}\",\n \"GetComponentsInParent() {}\",\n \"constructor() {\\n super(NameSpace);\\n }\",\n \"function TestRoot() {}\",\n \"namespace(source, importAs, importFrom) {\\n return ensureNamespaceImportPresent(source.getSourceFile(), importAs, importFrom, statementToAdd => source.addStatement(statementToAdd, true));\\n }\",\n \"getParent(){return this.__parent}\",\n \"isRoot () {\\r\\n return this.parent === null\\r\\n }\",\n \"function hasNamespace(node) {\\n const specifiers = node.specifiers.\\n filter(specifier => specifier.type === 'ImportNamespaceSpecifier');\\n return specifiers.length > 0;\\n}\",\n \"getBaseNamespace(text) {\\n const parts = text.split('.');\\n if (parts.length > 1) {\\n return parts[0];\\n }\\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}\",\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}\",\n \"isRoot() {\\nreturn this.parent === null;\\n}\",\n \"requireParent() {\\n return \\\"SCServer\\\";\\n }\",\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}\",\n \"function enterNamespace(namespace) {\\n namespaceStack.unshift( namespace.getName() );\\n return namespace;\\n}\",\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}\",\n \"static get localizeNamespaces() {}\",\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}\",\n \"addParent(node, parent) {\\n // implement by subclass\\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 }\",\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 }\",\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}\",\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 }\",\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}\",\n \"function _resyncParent() {\\n if (this.parentPath) {\\n this.parent = this.parentPath.node;\\n }\\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}\",\n \"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 }\",\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}\",\n \"function initNameSpace() {\\r\\n getTopStories();\\r\\n }\",\n \"getFirstChild() {}\",\n \"get parent () { return this._parent; }\",\n \"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}\",\n \"setParent(prnt) {\\nreturn this.parent = prnt;\\n}\",\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}\",\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}\",\n \"get ns() {\\n return this._ns;\\n }\",\n \"function SmalltalkRoot () {\\n }\",\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}\",\n \"function namespace__(){this.namespace_=( joo.MemberDeclaration.NAMESPACE_INTERNAL);}\",\n \"get parentName () {\\n\\t\\treturn Object.getPrototypeOf(this.constructor).name\\n\\t}\",\n \"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}\",\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}\",\n \"get namespace() {\\n return this._namespace\\n }\",\n \"function _resyncParent() {\\n\\t if (this.parentPath) {\\n\\t this.parent = this.parentPath.node;\\n\\t }\\n\\t}\",\n \"function _resyncParent() {\\n\\t if (this.parentPath) {\\n\\t this.parent = this.parentPath.node;\\n\\t }\\n\\t}\",\n \"getParent() {\\nreturn this.parent;\\n}\",\n \"function checkSubtree() {\\n \\n}\",\n \"GetComponentInParent() {}\",\n \"GetComponentInParent() {}\",\n \"GetComponentInParent() {}\",\n \"GetComponentInParent() {}\",\n \"function getFirstParentNative(tNode){var parent=tNode.parent;while(parent&&parent.type===5/* IcuContainer */){parent=parent.parent;}return parent;}\",\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;}\",\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;}\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\n \"static _getSpaceRoot(){\\n return process.cwd(); //path.dirname(module.parent.paths[0])\\n }\",\n \"constructor () {\\n this._isRoot = true;\\n }\",\n \"function it(e){e.parent=null,ae(e)}\",\n \"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 }\",\n \"initializing() {\\n this.getParentProject();\\n }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\n \"static getSymbolParent(symbol) {\\n return symbol.parent;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["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"],"string":"[\n \"0.59294087\",\n \"0.5788852\",\n \"0.5788852\",\n \"0.5788852\",\n \"0.5788852\",\n \"0.5788852\",\n \"0.5788852\",\n \"0.57438385\",\n \"0.56890935\",\n \"0.5673484\",\n \"0.56610936\",\n \"0.5640146\",\n \"0.5580239\",\n \"0.544239\",\n \"0.5442175\",\n \"0.5410278\",\n \"0.5397606\",\n \"0.53690296\",\n \"0.53592485\",\n \"0.5327534\",\n \"0.532705\",\n \"0.53229856\",\n \"0.53193605\",\n \"0.5313098\",\n \"0.5301471\",\n \"0.5295859\",\n \"0.5295859\",\n \"0.5295859\",\n \"0.5295859\",\n \"0.52877384\",\n \"0.52611893\",\n \"0.5261078\",\n \"0.52534926\",\n \"0.5248971\",\n \"0.52380115\",\n \"0.5237931\",\n \"0.52243704\",\n \"0.52243704\",\n \"0.52125657\",\n \"0.52120775\",\n \"0.5210552\",\n \"0.520527\",\n \"0.52020544\",\n \"0.5198533\",\n \"0.51924735\",\n \"0.51919633\",\n \"0.5177351\",\n \"0.5177351\",\n \"0.5165444\",\n \"0.5161359\",\n \"0.51606065\",\n \"0.5149667\",\n \"0.5135195\",\n \"0.51351124\",\n \"0.51234186\",\n \"0.51139593\",\n \"0.51106435\",\n \"0.51094973\",\n \"0.51002544\",\n \"0.50913143\",\n \"0.50814754\",\n \"0.50814754\",\n \"0.50765157\",\n \"0.50761247\",\n \"0.50760674\",\n \"0.506947\",\n \"0.5066843\",\n \"0.50630665\",\n \"0.5061734\",\n \"0.506166\",\n \"0.50544775\",\n \"0.50544775\",\n \"0.5048569\",\n \"0.5023388\",\n \"0.5022544\",\n \"0.5022544\",\n \"0.5022544\",\n \"0.5022544\",\n \"0.50127286\",\n \"0.4995106\",\n \"0.4995106\",\n \"0.4991204\",\n \"0.4991204\",\n \"0.4991204\",\n \"0.4991204\",\n \"0.4991204\",\n \"0.4991204\",\n \"0.4990565\",\n \"0.49904794\",\n \"0.4982848\",\n \"0.4979333\",\n \"0.4978937\",\n \"0.49788004\",\n \"0.4974179\",\n \"0.497409\",\n \"0.497409\",\n \"0.497409\",\n \"0.497409\",\n \"0.497409\",\n \"0.497409\",\n \"0.4973739\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80671,"cells":{"query":{"kind":"string","value":"Hyphenates a camelcased CSS property name, for example: > hyphenateStyleName('backgroundColor') hyphenateStyleName('MozTransition') hyphenateStyleName('msTransition') < \"mstransition\" As Modernizr suggests ( an `ms` prefix is converted to `ms`."},"document":{"kind":"string","value":"function hyphenateStyleName(name){return name.replace(uppercasePattern,'-$1').toLowerCase().replace(msPattern,'-ms-');}"},"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 hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}","function hyphenateStyleName(name) {\n return name\n .replace(uppercasePattern, '-$1')\n .toLowerCase()\n .replace(msPattern, '-ms-');\n }"],"string":"[\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\\n}\",\n \"function hyphenateStyleName(name) {\\n return name\\n .replace(uppercasePattern, '-$1')\\n .toLowerCase()\\n .replace(msPattern, '-ms-');\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.7950004","0.79490614"],"string":"[\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.7950004\",\n \"0.79490614\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8186882"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":80672,"cells":{"query":{"kind":"string","value":"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."},"document":{"kind":"string","value":"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;}}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["static 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 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 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 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 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 getStyleProps(injector) {\n return {\n id: STYLE_ELEMENT_ID,\n nonce: injector.nonce,\n textContent: injector.ruleTexts.join(\"\")\n };\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 _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 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 }","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 css$get$0() {\n if ( !this.cssCached ) this.stringify();\n return this.cssCached;\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;}}","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}","static get styles() {\n return \"\";\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 }","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 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 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\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 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 }"],"string":"[\n \"static get styles () {\\n return css`${unsafeCSS(style)}`\\n }\",\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 }\",\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 }\",\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}\",\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}\",\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}\",\n \"function evaluateStyleRule(styleProperty_)\\n{\\n\\treturn styleProperty_.name + \\\": \\\" + styleProperty_.value;\\n}\",\n \"function getCSSStyle(key, value) {\\n if(value && value.value) {\\n return key + \\\": \\\" + value.value +\\\";\\\";\\n }\\n else\\n return \\\"\\\";\\n }\",\n \"function cssToStr(cssProps){var statements=[];$.each(cssProps,function(name,val){if(val!=null){statements.push(name+':'+val);}});return statements.join(';');}\",\n \"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 }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"function getStyleProps(injector) {\\n return {\\n id: STYLE_ELEMENT_ID,\\n nonce: injector.nonce,\\n textContent: injector.ruleTexts.join(\\\"\\\")\\n };\\n}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"renderCssStyle() {\\n this.cssStyle = [\\n // `width: ${parseFloat(this.width) != this.width ? this.width : this.width + 'px'};`\\n ].join(' ');\\n }\",\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 }\",\n \"function css$get$0() {\\n if ( !this.cssCached ) this.stringify();\\n return this.cssCached;\\n }\",\n \"function stringifyProperties(properties) {\\n\\t return properties.map(function (p) { return styleToString(p[0], p[1]); }).join(';');\\n\\t}\",\n \"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 }\",\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 }\",\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 }\",\n \"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}\",\n \"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 }\",\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 }\",\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 }\",\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}\",\n \"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';}\",\n \"_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 }\",\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}\",\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 }\",\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 }\",\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}\",\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}\",\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}\",\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;}}\",\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;}}\",\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;}}\",\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;}}\",\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;}}\",\n \"getCssString() {\\n const text = fs.readFileSync(\\\"./src/hero.css\\\", 'utf8');\\n return (text.replace(/\\\\s+/g, ' '));\\n }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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 }\",\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}\",\n \"static get styles() {\\n return \\\"\\\";\\n }\",\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 }\",\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 }\",\n \"get styleStaticText() { return Object.assign({}, this.style.common); }\",\n \"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}\",\n \"function s(e){return getComputedStyle(e)}\",\n \"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('; ');}\",\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) result += key + ': ' + value + ';';\\n\\t\\t}\\n\\t});\\n\\treturn result;\\n}\",\n \"get styleMsg() { return Object.assign({}, this.style.msg); }\",\n \"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 }\",\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}\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6746066","0.6613922","0.6602744","0.6524541","0.6524541","0.6438197","0.6406999","0.63668555","0.62984747","0.6197879","0.6182385","0.6169909","0.61696804","0.61696804","0.61656594","0.61147296","0.60756344","0.60756344","0.60755336","0.60755336","0.60755336","0.60755336","0.6072733","0.60725766","0.6072488","0.60634124","0.6061033","0.6061033","0.6061033","0.6061033","0.60405844","0.60405844","0.6035424","0.5980971","0.59805703","0.59749323","0.5970161","0.59677553","0.5947411","0.5938178","0.59380126","0.5920499","0.59164137","0.5912556","0.5902871","0.5901565","0.5895141","0.5893317","0.58651316","0.585937","0.5848281","0.5848281","0.5845586","0.5845586","0.5845586","0.5845586","0.5845586","0.5829469","0.5827615","0.5827615","0.5827615","0.5827615","0.5827615","0.5827615","0.5827615","0.5827615","0.5823202","0.5815866","0.58112156","0.580478","0.5802561","0.58005714","0.57917386","0.5787905","0.5787248","0.57808846","0.57797396","0.5736355","0.57236403","0.57202506","0.5717578","0.5715881","0.5714579","0.5714579","0.5714579","0.5714579","0.5714579","0.5714579","0.5714579","0.5714579","0.5714579","0.5714579","0.5714222","0.5714222"],"string":"[\n \"0.6746066\",\n \"0.6613922\",\n \"0.6602744\",\n \"0.6524541\",\n \"0.6524541\",\n \"0.6438197\",\n \"0.6406999\",\n \"0.63668555\",\n \"0.62984747\",\n \"0.6197879\",\n \"0.6182385\",\n \"0.6169909\",\n \"0.61696804\",\n \"0.61696804\",\n \"0.61656594\",\n \"0.61147296\",\n \"0.60756344\",\n \"0.60756344\",\n \"0.60755336\",\n \"0.60755336\",\n \"0.60755336\",\n \"0.60755336\",\n \"0.6072733\",\n \"0.60725766\",\n \"0.6072488\",\n \"0.60634124\",\n \"0.6061033\",\n \"0.6061033\",\n \"0.6061033\",\n \"0.6061033\",\n \"0.60405844\",\n \"0.60405844\",\n \"0.6035424\",\n \"0.5980971\",\n \"0.59805703\",\n \"0.59749323\",\n \"0.5970161\",\n \"0.59677553\",\n \"0.5947411\",\n \"0.5938178\",\n \"0.59380126\",\n \"0.5920499\",\n \"0.59164137\",\n \"0.5912556\",\n \"0.5902871\",\n \"0.5901565\",\n \"0.5895141\",\n \"0.5893317\",\n \"0.58651316\",\n \"0.585937\",\n \"0.5848281\",\n \"0.5848281\",\n \"0.5845586\",\n \"0.5845586\",\n \"0.5845586\",\n \"0.5845586\",\n \"0.5845586\",\n \"0.5829469\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5827615\",\n \"0.5823202\",\n \"0.5815866\",\n \"0.58112156\",\n \"0.580478\",\n \"0.5802561\",\n \"0.58005714\",\n \"0.57917386\",\n \"0.5787905\",\n \"0.5787248\",\n \"0.57808846\",\n \"0.57797396\",\n \"0.5736355\",\n \"0.57236403\",\n \"0.57202506\",\n \"0.5717578\",\n \"0.5715881\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714579\",\n \"0.5714222\",\n \"0.5714222\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5843909"},"document_rank":{"kind":"string","value":"62"}}},{"rowIdx":80673,"cells":{"query":{"kind":"string","value":"Renderers that don't support persistence can reexport everything from this module."},"document":{"kind":"string","value":"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)"},"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 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 }","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)","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)","export() {\n\t\treturn {}\n\t}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}","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}"],"string":"[\n \"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)\",\n \"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)\",\n \"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)\",\n \"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)\",\n \"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)\",\n \"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)\",\n \"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)\",\n \"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 }\",\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 } // Persistence (when unsupported)\",\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}\",\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} // Persistence (when unsupported)\",\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} // Persistence (when unsupported)\",\n \"export() {\\n\\t\\treturn {}\\n\\t}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\n \"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}\",\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}\",\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}\",\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}\",\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}\",\n \"function ExportSave() {\\n Gameboy.Core.exportSave();\\n}\",\n \"function saveAndRender() {\\n save();\\n render();\\n}\",\n \"function saveLocalAndRender() {\\n localStorage.setItem(\\\"myLib\\\", JSON.stringify(myLibrary));\\n render(myLibrary);\\n}\",\n \"function render() {\\n renderRegistry();\\n renderDirectory();\\n renderOverride();\\n}\",\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 }\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\n\\t for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n\\t}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\n \"function __export(m) {\\r\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\r\\n}\",\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}\",\n \"function ExportReportData() {\\n BindOrReloadPurchaseTable('Export');\\n}\",\n \"function Renderer() {}\",\n \"flush()\\n {\\n this.setObjectRenderer(this.emptyRenderer);\\n }\",\n \"function saveNameToExportMap(index,def,exportsMap){if(exportsMap){if(def.exportAs)exportsMap[def.exportAs]=index;if(def.template)exportsMap['']=index;}}\",\n \"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 }\",\n \"function saveStorage() {\\n store.set(planner.list.modules, modules.toJSON());\\n }\",\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 }\",\n \"function Render() {\\n ClearScreen();\\n RenderEnergeticDroplets();\\n ResetRenderingConditions();\\n}\",\n \"afterRender() { }\",\n \"afterRender() { }\",\n \"function RendererType2(){}\",\n \"processPresenter() {\\n this.exportDict = this.getExportDict()\\n }\",\n \"function __export(m) {\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n}\",\n \"function __export(m) {\\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6056067","0.6056067","0.6056067","0.6020133","0.6020133","0.6020133","0.6020133","0.58904916","0.5828549","0.5826907","0.5709882","0.5709882","0.5657355","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.5584319","0.54288846","0.54288846","0.54220927","0.54220927","0.5390982","0.5349935","0.53008","0.5276268","0.52738345","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5163965","0.5135322","0.5135322","0.5135322","0.5135322","0.5135322","0.5135322","0.5135322","0.5135322","0.5132846","0.512681","0.512119","0.51100695","0.51062113","0.5104607","0.50995344","0.50957406","0.50900245","0.50860196","0.50860196","0.5083","0.5077835","0.50763386","0.50763386"],"string":"[\n \"0.6056067\",\n \"0.6056067\",\n \"0.6056067\",\n \"0.6020133\",\n \"0.6020133\",\n \"0.6020133\",\n \"0.6020133\",\n \"0.58904916\",\n \"0.5828549\",\n \"0.5826907\",\n \"0.5709882\",\n \"0.5709882\",\n \"0.5657355\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.5584319\",\n \"0.54288846\",\n \"0.54288846\",\n \"0.54220927\",\n \"0.54220927\",\n \"0.5390982\",\n \"0.5349935\",\n \"0.53008\",\n \"0.5276268\",\n \"0.52738345\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5163965\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5135322\",\n \"0.5132846\",\n \"0.512681\",\n \"0.512119\",\n \"0.51100695\",\n \"0.51062113\",\n \"0.5104607\",\n \"0.50995344\",\n \"0.50957406\",\n \"0.50900245\",\n \"0.50860196\",\n \"0.50860196\",\n \"0.5083\",\n \"0.5077835\",\n \"0.50763386\",\n \"0.50763386\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.62715775"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":80674,"cells":{"query":{"kind":"string","value":"1 unit of expiration time represents 10ms."},"document":{"kind":"string","value":"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);}"},"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 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) {\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 (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}","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}","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}","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 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}"],"string":"[\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) {\\n // 加上偏移量以避免10ms以内的与NoWork冲突\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\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 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\\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 getExpirationInSeconds () {\\n const nowInSeconds = Math.floor(Date.now() / 1000)\\n\\n return {\\n iat: nowInSeconds,\\n exp: nowInSeconds + 30\\n }\\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 calculateExpire() {\\n var expiresIn = Math.round((((messageObject.expiresOn-new Date(Date.now())) % 86400000) % 3600000) / 60000); // minutes\\n console.log(expiresIn);\\n return expiresIn\\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 \"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 \"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 \"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 MAGIC_NUMBER_OFFSET - (ms / UNIT_SIZE | 0);\\n }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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 }\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.69083685","0.69083685","0.69083685","0.69083685","0.6728504","0.66832036","0.66832036","0.66832036","0.6663674","0.66431606","0.66385615","0.65983444","0.65983444","0.65983444","0.6567885","0.65556103","0.65173113","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","0.6494671","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"],"string":"[\n \"0.69083685\",\n \"0.69083685\",\n \"0.69083685\",\n \"0.69083685\",\n \"0.6728504\",\n \"0.66832036\",\n \"0.66832036\",\n \"0.66832036\",\n \"0.6663674\",\n \"0.66431606\",\n \"0.66385615\",\n \"0.65983444\",\n \"0.65983444\",\n \"0.65983444\",\n \"0.6567885\",\n \"0.65556103\",\n \"0.65173113\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.6494671\",\n \"0.64938873\",\n \"0.64938873\",\n \"0.64938873\",\n \"0.64938873\",\n \"0.6479297\",\n \"0.6379728\",\n \"0.6379728\",\n \"0.6379728\",\n \"0.6379728\",\n \"0.6379728\",\n \"0.6379728\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\",\n \"0.63776934\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.68177795"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":80675,"cells":{"query":{"kind":"string","value":"The following attributes are only used by interaction tracing builds. They enable interactions to be associated with their async work, And expose interaction metadata to the React DevTools Profiler plugin. Note that these attributes are only defined when the enableSchedulerTracing flag is enabled. Exported FiberRoot type includes all properties, To avoid requiring potentially errorprone :any casts throughout the project. Profiling properties are only safe to access in profiling builds (when enableSchedulerTracing is true). The types are defined separately within this file to ensure they stay in sync. (We don't have to use an inline :any cast when enableSchedulerTracing is disabled.)"},"document":{"kind":"string","value":"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;}"},"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 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;{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$1.unstable_getThreadID(),memoizedInteractions:new Set(),pendingInteractionMap:new Map()};}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, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracking) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracking.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // The reason for the way the Flow types are structured in this file,\n // Is to avoid needing :any casts everywhere interaction tracking fields are used.\n // Unfortunately that requires an :any cast for non-interaction tracking capable builds.\n // $FlowFixMe Remove this :any cast and replace it with something better.\n return root;\n}","function createFiberRoot(containerInfo, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracking) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracking.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // The reason for the way the Flow types are structured in this file,\n // Is to avoid needing :any casts everywhere interaction tracking fields are used.\n // Unfortunately that requires an :any cast for non-interaction tracking capable builds.\n // $FlowFixMe Remove this :any cast and replace it with something better.\n return root;\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}","function createFiberRoot(containerInfo, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isAsync, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isAsync);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\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.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.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}","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}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing$$1.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function $__jsx_profiler() {\n}","_debugInfo() {\n var attributes = ['id'];\n var relationships = {};\n var expensiveProperties = [];\n\n this.eachAttribute((name, meta) => attributes.push(name));\n\n var groups = [{\n name: 'Attributes',\n properties: attributes,\n expand: true\n }];\n\n this.eachRelationship((name, relationship) => {\n var properties = relationships[relationship.kind];\n\n if (properties === undefined) {\n properties = relationships[relationship.kind] = [];\n groups.push({\n name: relationship.name,\n properties,\n expand: true\n });\n }\n properties.push(name);\n expensiveProperties.push(name);\n });\n\n groups.push({\n name: 'Flags',\n properties: ['isLoaded', 'hasDirtyAttributes', 'isSaving', 'isDeleted', 'isError', 'isNew', 'isValid']\n });\n\n return {\n propertyInfo: {\n // include all other mixins / properties (not just the grouped ones)\n includeOtherProperties: true,\n groups: groups,\n // don't pre-calculate unless cached\n expensiveProperties: expensiveProperties\n }\n };\n }","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n pingCache: null,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n pingCache: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\n}","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n\n var root = void 0;\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n\n didError: false,\n\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n uninitializedFiber.stateNode = root;\n\n // 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.\n return root;\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}","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}","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}","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}","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}","static get properties() {\n return {\n eventMap: {},\n resourceMap: {},\n releasedElements: {},\n toDrawOnProjectRefresh: new Set()\n };\n }","constructor() {\n this.startTime = Date.now();\n this.attributes = {\n \"version\": 0.5, \n \"lang\": \"node.js\",\n \"startTime\": this.startTime\n };\n\n this.inspectedCPU = false;\n this.inspectedMemory = false;\n this.inspectedContainer = false;\n this.inspectedPlatform = false;\n this.inspectedLinux = false;\n }","inspectAll() {\n this.inspectContainer();\n this.inspectPlatform();\n this.inspectLinux();\n this.inspectMemory();\n this.inspectCPU();\n this.addTimeStamp('frameworkRuntime');\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.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}","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.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}","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.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}","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.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}","static get properties() {\n return {\n eventMap: {},\n resourceMap: {},\n releasedElements: {}\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, 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 }","static get properties() {\n return {\n label: { type: String },\n value: { type: String },\n disabled: { type: Boolean, reflect: true },\n elevation: { type: Number },\n active: { type: Boolean, reflect: true },\n comingSoon: { type: Boolean, reflect: true, attribute: \"coming-soon\" },\n };\n }","inspectAllDeltas() {\n\n // Add 'userRuntime' timestamp.\n if (\"frameworkRuntime\" in this.attributes) {\n this.addTimeStamp('userRuntime', this.startTime + this.attributes['frameworkRuntime']);\n }\n\n let deltaTime = Date.now();\n this.inspectCPUDelta();\n this.inspectMemoryDelta();\n this.addTimeStamp(\"frameworkRuntimeDeltas\", deltaTime);\n }","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n var root = void 0;\n\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n pingCache: null,\n didError: false,\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n pingCache: null,\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n didError: false,\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n 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.\n\n return root;\n }","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n var root = void 0;\n\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n pingCache: null,\n didError: false,\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n pingCache: null,\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n didError: false,\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n 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.\n\n return root;\n }","function createFiberRoot(containerInfo, isConcurrent, hydrate) {\n // Cyclic construction. This cheats the type system right now because\n // stateNode is any.\n var uninitializedFiber = createHostRootFiber(isConcurrent);\n var root = void 0;\n\n if (enableSchedulerTracing) {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n pingCache: null,\n didError: false,\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null,\n interactionThreadID: tracing.unstable_getThreadID(),\n memoizedInteractions: new Set(),\n pendingInteractionMap: new Map()\n };\n } else {\n root = {\n current: uninitializedFiber,\n containerInfo: containerInfo,\n pendingChildren: null,\n pingCache: null,\n earliestPendingTime: NoWork,\n latestPendingTime: NoWork,\n earliestSuspendedTime: NoWork,\n latestSuspendedTime: NoWork,\n latestPingedTime: NoWork,\n didError: false,\n pendingCommitExpirationTime: NoWork,\n finishedWork: null,\n timeoutHandle: noTimeout,\n context: null,\n pendingContext: null,\n hydrate: hydrate,\n nextExpirationTimeToWorkOn: NoWork,\n expirationTime: NoWork,\n firstBatch: null,\n nextScheduledRoot: null\n };\n }\n\n 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.\n\n return root;\n }","function harness() {\n return (\n <div>\n <p>{'Each example below will trigger an event which can be verified by opening the dev tools and viewing the message logged to the console.'}</p>\n <h3>{'Icon Key'}</h3>\n <dl className=\"harness-dl\">\n <dt className=\"harness-dt\">\n <svg className=\"text-success\" width=\"24\" height=\"24\" viewBox=\"0 0 24 24\" fill=\"none\" strokeLinecap=\"square\" strokeMiterlimit=\"10\" xmlns=\"http://www.w3.org/2000/svg\">\n <use xmlnsXlink=\"http://www.w3.org/1999/xlink\" xlinkHref=\"#success\"/>\n </svg>\n </dt>\n <dd className=\"harness-dd\">\n {'Successfully triggered event with expected configuration.'}\n </dd>\n <dt className=\"harness-dt\">\n <svg className=\"text-danger\" width=\"24\" height=\"24\" viewBox=\"0 0 24 24\" fill=\"none\" strokeLinecap=\"square\" strokeMiterlimit=\"10\" xmlns=\"http://www.w3.org/2000/svg\">\n <use xmlnsXlink=\"http://www.w3.org/1999/xlink\" xlinkHref=\"#error\"/>\n </svg>\n </dt>\n <dd className=\"harness-dd\">\n {'Expected event did not trigger with the expected configuration.'}\n </dd>\n </dl>\n <h1>{'TrackingProvider and TrackingContext contextType'}</h1>\n <p>{'All these events have been setup to trigger on mount but can be manually triggered by clicking the related button.'}</p>\n <h2>{'Provider with no payload or options.'}</h2>\n <TrackingChecker expected={{\n event: 'generic.click',\n payload: {},\n options: {}}}\n >\n <EventButton label={'Generate generic.click'} />\n </TrackingChecker>\n\n <h2>{'Provider with payload and no options.'}</h2>\n <TrackingChecker payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'harness'\n }} expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'left',\n eventcategory: 'harness'\n },\n options: {}}}\n >\n <EventButton label={'Generate generic.click'} />\n </TrackingChecker>\n\n <h2>{'Nested Provider with payload and no options.'}</h2>\n <TrackingProvider payload={{'actionlocation': 'top'}}>\n <TrackingChecker\n payload={{'eventcategory': 'harness'}}\n expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'top',\n eventcategory: 'harness'\n },\n options: {}}}\n >\n <EventButton label={'Generate generic.click'} />\n </TrackingChecker>\n </TrackingProvider>\n\n <h2>{'Nested Provider with field overrides and no options.'}</h2>\n <TrackingProvider payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'junk'}}\n >\n <TrackingChecker\n payload={{\n 'actionlocation': 'top',\n 'eventcategory': 'harness'}}\n expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'top',\n eventcategory: 'harness'\n },\n options: {}}}\n >\n <EventButton label={'Generate generic.click'}/>\n </TrackingChecker>\n </TrackingProvider>\n\n <h2>{'Provider with payload and eventPayload with no options.'}</h2>\n <TrackingChecker\n payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'harness'\n }} eventPayload={{\n 'generic.click': {\n 'eventlabel': 'custom'\n },\n 'ignore.event': {\n 'display': 'no it should not'\n }\n }}\n expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'left',\n eventcategory: 'harness',\n eventlabel: 'custom'\n },\n options: {}}}\n >\n <EventButton label={'Generate generic.click'}/>\n </TrackingChecker>\n\n <h2>{'Nested Provider with payload and eventPayload with no options.'}</h2>\n <TrackingProvider\n payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'harness',\n 'eventvalue': 'a value'\n }} eventPayload={{\n 'generic.click': {\n 'eventlabel': 'skip',\n 'highfrequency': 'false'\n },\n 'ignore.event': {\n 'display': 'no it should not'\n }\n }}\n >\n <TrackingChecker\n payload={{\n 'actionlocation': 'top',\n 'eventcategory': 'test'\n }}\n eventPayload={{\n 'generic.click': {\n 'eventlabel': 'custom'\n }\n }}\n expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'top',\n eventcategory: 'test',\n eventvalue: 'a value',\n eventlabel: 'custom',\n highfrequency: 'false'\n },\n options: {}}}\n >\n <EventButton label={'Generate generic.click'}/>\n </TrackingChecker>\n </TrackingProvider>\n\n <h2>{'Nested Provider with payload, eventPayload, options and eventOptions.'}</h2>\n <TrackingProvider payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'harness',\n 'eventvalue': 'a value'\n }} eventPayload={{\n 'generic.click': {\n 'eventlabel': 'skip',\n 'highfrequency': 'false'\n },\n 'ignore.event': {\n 'display': 'no it should not'\n }\n }} eventOptions={{\n 'generic.click': {\n 'delayProcessing': '100'\n }\n }} options={{\n 'delayProcessing': '200'\n }}\n >\n <TrackingChecker\n payload={{\n 'actionlocation': 'top',\n 'eventcategory': 'test'\n }}\n eventPayload={{\n 'generic.click': {\n 'eventlabel': 'custom'\n }\n }}\n eventOptions={{\n 'generic.click': {\n 'maxWaitTime': '300'\n }\n }}\n options={{\n 'maxWaitTime': '400'\n }}\n expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'top',\n eventcategory: 'test',\n eventvalue: 'a value',\n eventlabel: 'custom',\n highfrequency: 'false'\n },\n options: {\n delayProcessing: '100',\n maxWaitTime: '300'\n }}}\n >\n <EventButton label={'Generate generic.click'}/>\n </TrackingChecker>\n </TrackingProvider>\n\n <h2>{'Provider with component consuming multiple contexts with one of them being contextType.'}</h2>\n <TrackingChecker\n payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'harness'\n }}\n expected={{\n event: 'generic.click',\n payload: {\n actionlocation: 'left',\n eventcategory: 'harness'\n },\n options: {}}}\n >\n <SecondContextChecker\n value={SECONDCONTEXT}\n expected={SECONDCONTEXT}\n >\n <EventButtonMultipleContext label={'Generate generic.click'}/>\n </SecondContextChecker>\n </TrackingChecker>\n\n <h1>{'TrackingTrigger'}</h1>\n\n <h2>{'Trigger with no payload or options.'}</h2>\n <TrackingChecker\n expected={{\n event: 'generic.click',\n payload: {},\n options: {}}}\n >\n <TrackingTrigger event={'generic.click'}/>\n <span>{'generic.click'}</span>\n </TrackingChecker>\n\n <h2>{'Trigger with payload and options for TrackingTrigger.'}</h2>\n <TrackingChecker\n expected={{\n event: 'generic.click',\n payload: {\n 'actionlocation': 'top',\n 'eventcategory': 'test'\n },\n options: {\n 'delayProcessing': '200'\n }}}\n >\n <TrackingTrigger event={'generic.click'}\n payload={{\n 'actionlocation': 'top',\n 'eventcategory': 'test'\n }}\n options={{\n 'delayProcessing': '200'\n }}\n />\n <span>{'generic.click'}</span>\n </TrackingChecker>\n\n <h2>{'Trigger with payload and options for TrackingTrigger and TrackingProvider with payload and options.'}</h2>\n <TrackingChecker\n payload={{\n 'actionlocation': 'left',\n 'eventcategory': 'harness',\n 'eventvalue': 'a value'\n }}\n eventPayload={{\n 'generic.click': {\n 'eventlabel': 'skip',\n 'highfrequency': 'false'\n },\n 'ignore.event': {\n 'display': 'no it should not'\n }\n }}\n eventOptions={{\n 'generic.click': {\n 'delayProcessing': '100',\n 'maxWaitTime': '500'\n }\n }}\n options={{\n 'delayProcessing': '200'\n }}\n expected={{\n event: 'generic.click',\n payload: {\n 'actionlocation': 'top',\n 'eventcategory': 'test',\n 'eventvalue': 'a value',\n 'eventlabel': 'skip',\n 'highfrequency': 'false'\n },\n options: {\n 'delayProcessing': '300',\n 'maxWaitTime': '500'\n }}}\n >\n <TrackingTrigger event={'generic.click'}\n payload={{\n 'actionlocation': 'top',\n 'eventcategory': 'test'\n }}\n options={{\n 'delayProcessing': '300'\n }}\n />\n <span>{'generic.click'}</span>\n </TrackingChecker>\n\n <h2>{'Trigger with no provider should not cause hard failure.'}</h2>\n <TrackingTrigger event={'generic.click'}\n payload={{\n 'actionlocation': 'top',\n 'eventcategory': 'test'\n }}\n options={{\n 'delayProcessing': '200'\n }}\n />\n </div>\n );\n}","function FluiContext() {\n var events = [];\n \n this._listeners = function (event) {\n if (events[event] === undefined) {\n events[event] = [];\n }\n\n return events[event];\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 }","static get observedAttributes() {\n return ['data'];\n }","static describe(): any {\n return merge(super.describe(), {\n NativeProps: {\n pointerEvents: 'string',\n hitSlop: 'number',\n cursorVisibilitySlop: 'number',\n billboarding: 'string',\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, 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 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.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 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.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 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.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 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.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 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.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 target._debugID = source._debugID;\n target._debugSource = source._debugSource;\n target._debugOwner = source._debugOwner;\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\n return target;\n}"],"string":"[\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;{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$1.unstable_getThreadID(),memoizedInteractions:new Set(),pendingInteractionMap:new Map()};}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;}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracking) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracking.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // The reason for the way the Flow types are structured in this file,\\n // Is to avoid needing :any casts everywhere interaction tracking fields are used.\\n // Unfortunately that requires an :any cast for non-interaction tracking capable builds.\\n // $FlowFixMe Remove this :any cast and replace it with something better.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracking) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracking.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // The reason for the way the Flow types are structured in this file,\\n // Is to avoid needing :any casts everywhere interaction tracking fields are used.\\n // Unfortunately that requires an :any cast for non-interaction tracking capable builds.\\n // $FlowFixMe Remove this :any cast and replace it with something better.\\n return root;\\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}\",\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}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isAsync, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isAsync);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\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, 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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\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}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing$$1.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function $__jsx_profiler() {\\n}\",\n \"_debugInfo() {\\n var attributes = ['id'];\\n var relationships = {};\\n var expensiveProperties = [];\\n\\n this.eachAttribute((name, meta) => attributes.push(name));\\n\\n var groups = [{\\n name: 'Attributes',\\n properties: attributes,\\n expand: true\\n }];\\n\\n this.eachRelationship((name, relationship) => {\\n var properties = relationships[relationship.kind];\\n\\n if (properties === undefined) {\\n properties = relationships[relationship.kind] = [];\\n groups.push({\\n name: relationship.name,\\n properties,\\n expand: true\\n });\\n }\\n properties.push(name);\\n expensiveProperties.push(name);\\n });\\n\\n groups.push({\\n name: 'Flags',\\n properties: ['isLoaded', 'hasDirtyAttributes', 'isSaving', 'isDeleted', 'isError', 'isNew', 'isValid']\\n });\\n\\n return {\\n propertyInfo: {\\n // include all other mixins / properties (not just the grouped ones)\\n includeOtherProperties: true,\\n groups: groups,\\n // don't pre-calculate unless cached\\n expensiveProperties: expensiveProperties\\n }\\n };\\n }\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n pingCache: null,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n pingCache: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\n}\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n\\n var root = void 0;\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n\\n didError: false,\\n\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n uninitializedFiber.stateNode = root;\\n\\n // 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.\\n return root;\\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, 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}\",\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}\",\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}\",\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}\",\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}\",\n \"static get properties() {\\n return {\\n eventMap: {},\\n resourceMap: {},\\n releasedElements: {},\\n toDrawOnProjectRefresh: new Set()\\n };\\n }\",\n \"constructor() {\\n this.startTime = Date.now();\\n this.attributes = {\\n \\\"version\\\": 0.5, \\n \\\"lang\\\": \\\"node.js\\\",\\n \\\"startTime\\\": this.startTime\\n };\\n\\n this.inspectedCPU = false;\\n this.inspectedMemory = false;\\n this.inspectedContainer = false;\\n this.inspectedPlatform = false;\\n this.inspectedLinux = false;\\n }\",\n \"inspectAll() {\\n this.inspectContainer();\\n this.inspectPlatform();\\n this.inspectLinux();\\n this.inspectMemory();\\n this.inspectCPU();\\n this.addTimeStamp('frameworkRuntime');\\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, 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.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}\",\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.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}\",\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.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}\",\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.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}\",\n \"static get properties() {\\n return {\\n eventMap: {},\\n resourceMap: {},\\n releasedElements: {}\\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, 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 }\",\n \"static get properties() {\\n return {\\n label: { type: String },\\n value: { type: String },\\n disabled: { type: Boolean, reflect: true },\\n elevation: { type: Number },\\n active: { type: Boolean, reflect: true },\\n comingSoon: { type: Boolean, reflect: true, attribute: \\\"coming-soon\\\" },\\n };\\n }\",\n \"inspectAllDeltas() {\\n\\n // Add 'userRuntime' timestamp.\\n if (\\\"frameworkRuntime\\\" in this.attributes) {\\n this.addTimeStamp('userRuntime', this.startTime + this.attributes['frameworkRuntime']);\\n }\\n\\n let deltaTime = Date.now();\\n this.inspectCPUDelta();\\n this.inspectMemoryDelta();\\n this.addTimeStamp(\\\"frameworkRuntimeDeltas\\\", deltaTime);\\n }\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n var root = void 0;\\n\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n pingCache: null,\\n didError: false,\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n pingCache: null,\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n didError: false,\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n 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.\\n\\n return root;\\n }\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n var root = void 0;\\n\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n pingCache: null,\\n didError: false,\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n pingCache: null,\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n didError: false,\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n 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.\\n\\n return root;\\n }\",\n \"function createFiberRoot(containerInfo, isConcurrent, hydrate) {\\n // Cyclic construction. This cheats the type system right now because\\n // stateNode is any.\\n var uninitializedFiber = createHostRootFiber(isConcurrent);\\n var root = void 0;\\n\\n if (enableSchedulerTracing) {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n pingCache: null,\\n didError: false,\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null,\\n interactionThreadID: tracing.unstable_getThreadID(),\\n memoizedInteractions: new Set(),\\n pendingInteractionMap: new Map()\\n };\\n } else {\\n root = {\\n current: uninitializedFiber,\\n containerInfo: containerInfo,\\n pendingChildren: null,\\n pingCache: null,\\n earliestPendingTime: NoWork,\\n latestPendingTime: NoWork,\\n earliestSuspendedTime: NoWork,\\n latestSuspendedTime: NoWork,\\n latestPingedTime: NoWork,\\n didError: false,\\n pendingCommitExpirationTime: NoWork,\\n finishedWork: null,\\n timeoutHandle: noTimeout,\\n context: null,\\n pendingContext: null,\\n hydrate: hydrate,\\n nextExpirationTimeToWorkOn: NoWork,\\n expirationTime: NoWork,\\n firstBatch: null,\\n nextScheduledRoot: null\\n };\\n }\\n\\n 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.\\n\\n return root;\\n }\",\n \"function harness() {\\n return (\\n <div>\\n <p>{'Each example below will trigger an event which can be verified by opening the dev tools and viewing the message logged to the console.'}</p>\\n <h3>{'Icon Key'}</h3>\\n <dl className=\\\"harness-dl\\\">\\n <dt className=\\\"harness-dt\\\">\\n <svg className=\\\"text-success\\\" width=\\\"24\\\" height=\\\"24\\\" viewBox=\\\"0 0 24 24\\\" fill=\\\"none\\\" strokeLinecap=\\\"square\\\" strokeMiterlimit=\\\"10\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\\n <use xmlnsXlink=\\\"http://www.w3.org/1999/xlink\\\" xlinkHref=\\\"#success\\\"/>\\n </svg>\\n </dt>\\n <dd className=\\\"harness-dd\\\">\\n {'Successfully triggered event with expected configuration.'}\\n </dd>\\n <dt className=\\\"harness-dt\\\">\\n <svg className=\\\"text-danger\\\" width=\\\"24\\\" height=\\\"24\\\" viewBox=\\\"0 0 24 24\\\" fill=\\\"none\\\" strokeLinecap=\\\"square\\\" strokeMiterlimit=\\\"10\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\\n <use xmlnsXlink=\\\"http://www.w3.org/1999/xlink\\\" xlinkHref=\\\"#error\\\"/>\\n </svg>\\n </dt>\\n <dd className=\\\"harness-dd\\\">\\n {'Expected event did not trigger with the expected configuration.'}\\n </dd>\\n </dl>\\n <h1>{'TrackingProvider and TrackingContext contextType'}</h1>\\n <p>{'All these events have been setup to trigger on mount but can be manually triggered by clicking the related button.'}</p>\\n <h2>{'Provider with no payload or options.'}</h2>\\n <TrackingChecker expected={{\\n event: 'generic.click',\\n payload: {},\\n options: {}}}\\n >\\n <EventButton label={'Generate generic.click'} />\\n </TrackingChecker>\\n\\n <h2>{'Provider with payload and no options.'}</h2>\\n <TrackingChecker payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'harness'\\n }} expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'left',\\n eventcategory: 'harness'\\n },\\n options: {}}}\\n >\\n <EventButton label={'Generate generic.click'} />\\n </TrackingChecker>\\n\\n <h2>{'Nested Provider with payload and no options.'}</h2>\\n <TrackingProvider payload={{'actionlocation': 'top'}}>\\n <TrackingChecker\\n payload={{'eventcategory': 'harness'}}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'top',\\n eventcategory: 'harness'\\n },\\n options: {}}}\\n >\\n <EventButton label={'Generate generic.click'} />\\n </TrackingChecker>\\n </TrackingProvider>\\n\\n <h2>{'Nested Provider with field overrides and no options.'}</h2>\\n <TrackingProvider payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'junk'}}\\n >\\n <TrackingChecker\\n payload={{\\n 'actionlocation': 'top',\\n 'eventcategory': 'harness'}}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'top',\\n eventcategory: 'harness'\\n },\\n options: {}}}\\n >\\n <EventButton label={'Generate generic.click'}/>\\n </TrackingChecker>\\n </TrackingProvider>\\n\\n <h2>{'Provider with payload and eventPayload with no options.'}</h2>\\n <TrackingChecker\\n payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'harness'\\n }} eventPayload={{\\n 'generic.click': {\\n 'eventlabel': 'custom'\\n },\\n 'ignore.event': {\\n 'display': 'no it should not'\\n }\\n }}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'left',\\n eventcategory: 'harness',\\n eventlabel: 'custom'\\n },\\n options: {}}}\\n >\\n <EventButton label={'Generate generic.click'}/>\\n </TrackingChecker>\\n\\n <h2>{'Nested Provider with payload and eventPayload with no options.'}</h2>\\n <TrackingProvider\\n payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'harness',\\n 'eventvalue': 'a value'\\n }} eventPayload={{\\n 'generic.click': {\\n 'eventlabel': 'skip',\\n 'highfrequency': 'false'\\n },\\n 'ignore.event': {\\n 'display': 'no it should not'\\n }\\n }}\\n >\\n <TrackingChecker\\n payload={{\\n 'actionlocation': 'top',\\n 'eventcategory': 'test'\\n }}\\n eventPayload={{\\n 'generic.click': {\\n 'eventlabel': 'custom'\\n }\\n }}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'top',\\n eventcategory: 'test',\\n eventvalue: 'a value',\\n eventlabel: 'custom',\\n highfrequency: 'false'\\n },\\n options: {}}}\\n >\\n <EventButton label={'Generate generic.click'}/>\\n </TrackingChecker>\\n </TrackingProvider>\\n\\n <h2>{'Nested Provider with payload, eventPayload, options and eventOptions.'}</h2>\\n <TrackingProvider payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'harness',\\n 'eventvalue': 'a value'\\n }} eventPayload={{\\n 'generic.click': {\\n 'eventlabel': 'skip',\\n 'highfrequency': 'false'\\n },\\n 'ignore.event': {\\n 'display': 'no it should not'\\n }\\n }} eventOptions={{\\n 'generic.click': {\\n 'delayProcessing': '100'\\n }\\n }} options={{\\n 'delayProcessing': '200'\\n }}\\n >\\n <TrackingChecker\\n payload={{\\n 'actionlocation': 'top',\\n 'eventcategory': 'test'\\n }}\\n eventPayload={{\\n 'generic.click': {\\n 'eventlabel': 'custom'\\n }\\n }}\\n eventOptions={{\\n 'generic.click': {\\n 'maxWaitTime': '300'\\n }\\n }}\\n options={{\\n 'maxWaitTime': '400'\\n }}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'top',\\n eventcategory: 'test',\\n eventvalue: 'a value',\\n eventlabel: 'custom',\\n highfrequency: 'false'\\n },\\n options: {\\n delayProcessing: '100',\\n maxWaitTime: '300'\\n }}}\\n >\\n <EventButton label={'Generate generic.click'}/>\\n </TrackingChecker>\\n </TrackingProvider>\\n\\n <h2>{'Provider with component consuming multiple contexts with one of them being contextType.'}</h2>\\n <TrackingChecker\\n payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'harness'\\n }}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n actionlocation: 'left',\\n eventcategory: 'harness'\\n },\\n options: {}}}\\n >\\n <SecondContextChecker\\n value={SECONDCONTEXT}\\n expected={SECONDCONTEXT}\\n >\\n <EventButtonMultipleContext label={'Generate generic.click'}/>\\n </SecondContextChecker>\\n </TrackingChecker>\\n\\n <h1>{'TrackingTrigger'}</h1>\\n\\n <h2>{'Trigger with no payload or options.'}</h2>\\n <TrackingChecker\\n expected={{\\n event: 'generic.click',\\n payload: {},\\n options: {}}}\\n >\\n <TrackingTrigger event={'generic.click'}/>\\n <span>{'generic.click'}</span>\\n </TrackingChecker>\\n\\n <h2>{'Trigger with payload and options for TrackingTrigger.'}</h2>\\n <TrackingChecker\\n expected={{\\n event: 'generic.click',\\n payload: {\\n 'actionlocation': 'top',\\n 'eventcategory': 'test'\\n },\\n options: {\\n 'delayProcessing': '200'\\n }}}\\n >\\n <TrackingTrigger event={'generic.click'}\\n payload={{\\n 'actionlocation': 'top',\\n 'eventcategory': 'test'\\n }}\\n options={{\\n 'delayProcessing': '200'\\n }}\\n />\\n <span>{'generic.click'}</span>\\n </TrackingChecker>\\n\\n <h2>{'Trigger with payload and options for TrackingTrigger and TrackingProvider with payload and options.'}</h2>\\n <TrackingChecker\\n payload={{\\n 'actionlocation': 'left',\\n 'eventcategory': 'harness',\\n 'eventvalue': 'a value'\\n }}\\n eventPayload={{\\n 'generic.click': {\\n 'eventlabel': 'skip',\\n 'highfrequency': 'false'\\n },\\n 'ignore.event': {\\n 'display': 'no it should not'\\n }\\n }}\\n eventOptions={{\\n 'generic.click': {\\n 'delayProcessing': '100',\\n 'maxWaitTime': '500'\\n }\\n }}\\n options={{\\n 'delayProcessing': '200'\\n }}\\n expected={{\\n event: 'generic.click',\\n payload: {\\n 'actionlocation': 'top',\\n 'eventcategory': 'test',\\n 'eventvalue': 'a value',\\n 'eventlabel': 'skip',\\n 'highfrequency': 'false'\\n },\\n options: {\\n 'delayProcessing': '300',\\n 'maxWaitTime': '500'\\n }}}\\n >\\n <TrackingTrigger event={'generic.click'}\\n payload={{\\n 'actionlocation': 'top',\\n 'eventcategory': 'test'\\n }}\\n options={{\\n 'delayProcessing': '300'\\n }}\\n />\\n <span>{'generic.click'}</span>\\n </TrackingChecker>\\n\\n <h2>{'Trigger with no provider should not cause hard failure.'}</h2>\\n <TrackingTrigger event={'generic.click'}\\n payload={{\\n 'actionlocation': 'top',\\n 'eventcategory': 'test'\\n }}\\n options={{\\n 'delayProcessing': '200'\\n }}\\n />\\n </div>\\n );\\n}\",\n \"function FluiContext() {\\n var events = [];\\n \\n this._listeners = function (event) {\\n if (events[event] === undefined) {\\n events[event] = [];\\n }\\n\\n return events[event];\\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 }\",\n \"static get observedAttributes() {\\n return ['data'];\\n }\",\n \"static describe(): any {\\n return merge(super.describe(), {\\n NativeProps: {\\n pointerEvents: 'string',\\n hitSlop: 'number',\\n cursorVisibilitySlop: 'number',\\n billboarding: 'string',\\n },\\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, 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 target._debugID = source._debugID;\\n target._debugSource = source._debugSource;\\n target._debugOwner = source._debugOwner;\\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\\n return target;\\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, 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 target._debugID = source._debugID;\\n target._debugSource = source._debugSource;\\n target._debugOwner = source._debugOwner;\\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\\n return target;\\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, 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 target._debugID = source._debugID;\\n target._debugSource = source._debugSource;\\n target._debugOwner = source._debugOwner;\\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\\n return target;\\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, 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 target._debugID = source._debugID;\\n target._debugSource = source._debugSource;\\n target._debugOwner = source._debugOwner;\\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\\n return target;\\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, 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 target._debugID = source._debugID;\\n target._debugSource = source._debugSource;\\n target._debugOwner = source._debugOwner;\\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\\n return target;\\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, 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 target._debugID = source._debugID;\\n target._debugSource = source._debugSource;\\n target._debugOwner = source._debugOwner;\\n target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;\\n return target;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5403074","0.501894","0.501894","0.50066847","0.50066847","0.49931163","0.49931163","0.49931163","0.49931163","0.49931163","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49729648","0.49675214","0.49675214","0.49675214","0.49675214","0.49675214","0.49675214","0.49675214","0.49675214","0.49675214","0.49559176","0.49559176","0.49559176","0.49559176","0.49559176","0.49559176","0.49559176","0.49508518","0.49482167","0.49371395","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.49185696","0.48750645","0.48750645","0.48750645","0.48750645","0.48750645","0.48750645","0.48650116","0.48650116","0.48650116","0.48650116","0.48650116","0.48480558","0.4810092","0.48003682","0.47800502","0.47800502","0.47800502","0.47800502","0.4749086","0.4716211","0.46531025","0.46376023","0.4613569","0.4613569","0.4613569","0.46115744","0.46043262","0.45999283","0.45904955","0.45780507","0.45761696","0.45761696","0.45761696","0.45761696","0.45761696","0.45761696"],"string":"[\n \"0.5403074\",\n \"0.501894\",\n \"0.501894\",\n \"0.50066847\",\n \"0.50066847\",\n \"0.49931163\",\n \"0.49931163\",\n \"0.49931163\",\n \"0.49931163\",\n \"0.49931163\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49729648\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49675214\",\n \"0.49559176\",\n \"0.49559176\",\n \"0.49559176\",\n \"0.49559176\",\n \"0.49559176\",\n \"0.49559176\",\n \"0.49559176\",\n \"0.49508518\",\n \"0.49482167\",\n \"0.49371395\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.49185696\",\n \"0.48750645\",\n \"0.48750645\",\n \"0.48750645\",\n \"0.48750645\",\n \"0.48750645\",\n \"0.48750645\",\n \"0.48650116\",\n \"0.48650116\",\n \"0.48650116\",\n \"0.48650116\",\n \"0.48650116\",\n \"0.48480558\",\n \"0.4810092\",\n \"0.48003682\",\n \"0.47800502\",\n \"0.47800502\",\n \"0.47800502\",\n \"0.47800502\",\n \"0.4749086\",\n \"0.4716211\",\n \"0.46531025\",\n \"0.46376023\",\n \"0.4613569\",\n \"0.4613569\",\n \"0.4613569\",\n \"0.46115744\",\n \"0.46043262\",\n \"0.45999283\",\n \"0.45904955\",\n \"0.45780507\",\n \"0.45761696\",\n \"0.45761696\",\n \"0.45761696\",\n \"0.45761696\",\n \"0.45761696\",\n \"0.45761696\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.57750165"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":80676,"cells":{"query":{"kind":"string","value":"TODO: Offscreen updates should never suspend. However, a promise that suspended inside an offscreen subtree should be able to ping at the priority of the outer render."},"document":{"kind":"string","value":"function markPendingPriorityLevel(root,expirationTime){// If there's a gap between completing a failed root and retrying it,\n// additional updates may be scheduled. Clear `didError`, in case the update\n// is sufficient to fix the error.\nroot.didError=false;// Update the latest and earliest pending times\nvar earliestPendingTime=root.earliestPendingTime;if(earliestPendingTime===NoWork){// No other pending updates.\nroot.earliestPendingTime=root.latestPendingTime=expirationTime;}else{if(earliestPendingTime<expirationTime){// This is the earliest pending update.\nroot.earliestPendingTime=expirationTime;}else{var latestPendingTime=root.latestPendingTime;if(latestPendingTime>expirationTime){// This is the latest pending update\nroot.latestPendingTime=expirationTime;}}}findNextExpirationTimeToWorkOn(expirationTime,root);}"},"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":["if (\n workInProgressSuspendedReason === SuspendedOnData &&\n workInProgressRoot === root\n ) {\n // Mark the root as ready to continue rendering.\n workInProgressSuspendedReason = SuspendedAndReadyToContinue;\n }","async _enqueueUpdate(){// Mark state updating...\nthis._updateState=this._updateState|STATE_UPDATE_REQUESTED;let resolve,reject;const previousUpdatePromise=this._updatePromise;this._updatePromise=new Promise((res,rej)=>{resolve=res;reject=rej});try{// Ensure any previous update has resolved before updating.\n// This `await` also ensures that property changes are batched.\nawait previousUpdatePromise}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// Make sure the element has connected before updating.\nif(!this._hasConnected){await new Promise(res=>this._hasConnectedResolver=res)}try{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(null!=result){await result}}catch(e){reject(e)}resolve(!this._hasRequestedUpdate)}","async _enqueueUpdate(){this._updateState|=STATE_UPDATE_REQUESTED;let e,t;const n=this._updatePromise;this._updatePromise=new Promise((n,r)=>{e=n,t=r});try{// Ensure any previous update has resolved before updating.\n// This `await` also ensures that property changes are batched.\nawait n}catch(t){}// 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// Make sure the element has connected before updating.\nthis._hasConnected||(await new Promise(e=>this._hasConnectedResolver=e));try{const e=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.\nnull!=e&&(await e)}catch(n){t(n)}e(!this._hasRequestedUpdate)}","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 }","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 waitForUpdate(inspector) {\n return inspector.once(\"layoutview-updated\");\n}","if (rootWithPendingPassiveEffects !== null) {\n // Cache the root since rootWithPendingPassiveEffects is cleared in\n // flushPassiveEffectsImpl\n const root = rootWithPendingPassiveEffects;\n // Cache and clear the remaining lanes flag; it must be reset since this\n // method can be called from various places, not always from commitRoot\n // where the remaining lanes are known\n const remainingLanes = pendingPassiveEffectsRemainingLanes;\n pendingPassiveEffectsRemainingLanes = NoLanes;\n\n const renderPriority = lanesToEventPriority(pendingPassiveEffectsLanes);\n const priority = lowerEventPriority(DefaultEventPriority, renderPriority);\n const prevTransition = ReactCurrentBatchConfig.transition;\n const previousPriority = getCurrentUpdatePriority();\n\n try {\n ReactCurrentBatchConfig.transition = null;\n setCurrentUpdatePriority(priority);\n return flushPassiveEffectsImpl();\n } finally {\n setCurrentUpdatePriority(previousPriority);\n ReactCurrentBatchConfig.transition = prevTransition;\n\n // Once passive effects have run for the tree - giving components a\n // chance to retain cache instances they use - release the pooled\n // cache at the root (if there is one)\n releaseRootPooledCache(root, remainingLanes);\n }\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}","async _enqueueUpdate() {\n // Mark state updating...\n this._updateState = this._updateState | STATE_UPDATE_REQUESTED;\n let resolve;\n const previousUpdatePromise = this._updatePromise;\n this._updatePromise = new Promise((res) => resolve = res);\n // Ensure any previous update has resolved before updating.\n // This `await` also ensures that property changes are batched.\n await previousUpdatePromise;\n // Make sure the element has connected before updating.\n if (!this._hasConnected) {\n await new Promise((res) => this._hasConnectedResolver = res);\n }\n // Allow `performUpdate` to be asynchronous to enable scheduling of updates.\n const result = this.performUpdate();\n // Note, this is to avoid delaying an additional microtask unless we need\n // to.\n if (result != null &&\n typeof result.then === 'function') {\n await result;\n }\n resolve(!this._hasRequestedUpdate);\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 }","function updatePromo() { }","function enterModificationReal() {\n suspendEvents += 1;\n }","function enterModificationReal() {\n suspendEvents += 1;\n }","function _innerUpdate() {\n if (playback.state.value == Playback$STATE_NORMAL) {\n checkForSafeBufferLevel();\n }\n }","async performUpdate() {\n await new Promise((resolve) => requestAnimationFrame(() => resolve()));\n super.performUpdate();\n }","function markUpdateTimeFromFiberToRoot(fiber,expirationTime){// Update the source fiber's expiration time\nif(fiber.expirationTime<expirationTime){fiber.expirationTime=expirationTime;}var alternate=fiber.alternate;if(alternate!==null&&alternate.expirationTime<expirationTime){alternate.expirationTime=expirationTime;}// Walk the parent path to the root and update the child expiration time.\nvar node=fiber[\"return\"];var root=null;if(node===null&&fiber.tag===HostRoot){root=fiber.stateNode;}else{while(node!==null){alternate=node.alternate;if(node.childExpirationTime<expirationTime){node.childExpirationTime=expirationTime;if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}}else if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}if(node[\"return\"]===null&&node.tag===HostRoot){root=node.stateNode;break;}node=node[\"return\"];}}if(root!==null){if(workInProgressRoot===root){// Received an update to a tree that's in the middle of rendering. Mark\n// that's unprocessed work on this root.\nmarkUnprocessedUpdateTime(expirationTime);if(workInProgressRootExitStatus===RootSuspendedWithDelay){// The root already suspended with a delay, which means this render\n// definitely won't finish. Since we have a new update, let's mark it as\n// suspended now, right before marking the incoming update. This has the\n// effect of interrupting the current render and switching to the update.\n// TODO: This happens to work when receiving an update during the render\n// phase, because of the trick inside computeExpirationForFiber to\n// subtract 1 from `renderExpirationTime` to move it into a\n// separate bucket. But we should probably model it with an exception,\n// using the same mechanism we use to force hydration of a subtree.\n// TODO: This does not account for low pri updates that were already\n// scheduled before the root started rendering. Need to track the next\n// pending expiration time (perhaps by backtracking the return path) and\n// then trigger a restart in the `renderDidSuspendDelayIfPossible` path.\nmarkRootSuspendedAtTime(root,renderExpirationTime$1);}}// Mark that the root has a pending update.\nmarkRootUpdatedAtTime(root,expirationTime);}return root;}","componentDidUpdate(){\n this.pageScrollTo();\n\n //automated pre render\n if( this.state.isLoaded && window.c && window.c.length > 2 ){\n console.log( \"Pre-rendering...\" );\n\n //Prerender.writeHTMLPrerender();\n this.shouldPreRender({mainPageRendered: true});\n }\n }","function markUpdateTimeFromFiberToRoot(fiber,expirationTime){// Update the source fiber's expiration time\nif(fiber.expirationTime<expirationTime){fiber.expirationTime=expirationTime;}var alternate=fiber.alternate;if(alternate!==null&&alternate.expirationTime<expirationTime){alternate.expirationTime=expirationTime;}// Walk the parent path to the root and update the child expiration time.\nvar node=fiber.return;var root=null;if(node===null&&fiber.tag===HostRoot){root=fiber.stateNode;}else{while(node!==null){alternate=node.alternate;if(node.childExpirationTime<expirationTime){node.childExpirationTime=expirationTime;if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}}else if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}if(node.return===null&&node.tag===HostRoot){root=node.stateNode;break;}node=node.return;}}if(root!==null){if(workInProgressRoot===root){// Received an update to a tree that's in the middle of rendering. Mark\n// that's unprocessed work on this root.\nmarkUnprocessedUpdateTime(expirationTime);if(workInProgressRootExitStatus===RootSuspendedWithDelay){// The root already suspended with a delay, which means this render\n// definitely won't finish. Since we have a new update, let's mark it as\n// suspended now, right before marking the incoming update. This has the\n// effect of interrupting the current render and switching to the update.\n// TODO: This happens to work when receiving an update during the render\n// phase, because of the trick inside computeExpirationForFiber to\n// subtract 1 from `renderExpirationTime` to move it into a\n// separate bucket. But we should probably model it with an exception,\n// using the same mechanism we use to force hydration of a subtree.\n// TODO: This does not account for low pri updates that were already\n// scheduled before the root started rendering. Need to track the next\n// pending expiration time (perhaps by backtracking the return path) and\n// then trigger a restart in the `renderDidSuspendDelayIfPossible` path.\nmarkRootSuspendedAtTime(root,renderExpirationTime$1);}}// Mark that the root has a pending update.\nmarkRootUpdatedAtTime(root,expirationTime);}return root;}","function markUpdateTimeFromFiberToRoot(fiber,expirationTime){// Update the source fiber's expiration time\nif(fiber.expirationTime<expirationTime){fiber.expirationTime=expirationTime;}var alternate=fiber.alternate;if(alternate!==null&&alternate.expirationTime<expirationTime){alternate.expirationTime=expirationTime;}// Walk the parent path to the root and update the child expiration time.\nvar node=fiber.return;var root=null;if(node===null&&fiber.tag===HostRoot){root=fiber.stateNode;}else{while(node!==null){alternate=node.alternate;if(node.childExpirationTime<expirationTime){node.childExpirationTime=expirationTime;if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}}else if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}if(node.return===null&&node.tag===HostRoot){root=node.stateNode;break;}node=node.return;}}if(root!==null){if(workInProgressRoot===root){// Received an update to a tree that's in the middle of rendering. Mark\n// that's unprocessed work on this root.\nmarkUnprocessedUpdateTime(expirationTime);if(workInProgressRootExitStatus===RootSuspendedWithDelay){// The root already suspended with a delay, which means this render\n// definitely won't finish. Since we have a new update, let's mark it as\n// suspended now, right before marking the incoming update. This has the\n// effect of interrupting the current render and switching to the update.\n// TODO: This happens to work when receiving an update during the render\n// phase, because of the trick inside computeExpirationForFiber to\n// subtract 1 from `renderExpirationTime` to move it into a\n// separate bucket. But we should probably model it with an exception,\n// using the same mechanism we use to force hydration of a subtree.\n// TODO: This does not account for low pri updates that were already\n// scheduled before the root started rendering. Need to track the next\n// pending expiration time (perhaps by backtracking the return path) and\n// then trigger a restart in the `renderDidSuspendDelayIfPossible` path.\nmarkRootSuspendedAtTime(root,renderExpirationTime$1);}}// Mark that the root has a pending update.\nmarkRootUpdatedAtTime(root,expirationTime);}return root;}","function enterModificationReal() {\n\t suspendEvents += 1;\n\t }","function enterModificationReal() {\n\t suspendEvents += 1;\n\t }","discoverWork_() {\n // TODO(dvoytenko): vsync separation may be needed for different phases\n\n const now = this.win.Date.now();\n\n // Ensure all resources layout phase complete; when relayoutAll is requested\n // force re-layout.\n const {\n elementsThatScrolled_: elementsThatScrolled,\n relayoutAll_: relayoutAll,\n relayoutTop_: relayoutTop,\n } = this;\n this.relayoutAll_ = false;\n this.relayoutTop_ = -1;\n\n // Phase 1: Build and relayout as needed. All mutations happen here.\n let relayoutCount = 0;\n let remeasureCount = 0;\n for (let i = 0; i < this.resources_.length; i++) {\n const r = this.resources_[i];\n if (\n r.getState() == ResourceState_Enum.NOT_BUILT &&\n !r.isBuilding() &&\n !r.element.R1()\n ) {\n this.buildOrScheduleBuildForResource_(r, /* checkForDupes */ true);\n }\n\n if (\n relayoutAll ||\n !r.hasBeenMeasured() ||\n // NOT_LAID_OUT is the state after build() but before measure().\n r.getState() == ResourceState_Enum.NOT_LAID_OUT\n ) {\n relayoutCount++;\n }\n if (r.isMeasureRequested()) {\n remeasureCount++;\n }\n }\n\n // Phase 2: Remeasure if there were any relayouts. Unfortunately, currently\n // there's no way to optimize this. All reads happen here.\n let toUnload;\n if (\n relayoutCount > 0 ||\n remeasureCount > 0 ||\n relayoutAll ||\n relayoutTop != -1 ||\n elementsThatScrolled.length > 0\n ) {\n for (let i = 0; i < this.resources_.length; i++) {\n const r = this.resources_[i];\n if ((r.hasOwner() && !r.isMeasureRequested()) || r.element.R1()) {\n // If element has owner, and measure is not requested, do nothing.\n continue;\n }\n let needsMeasure =\n relayoutAll ||\n r.getState() == ResourceState_Enum.NOT_LAID_OUT ||\n !r.hasBeenMeasured() ||\n r.isMeasureRequested() ||\n (relayoutTop != -1 && r.getLayoutBox().bottom >= relayoutTop);\n\n if (!needsMeasure) {\n for (let i = 0; i < elementsThatScrolled.length; i++) {\n // TODO(jridgewell): Need to figure out how ShadowRoots and FIEs\n // should behave in this model. If the ShadowRoot's host scrolls,\n // do we need to invalidate inside the shadow or light tree? Or if\n // the FIE's iframe parent scrolls, do we?\n if (elementsThatScrolled[i].contains(r.element)) {\n needsMeasure = true;\n break;\n }\n }\n }\n\n if (needsMeasure) {\n const isDisplayed = this.measureResource_(r);\n if (!isDisplayed) {\n if (!toUnload) {\n toUnload = [];\n }\n toUnload.push(r);\n }\n }\n }\n }\n elementsThatScrolled.length = 0;\n\n // Unload all in one cycle.\n if (toUnload) {\n this.unloadResources_(toUnload);\n }\n\n const viewportRect = this.viewport_.getRect();\n // Load viewport = viewport + 3x up/down when document is visible.\n let loadRect;\n if (this.visible_) {\n loadRect = expandLayoutRect(viewportRect, 0.25, 2);\n } else {\n loadRect = viewportRect;\n }\n\n const visibleRect = this.visible_\n ? // When the doc is visible, consider the viewport to be 25% larger,\n // to minimize effect from small scrolling and notify things that\n // they are in viewport just before they are actually visible.\n expandLayoutRect(viewportRect, 0.25, 0.25)\n : viewportRect;\n\n // Phase 3: Set inViewport status for resources.\n for (let i = 0; i < this.resources_.length; i++) {\n const r = this.resources_[i];\n if (\n r.getState() == ResourceState_Enum.NOT_BUILT ||\n r.hasOwner() ||\n r.element.R1()\n ) {\n continue;\n }\n // Note that when the document is not visible, neither are any of its\n // elements to reduce CPU cycles.\n // TODO(dvoytenko, #3434): Reimplement the use of `isFixed` with\n // layers. This is currently a short-term fix to the problem that\n // the fixed elements get incorrect top coord.\n const shouldBeInViewport =\n this.visible_ && r.isDisplayed() && r.overlaps(visibleRect);\n r.setInViewport(shouldBeInViewport);\n }\n\n // Phase 4: Schedule elements for layout within a reasonable distance from\n // current viewport.\n if (loadRect) {\n for (let i = 0; i < this.resources_.length; i++) {\n const r = this.resources_[i];\n // TODO(dvoytenko): This extra build has to be merged with the\n // scheduleLayoutOrPreload method below.\n // Build all resources visible, measured, and in the viewport.\n if (\n !r.isBuilt() &&\n !r.isBuilding() &&\n !r.hasOwner() &&\n !r.element.R1() &&\n r.hasBeenMeasured() &&\n r.isDisplayed() &&\n r.overlaps(loadRect)\n ) {\n this.buildOrScheduleBuildForResource_(\n r,\n /* checkForDupes */ true,\n /* ignoreQuota */ true\n );\n }\n if (\n r.getState() != ResourceState_Enum.READY_FOR_LAYOUT ||\n r.hasOwner()\n ) {\n continue;\n }\n // TODO(dvoytenko, #3434): Reimplement the use of `isFixed` with\n // layers. This is currently a short-term fix to the problem that\n // the fixed elements get incorrect top coord.\n if (r.isDisplayed() && r.overlaps(loadRect)) {\n this.scheduleLayoutOrPreload(r, /* layout */ true);\n }\n }\n }\n\n if (this.visible_ && this.isIdle_(now)) {\n // Phase 5: Idle Render Outside Viewport layout: layout up to 4 items\n // with idleRenderOutsideViewport true\n let idleScheduledCount = 0;\n for (\n let i = 0;\n i < this.resources_.length && idleScheduledCount < 4;\n i++\n ) {\n const r = this.resources_[i];\n if (\n r.getState() == ResourceState_Enum.READY_FOR_LAYOUT &&\n !r.hasOwner() &&\n !r.element.R1() &&\n r.isDisplayed() &&\n r.idleRenderOutsideViewport()\n ) {\n dev().fine(TAG_, 'idleRenderOutsideViewport layout:', r.debugid);\n this.scheduleLayoutOrPreload(r, /* layout */ false);\n idleScheduledCount++;\n }\n }\n // Phase 6: Idle layout: layout more if we are otherwise not doing much.\n // TODO(dvoytenko): document/estimate IDLE timeouts and other constants\n for (\n let i = 0;\n i < this.resources_.length && idleScheduledCount < 4;\n i++\n ) {\n const r = this.resources_[i];\n if (\n r.getState() == ResourceState_Enum.READY_FOR_LAYOUT &&\n !r.hasOwner() &&\n !r.element.R1() &&\n r.isDisplayed()\n ) {\n dev().fine(TAG_, 'idle layout:', r.debugid);\n this.scheduleLayoutOrPreload(r, /* layout */ false);\n idleScheduledCount++;\n }\n }\n }\n }","doUpdate () {\n\t\tif (! this.isDisplayConditionActive) {\n\t\t\tthis.setPaused (false);\n\t\t\tthis.clearStage ();\n\t\t\treturn;\n\t\t}\n\t\tconst monitorstatus = App.systemAgent.agentControl.getLocalAgent ().lastStatus.monitorServerStatus;\n\t\tif ((typeof monitorstatus != \"object\") || (monitorstatus == null)) {\n\t\t\tthis.setPaused (false);\n\t\t\tthis.clearStage ();\n\t\t\treturn;\n\t\t}\n\t\tthis.monitorStatus = monitorstatus;\n\t\tif (this.stage == \"\") {\n\t\t\tthis.setStage (Initializing);\n\t\t}\n\t}","update() {\n this.poll();\n }","async _enqueueUpdate() {\n // Mark state updating...\n this._updateState = this._updateState | STATE_UPDATE_REQUESTED;\n let resolve;\n let reject;\n const previousUpdatePromise = this._updatePromise;\n this._updatePromise = new Promise((res, rej) => {\n resolve = res;\n reject = rej;\n });\n try {\n // Ensure any previous update has resolved before updating.\n // This `await` also ensures that property changes are batched.\n await previousUpdatePromise;\n }\n catch (e) {\n // 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 }\n // Make sure the element has connected before updating.\n if (!this._hasConnected) {\n await new Promise((res) => this._hasConnectedResolver = res);\n }\n try {\n const result = this.performUpdate();\n // 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.\n if (result != null) {\n await result;\n }\n }\n catch (e) {\n reject(e);\n }\n resolve(!this._hasRequestedUpdate);\n }","if (\n rootWithPendingPassiveEffects !== null &&\n rootWithPendingPassiveEffects.tag === LegacyRoot &&\n (executionContext & (RenderContext | CommitContext)) === NoContext\n ) {\n flushPassiveEffects();\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;}","componentDidUpdate(prevProps) {\n // const { checkExtensionLockStatus } = this.props;\n // checkExtensionLockStatus().then(() => {\n this.fetchData(prevProps);\n // });\n }","whenRemoteResponsive () {\n return new Promise(function (resolve) {\n setTimeout(resolve, 100);\n })\n }","_notifyRenderer() {\n this.renderer.notify();\n }","function ensureRootIsScheduled(root){var lastExpiredTime=root.lastExpiredTime;if(lastExpiredTime!==NoWork){// Special case: Expired work should flush synchronously.\nroot.callbackExpirationTime=Sync;root.callbackPriority=ImmediatePriority;root.callbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));return;}var expirationTime=getNextRootExpirationTimeToWorkOn(root);var existingCallbackNode=root.callbackNode;if(expirationTime===NoWork){// There's nothing to work on.\nif(existingCallbackNode!==null){root.callbackNode=null;root.callbackExpirationTime=NoWork;root.callbackPriority=NoPriority;}return;}// TODO: If this is an update, we already read the current time. Pass the\n// time as an argument.\nvar currentTime=requestCurrentTimeForUpdate();var priorityLevel=inferPriorityFromExpirationTime(currentTime,expirationTime);// If there's an existing render task, confirm it has the correct priority and\n// expiration time. Otherwise, we'll cancel it and schedule a new one.\nif(existingCallbackNode!==null){var existingCallbackPriority=root.callbackPriority;var existingCallbackExpirationTime=root.callbackExpirationTime;if(// Callback must have the exact same expiration time.\nexistingCallbackExpirationTime===expirationTime&&// Callback must have greater or equal priority.\nexistingCallbackPriority>=priorityLevel){// Existing callback is sufficient.\nreturn;}// Need to schedule a new task.\n// TODO: Instead of scheduling a new task, we should be able to change the\n// priority of the existing one.\ncancelCallback(existingCallbackNode);}root.callbackExpirationTime=expirationTime;root.callbackPriority=priorityLevel;var callbackNode;if(expirationTime===Sync){// Sync React callbacks are scheduled on a special internal queue\ncallbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));}else{callbackNode=scheduleCallback(priorityLevel,performConcurrentWorkOnRoot.bind(null,root),// Compute a task timeout based on the expiration time. This also affects\n// ordering because tasks are processed in timeout order.\n{timeout:expirationTimeToMs(expirationTime)-now()});}root.callbackNode=callbackNode;}// This is the entry point for every concurrent task, i.e. anything that","function ensureRootIsScheduled(root){var lastExpiredTime=root.lastExpiredTime;if(lastExpiredTime!==NoWork){// Special case: Expired work should flush synchronously.\nroot.callbackExpirationTime=Sync;root.callbackPriority=ImmediatePriority;root.callbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));return;}var expirationTime=getNextRootExpirationTimeToWorkOn(root);var existingCallbackNode=root.callbackNode;if(expirationTime===NoWork){// There's nothing to work on.\nif(existingCallbackNode!==null){root.callbackNode=null;root.callbackExpirationTime=NoWork;root.callbackPriority=NoPriority;}return;}// TODO: If this is an update, we already read the current time. Pass the\n// time as an argument.\nvar currentTime=requestCurrentTimeForUpdate();var priorityLevel=inferPriorityFromExpirationTime(currentTime,expirationTime);// If there's an existing render task, confirm it has the correct priority and\n// expiration time. Otherwise, we'll cancel it and schedule a new one.\nif(existingCallbackNode!==null){var existingCallbackPriority=root.callbackPriority;var existingCallbackExpirationTime=root.callbackExpirationTime;if(// Callback must have the exact same expiration time.\nexistingCallbackExpirationTime===expirationTime&&// Callback must have greater or equal priority.\nexistingCallbackPriority>=priorityLevel){// Existing callback is sufficient.\nreturn;}// Need to schedule a new task.\n// TODO: Instead of scheduling a new task, we should be able to change the\n// priority of the existing one.\ncancelCallback(existingCallbackNode);}root.callbackExpirationTime=expirationTime;root.callbackPriority=priorityLevel;var callbackNode;if(expirationTime===Sync){// Sync React callbacks are scheduled on a special internal queue\ncallbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));}else{callbackNode=scheduleCallback(priorityLevel,performConcurrentWorkOnRoot.bind(null,root),// Compute a task timeout based on the expiration time. This also affects\n// ordering because tasks are processed in timeout order.\n{timeout:expirationTimeToMs(expirationTime)-now()});}root.callbackNode=callbackNode;}// This is the entry point for every concurrent task, i.e. anything that","function ensureRootIsScheduled(root){var lastExpiredTime=root.lastExpiredTime;if(lastExpiredTime!==NoWork){// Special case: Expired work should flush synchronously.\nroot.callbackExpirationTime=Sync;root.callbackPriority=ImmediatePriority;root.callbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));return;}var expirationTime=getNextRootExpirationTimeToWorkOn(root);var existingCallbackNode=root.callbackNode;if(expirationTime===NoWork){// There's nothing to work on.\nif(existingCallbackNode!==null){root.callbackNode=null;root.callbackExpirationTime=NoWork;root.callbackPriority=NoPriority;}return;}// TODO: If this is an update, we already read the current time. Pass the\n// time as an argument.\nvar currentTime=requestCurrentTimeForUpdate();var priorityLevel=inferPriorityFromExpirationTime(currentTime,expirationTime);// If there's an existing render task, confirm it has the correct priority and\n// expiration time. Otherwise, we'll cancel it and schedule a new one.\nif(existingCallbackNode!==null){var existingCallbackPriority=root.callbackPriority;var existingCallbackExpirationTime=root.callbackExpirationTime;if(// Callback must have the exact same expiration time.\nexistingCallbackExpirationTime===expirationTime&&// Callback must have greater or equal priority.\nexistingCallbackPriority>=priorityLevel){// Existing callback is sufficient.\nreturn;}// Need to schedule a new task.\n// TODO: Instead of scheduling a new task, we should be able to change the\n// priority of the existing one.\ncancelCallback(existingCallbackNode);}root.callbackExpirationTime=expirationTime;root.callbackPriority=priorityLevel;var callbackNode;if(expirationTime===Sync){// Sync React callbacks are scheduled on a special internal queue\ncallbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));}else{callbackNode=scheduleCallback(priorityLevel,performConcurrentWorkOnRoot.bind(null,root),// Compute a task timeout based on the expiration time. This also affects\n// ordering because tasks are processed in timeout order.\n{timeout:expirationTimeToMs(expirationTime)-now()});}root.callbackNode=callbackNode;}// This is the entry point for every concurrent task, i.e. anything that","function processQueue(){if(updateQueue.length){ReactComponentEnvironment.processChildrenUpdates(updateQueue,markupQueue);clearQueue();}}","function processQueue(){if(updateQueue.length){ReactComponentEnvironment.processChildrenUpdates(updateQueue,markupQueue);clearQueue();}}","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;}","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;}","async __enqueueUpdate() {\n this.isUpdatePending = true;\n try {\n await this.__updatePromise;\n } catch (e) {\n Promise.reject(e);\n }\n const result2 = this.scheduleUpdate();\n if (result2 != null) {\n await result2;\n }\n return !this.isUpdatePending;\n }","_onScreen() {\n return this.arena;\n }","function updateSuspenseListComponent(current,workInProgress,renderExpirationTime){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderExpirationTime);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.effectTag|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.effectTag&DidCapture)!==NoEffect;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\n// on any nested boundaries to let them know to try to render\n// again. This is the same as context updating.\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderExpirationTime);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// Outside of blocking mode, SuspenseList doesn't work so we just\n// use make it a noop by treating it as the default revealOrder.\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\n// TODO: We could fast path by just rendering the tail now.\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\n// We're going to render them separately later.\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\n// At the same time we're going to reverse the list of everything\n// we pass in the meantime. That's going to be our tail in reverse\n// order.\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\n_tail,null,// last\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\nnull,// tail\nnull,// last\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\n// a boundary.\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}","function updateSuspenseListComponent(current,workInProgress,renderExpirationTime){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderExpirationTime);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.effectTag|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.effectTag&DidCapture)!==NoEffect;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\n// on any nested boundaries to let them know to try to render\n// again. This is the same as context updating.\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderExpirationTime);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// Outside of blocking mode, SuspenseList doesn't work so we just\n// use make it a noop by treating it as the default revealOrder.\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\n// TODO: We could fast path by just rendering the tail now.\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\n// We're going to render them separately later.\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\n// At the same time we're going to reverse the list of everything\n// we pass in the meantime. That's going to be our tail in reverse\n// order.\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\n_tail,null,// last\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\nnull,// tail\nnull,// last\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\n// a boundary.\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}","function updateSuspenseListComponent(current,workInProgress,renderExpirationTime){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderExpirationTime);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.effectTag|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.effectTag&DidCapture)!==NoEffect;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\n// on any nested boundaries to let them know to try to render\n// again. This is the same as context updating.\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderExpirationTime);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// Outside of blocking mode, SuspenseList doesn't work so we just\n// use make it a noop by treating it as the default revealOrder.\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\n// TODO: We could fast path by just rendering the tail now.\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\n// We're going to render them separately later.\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\n// At the same time we're going to reverse the list of everything\n// we pass in the meantime. That's going to be our tail in reverse\n// order.\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\n_tail,null,// last\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\nnull,// tail\nnull,// last\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\n// a boundary.\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}","function updateSuspenseListComponent(current,workInProgress,renderLanes){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderLanes);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.flags|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.flags&DidCapture)!==NoFlags;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\n// on any nested boundaries to let them know to try to render\n// again. This is the same as context updating.\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderLanes);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// In legacy mode, SuspenseList doesn't work so we just\n// use make it a noop by treating it as the default revealOrder.\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\n// TODO: We could fast path by just rendering the tail now.\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\n// We're going to render them separately later.\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\n// At the same time we're going to reverse the list of everything\n// we pass in the meantime. That's going to be our tail in reverse\n// order.\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\n_tail,null,// last\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\nnull,// tail\nnull,// last\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\n// a boundary.\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}","function updateSuspenseListComponent(current,workInProgress,renderLanes){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderLanes);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.flags|=DidCapture;}else {var didSuspendBefore=current!==null&&(current.flags&DidCapture)!==NoFlags;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\n// on any nested boundaries to let them know to try to render\n// again. This is the same as context updating.\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderLanes);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// In legacy mode, SuspenseList doesn't work so we just\n// use make it a noop by treating it as the default revealOrder.\nworkInProgress.memoizedState=null;}else {switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\n// TODO: We could fast path by just rendering the tail now.\ntail=workInProgress.child;workInProgress.child=null;}else {// Disconnect the tail rows after the content row.\n// We're going to render them separately later.\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\n// At the same time we're going to reverse the list of everything\n// we pass in the meantime. That's going to be our tail in reverse\n// order.\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\n_tail,null,// last\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\nnull,// tail\nnull,// last\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\n// a boundary.\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}","_ensurePowerOnState() {\n\t\treturn new Promise(resolve => {\n\t\t\tif (noble.state === 'poweredOn') {\n\t\t\t\tresolve();\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tlogDebug('waiting for adapter state change');\n\t\t\tnoble.on('stateChange', state => {\n\t\t\t\tif (state === 'poweredOn') {\n\t\t\t\t\tresolve();\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t}","async function lockPromise() {\n await document.documentElement.requestFullscreen();\n const value = await screen.orientation.lock(\"any\");\n console.log(`${value} should be undefined`);\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}","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}","nextUpdate() {\n return new Promise(updateQueue.enqueue);\n }","function updateAutoAttach(newState) {\r\n currentState = currentState.then(async ({ context, state: oldState }) => {\r\n if (newState === oldState) {\r\n return { context, state: oldState };\r\n }\r\n if (oldState !== null) {\r\n updateStatusBar(context, oldState, true);\r\n }\r\n await transitions[newState](context);\r\n isTemporarilyDisabled = false;\r\n updateStatusBar(context, newState, false);\r\n return { context, state: newState };\r\n });\r\n}","_FBPReady() {\n super._FBPReady();\n // this._FBPTraceWires()\n\n this.updateComplete.then(() => {\n if (window.ResizeObserver) {\n const ro = new ResizeObserver(entries => {\n window.requestAnimationFrame(() => {\n for (const entry of entries) {\n this._checkSize(entry.contentRect.width);\n }\n });\n });\n ro.observe(this);\n } else {\n // fallback, just listen to the resize event\n setTimeout(() => {\n const cr = this.getBoundingClientRect();\n this._checkSize(cr.width);\n }, 1);\n\n window.addEventListener('resize', () => {\n const cr = this.getBoundingClientRect();\n this._checkSize(cr.width);\n });\n }\n });\n }","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BatchedMode) === NoMode) {\n // Outside of batched mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BatchedMode) === NoMode) {\n // Outside of batched mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BatchedMode) === NoMode) {\n // Outside of batched mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","componentDidUpdate() {\n this.updateOverflow();\n }","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // Outside of blocking mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // Outside of blocking mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // Outside of blocking mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","poll () {\n console.log('Polling'.cyan);\n\n Promise\n .all([\n PS.get(),\n PS.getCPUTime()\n ])\n .then(\n results => {\n try {\n // free mem\n this.sockets.forEach(socket => socket.emit('free mem', os.freemem()));\n\n let [ processes, cpu ] = results;\n\n this.processes = processes;\n console.log(`Got ${processes.length} processes`.green);\n this.broadcast('ps', processes);\n\n let time = cpu.totalTime - this.cpu.totalTime;\n let idle = cpu.idleTime - this.cpu.idleTime;\n\n let load = ( ( time - idle ) / time );\n\n console.log('comparing', cpu, this.cpu, { load });\n\n this.cpu = cpu;\n\n this.cpu.load = load;\n\n console.log('load average', (os.loadavg()[0] / 8 * 100) + load);\n\n this.broadcast('cpu load', (os.loadavg()[0] / 8 * 100) + load);\n\n setTimeout(this.poll.bind(this), 2500);\n }\n catch ( error ) {\n this.emit('error', error);\n }\n },\n error => this.emit('error', error)\n );\n }","_updateZOrder() {}","function processNextUpdateRequest() {\n if(vis_queue.length > 0) {\n let temp = vis_queue.pop();\n update(temp.svg, temp.pack, temp.path, temp.id, temp.cb_keyword);\n } else {\n hook_busy = false;\n }\n}","forceRender() {\n window.requestAnimationFrame(() => {\n this.$forceUpdate();\n });\n }","beginUpdate(){\n if (this.nativeElement.isRendered) {\n this.nativeElement.beginUpdate();\n }\n else\n {\n this.nativeElement.whenRendered(() => {\n this.nativeElement.beginUpdate();\n });\n }\n }","function _innerUpdate() {\n if (playback.state.value == Playback$STATE_NORMAL) {\n checkForSafeBufferLevel();\n _currentDownloaderState.update();\n }\n }","suspend() {\n if (this.state_ === WindowState.LAUNCHING) {\n console.error('Call suspend() while window is still launching.');\n return;\n }\n this.state_ = WindowState.SUSPENDING;\n this.foregroundOps_.suspend();\n }","function pollForCPUInfo() {\n chrome.system.cpu.getInfo(function(info) {\n CPU_info = info;\n setTimeout(pollForCPUInfo, POLL_TIME_DELAY);\n });\n}","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n\n var suspenseContext = suspenseStackCursor.current;\n\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BatchedMode) === NoMode) {\n // Outside of batched mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail = void 0;\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode);\n break;\n }\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n while (row !== null) {\n var currentRow = row.alternate;\n // New rows can't be content rows.\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n }\n // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode);\n break;\n }\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined);\n break;\n }\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n return workInProgress.child;\n}","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n\n var suspenseContext = suspenseStackCursor.current;\n\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BatchedMode) === NoMode) {\n // Outside of batched mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail = void 0;\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode);\n break;\n }\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n while (row !== null) {\n var currentRow = row.alternate;\n // New rows can't be content rows.\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n }\n // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode);\n break;\n }\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined);\n break;\n }\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n return workInProgress.child;\n}","static tickFullUpdate() {\n let updateParcel = {\n text: \"\",\n color: \"#d352ad\",\n tooltip: \"\"\n };\n\n this.refreshState()\n .then((timerState) => {\n console.debug('[Net]', '(API status result)', timerState);\n\n this.handleTimerState(timerState, updateParcel);\n this.networkOk = true;\n })\n .catch((err) => {\n console.warn('[Net]', '(API status fetch failed)', err);\n\n updateParcel.text = \"!\";\n updateParcel.color = \"#e74c3c\";\n updateParcel.tooltip = \"Communication error\";\n\n this.networkOk = false;\n })\n .then(() => {\n this.applyBadgeConfig(updateParcel);\n });\n }","forceUpdate() {\n if (!RenderDebounce.has(this)) {\n RenderDebounce.set(this, new Promise(resolve => setTimeout(() => {\n RenderDebounce.delete(this);\n\n this.componentWillReceiveProps(this.props, this.state);\n\n resolve(this[$$render]());\n })));\n }\n\n return RenderDebounce.get(this);\n }","function safeRefreshNotifyState(state)\n {\n // Only update mainpage if there is no owner or we are the owner.\n if(mainpage.dataset.owner === PANEOWNER.NONE || mainpage.dataset.owner === PANEOWNER.ATHENS) {\n if (state === 0) {\n mainpage.dataset.state = \"none\";\n }\n else {\n if (!mainpage.dataset.state || mainpage.dataset.state === \"none\") {\n mainpage.dataset.state = \"notify\";\n }\n } \n requestParentSizeChange();\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}","doLoadingScreen(loadingMs){\n var promise1 = new Promise(resolve => setTimeout(resolve, loadingMs));\n\n return promise1;\n }","function touchLastRequested(){\n\tlastRequestedMs = new Date().getTime();\n\n\t// if it was not running, we run it\n\tif (!on){\n\t\ton = true;\n\t\tconsole.log(\"os-usage.js - starting top.fetch every \" + (delay/1000) + \"s\");\n\t\ttopFetch();\n\t}\n\n}","_suspendPresentationLayerUpdates() {\n this._suspendCATransaction = true;\n }","function updateElements() { //Main loop logic here.\r\n updateResourceDisplay();\r\n updateCoreDisplay();\r\n}","async update_() {\n if (this.lockingUpdate_) {\n if (this.pendingUpdate_) {\n return;\n }\n this.pendingUpdate_ = (async () => {\n while (this.lockingUpdate_) {\n try {\n await this.lockingUpdate_;\n } catch (e) {\n // Ignore exception from waiting for existing update.\n }\n }\n this.lockingUpdate_ = this.pendingUpdate_;\n this.pendingUpdate_ = null;\n await this.doUpdate_();\n this.lockingUpdate_ = null;\n })();\n } else {\n this.lockingUpdate_ = (async () => {\n await this.doUpdate_();\n this.lockingUpdate_ = null;\n })();\n }\n }","function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.effectTag |= DidCapture;\n } else {\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BatchedMode) === NoMode) {\n // Outside of batched mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n }","async handle_update() {\n\t\tthis.new_worker = await navigator.serviceWorker.getRegistration();\n\t\tif (this.new_worker.waiting) {\n\t\t\tthis.promote_app_update();\n\t\t}\n\t}","function prerender() {\n if (tileEngine.layers) {\n tileEngine.layers.forEach(layer => {\n layerMap[layer.name] = layer;\n\n if (layer.visible !== false) {\n tileEngine._r(layer, offscreenContext);\n }\n });\n }\n }","function poll(el) {\n observedElements.push(el);\n if (observedElements.length === 1)\n rafID = requestAnimationFrame(checkStyles);\n}","if (didScheduleUpdateDuringPassiveEffects) {\n if (root === rootWithPassiveNestedUpdates) {\n nestedPassiveUpdateCount++;\n } else {\n nestedPassiveUpdateCount = 0;\n rootWithPassiveNestedUpdates = root;\n }\n }","renderui(){\n this.events.emit('updateresources', {\n currenthp: this.player.currenthp,\n maxhp: this.player.maxhp,\n currentend: this.player.currentend,\n maxend: this.player.maxend,\n currentmana: this.player.currentmana,\n maxmana: this.player.maxmana,\n target: this.player.target ? this.player.target : null\n })\n this.events.emit('updateabilities',{\n gcd: this.GCD.timer ? Math.floor(this.GCD.timer.getProgress() * 1000) : 1000, //it starts in sub 1 levels \n value: this.GCD.value\n })\n }","_updateAttachedFlag() {\n // Calculate active flag.\n let newAttached = this.isAttached();\n if (this._attached !== newAttached) {\n this._attached = newAttached;\n\n let children = this._children.get();\n if (children) {\n let m = children.length;\n if (m > 0) {\n for (let i = 0; i < m; i++) {\n children[i]._updateAttachedFlag();\n }\n }\n }\n\n if (newAttached) {\n this.emit('attach');\n } else {\n this.emit('detach');\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 setProps, setState, forceUpdate, etc.; creation and\n// destruction of top-level components is guarded in ReactMount.)\n\"production\"!==process.env.NODE_ENV?warning(ReactCurrentOwner.current==null,'enqueueUpdate(): Render methods should be a pure function of props '+'and state; triggering nested component updates from render is not '+'allowed. If necessary, trigger nested updates in '+'componentDidUpdate.'):null;if(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","async function queueUpdate(p) {\n queued.push(p);\n if (!pending) {\n pending = true;\n await Promise.resolve();\n pending = false;\n const loading = [...queued];\n queued = [];\n (await Promise.all(loading)).forEach((fn) => fn && fn());\n }\n}","measure() {\n // Check if the element is ready to be measured.\n // Placeholders are special. They are technically \"owned\" by parent AMP\n // elements, sized by parents, but laid out independently. This means\n // that placeholders need to at least wait until the parent element\n // has been stubbed. We can tell whether the parent has been stubbed\n // by whether a resource has been attached to it.\n if (\n this.isPlaceholder_ &&\n this.element.parentElement &&\n // Use prefix to recognize AMP element. This is necessary because stub\n // may not be attached yet.\n this.element.parentElement.tagName.startsWith('AMP-') &&\n !(RESOURCE_PROP_ in this.element.parentElement)\n ) {\n return;\n }\n if (\n !this.element.ownerDocument ||\n !this.element.ownerDocument.defaultView\n ) {\n // Most likely this is an element who's window has just been destroyed.\n // This is an issue with FIE embeds destruction. Such elements will be\n // considered \"not displayable\" until they are GC'ed.\n this.state_ = ResourceState_Enum.NOT_LAID_OUT;\n return;\n }\n\n this.isMeasureRequested_ = false;\n\n const oldBox = this.layoutBox_;\n this.computeMeasurements_();\n const newBox = this.layoutBox_;\n\n // Note that \"left\" doesn't affect readiness for the layout.\n const sizeChanges = !layoutRectSizeEquals(oldBox, newBox);\n if (\n this.state_ == ResourceState_Enum.NOT_LAID_OUT ||\n oldBox.top != newBox.top ||\n sizeChanges\n ) {\n if (this.element.isUpgraded()) {\n if (this.state_ == ResourceState_Enum.NOT_LAID_OUT) {\n // If the element isn't laid out yet, then we're now ready for layout.\n this.state_ = ResourceState_Enum.READY_FOR_LAYOUT;\n } else if (\n (this.state_ == ResourceState_Enum.LAYOUT_COMPLETE ||\n this.state_ == ResourceState_Enum.LAYOUT_FAILED) &&\n this.element.isRelayoutNeeded()\n ) {\n // If the element was already laid out and we need to relayout, then\n // go back to ready for layout.\n this.state_ = ResourceState_Enum.READY_FOR_LAYOUT;\n }\n }\n }\n\n if (!this.hasBeenMeasured()) {\n this.initialLayoutBox_ = newBox;\n }\n\n this.element.updateLayoutBox(newBox, sizeChanges);\n }","async onIdle() {\n // Instantly resolve if none pending and if nothing else is queued\n if (this._pendingCount === 0 && this._queue.size === 0) {\n return;\n }\n\n return new Promise(resolve => {\n const existingResolve = this._resolveIdle;\n\n this._resolveIdle = () => {\n existingResolve();\n resolve();\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// 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 updateSuspenseListComponent(current, workInProgress, renderLanes) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.flags |= DidCapture;\n } else {\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // In legacy mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current, workInProgress, renderLanes) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.flags |= DidCapture;\n } else {\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // In legacy mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current, workInProgress, renderLanes) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.flags |= DidCapture;\n } else {\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // In legacy mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current, workInProgress, renderLanes) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.flags |= DidCapture;\n } else {\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // In legacy mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}","function updateSuspenseListComponent(current, workInProgress, renderLanes) {\n var nextProps = workInProgress.pendingProps;\n var revealOrder = nextProps.revealOrder;\n var tailMode = nextProps.tail;\n var newChildren = nextProps.children;\n validateRevealOrder(revealOrder);\n validateTailOptions(tailMode, revealOrder);\n validateSuspenseListChildren(newChildren, revealOrder);\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\n var suspenseContext = suspenseStackCursor.current;\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n if (shouldForceFallback) {\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n workInProgress.flags |= DidCapture;\n } else {\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\n\n if (didSuspendBefore) {\n // If we previously forced a fallback, we need to schedule work\n // on any nested boundaries to let them know to try to render\n // again. This is the same as context updating.\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\n }\n\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n }\n\n pushSuspenseContext(workInProgress, suspenseContext);\n\n if ((workInProgress.mode & BlockingMode) === NoMode) {\n // In legacy mode, SuspenseList doesn't work so we just\n // use make it a noop by treating it as the default revealOrder.\n workInProgress.memoizedState = null;\n } else {\n switch (revealOrder) {\n case 'forwards':\n {\n var lastContentRow = findLastContentRow(workInProgress.child);\n var tail;\n\n if (lastContentRow === null) {\n // The whole list is part of the tail.\n // TODO: We could fast path by just rendering the tail now.\n tail = workInProgress.child;\n workInProgress.child = null;\n } else {\n // Disconnect the tail rows after the content row.\n // We're going to render them separately later.\n tail = lastContentRow.sibling;\n lastContentRow.sibling = null;\n }\n\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'backwards':\n {\n // We're going to find the first row that has existing content.\n // At the same time we're going to reverse the list of everything\n // we pass in the meantime. That's going to be our tail in reverse\n // order.\n var _tail = null;\n var row = workInProgress.child;\n workInProgress.child = null;\n\n while (row !== null) {\n var currentRow = row.alternate; // New rows can't be content rows.\n\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n // This is the beginning of the main content.\n workInProgress.child = row;\n break;\n }\n\n var nextRow = row.sibling;\n row.sibling = _tail;\n _tail = row;\n row = nextRow;\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n initSuspenseListRenderState(workInProgress, true, // isBackwards\n _tail, null, // last\n tailMode, workInProgress.lastEffect);\n break;\n }\n\n case 'together':\n {\n initSuspenseListRenderState(workInProgress, false, // isBackwards\n null, // tail\n null, // last\n undefined, workInProgress.lastEffect);\n break;\n }\n\n default:\n {\n // The default reveal order is the same as not having\n // a boundary.\n workInProgress.memoizedState = null;\n }\n }\n }\n\n return workInProgress.child;\n}"],"string":"[\n \"if (\\n workInProgressSuspendedReason === SuspendedOnData &&\\n workInProgressRoot === root\\n ) {\\n // Mark the root as ready to continue rendering.\\n workInProgressSuspendedReason = SuspendedAndReadyToContinue;\\n }\",\n \"async _enqueueUpdate(){// Mark state updating...\\nthis._updateState=this._updateState|STATE_UPDATE_REQUESTED;let resolve,reject;const previousUpdatePromise=this._updatePromise;this._updatePromise=new Promise((res,rej)=>{resolve=res;reject=rej});try{// Ensure any previous update has resolved before updating.\\n// This `await` also ensures that property changes are batched.\\nawait previousUpdatePromise}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// Make sure the element has connected before updating.\\nif(!this._hasConnected){await new Promise(res=>this._hasConnectedResolver=res)}try{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(null!=result){await result}}catch(e){reject(e)}resolve(!this._hasRequestedUpdate)}\",\n \"async _enqueueUpdate(){this._updateState|=STATE_UPDATE_REQUESTED;let e,t;const n=this._updatePromise;this._updatePromise=new Promise((n,r)=>{e=n,t=r});try{// Ensure any previous update has resolved before updating.\\n// This `await` also ensures that property changes are batched.\\nawait n}catch(t){}// 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// Make sure the element has connected before updating.\\nthis._hasConnected||(await new Promise(e=>this._hasConnectedResolver=e));try{const e=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.\\nnull!=e&&(await e)}catch(n){t(n)}e(!this._hasRequestedUpdate)}\",\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 \"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 waitForUpdate(inspector) {\\n return inspector.once(\\\"layoutview-updated\\\");\\n}\",\n \"if (rootWithPendingPassiveEffects !== null) {\\n // Cache the root since rootWithPendingPassiveEffects is cleared in\\n // flushPassiveEffectsImpl\\n const root = rootWithPendingPassiveEffects;\\n // Cache and clear the remaining lanes flag; it must be reset since this\\n // method can be called from various places, not always from commitRoot\\n // where the remaining lanes are known\\n const remainingLanes = pendingPassiveEffectsRemainingLanes;\\n pendingPassiveEffectsRemainingLanes = NoLanes;\\n\\n const renderPriority = lanesToEventPriority(pendingPassiveEffectsLanes);\\n const priority = lowerEventPriority(DefaultEventPriority, renderPriority);\\n const prevTransition = ReactCurrentBatchConfig.transition;\\n const previousPriority = getCurrentUpdatePriority();\\n\\n try {\\n ReactCurrentBatchConfig.transition = null;\\n setCurrentUpdatePriority(priority);\\n return flushPassiveEffectsImpl();\\n } finally {\\n setCurrentUpdatePriority(previousPriority);\\n ReactCurrentBatchConfig.transition = prevTransition;\\n\\n // Once passive effects have run for the tree - giving components a\\n // chance to retain cache instances they use - release the pooled\\n // cache at the root (if there is one)\\n releaseRootPooledCache(root, remainingLanes);\\n }\\n }\",\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 \"async _enqueueUpdate() {\\n // Mark state updating...\\n this._updateState = this._updateState | STATE_UPDATE_REQUESTED;\\n let resolve;\\n const previousUpdatePromise = this._updatePromise;\\n this._updatePromise = new Promise((res) => resolve = res);\\n // Ensure any previous update has resolved before updating.\\n // This `await` also ensures that property changes are batched.\\n await previousUpdatePromise;\\n // Make sure the element has connected before updating.\\n if (!this._hasConnected) {\\n await new Promise((res) => this._hasConnectedResolver = res);\\n }\\n // Allow `performUpdate` to be asynchronous to enable scheduling of updates.\\n const result = this.performUpdate();\\n // Note, this is to avoid delaying an additional microtask unless we need\\n // to.\\n if (result != null &&\\n typeof result.then === 'function') {\\n await result;\\n }\\n resolve(!this._hasRequestedUpdate);\\n }\",\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 \"function updatePromo() { }\",\n \"function enterModificationReal() {\\n suspendEvents += 1;\\n }\",\n \"function enterModificationReal() {\\n suspendEvents += 1;\\n }\",\n \"function _innerUpdate() {\\n if (playback.state.value == Playback$STATE_NORMAL) {\\n checkForSafeBufferLevel();\\n }\\n }\",\n \"async performUpdate() {\\n await new Promise((resolve) => requestAnimationFrame(() => resolve()));\\n super.performUpdate();\\n }\",\n \"function markUpdateTimeFromFiberToRoot(fiber,expirationTime){// Update the source fiber's expiration time\\nif(fiber.expirationTime<expirationTime){fiber.expirationTime=expirationTime;}var alternate=fiber.alternate;if(alternate!==null&&alternate.expirationTime<expirationTime){alternate.expirationTime=expirationTime;}// Walk the parent path to the root and update the child expiration time.\\nvar node=fiber[\\\"return\\\"];var root=null;if(node===null&&fiber.tag===HostRoot){root=fiber.stateNode;}else{while(node!==null){alternate=node.alternate;if(node.childExpirationTime<expirationTime){node.childExpirationTime=expirationTime;if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}}else if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}if(node[\\\"return\\\"]===null&&node.tag===HostRoot){root=node.stateNode;break;}node=node[\\\"return\\\"];}}if(root!==null){if(workInProgressRoot===root){// Received an update to a tree that's in the middle of rendering. Mark\\n// that's unprocessed work on this root.\\nmarkUnprocessedUpdateTime(expirationTime);if(workInProgressRootExitStatus===RootSuspendedWithDelay){// The root already suspended with a delay, which means this render\\n// definitely won't finish. Since we have a new update, let's mark it as\\n// suspended now, right before marking the incoming update. This has the\\n// effect of interrupting the current render and switching to the update.\\n// TODO: This happens to work when receiving an update during the render\\n// phase, because of the trick inside computeExpirationForFiber to\\n// subtract 1 from `renderExpirationTime` to move it into a\\n// separate bucket. But we should probably model it with an exception,\\n// using the same mechanism we use to force hydration of a subtree.\\n// TODO: This does not account for low pri updates that were already\\n// scheduled before the root started rendering. Need to track the next\\n// pending expiration time (perhaps by backtracking the return path) and\\n// then trigger a restart in the `renderDidSuspendDelayIfPossible` path.\\nmarkRootSuspendedAtTime(root,renderExpirationTime$1);}}// Mark that the root has a pending update.\\nmarkRootUpdatedAtTime(root,expirationTime);}return root;}\",\n \"componentDidUpdate(){\\n this.pageScrollTo();\\n\\n //automated pre render\\n if( this.state.isLoaded && window.c && window.c.length > 2 ){\\n console.log( \\\"Pre-rendering...\\\" );\\n\\n //Prerender.writeHTMLPrerender();\\n this.shouldPreRender({mainPageRendered: true});\\n }\\n }\",\n \"function markUpdateTimeFromFiberToRoot(fiber,expirationTime){// Update the source fiber's expiration time\\nif(fiber.expirationTime<expirationTime){fiber.expirationTime=expirationTime;}var alternate=fiber.alternate;if(alternate!==null&&alternate.expirationTime<expirationTime){alternate.expirationTime=expirationTime;}// Walk the parent path to the root and update the child expiration time.\\nvar node=fiber.return;var root=null;if(node===null&&fiber.tag===HostRoot){root=fiber.stateNode;}else{while(node!==null){alternate=node.alternate;if(node.childExpirationTime<expirationTime){node.childExpirationTime=expirationTime;if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}}else if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}if(node.return===null&&node.tag===HostRoot){root=node.stateNode;break;}node=node.return;}}if(root!==null){if(workInProgressRoot===root){// Received an update to a tree that's in the middle of rendering. Mark\\n// that's unprocessed work on this root.\\nmarkUnprocessedUpdateTime(expirationTime);if(workInProgressRootExitStatus===RootSuspendedWithDelay){// The root already suspended with a delay, which means this render\\n// definitely won't finish. Since we have a new update, let's mark it as\\n// suspended now, right before marking the incoming update. This has the\\n// effect of interrupting the current render and switching to the update.\\n// TODO: This happens to work when receiving an update during the render\\n// phase, because of the trick inside computeExpirationForFiber to\\n// subtract 1 from `renderExpirationTime` to move it into a\\n// separate bucket. But we should probably model it with an exception,\\n// using the same mechanism we use to force hydration of a subtree.\\n// TODO: This does not account for low pri updates that were already\\n// scheduled before the root started rendering. Need to track the next\\n// pending expiration time (perhaps by backtracking the return path) and\\n// then trigger a restart in the `renderDidSuspendDelayIfPossible` path.\\nmarkRootSuspendedAtTime(root,renderExpirationTime$1);}}// Mark that the root has a pending update.\\nmarkRootUpdatedAtTime(root,expirationTime);}return root;}\",\n \"function markUpdateTimeFromFiberToRoot(fiber,expirationTime){// Update the source fiber's expiration time\\nif(fiber.expirationTime<expirationTime){fiber.expirationTime=expirationTime;}var alternate=fiber.alternate;if(alternate!==null&&alternate.expirationTime<expirationTime){alternate.expirationTime=expirationTime;}// Walk the parent path to the root and update the child expiration time.\\nvar node=fiber.return;var root=null;if(node===null&&fiber.tag===HostRoot){root=fiber.stateNode;}else{while(node!==null){alternate=node.alternate;if(node.childExpirationTime<expirationTime){node.childExpirationTime=expirationTime;if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}}else if(alternate!==null&&alternate.childExpirationTime<expirationTime){alternate.childExpirationTime=expirationTime;}if(node.return===null&&node.tag===HostRoot){root=node.stateNode;break;}node=node.return;}}if(root!==null){if(workInProgressRoot===root){// Received an update to a tree that's in the middle of rendering. Mark\\n// that's unprocessed work on this root.\\nmarkUnprocessedUpdateTime(expirationTime);if(workInProgressRootExitStatus===RootSuspendedWithDelay){// The root already suspended with a delay, which means this render\\n// definitely won't finish. Since we have a new update, let's mark it as\\n// suspended now, right before marking the incoming update. This has the\\n// effect of interrupting the current render and switching to the update.\\n// TODO: This happens to work when receiving an update during the render\\n// phase, because of the trick inside computeExpirationForFiber to\\n// subtract 1 from `renderExpirationTime` to move it into a\\n// separate bucket. But we should probably model it with an exception,\\n// using the same mechanism we use to force hydration of a subtree.\\n// TODO: This does not account for low pri updates that were already\\n// scheduled before the root started rendering. Need to track the next\\n// pending expiration time (perhaps by backtracking the return path) and\\n// then trigger a restart in the `renderDidSuspendDelayIfPossible` path.\\nmarkRootSuspendedAtTime(root,renderExpirationTime$1);}}// Mark that the root has a pending update.\\nmarkRootUpdatedAtTime(root,expirationTime);}return root;}\",\n \"function enterModificationReal() {\\n\\t suspendEvents += 1;\\n\\t }\",\n \"function enterModificationReal() {\\n\\t suspendEvents += 1;\\n\\t }\",\n \"discoverWork_() {\\n // TODO(dvoytenko): vsync separation may be needed for different phases\\n\\n const now = this.win.Date.now();\\n\\n // Ensure all resources layout phase complete; when relayoutAll is requested\\n // force re-layout.\\n const {\\n elementsThatScrolled_: elementsThatScrolled,\\n relayoutAll_: relayoutAll,\\n relayoutTop_: relayoutTop,\\n } = this;\\n this.relayoutAll_ = false;\\n this.relayoutTop_ = -1;\\n\\n // Phase 1: Build and relayout as needed. All mutations happen here.\\n let relayoutCount = 0;\\n let remeasureCount = 0;\\n for (let i = 0; i < this.resources_.length; i++) {\\n const r = this.resources_[i];\\n if (\\n r.getState() == ResourceState_Enum.NOT_BUILT &&\\n !r.isBuilding() &&\\n !r.element.R1()\\n ) {\\n this.buildOrScheduleBuildForResource_(r, /* checkForDupes */ true);\\n }\\n\\n if (\\n relayoutAll ||\\n !r.hasBeenMeasured() ||\\n // NOT_LAID_OUT is the state after build() but before measure().\\n r.getState() == ResourceState_Enum.NOT_LAID_OUT\\n ) {\\n relayoutCount++;\\n }\\n if (r.isMeasureRequested()) {\\n remeasureCount++;\\n }\\n }\\n\\n // Phase 2: Remeasure if there were any relayouts. Unfortunately, currently\\n // there's no way to optimize this. All reads happen here.\\n let toUnload;\\n if (\\n relayoutCount > 0 ||\\n remeasureCount > 0 ||\\n relayoutAll ||\\n relayoutTop != -1 ||\\n elementsThatScrolled.length > 0\\n ) {\\n for (let i = 0; i < this.resources_.length; i++) {\\n const r = this.resources_[i];\\n if ((r.hasOwner() && !r.isMeasureRequested()) || r.element.R1()) {\\n // If element has owner, and measure is not requested, do nothing.\\n continue;\\n }\\n let needsMeasure =\\n relayoutAll ||\\n r.getState() == ResourceState_Enum.NOT_LAID_OUT ||\\n !r.hasBeenMeasured() ||\\n r.isMeasureRequested() ||\\n (relayoutTop != -1 && r.getLayoutBox().bottom >= relayoutTop);\\n\\n if (!needsMeasure) {\\n for (let i = 0; i < elementsThatScrolled.length; i++) {\\n // TODO(jridgewell): Need to figure out how ShadowRoots and FIEs\\n // should behave in this model. If the ShadowRoot's host scrolls,\\n // do we need to invalidate inside the shadow or light tree? Or if\\n // the FIE's iframe parent scrolls, do we?\\n if (elementsThatScrolled[i].contains(r.element)) {\\n needsMeasure = true;\\n break;\\n }\\n }\\n }\\n\\n if (needsMeasure) {\\n const isDisplayed = this.measureResource_(r);\\n if (!isDisplayed) {\\n if (!toUnload) {\\n toUnload = [];\\n }\\n toUnload.push(r);\\n }\\n }\\n }\\n }\\n elementsThatScrolled.length = 0;\\n\\n // Unload all in one cycle.\\n if (toUnload) {\\n this.unloadResources_(toUnload);\\n }\\n\\n const viewportRect = this.viewport_.getRect();\\n // Load viewport = viewport + 3x up/down when document is visible.\\n let loadRect;\\n if (this.visible_) {\\n loadRect = expandLayoutRect(viewportRect, 0.25, 2);\\n } else {\\n loadRect = viewportRect;\\n }\\n\\n const visibleRect = this.visible_\\n ? // When the doc is visible, consider the viewport to be 25% larger,\\n // to minimize effect from small scrolling and notify things that\\n // they are in viewport just before they are actually visible.\\n expandLayoutRect(viewportRect, 0.25, 0.25)\\n : viewportRect;\\n\\n // Phase 3: Set inViewport status for resources.\\n for (let i = 0; i < this.resources_.length; i++) {\\n const r = this.resources_[i];\\n if (\\n r.getState() == ResourceState_Enum.NOT_BUILT ||\\n r.hasOwner() ||\\n r.element.R1()\\n ) {\\n continue;\\n }\\n // Note that when the document is not visible, neither are any of its\\n // elements to reduce CPU cycles.\\n // TODO(dvoytenko, #3434): Reimplement the use of `isFixed` with\\n // layers. This is currently a short-term fix to the problem that\\n // the fixed elements get incorrect top coord.\\n const shouldBeInViewport =\\n this.visible_ && r.isDisplayed() && r.overlaps(visibleRect);\\n r.setInViewport(shouldBeInViewport);\\n }\\n\\n // Phase 4: Schedule elements for layout within a reasonable distance from\\n // current viewport.\\n if (loadRect) {\\n for (let i = 0; i < this.resources_.length; i++) {\\n const r = this.resources_[i];\\n // TODO(dvoytenko): This extra build has to be merged with the\\n // scheduleLayoutOrPreload method below.\\n // Build all resources visible, measured, and in the viewport.\\n if (\\n !r.isBuilt() &&\\n !r.isBuilding() &&\\n !r.hasOwner() &&\\n !r.element.R1() &&\\n r.hasBeenMeasured() &&\\n r.isDisplayed() &&\\n r.overlaps(loadRect)\\n ) {\\n this.buildOrScheduleBuildForResource_(\\n r,\\n /* checkForDupes */ true,\\n /* ignoreQuota */ true\\n );\\n }\\n if (\\n r.getState() != ResourceState_Enum.READY_FOR_LAYOUT ||\\n r.hasOwner()\\n ) {\\n continue;\\n }\\n // TODO(dvoytenko, #3434): Reimplement the use of `isFixed` with\\n // layers. This is currently a short-term fix to the problem that\\n // the fixed elements get incorrect top coord.\\n if (r.isDisplayed() && r.overlaps(loadRect)) {\\n this.scheduleLayoutOrPreload(r, /* layout */ true);\\n }\\n }\\n }\\n\\n if (this.visible_ && this.isIdle_(now)) {\\n // Phase 5: Idle Render Outside Viewport layout: layout up to 4 items\\n // with idleRenderOutsideViewport true\\n let idleScheduledCount = 0;\\n for (\\n let i = 0;\\n i < this.resources_.length && idleScheduledCount < 4;\\n i++\\n ) {\\n const r = this.resources_[i];\\n if (\\n r.getState() == ResourceState_Enum.READY_FOR_LAYOUT &&\\n !r.hasOwner() &&\\n !r.element.R1() &&\\n r.isDisplayed() &&\\n r.idleRenderOutsideViewport()\\n ) {\\n dev().fine(TAG_, 'idleRenderOutsideViewport layout:', r.debugid);\\n this.scheduleLayoutOrPreload(r, /* layout */ false);\\n idleScheduledCount++;\\n }\\n }\\n // Phase 6: Idle layout: layout more if we are otherwise not doing much.\\n // TODO(dvoytenko): document/estimate IDLE timeouts and other constants\\n for (\\n let i = 0;\\n i < this.resources_.length && idleScheduledCount < 4;\\n i++\\n ) {\\n const r = this.resources_[i];\\n if (\\n r.getState() == ResourceState_Enum.READY_FOR_LAYOUT &&\\n !r.hasOwner() &&\\n !r.element.R1() &&\\n r.isDisplayed()\\n ) {\\n dev().fine(TAG_, 'idle layout:', r.debugid);\\n this.scheduleLayoutOrPreload(r, /* layout */ false);\\n idleScheduledCount++;\\n }\\n }\\n }\\n }\",\n \"doUpdate () {\\n\\t\\tif (! this.isDisplayConditionActive) {\\n\\t\\t\\tthis.setPaused (false);\\n\\t\\t\\tthis.clearStage ();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tconst monitorstatus = App.systemAgent.agentControl.getLocalAgent ().lastStatus.monitorServerStatus;\\n\\t\\tif ((typeof monitorstatus != \\\"object\\\") || (monitorstatus == null)) {\\n\\t\\t\\tthis.setPaused (false);\\n\\t\\t\\tthis.clearStage ();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tthis.monitorStatus = monitorstatus;\\n\\t\\tif (this.stage == \\\"\\\") {\\n\\t\\t\\tthis.setStage (Initializing);\\n\\t\\t}\\n\\t}\",\n \"update() {\\n this.poll();\\n }\",\n \"async _enqueueUpdate() {\\n // Mark state updating...\\n this._updateState = this._updateState | STATE_UPDATE_REQUESTED;\\n let resolve;\\n let reject;\\n const previousUpdatePromise = this._updatePromise;\\n this._updatePromise = new Promise((res, rej) => {\\n resolve = res;\\n reject = rej;\\n });\\n try {\\n // Ensure any previous update has resolved before updating.\\n // This `await` also ensures that property changes are batched.\\n await previousUpdatePromise;\\n }\\n catch (e) {\\n // 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 }\\n // Make sure the element has connected before updating.\\n if (!this._hasConnected) {\\n await new Promise((res) => this._hasConnectedResolver = res);\\n }\\n try {\\n const result = this.performUpdate();\\n // 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.\\n if (result != null) {\\n await result;\\n }\\n }\\n catch (e) {\\n reject(e);\\n }\\n resolve(!this._hasRequestedUpdate);\\n }\",\n \"if (\\n rootWithPendingPassiveEffects !== null &&\\n rootWithPendingPassiveEffects.tag === LegacyRoot &&\\n (executionContext & (RenderContext | CommitContext)) === NoContext\\n ) {\\n flushPassiveEffects();\\n }\",\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;}\",\n \"componentDidUpdate(prevProps) {\\n // const { checkExtensionLockStatus } = this.props;\\n // checkExtensionLockStatus().then(() => {\\n this.fetchData(prevProps);\\n // });\\n }\",\n \"whenRemoteResponsive () {\\n return new Promise(function (resolve) {\\n setTimeout(resolve, 100);\\n })\\n }\",\n \"_notifyRenderer() {\\n this.renderer.notify();\\n }\",\n \"function ensureRootIsScheduled(root){var lastExpiredTime=root.lastExpiredTime;if(lastExpiredTime!==NoWork){// Special case: Expired work should flush synchronously.\\nroot.callbackExpirationTime=Sync;root.callbackPriority=ImmediatePriority;root.callbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));return;}var expirationTime=getNextRootExpirationTimeToWorkOn(root);var existingCallbackNode=root.callbackNode;if(expirationTime===NoWork){// There's nothing to work on.\\nif(existingCallbackNode!==null){root.callbackNode=null;root.callbackExpirationTime=NoWork;root.callbackPriority=NoPriority;}return;}// TODO: If this is an update, we already read the current time. Pass the\\n// time as an argument.\\nvar currentTime=requestCurrentTimeForUpdate();var priorityLevel=inferPriorityFromExpirationTime(currentTime,expirationTime);// If there's an existing render task, confirm it has the correct priority and\\n// expiration time. Otherwise, we'll cancel it and schedule a new one.\\nif(existingCallbackNode!==null){var existingCallbackPriority=root.callbackPriority;var existingCallbackExpirationTime=root.callbackExpirationTime;if(// Callback must have the exact same expiration time.\\nexistingCallbackExpirationTime===expirationTime&&// Callback must have greater or equal priority.\\nexistingCallbackPriority>=priorityLevel){// Existing callback is sufficient.\\nreturn;}// Need to schedule a new task.\\n// TODO: Instead of scheduling a new task, we should be able to change the\\n// priority of the existing one.\\ncancelCallback(existingCallbackNode);}root.callbackExpirationTime=expirationTime;root.callbackPriority=priorityLevel;var callbackNode;if(expirationTime===Sync){// Sync React callbacks are scheduled on a special internal queue\\ncallbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));}else{callbackNode=scheduleCallback(priorityLevel,performConcurrentWorkOnRoot.bind(null,root),// Compute a task timeout based on the expiration time. This also affects\\n// ordering because tasks are processed in timeout order.\\n{timeout:expirationTimeToMs(expirationTime)-now()});}root.callbackNode=callbackNode;}// This is the entry point for every concurrent task, i.e. anything that\",\n \"function ensureRootIsScheduled(root){var lastExpiredTime=root.lastExpiredTime;if(lastExpiredTime!==NoWork){// Special case: Expired work should flush synchronously.\\nroot.callbackExpirationTime=Sync;root.callbackPriority=ImmediatePriority;root.callbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));return;}var expirationTime=getNextRootExpirationTimeToWorkOn(root);var existingCallbackNode=root.callbackNode;if(expirationTime===NoWork){// There's nothing to work on.\\nif(existingCallbackNode!==null){root.callbackNode=null;root.callbackExpirationTime=NoWork;root.callbackPriority=NoPriority;}return;}// TODO: If this is an update, we already read the current time. Pass the\\n// time as an argument.\\nvar currentTime=requestCurrentTimeForUpdate();var priorityLevel=inferPriorityFromExpirationTime(currentTime,expirationTime);// If there's an existing render task, confirm it has the correct priority and\\n// expiration time. Otherwise, we'll cancel it and schedule a new one.\\nif(existingCallbackNode!==null){var existingCallbackPriority=root.callbackPriority;var existingCallbackExpirationTime=root.callbackExpirationTime;if(// Callback must have the exact same expiration time.\\nexistingCallbackExpirationTime===expirationTime&&// Callback must have greater or equal priority.\\nexistingCallbackPriority>=priorityLevel){// Existing callback is sufficient.\\nreturn;}// Need to schedule a new task.\\n// TODO: Instead of scheduling a new task, we should be able to change the\\n// priority of the existing one.\\ncancelCallback(existingCallbackNode);}root.callbackExpirationTime=expirationTime;root.callbackPriority=priorityLevel;var callbackNode;if(expirationTime===Sync){// Sync React callbacks are scheduled on a special internal queue\\ncallbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));}else{callbackNode=scheduleCallback(priorityLevel,performConcurrentWorkOnRoot.bind(null,root),// Compute a task timeout based on the expiration time. This also affects\\n// ordering because tasks are processed in timeout order.\\n{timeout:expirationTimeToMs(expirationTime)-now()});}root.callbackNode=callbackNode;}// This is the entry point for every concurrent task, i.e. anything that\",\n \"function ensureRootIsScheduled(root){var lastExpiredTime=root.lastExpiredTime;if(lastExpiredTime!==NoWork){// Special case: Expired work should flush synchronously.\\nroot.callbackExpirationTime=Sync;root.callbackPriority=ImmediatePriority;root.callbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));return;}var expirationTime=getNextRootExpirationTimeToWorkOn(root);var existingCallbackNode=root.callbackNode;if(expirationTime===NoWork){// There's nothing to work on.\\nif(existingCallbackNode!==null){root.callbackNode=null;root.callbackExpirationTime=NoWork;root.callbackPriority=NoPriority;}return;}// TODO: If this is an update, we already read the current time. Pass the\\n// time as an argument.\\nvar currentTime=requestCurrentTimeForUpdate();var priorityLevel=inferPriorityFromExpirationTime(currentTime,expirationTime);// If there's an existing render task, confirm it has the correct priority and\\n// expiration time. Otherwise, we'll cancel it and schedule a new one.\\nif(existingCallbackNode!==null){var existingCallbackPriority=root.callbackPriority;var existingCallbackExpirationTime=root.callbackExpirationTime;if(// Callback must have the exact same expiration time.\\nexistingCallbackExpirationTime===expirationTime&&// Callback must have greater or equal priority.\\nexistingCallbackPriority>=priorityLevel){// Existing callback is sufficient.\\nreturn;}// Need to schedule a new task.\\n// TODO: Instead of scheduling a new task, we should be able to change the\\n// priority of the existing one.\\ncancelCallback(existingCallbackNode);}root.callbackExpirationTime=expirationTime;root.callbackPriority=priorityLevel;var callbackNode;if(expirationTime===Sync){// Sync React callbacks are scheduled on a special internal queue\\ncallbackNode=scheduleSyncCallback(performSyncWorkOnRoot.bind(null,root));}else{callbackNode=scheduleCallback(priorityLevel,performConcurrentWorkOnRoot.bind(null,root),// Compute a task timeout based on the expiration time. This also affects\\n// ordering because tasks are processed in timeout order.\\n{timeout:expirationTimeToMs(expirationTime)-now()});}root.callbackNode=callbackNode;}// This is the entry point for every concurrent task, i.e. anything that\",\n \"function processQueue(){if(updateQueue.length){ReactComponentEnvironment.processChildrenUpdates(updateQueue,markupQueue);clearQueue();}}\",\n \"function processQueue(){if(updateQueue.length){ReactComponentEnvironment.processChildrenUpdates(updateQueue,markupQueue);clearQueue();}}\",\n \"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\\n// so those are false.\\nreturn workInProgressRootExitStatus===RootIncomplete;}\",\n \"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\\n// so those are false.\\nreturn workInProgressRootExitStatus===RootIncomplete;}\",\n \"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\\n// so those are false.\\nreturn workInProgressRootExitStatus===RootIncomplete;}\",\n \"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\\n// so those are false.\\nreturn workInProgressRootExitStatus===RootIncomplete;}\",\n \"function renderHasNotSuspendedYet(){// If something errored or completed, we can't really be sure,\\n// so those are false.\\nreturn workInProgressRootExitStatus===RootIncomplete;}\",\n \"async __enqueueUpdate() {\\n this.isUpdatePending = true;\\n try {\\n await this.__updatePromise;\\n } catch (e) {\\n Promise.reject(e);\\n }\\n const result2 = this.scheduleUpdate();\\n if (result2 != null) {\\n await result2;\\n }\\n return !this.isUpdatePending;\\n }\",\n \"_onScreen() {\\n return this.arena;\\n }\",\n \"function updateSuspenseListComponent(current,workInProgress,renderExpirationTime){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderExpirationTime);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.effectTag|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.effectTag&DidCapture)!==NoEffect;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\\n// on any nested boundaries to let them know to try to render\\n// again. This is the same as context updating.\\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderExpirationTime);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// Outside of blocking mode, SuspenseList doesn't work so we just\\n// use make it a noop by treating it as the default revealOrder.\\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\\n// TODO: We could fast path by just rendering the tail now.\\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\\n// We're going to render them separately later.\\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\\n// At the same time we're going to reverse the list of everything\\n// we pass in the meantime. That's going to be our tail in reverse\\n// order.\\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\\n_tail,null,// last\\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\\nnull,// tail\\nnull,// last\\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\\n// a boundary.\\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}\",\n \"function updateSuspenseListComponent(current,workInProgress,renderExpirationTime){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderExpirationTime);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.effectTag|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.effectTag&DidCapture)!==NoEffect;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\\n// on any nested boundaries to let them know to try to render\\n// again. This is the same as context updating.\\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderExpirationTime);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// Outside of blocking mode, SuspenseList doesn't work so we just\\n// use make it a noop by treating it as the default revealOrder.\\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\\n// TODO: We could fast path by just rendering the tail now.\\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\\n// We're going to render them separately later.\\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\\n// At the same time we're going to reverse the list of everything\\n// we pass in the meantime. That's going to be our tail in reverse\\n// order.\\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\\n_tail,null,// last\\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\\nnull,// tail\\nnull,// last\\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\\n// a boundary.\\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}\",\n \"function updateSuspenseListComponent(current,workInProgress,renderExpirationTime){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderExpirationTime);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.effectTag|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.effectTag&DidCapture)!==NoEffect;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\\n// on any nested boundaries to let them know to try to render\\n// again. This is the same as context updating.\\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderExpirationTime);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// Outside of blocking mode, SuspenseList doesn't work so we just\\n// use make it a noop by treating it as the default revealOrder.\\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\\n// TODO: We could fast path by just rendering the tail now.\\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\\n// We're going to render them separately later.\\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\\n// At the same time we're going to reverse the list of everything\\n// we pass in the meantime. That's going to be our tail in reverse\\n// order.\\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\\n_tail,null,// last\\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\\nnull,// tail\\nnull,// last\\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\\n// a boundary.\\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}\",\n \"function updateSuspenseListComponent(current,workInProgress,renderLanes){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderLanes);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.flags|=DidCapture;}else{var didSuspendBefore=current!==null&&(current.flags&DidCapture)!==NoFlags;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\\n// on any nested boundaries to let them know to try to render\\n// again. This is the same as context updating.\\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderLanes);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// In legacy mode, SuspenseList doesn't work so we just\\n// use make it a noop by treating it as the default revealOrder.\\nworkInProgress.memoizedState=null;}else{switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\\n// TODO: We could fast path by just rendering the tail now.\\ntail=workInProgress.child;workInProgress.child=null;}else{// Disconnect the tail rows after the content row.\\n// We're going to render them separately later.\\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\\n// At the same time we're going to reverse the list of everything\\n// we pass in the meantime. That's going to be our tail in reverse\\n// order.\\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\\n_tail,null,// last\\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\\nnull,// tail\\nnull,// last\\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\\n// a boundary.\\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}\",\n \"function updateSuspenseListComponent(current,workInProgress,renderLanes){var nextProps=workInProgress.pendingProps;var revealOrder=nextProps.revealOrder;var tailMode=nextProps.tail;var newChildren=nextProps.children;validateRevealOrder(revealOrder);validateTailOptions(tailMode,revealOrder);validateSuspenseListChildren(newChildren,revealOrder);reconcileChildren(current,workInProgress,newChildren,renderLanes);var suspenseContext=suspenseStackCursor.current;var shouldForceFallback=hasSuspenseContext(suspenseContext,ForceSuspenseFallback);if(shouldForceFallback){suspenseContext=setShallowSuspenseContext(suspenseContext,ForceSuspenseFallback);workInProgress.flags|=DidCapture;}else {var didSuspendBefore=current!==null&&(current.flags&DidCapture)!==NoFlags;if(didSuspendBefore){// If we previously forced a fallback, we need to schedule work\\n// on any nested boundaries to let them know to try to render\\n// again. This is the same as context updating.\\npropagateSuspenseContextChange(workInProgress,workInProgress.child,renderLanes);}suspenseContext=setDefaultShallowSuspenseContext(suspenseContext);}pushSuspenseContext(workInProgress,suspenseContext);if((workInProgress.mode&BlockingMode)===NoMode){// In legacy mode, SuspenseList doesn't work so we just\\n// use make it a noop by treating it as the default revealOrder.\\nworkInProgress.memoizedState=null;}else {switch(revealOrder){case'forwards':{var lastContentRow=findLastContentRow(workInProgress.child);var tail;if(lastContentRow===null){// The whole list is part of the tail.\\n// TODO: We could fast path by just rendering the tail now.\\ntail=workInProgress.child;workInProgress.child=null;}else {// Disconnect the tail rows after the content row.\\n// We're going to render them separately later.\\ntail=lastContentRow.sibling;lastContentRow.sibling=null;}initSuspenseListRenderState(workInProgress,false,// isBackwards\\ntail,lastContentRow,tailMode,workInProgress.lastEffect);break;}case'backwards':{// We're going to find the first row that has existing content.\\n// At the same time we're going to reverse the list of everything\\n// we pass in the meantime. That's going to be our tail in reverse\\n// order.\\nvar _tail=null;var row=workInProgress.child;workInProgress.child=null;while(row!==null){var currentRow=row.alternate;// New rows can't be content rows.\\nif(currentRow!==null&&findFirstSuspended(currentRow)===null){// This is the beginning of the main content.\\nworkInProgress.child=row;break;}var nextRow=row.sibling;row.sibling=_tail;_tail=row;row=nextRow;}// TODO: If workInProgress.child is null, we can continue on the tail immediately.\\ninitSuspenseListRenderState(workInProgress,true,// isBackwards\\n_tail,null,// last\\ntailMode,workInProgress.lastEffect);break;}case'together':{initSuspenseListRenderState(workInProgress,false,// isBackwards\\nnull,// tail\\nnull,// last\\nundefined,workInProgress.lastEffect);break;}default:{// The default reveal order is the same as not having\\n// a boundary.\\nworkInProgress.memoizedState=null;}}}return workInProgress.child;}\",\n \"_ensurePowerOnState() {\\n\\t\\treturn new Promise(resolve => {\\n\\t\\t\\tif (noble.state === 'poweredOn') {\\n\\t\\t\\t\\tresolve();\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\n\\t\\t\\tlogDebug('waiting for adapter state change');\\n\\t\\t\\tnoble.on('stateChange', state => {\\n\\t\\t\\t\\tif (state === 'poweredOn') {\\n\\t\\t\\t\\t\\tresolve();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t});\\n\\t}\",\n \"async function lockPromise() {\\n await document.documentElement.requestFullscreen();\\n const value = await screen.orientation.lock(\\\"any\\\");\\n console.log(`${value} should be undefined`);\\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 \"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 \"nextUpdate() {\\n return new Promise(updateQueue.enqueue);\\n }\",\n \"function updateAutoAttach(newState) {\\r\\n currentState = currentState.then(async ({ context, state: oldState }) => {\\r\\n if (newState === oldState) {\\r\\n return { context, state: oldState };\\r\\n }\\r\\n if (oldState !== null) {\\r\\n updateStatusBar(context, oldState, true);\\r\\n }\\r\\n await transitions[newState](context);\\r\\n isTemporarilyDisabled = false;\\r\\n updateStatusBar(context, newState, false);\\r\\n return { context, state: newState };\\r\\n });\\r\\n}\",\n \"_FBPReady() {\\n super._FBPReady();\\n // this._FBPTraceWires()\\n\\n this.updateComplete.then(() => {\\n if (window.ResizeObserver) {\\n const ro = new ResizeObserver(entries => {\\n window.requestAnimationFrame(() => {\\n for (const entry of entries) {\\n this._checkSize(entry.contentRect.width);\\n }\\n });\\n });\\n ro.observe(this);\\n } else {\\n // fallback, just listen to the resize event\\n setTimeout(() => {\\n const cr = this.getBoundingClientRect();\\n this._checkSize(cr.width);\\n }, 1);\\n\\n window.addEventListener('resize', () => {\\n const cr = this.getBoundingClientRect();\\n this._checkSize(cr.width);\\n });\\n }\\n });\\n }\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BatchedMode) === NoMode) {\\n // Outside of batched mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BatchedMode) === NoMode) {\\n // Outside of batched mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BatchedMode) === NoMode) {\\n // Outside of batched mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"componentDidUpdate() {\\n this.updateOverflow();\\n }\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // Outside of blocking mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // Outside of blocking mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // Outside of blocking mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"poll () {\\n console.log('Polling'.cyan);\\n\\n Promise\\n .all([\\n PS.get(),\\n PS.getCPUTime()\\n ])\\n .then(\\n results => {\\n try {\\n // free mem\\n this.sockets.forEach(socket => socket.emit('free mem', os.freemem()));\\n\\n let [ processes, cpu ] = results;\\n\\n this.processes = processes;\\n console.log(`Got ${processes.length} processes`.green);\\n this.broadcast('ps', processes);\\n\\n let time = cpu.totalTime - this.cpu.totalTime;\\n let idle = cpu.idleTime - this.cpu.idleTime;\\n\\n let load = ( ( time - idle ) / time );\\n\\n console.log('comparing', cpu, this.cpu, { load });\\n\\n this.cpu = cpu;\\n\\n this.cpu.load = load;\\n\\n console.log('load average', (os.loadavg()[0] / 8 * 100) + load);\\n\\n this.broadcast('cpu load', (os.loadavg()[0] / 8 * 100) + load);\\n\\n setTimeout(this.poll.bind(this), 2500);\\n }\\n catch ( error ) {\\n this.emit('error', error);\\n }\\n },\\n error => this.emit('error', error)\\n );\\n }\",\n \"_updateZOrder() {}\",\n \"function processNextUpdateRequest() {\\n if(vis_queue.length > 0) {\\n let temp = vis_queue.pop();\\n update(temp.svg, temp.pack, temp.path, temp.id, temp.cb_keyword);\\n } else {\\n hook_busy = false;\\n }\\n}\",\n \"forceRender() {\\n window.requestAnimationFrame(() => {\\n this.$forceUpdate();\\n });\\n }\",\n \"beginUpdate(){\\n if (this.nativeElement.isRendered) {\\n this.nativeElement.beginUpdate();\\n }\\n else\\n {\\n this.nativeElement.whenRendered(() => {\\n this.nativeElement.beginUpdate();\\n });\\n }\\n }\",\n \"function _innerUpdate() {\\n if (playback.state.value == Playback$STATE_NORMAL) {\\n checkForSafeBufferLevel();\\n _currentDownloaderState.update();\\n }\\n }\",\n \"suspend() {\\n if (this.state_ === WindowState.LAUNCHING) {\\n console.error('Call suspend() while window is still launching.');\\n return;\\n }\\n this.state_ = WindowState.SUSPENDING;\\n this.foregroundOps_.suspend();\\n }\",\n \"function pollForCPUInfo() {\\n chrome.system.cpu.getInfo(function(info) {\\n CPU_info = info;\\n setTimeout(pollForCPUInfo, POLL_TIME_DELAY);\\n });\\n}\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n\\n var suspenseContext = suspenseStackCursor.current;\\n\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BatchedMode) === NoMode) {\\n // Outside of batched mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail = void 0;\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode);\\n break;\\n }\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n while (row !== null) {\\n var currentRow = row.alternate;\\n // New rows can't be content rows.\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n }\\n // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode);\\n break;\\n }\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined);\\n break;\\n }\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n\\n var suspenseContext = suspenseStackCursor.current;\\n\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BatchedMode) === NoMode) {\\n // Outside of batched mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail = void 0;\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode);\\n break;\\n }\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n while (row !== null) {\\n var currentRow = row.alternate;\\n // New rows can't be content rows.\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n }\\n // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode);\\n break;\\n }\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined);\\n break;\\n }\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n return workInProgress.child;\\n}\",\n \"static tickFullUpdate() {\\n let updateParcel = {\\n text: \\\"\\\",\\n color: \\\"#d352ad\\\",\\n tooltip: \\\"\\\"\\n };\\n\\n this.refreshState()\\n .then((timerState) => {\\n console.debug('[Net]', '(API status result)', timerState);\\n\\n this.handleTimerState(timerState, updateParcel);\\n this.networkOk = true;\\n })\\n .catch((err) => {\\n console.warn('[Net]', '(API status fetch failed)', err);\\n\\n updateParcel.text = \\\"!\\\";\\n updateParcel.color = \\\"#e74c3c\\\";\\n updateParcel.tooltip = \\\"Communication error\\\";\\n\\n this.networkOk = false;\\n })\\n .then(() => {\\n this.applyBadgeConfig(updateParcel);\\n });\\n }\",\n \"forceUpdate() {\\n if (!RenderDebounce.has(this)) {\\n RenderDebounce.set(this, new Promise(resolve => setTimeout(() => {\\n RenderDebounce.delete(this);\\n\\n this.componentWillReceiveProps(this.props, this.state);\\n\\n resolve(this[$$render]());\\n })));\\n }\\n\\n return RenderDebounce.get(this);\\n }\",\n \"function safeRefreshNotifyState(state)\\n {\\n // Only update mainpage if there is no owner or we are the owner.\\n if(mainpage.dataset.owner === PANEOWNER.NONE || mainpage.dataset.owner === PANEOWNER.ATHENS) {\\n if (state === 0) {\\n mainpage.dataset.state = \\\"none\\\";\\n }\\n else {\\n if (!mainpage.dataset.state || mainpage.dataset.state === \\\"none\\\") {\\n mainpage.dataset.state = \\\"notify\\\";\\n }\\n } \\n requestParentSizeChange();\\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 \"doLoadingScreen(loadingMs){\\n var promise1 = new Promise(resolve => setTimeout(resolve, loadingMs));\\n\\n return promise1;\\n }\",\n \"function touchLastRequested(){\\n\\tlastRequestedMs = new Date().getTime();\\n\\n\\t// if it was not running, we run it\\n\\tif (!on){\\n\\t\\ton = true;\\n\\t\\tconsole.log(\\\"os-usage.js - starting top.fetch every \\\" + (delay/1000) + \\\"s\\\");\\n\\t\\ttopFetch();\\n\\t}\\n\\n}\",\n \"_suspendPresentationLayerUpdates() {\\n this._suspendCATransaction = true;\\n }\",\n \"function updateElements() { //Main loop logic here.\\r\\n updateResourceDisplay();\\r\\n updateCoreDisplay();\\r\\n}\",\n \"async update_() {\\n if (this.lockingUpdate_) {\\n if (this.pendingUpdate_) {\\n return;\\n }\\n this.pendingUpdate_ = (async () => {\\n while (this.lockingUpdate_) {\\n try {\\n await this.lockingUpdate_;\\n } catch (e) {\\n // Ignore exception from waiting for existing update.\\n }\\n }\\n this.lockingUpdate_ = this.pendingUpdate_;\\n this.pendingUpdate_ = null;\\n await this.doUpdate_();\\n this.lockingUpdate_ = null;\\n })();\\n } else {\\n this.lockingUpdate_ = (async () => {\\n await this.doUpdate_();\\n this.lockingUpdate_ = null;\\n })();\\n }\\n }\",\n \"function updateSuspenseListComponent(current$$1, workInProgress, renderExpirationTime) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current$$1, workInProgress, newChildren, renderExpirationTime);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.effectTag |= DidCapture;\\n } else {\\n var didSuspendBefore = current$$1 !== null && (current$$1.effectTag & DidCapture) !== NoEffect;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderExpirationTime);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BatchedMode) === NoMode) {\\n // Outside of batched mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n }\",\n \"async handle_update() {\\n\\t\\tthis.new_worker = await navigator.serviceWorker.getRegistration();\\n\\t\\tif (this.new_worker.waiting) {\\n\\t\\t\\tthis.promote_app_update();\\n\\t\\t}\\n\\t}\",\n \"function prerender() {\\n if (tileEngine.layers) {\\n tileEngine.layers.forEach(layer => {\\n layerMap[layer.name] = layer;\\n\\n if (layer.visible !== false) {\\n tileEngine._r(layer, offscreenContext);\\n }\\n });\\n }\\n }\",\n \"function poll(el) {\\n observedElements.push(el);\\n if (observedElements.length === 1)\\n rafID = requestAnimationFrame(checkStyles);\\n}\",\n \"if (didScheduleUpdateDuringPassiveEffects) {\\n if (root === rootWithPassiveNestedUpdates) {\\n nestedPassiveUpdateCount++;\\n } else {\\n nestedPassiveUpdateCount = 0;\\n rootWithPassiveNestedUpdates = root;\\n }\\n }\",\n \"renderui(){\\n this.events.emit('updateresources', {\\n currenthp: this.player.currenthp,\\n maxhp: this.player.maxhp,\\n currentend: this.player.currentend,\\n maxend: this.player.maxend,\\n currentmana: this.player.currentmana,\\n maxmana: this.player.maxmana,\\n target: this.player.target ? this.player.target : null\\n })\\n this.events.emit('updateabilities',{\\n gcd: this.GCD.timer ? Math.floor(this.GCD.timer.getProgress() * 1000) : 1000, //it starts in sub 1 levels \\n value: this.GCD.value\\n })\\n }\",\n \"_updateAttachedFlag() {\\n // Calculate active flag.\\n let newAttached = this.isAttached();\\n if (this._attached !== newAttached) {\\n this._attached = newAttached;\\n\\n let children = this._children.get();\\n if (children) {\\n let m = children.length;\\n if (m > 0) {\\n for (let i = 0; i < m; i++) {\\n children[i]._updateAttachedFlag();\\n }\\n }\\n }\\n\\n if (newAttached) {\\n this.emit('attach');\\n } else {\\n this.emit('detach');\\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 setProps, setState, forceUpdate, etc.; creation and\\n// destruction of top-level components is guarded in ReactMount.)\\n\\\"production\\\"!==process.env.NODE_ENV?warning(ReactCurrentOwner.current==null,'enqueueUpdate(): Render methods should be a pure function of props '+'and state; triggering nested component updates from render is not '+'allowed. If necessary, trigger nested updates in '+'componentDidUpdate.'):null;if(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"async function queueUpdate(p) {\\n queued.push(p);\\n if (!pending) {\\n pending = true;\\n await Promise.resolve();\\n pending = false;\\n const loading = [...queued];\\n queued = [];\\n (await Promise.all(loading)).forEach((fn) => fn && fn());\\n }\\n}\",\n \"measure() {\\n // Check if the element is ready to be measured.\\n // Placeholders are special. They are technically \\\"owned\\\" by parent AMP\\n // elements, sized by parents, but laid out independently. This means\\n // that placeholders need to at least wait until the parent element\\n // has been stubbed. We can tell whether the parent has been stubbed\\n // by whether a resource has been attached to it.\\n if (\\n this.isPlaceholder_ &&\\n this.element.parentElement &&\\n // Use prefix to recognize AMP element. This is necessary because stub\\n // may not be attached yet.\\n this.element.parentElement.tagName.startsWith('AMP-') &&\\n !(RESOURCE_PROP_ in this.element.parentElement)\\n ) {\\n return;\\n }\\n if (\\n !this.element.ownerDocument ||\\n !this.element.ownerDocument.defaultView\\n ) {\\n // Most likely this is an element who's window has just been destroyed.\\n // This is an issue with FIE embeds destruction. Such elements will be\\n // considered \\\"not displayable\\\" until they are GC'ed.\\n this.state_ = ResourceState_Enum.NOT_LAID_OUT;\\n return;\\n }\\n\\n this.isMeasureRequested_ = false;\\n\\n const oldBox = this.layoutBox_;\\n this.computeMeasurements_();\\n const newBox = this.layoutBox_;\\n\\n // Note that \\\"left\\\" doesn't affect readiness for the layout.\\n const sizeChanges = !layoutRectSizeEquals(oldBox, newBox);\\n if (\\n this.state_ == ResourceState_Enum.NOT_LAID_OUT ||\\n oldBox.top != newBox.top ||\\n sizeChanges\\n ) {\\n if (this.element.isUpgraded()) {\\n if (this.state_ == ResourceState_Enum.NOT_LAID_OUT) {\\n // If the element isn't laid out yet, then we're now ready for layout.\\n this.state_ = ResourceState_Enum.READY_FOR_LAYOUT;\\n } else if (\\n (this.state_ == ResourceState_Enum.LAYOUT_COMPLETE ||\\n this.state_ == ResourceState_Enum.LAYOUT_FAILED) &&\\n this.element.isRelayoutNeeded()\\n ) {\\n // If the element was already laid out and we need to relayout, then\\n // go back to ready for layout.\\n this.state_ = ResourceState_Enum.READY_FOR_LAYOUT;\\n }\\n }\\n }\\n\\n if (!this.hasBeenMeasured()) {\\n this.initialLayoutBox_ = newBox;\\n }\\n\\n this.element.updateLayoutBox(newBox, sizeChanges);\\n }\",\n \"async onIdle() {\\n // Instantly resolve if none pending and if nothing else is queued\\n if (this._pendingCount === 0 && this._queue.size === 0) {\\n return;\\n }\\n\\n return new Promise(resolve => {\\n const existingResolve = this._resolveIdle;\\n\\n this._resolveIdle = () => {\\n existingResolve();\\n resolve();\\n };\\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// Check if this root is already part of the schedule.\\nif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\\nroot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\\nvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\\nroot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\\n// Check if this root is already part of the schedule.\\nif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\\nroot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\\nvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\\nroot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function updateSuspenseListComponent(current, workInProgress, renderLanes) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.flags |= DidCapture;\\n } else {\\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // In legacy mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current, workInProgress, renderLanes) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.flags |= DidCapture;\\n } else {\\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // In legacy mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current, workInProgress, renderLanes) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.flags |= DidCapture;\\n } else {\\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // In legacy mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current, workInProgress, renderLanes) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.flags |= DidCapture;\\n } else {\\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // In legacy mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\",\n \"function updateSuspenseListComponent(current, workInProgress, renderLanes) {\\n var nextProps = workInProgress.pendingProps;\\n var revealOrder = nextProps.revealOrder;\\n var tailMode = nextProps.tail;\\n var newChildren = nextProps.children;\\n validateRevealOrder(revealOrder);\\n validateTailOptions(tailMode, revealOrder);\\n validateSuspenseListChildren(newChildren, revealOrder);\\n reconcileChildren(current, workInProgress, newChildren, renderLanes);\\n var suspenseContext = suspenseStackCursor.current;\\n var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n\\n if (shouldForceFallback) {\\n suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\\n workInProgress.flags |= DidCapture;\\n } else {\\n var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\\n\\n if (didSuspendBefore) {\\n // If we previously forced a fallback, we need to schedule work\\n // on any nested boundaries to let them know to try to render\\n // again. This is the same as context updating.\\n propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\\n }\\n\\n suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\\n }\\n\\n pushSuspenseContext(workInProgress, suspenseContext);\\n\\n if ((workInProgress.mode & BlockingMode) === NoMode) {\\n // In legacy mode, SuspenseList doesn't work so we just\\n // use make it a noop by treating it as the default revealOrder.\\n workInProgress.memoizedState = null;\\n } else {\\n switch (revealOrder) {\\n case 'forwards':\\n {\\n var lastContentRow = findLastContentRow(workInProgress.child);\\n var tail;\\n\\n if (lastContentRow === null) {\\n // The whole list is part of the tail.\\n // TODO: We could fast path by just rendering the tail now.\\n tail = workInProgress.child;\\n workInProgress.child = null;\\n } else {\\n // Disconnect the tail rows after the content row.\\n // We're going to render them separately later.\\n tail = lastContentRow.sibling;\\n lastContentRow.sibling = null;\\n }\\n\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n tail, lastContentRow, tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'backwards':\\n {\\n // We're going to find the first row that has existing content.\\n // At the same time we're going to reverse the list of everything\\n // we pass in the meantime. That's going to be our tail in reverse\\n // order.\\n var _tail = null;\\n var row = workInProgress.child;\\n workInProgress.child = null;\\n\\n while (row !== null) {\\n var currentRow = row.alternate; // New rows can't be content rows.\\n\\n if (currentRow !== null && findFirstSuspended(currentRow) === null) {\\n // This is the beginning of the main content.\\n workInProgress.child = row;\\n break;\\n }\\n\\n var nextRow = row.sibling;\\n row.sibling = _tail;\\n _tail = row;\\n row = nextRow;\\n } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\\n\\n\\n initSuspenseListRenderState(workInProgress, true, // isBackwards\\n _tail, null, // last\\n tailMode, workInProgress.lastEffect);\\n break;\\n }\\n\\n case 'together':\\n {\\n initSuspenseListRenderState(workInProgress, false, // isBackwards\\n null, // tail\\n null, // last\\n undefined, workInProgress.lastEffect);\\n break;\\n }\\n\\n default:\\n {\\n // The default reveal order is the same as not having\\n // a boundary.\\n workInProgress.memoizedState = null;\\n }\\n }\\n }\\n\\n return workInProgress.child;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6279164","0.5831592","0.5645547","0.5618422","0.5553275","0.5536617","0.5518966","0.54060096","0.5393215","0.53856635","0.5385072","0.53362244","0.53362244","0.5301369","0.52907246","0.5246852","0.5243641","0.52426386","0.52426386","0.5228701","0.5228701","0.5212066","0.5208014","0.5202","0.5181804","0.51752317","0.51610494","0.51582134","0.513112","0.5079978","0.5066546","0.5066546","0.5066546","0.505017","0.505017","0.50471187","0.50471187","0.50471187","0.50471187","0.50471187","0.50378776","0.5034661","0.50321984","0.50321984","0.50321984","0.5025778","0.5008299","0.50001943","0.49863476","0.49800754","0.4969751","0.49557573","0.4949225","0.4948172","0.4942327","0.4942327","0.4942327","0.49417248","0.49398932","0.49398932","0.49398932","0.49336916","0.49316722","0.4917704","0.49112192","0.49099982","0.49090612","0.49079677","0.49050513","0.48993877","0.48993877","0.48975766","0.48923603","0.48796865","0.48762953","0.48761165","0.48736286","0.48713553","0.48645148","0.4863577","0.48628563","0.4857083","0.48419675","0.48381442","0.48378807","0.48341948","0.4831561","0.482558","0.48223293","0.48174143","0.48158416","0.48155522","0.48155522","0.4808226","0.4808226","0.4808226","0.4808226","0.4808226"],"string":"[\n \"0.6279164\",\n \"0.5831592\",\n \"0.5645547\",\n \"0.5618422\",\n \"0.5553275\",\n \"0.5536617\",\n \"0.5518966\",\n \"0.54060096\",\n \"0.5393215\",\n \"0.53856635\",\n \"0.5385072\",\n \"0.53362244\",\n \"0.53362244\",\n \"0.5301369\",\n \"0.52907246\",\n \"0.5246852\",\n \"0.5243641\",\n \"0.52426386\",\n \"0.52426386\",\n \"0.5228701\",\n \"0.5228701\",\n \"0.5212066\",\n \"0.5208014\",\n \"0.5202\",\n \"0.5181804\",\n \"0.51752317\",\n \"0.51610494\",\n \"0.51582134\",\n \"0.513112\",\n \"0.5079978\",\n \"0.5066546\",\n \"0.5066546\",\n \"0.5066546\",\n \"0.505017\",\n \"0.505017\",\n \"0.50471187\",\n \"0.50471187\",\n \"0.50471187\",\n \"0.50471187\",\n \"0.50471187\",\n \"0.50378776\",\n \"0.5034661\",\n \"0.50321984\",\n \"0.50321984\",\n \"0.50321984\",\n \"0.5025778\",\n \"0.5008299\",\n \"0.50001943\",\n \"0.49863476\",\n \"0.49800754\",\n \"0.4969751\",\n \"0.49557573\",\n \"0.4949225\",\n \"0.4948172\",\n \"0.4942327\",\n \"0.4942327\",\n \"0.4942327\",\n \"0.49417248\",\n \"0.49398932\",\n \"0.49398932\",\n \"0.49398932\",\n \"0.49336916\",\n \"0.49316722\",\n \"0.4917704\",\n \"0.49112192\",\n \"0.49099982\",\n \"0.49090612\",\n \"0.49079677\",\n \"0.49050513\",\n \"0.48993877\",\n \"0.48993877\",\n \"0.48975766\",\n \"0.48923603\",\n \"0.48796865\",\n \"0.48762953\",\n \"0.48761165\",\n \"0.48736286\",\n \"0.48713553\",\n \"0.48645148\",\n \"0.4863577\",\n \"0.48628563\",\n \"0.4857083\",\n \"0.48419675\",\n \"0.48381442\",\n \"0.48378807\",\n \"0.48341948\",\n \"0.4831561\",\n \"0.482558\",\n \"0.48223293\",\n \"0.48174143\",\n \"0.48158416\",\n \"0.48155522\",\n \"0.48155522\",\n \"0.4808226\",\n \"0.4808226\",\n \"0.4808226\",\n \"0.4808226\",\n \"0.4808226\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.48313922"},"document_rank":{"kind":"string","value":"89"}}},{"rowIdx":80677,"cells":{"query":{"kind":"string","value":"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."},"document":{"kind":"string","value":"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\nvar existing=useFiber(current$$1,element.props,expirationTime);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,portal.children||[],expirationTime);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_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(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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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(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\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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(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;}/**\n * Warns if there is a duplicate or missing key\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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;{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===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\n// the first item in the list.\nif(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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}"},"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":["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 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 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}","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 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}","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 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 shortenPaths(graph) {\n var foundNonTrivialPaths = true,\n startNode = null,\n startNodeName = null,\n minWeight = 0;\n\n while(foundNonTrivialPaths) {\n foundNonTrivialPaths = false;\n for(startNodeName in graph) {\n startNode = graph[startNodeName];\n depthFirstSearch(\n startNodeName, \n graph, \n followingNonTrivialPath(\n [],\n [\n correctMinimumWeight,\n modifyStep\n ],\n [\n resetMinimumWeight\n ]\n )\n );\n }\n }\n\n function followingNonTrivialPath (startFns, stepFns, endFns) {\n return function inner (path, pathIndex) {\n if(path.length > 1) {\n foundNonTrivialPaths = true;\n startFns.forEach(function eachStartFn (startFn) {\n startFn.call(this, path, pathIndex);\n });\n stepFns.forEach(function eachStepFn (fn) {\n path.forEach(stepFns);\n });\n endFns.forEach(function eachEndFn (endFn) {\n endFn.call(this, path, pathIndex);\n });\n }\n }\n }\n\n function modifyStep (step, stepIndex, path) { \n if(step.edge.weight === minWeight) {\n delete step.node.edges[step.nextNodeName];\n }\n else {\n // reduce weight of edge by lowest weight along non-trivial path\n step.edge.weight -= minWeight;\n }\n\n if(stepIndex === path.length - 1) {\n // get/create edge between start and end of current path\n ensureAttr(startNode.edges, step.nextNodeName, { weight: 0});\n startNode.edges[step.nextNodeName].weight += minWeight; \n } \n }\n\n function correctMinimumWeight (step) {\n if(step.edge != null && step.edge.weight > 0 && minWeight === 0 || minWeight > 0 && step.edge.weight < minWeight) {\n minWeight = step.edge.weight;\n }\n }\n \n function resetMinimumWeight () {\n minWeight = 0;\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}","isReachable(vertID1, vertID2, curr=null, path=[]) {\n if(curr == vertID1) {\n return [];\n }\n if(curr == vertID2) {\n path.push(curr);\n return path;\n }\n let result = [];\n curr = curr || vertID1;\n for(let edge of this.edgeList) {\n if(edge[0] == curr) {\n path.push(edge[0]);\n result.push(this.isReachable(vertID1, vertID2, edge[1], path));\n }\n }\n return result;\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}","function build_full_paths(FI, FP, Paths) {\n var i = 0,\n L = 0,\n R = 0,\n C = 0,\n j = 0,\n pl = Paths.length;\n var dad = [],\n q = [];\n\n for (; i < pl; ++i) {\n dad[i] = q[i] = i;\n FP[i] = Paths[i];\n }\n\n for (; j < q.length; ++j) {\n i = q[j];\n L = FI[i].L;\n R = FI[i].R;\n C = FI[i].C;\n\n if (dad[i] === i) {\n if (L !== -1\n /*NOSTREAM*/\n && dad[L] !== L) dad[i] = dad[L];\n if (R !== -1 && dad[R] !== R) dad[i] = dad[R];\n }\n\n if (C !== -1\n /*NOSTREAM*/\n ) dad[C] = i;\n\n if (L !== -1 && i != dad[i]) {\n dad[L] = dad[i];\n if (q.lastIndexOf(L) < j) q.push(L);\n }\n\n if (R !== -1 && i != dad[i]) {\n dad[R] = dad[i];\n if (q.lastIndexOf(R) < j) q.push(R);\n }\n }\n\n for (i = 1; i < pl; ++i) if (dad[i] === i) {\n if (R !== -1\n /*NOSTREAM*/\n && dad[R] !== R) dad[i] = dad[R];else if (L !== -1 && dad[L] !== L) dad[i] = dad[L];\n }\n\n for (i = 1; i < pl; ++i) {\n if (FI[i].type === 0\n /* unknown */\n ) continue;\n j = i;\n if (j != dad[j]) do {\n j = dad[j];\n FP[i] = FP[j] + \"/\" + FP[i];\n } while (j !== 0 && -1 !== dad[j] && j != dad[j]);\n dad[i] = -1;\n }\n\n FP[0] += \"/\";\n\n for (i = 1; i < pl; ++i) {\n if (FI[i].type !== 2\n /* stream */\n ) FP[i] += \"/\";\n }\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}","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}","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 }","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 }","_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 applyPath(){\n\t\tvar cap = [];\n\t\tdelta = 0;\n\t\tGraph.instance.edges.forEach(function(key,edge){\n\t\t\tstate.edgePrevCost[edge.id] = edge.resources[1];\n\t\t});\n\t\tfor (var i =0; i<state.edgesOfSP.length; i++){\n\t\t\t\n\t\t\tcap[i] = state.edgesOfSP[i].resources[0]-state.edgesOfSP[i].state.flow;\n\t\t\t\n\t\t}\n var minCap = d3.min(cap);\n\t\t\n\t\tvar excessDemandMin = Math.min(Graph.instance.nodes.get(state.sourceId).b , -Graph.instance.nodes.get(state.targetId).b);\n\t\tdelta = Math.min(minCap, excessDemandMin);\n\t\t\n\t\n\t\tfor (var i = 0; i < state.edgesOfSP.length; i++){\n \n var edge = state.edgesOfSP[i];\n\n edge.state.flow += edge.start.state.predecessor[\"direction\"] * delta;\n\t\t\tminCost += delta * edge.edges[\"cost\"];\n }\n\t\tGraph.instance.nodes.forEach(function(key,node){\n\t\t\tbs[node.id] = node.b;\n\t\t\tif(node.id == state.sourceId){\n\t\t\t\tnode.b = node.b-delta;\n\t\t\t\tbOfS = node.b;\n\t\t\t}else if(node.id == state.targetId){\n\t\t\t\tnode.b = node.b + delta;\n\t\t\t\tbOfT = node.b;\n\t\t\t\t\n\t\t\t}else{\n\t\t\t\tnode.b = 0;\n\t\t\t}\n\t\t});\n\t\t\n\t\tGraph.instance.edges.forEach(function(key, edge) {\n\t\t\tedge.inSP = false;\n\t\t\tif(edge.state.flow == edge.resources[0]){\n\t\t\t\tedge.state.usedUp = true;\t\n\t\t\t}else{\n\t\t\t\tedge.state.usedUp = false;\t\n\n\t\t\t}\n });\n logger.log(\"Applied augmenting path with flow \"+state.augmentation);\n\t\tdel = 0;\n\t\tstate.distancesOfNodes = [];\n state.show_residual_graph = false;\n\t\tstate.shortestPath = [];\n state.current_step = STEP_MAINLOOP;\n\t\t\n\t}","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 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 findPath (start, stop, mapToUse) {\n var checked = [];\n var queue = [];\n var villages = [];\n\n queue.push([start]);\n checked.push(start);\n\n while(queue.length !== 0){\n var path = queue.shift(); // Get shortest path\n var t = path[path.length - 1]; // Take last element without removing it\n var tx = t[0];\n var ty = t[1];\n\n // If the last element is the one we are looking for\n // return the path\n if((mapToUse[tx][ty]).position.equals(stop)){\n return path;\n }\n\n var newPath = [];\n // Add all adjacent nodes to paths and push them to the \"prio\" queue\n // Paths cannot go through moutains\n if(customIndexOf(checked, [(tx+1),ty]) == -1 &&\n !isOutOfBounds(tx+1, ty, mapToUse) &&\n isPassable(tx+1, ty, mapToUse)){\n newPath = path.slice();\n checked.push([(tx+1),ty]); // Push node to checked so we dont use it again\n newPath.push([(tx+1),ty]);\n queue.push(newPath.slice()); // Push old path plus new node to prio queue\n }\n\n if (customIndexOf(checked, [(tx-1),ty]) == -1 &&\n !isOutOfBounds(tx-1, ty, mapToUse) &&\n isPassable(tx-1, ty, mapToUse)) {\n newPath = path.slice();\n checked.push([(tx-1),ty]);\n newPath.push([(tx-1),ty]);\n queue.push(newPath.slice());\n }\n\n if (customIndexOf(checked, [tx,(ty+1)]) == -1 &&\n !isOutOfBounds(tx, ty+1, mapToUse) &&\n isPassable(tx, ty+1, mapToUse)) {\n newPath = path.slice();\n checked.push([tx,(ty+1)]);\n newPath.push([tx,(ty+1)]);\n queue.push(newPath.slice());\n }\n\n if (customIndexOf(checked, [tx,(ty-1)]) == -1 &&\n !isOutOfBounds(tx, ty-1, mapToUse) &&\n isPassable(tx, ty-1, mapToUse)) {\n newPath = path.slice();\n checked.push([tx,(ty-1)]);\n newPath.push([tx,(ty-1)]);\n queue.push(newPath.slice());\n }\n\n queue.sort(function(a, b){return a.length - b.length;}); // This is needed as I'm too lazy to create/use a prio queue\n }\n\n return null;\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}","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 traverse(cur_pos, tc, b, visited, optPaths) {\n if(tc<0) return -2;\n\n if(cur_pos==b){\n optPaths[b][\"spt\"] = tc;\n optPaths[b][\"path\"] = [];\n optPaths[b][\"path\"].push(b);\n optPaths[b][\"res\"] = graph_vertices[b];\n console.log(\"base case\");\n return optPaths[b][\"res\"];\n }\n\n // let copiedOptPaths = JSON.parse(JSON.stringify(optPaths));\n let maxRes = -1, rec_ans, maxST = -1;\n visited[cur_pos] = 1;\n let temp_path = [];\n\n for(let i=0; i<graph_edges[cur_pos].length; i++){\n let toVis = graph_edges[cur_pos][i][0];\n let nbr_wt = graph_edges[cur_pos][i][1];\n console.log(toVis, nbr_wt);\n \n if(visited[toVis]==0){\n visited[toVis]=1;\n rec_ans = traverse(toVis, tc-nbr_wt, b, visited, optPaths);\n visited[toVis]=0;\n\n // if(rec_ans>maxRes || (rec_ans==maxRes && (maxST<optPaths[b][\"spt\"]))){\n if(parseInt(rec_ans)>parseInt(maxRes) || (rec_ans==maxRes && (maxST<optPaths[b][\"spt\"]))){\n maxRes = rec_ans;\n maxST = optPaths[b][\"spt\"];\n\n temp_path = optPaths[toVis][\"path\"];\n // optPaths[cur_pos] = optPaths[toVis];\n console.log(\"max res update:\", maxRes, optPaths[cur_pos][\"path\"]);\n }\n }\n\n }\n\n if(maxRes != -1){\n optPaths[cur_pos][\"res\"] = maxRes + graph_vertices[cur_pos];\n temp_path.unshift(cur_pos);\n }\n \n optPaths[cur_pos][\"path\"] = temp_path;\n optPaths[cur_pos][\"spt\"] = maxST;\n // optPaths[cur_pos][\"res\"] += graph_vertices[cur_pos];\n\n visited[cur_pos] = 0; // backtracking\n if(maxRes==-1) return -2;\n\n console.log(\"return value:\", optPaths[cur_pos][\"res\"]);\n return optPaths[cur_pos][\"res\"];\n}","function solvePath() {\n let r = 19\n let c = 19\n shortestPath.push(board[r][c])\n while (true) {\n let parent = board[r][c].parentNode\n shortestPath.unshift(parent);\n r = parent.r\n c = parent.c\n if (r == 0 && c == 0) {\n return\n }\n }\n}","function build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\n\t\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\n\t}\n\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = i;\n\t\tif(j != dad[j]) do {\n\t\t\tj = dad[j];\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\n\t\tdad[i] = -1;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\n}","function build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\n\t\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\n\t}\n\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = i;\n\t\tif(j != dad[j]) do {\n\t\t\tj = dad[j];\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\n\t\tdad[i] = -1;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\n}","function build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\n\t\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\n\t}\n\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = i;\n\t\tif(j != dad[j]) do {\n\t\t\tj = dad[j];\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\n\t\tdad[i] = -1;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\n}","function build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\n\t\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\n\t}\n\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = i;\n\t\tif(j != dad[j]) do {\n\t\t\tj = dad[j];\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\n\t\tdad[i] = -1;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\n}","function build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\n\t}\n\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0 && j !== dad[j]) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\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}","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = new Array(pl), q = new Array(pl);\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\n}","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = new Array(pl), q = new Array(pl);\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\n}","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = new Array(pl), q = new Array(pl);\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\n}","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = new Array(pl), q = new Array(pl);\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\n}","function augmentingPaths (graph, start, end) {\n \n// Keep track of vertices with that have been visited with \"processedList\" to avoid cycles\n// If a cycle existed and \"end\" could not be found the code would execute forever\n// Also, using \"processedList\" may be faster in graphs with a large edges/vertices ratio\nprocessedList = [];\nprocessedList.push(start)\n \n// \"Queue\" keeps track of the growth of the paths as the breadth first search proceeds\nqueue = [];\nqueue.push([start]);\n \nwhile (queue.length > 0) {\n path = [];\n path = queue[0];\n queue.splice(0, 1);\n\n vert = path[path.length - 1];\n \n \n if (vert == end) {\n return path;\n }\n\n adjacentVerts = [];\n\n for (var j = 0; j < graph.length; j++) {\n if (graph[vert][j] != 0) {\n adjacentVerts.push(j);\n }\n }\n\n for (var i = 0; i < adjacentVerts.length; i++) {\n\n currVert = adjacentVerts[i];\n\n if (!(processedList.includes(currVert))) {\n processedList.push(currVert);\n newPath = path.slice();\n newPath.push(currVert);\n queue.push(newPath);\n }\n }\n}\nreturn (\"Failure\")\n}","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}","function setPath(body) {\n if (body.grid1 != null) {\n setPath1(path1 => [...path1, start]);\n \n for (let data of body.grid1){ \n let pos = {lat: data.lat, lng: data.long};\n // console.log(pos);\n setPath1(path1 => [...path1, pos]);\n // setGrid(grid => [...grid, pos]);\n \n } \n setPath1(path1 => [...path1, end]);\n setPath1Length(body.grid1Length);\n setPath1NetElev(body.grid1ElevNet);\n setPath1Shortest(body.grid1Shortest);\n }\n if (body.grid2 != null) { \n setPath2(path2 => [...path2, start]);\n for (let data of body.grid2){ \n let pos = {lat: data.lat, lng: data.long};\n setPath2(path2 => [...path2, pos]);\n }\n \n setPath2(path2 => [...path2, end]);\n setPath2Length(body.grid2Length);\n setPath2NetElev(body.grid2ElevNet);\n setPath2Shortest(body.grid2Shortest);\n }\n if (body.grid3 != null) { \n setPath3(path3=> [...path3, start]);\n for (let data of body.grid3){ \n let pos = {lat: data.lat, lng: data.long};\n setPath3(path3 => [...path3, pos]);\n }\n \n setPath3(path3 => [...path3, end]);\n\n }\n \n }","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0 && j !== dad[j]) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\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 build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0 && j !== dad[j]) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\n}","function build_full_paths(FI, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0 && j !== dad[j]) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t}\n}","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\n}","function build_full_paths(FI, FPD, FP, Paths) {\n\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\n\tvar dad = [], q = [];\n\n\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\n\n\tfor(; j < q.length; ++j) {\n\t\ti = q[j];\n\t\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\n\t\tif(dad[i] === i) {\n\t\t\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\n\t\t\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\n\t\t}\n\t\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\n\t\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\n\t\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\n\t}\n\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\n\t\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\n\t\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\n\t}\n\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type === 0 /* unknown */) continue;\n\t\tj = dad[i];\n\t\tif(j === 0) FP[i] = FP[0] + \"/\" + FP[i];\n\t\telse while(j !== 0) {\n\t\t\tFP[i] = FP[j] + \"/\" + FP[i];\n\t\t\tj = dad[j];\n\t\t}\n\t\tdad[i] = 0;\n\t}\n\n\tFP[0] += \"/\";\n\tfor(i=1; i < pl; ++i) {\n\t\tif(FI[i].type !== 2 /* stream */) FP[i] += \"/\";\n\t\tFPD[FP[i]] = FI[i];\n\t}\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 buildRoutes(path) {\n\n for (var name in path) {\n var current = path[name];\n\n if (traverse(path, current, name)) {\n buildRoutes(addRoutes(current, path, name));\n }\n\n }\n }","function calculateNextVelInPaths(){\n pathStats.size += pathStats.calculateSpeed;\n for (let i = 0; i < pathStats.calculateSpeed; i++){\n for (const p of allPlanets){\n p.calculateNextVelInPath();\n }\n }\n}","function bestPathFinder(bPath , path){\n if (path < bPath){\n return path;\n }\n return bPath\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 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 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 calculatePath (startIndex, endIndex, onlyMeasure = false) {\n // startIndex ist der Index im TileArray von dem der Pfad startet\n // endIndex ist der Index im TileArray zu dem der Pfad geht\n // onlyMeasure = true begrenzt den Pfad nicht auf die maximale Bewegungsweite während einem Kampf\n \n let mappedList = [];\n let frontierList = [];\n let frontierListValues = [];\n let activeNode;\n let pathFound = false;\n let pathToTravel = [];\n let distance = 0;\n \n //Fange Ausnahmen ab startIndex = endIndex\n if (startIndex == endIndex || endIndex == undefined) {\n return {\n first: pathToTravel,\n second: distance\n }\n }\n \n // finde A und füge ihn der frontierList hinzu {name, wayPointUsefulness}\n tileArray[startIndex].entryPoint = \"Start\";\n tileArray[startIndex].distanceTravelled = 0;\n tileArray[startIndex].wayPointUsefulness = tileArray[startIndex].distanceTravelled + tileArray[startIndex].estimatedWayToB(endIndex);\n tileArray[startIndex].difDegree = Phaser.Math.Angle.BetweenPoints(tileArray[startIndex], tileArray[endIndex]);\n frontierList.push(tileArray[startIndex]);\n \n // gehe folgende Schleife solange durch bis es einen Weg gibt\n while (pathFound == false) {\n \n // Wenn kein Weg möglich ist brich diese Schleife ab\n if (frontierList.length == 0) {\n pathToTravel = [];\n break;\n }\n \n // gehe frontierList durch nach niedrigster wayPointUsefulness + Tiebreaker (geringster Winkelunterschied zur Luftlinie)\n frontierListValues.length = 0;\n for (let i = 0; i < frontierList.length; i++) {\n let difDegree = Math.abs(Phaser.Math.Angle.ShortestBetween(tileArray[startIndex].difDegree, frontierList[i].difDegree))/1000;\n frontierListValues.push(frontierList[i].wayPointUsefulness + difDegree);\n }\n activeNode = frontierListValues.indexOf(Math.min(...frontierListValues));\n \n // Wenn Knoten mit Niedrigster wayPointUsefulness schon das Ziel ist, ist A* fertig\n if (frontierList[activeNode].name == endIndex) {\n pathFound = true; // unterbricht diese Schleife und damit das Pfadsuchen\n let backtraceIndex = endIndex; // Sucht den Index des Zielfeldes\n pathToTravel.unshift(backtraceIndex); // Fügt das Zielfeld dem Pfad hinzu\n \n while (tileArray[tileArray[backtraceIndex].entryPoint].name != startIndex) {\n pathToTravel.unshift(tileArray[backtraceIndex].entryPoint);\n backtraceIndex = tileArray[backtraceIndex].entryPoint;\n }\n \n break;\n }\n \n // berechne für diesen alle neighbors\n frontierList[activeNode].checkForNeighbors();\n \n // Füge Neighbors des aktuellen Knotens der Frontierlist hinzu\n for (let i = 0; i < frontierList[activeNode].neighbors.length; i++) {\n \n let distanceTravelled = frontierList[activeNode].distanceTravelled + frontierList[activeNode].neighborsDistance[i];\n if (containsObject(frontierList[activeNode].neighbors[i], frontierList)) {\n if (distanceTravelled < frontierList[activeNode].neighbors[i].distanceTravelled) {\n frontierList[activeNode].neighbors[i].distanceTravelled = distanceTravelled;\n frontierList[activeNode].neighbors[i].wayPointUsefulness = frontierList[activeNode].neighbors[i].distanceTravelled + frontierList[activeNode].neighbors[i].estimatedWayToB(endIndex);\n frontierList[activeNode].neighbors[i].entryPoint = frontierList[activeNode].name;\n }\n } else if (containsObject(frontierList[activeNode].neighbors[i], mappedList)) {\n continue;\n } else {\n frontierList[activeNode].neighbors[i].distanceTravelled = frontierList[activeNode].distanceTravelled + frontierList[activeNode].neighborsDistance[i];\n frontierList[activeNode].neighbors[i].wayPointUsefulness = frontierList[activeNode].neighbors[i].distanceTravelled + frontierList[activeNode].neighbors[i].estimatedWayToB(endIndex);\n frontierList[activeNode].neighbors[i].entryPoint = frontierList[activeNode].name;\n frontierList[activeNode].neighbors[i].difDegree = Phaser.Math.Angle.BetweenPoints(frontierList[activeNode].neighbors[i], tileArray[endIndex])\n frontierList.push(frontierList[activeNode].neighbors[i]);\n }\n }\n \n // Füge den aktiven Knoten der mappedList hinzu und Lösche den aktven Knoten aus der frontierList\n mappedList.push(frontierList[activeNode]);\n frontierList.splice(activeNode,1);\n }\n \n // wenn gerade ein Kampf ist soll die Bewegung begrenzt sein auf die Maximale Bewegungsweite des aktiven Charakters\n if (fightmode == true && onlyMeasure == false) {\n movementStopper: for (let l = 0; l < pathToTravel.length; l++) {\n if (tileArray[pathToTravel[l]].distanceTravelled > activeChar.movementCounter) {\n pathToTravel.length = l;\n break movementStopper;\n }\n }\n }\n \n // wenn das Ziefeld der Bewegung besetzt ist, wird die Bewegung gekürzt\n checkEnd: while (pathToTravel.length > 0) {\n if (checkFor (tileArray[pathToTravel[pathToTravel.length-1]].occupiedBy, Figure) || checkFor (tileArray[pathToTravel[pathToTravel.length-1]].occupiedBy, Enemy)) {\n pathToTravel.length = pathToTravel.length-1;\n } else {\n break checkEnd;\n }\n }\n \n // speichert die Entfernung bis zum Ende des Pfades\n if (pathToTravel.length > 0) {\n distance += tileArray[pathToTravel[pathToTravel.length-1]].distanceTravelled;\n }\n \n // räumt alle Tiles wieder auf\n clearNodes();\n return {\n first: pathToTravel,\n second: distance\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 }","path(start, end)\n {\n // Check if the end is reachable\n let endInfo = this.positionInfo(end);\n if (endInfo.passable === false)\n return undefined;\n\n // For node n, parent[n] is the node immediately preceding it on the cheapest path from start to n currently known\n let parent = new Map();\n\n // For node n, gScore[n] is the cost of the cheapest path from start to n currently known\n let gScore = new Map([[start.toString(), 0]]);\n\n // For node n, fScore[n] = gScore[n] + h(n)\n let fScore = new Map([[start.toString(), 0]]);\n\n // The heap of discovered nodes that need to be (re-)expanded\n let openHeap = new BinaryHeap(node => fScore.get(node.toString()) || 0);\n openHeap.push(start);\n\n // The set of closed nodes\n let closedSet = new Set();\n\n // Iterate while the heap is not empty\n while (openHeap.size > 0)\n {\n // Grab the lowest f(x) to process next\n let node = openHeap.pop();\n\n // End case -- result has been found, return the traced path\n if (node.x === end.x && node.y === end.y)\n {\n let path = [node];\n while (parent.has(node.toString()))\n {\n node = parent.get(node.toString());\n path.unshift(node);\n }\n return path.map(position => this.positionInfo(position));\n }\n\n // Normal case -- move node from open to closed, process each of its neighbors\n closedSet.add(node.toString());\n\n // Find all neighbors for the current node\n for (let neighbor of this.getNeighbors(node))\n {\n let neighborInfo = this.positionInfo(neighbor);\n\n // If the neighbor is already closed or is not passable, then continue\n if (closedSet.has(neighbor.toString()) || neighborInfo.passable === false)\n continue;\n\n // The g score is the shortest distance from start to current node\n // We need to check if the path we have arrived at this neighbor is the shortest one we have seen yet\n let gScoreTentative = gScore.get(node.toString()) + neighborInfo.cost;\n if (!gScore.has(neighbor.toString()) || gScoreTentative < gScore.get(neighbor.toString()))\n {\n parent.set(neighbor.toString(), node);\n gScore.set(neighbor.toString(), gScoreTentative);\n fScore.set(neighbor.toString(), gScoreTentative + Vector.manhattanDistance(neighbor, end));\n\n if (!openHeap.has(neighbor))\n openHeap.push(neighbor);\n else\n openHeap.rescoreElement(neighbor);\n }\n }\n }\n\n // No path found, so return undefined\n return undefined;\n }","function pathGatherer(){\n var indicator = Grid[EndPoint[0]][EndPoint[1]].VisitedAt\n var currentPoint = [EndPoint[0],EndPoint[1]]\n var path = []\n\n while( indicator != 0){\n console.log(indicator)\n console.log(\"Current: \" + currentPoint[0] + \"-\" + currentPoint[1])\n if(currentPoint[0]!=EndPoint[0] | currentPoint[1]!=EndPoint[1]){\n console.log(currentPoint,\"not equal to\",EndPoint)\n document.getElementById(Grid[currentPoint[0]][currentPoint[1]].id).innerHTML=\"<div id='path\"+currentPoint[0]+\"x\"+currentPoint[1]+\"' class='path'></div>\";\n document.getElementById(\"path\"+currentPoint[0]+\"x\"+currentPoint[1]).style.animationDelay=indicator/15+\"s\"\n }\n \n Grid[currentPoint[0]][currentPoint[1]].State = \"Path\"\n //update, find the \n indicator -= 1\n //-x NORTH\n if(currentPoint[0] > 0){\n if(Grid[currentPoint[0]-1][currentPoint[1]].VisitedAt == indicator){\n path.push([currentPoint[0],currentPoint[1],\"NORTH\"])\n currentPoint[0] -= 1\n continue\n }\n \n }\n //+x SOUTH\n if(currentPoint[0] < GRID_ROW_SIZE-1){\n if(Grid[currentPoint[0]+1][currentPoint[1]].VisitedAt == indicator){\n path.push([currentPoint[0],currentPoint[1],\"SOUTH\"])\n currentPoint[0] += 1\n continue\n }\n \n }\n //-y WEST\n if(currentPoint[1] > 0){\n if(Grid[currentPoint[0]][currentPoint[1]-1].VisitedAt == indicator){\n path.push([currentPoint[0],currentPoint[1],\"WEST\"])\n currentPoint[1] -= 1\n continue\n }\n \n }\n //+y EAST\n if(currentPoint[1] < GRID_COL_SIZE-1){\n if(Grid[currentPoint[0]][currentPoint[1]+1].VisitedAt == indicator){\n path.push([currentPoint[0],currentPoint[1],\"EAST\"])\n currentPoint[1] += 1\n continue\n }\n \n }\n\n }\n //!! the path is the REVERSE PATH from the END to the START \n Grid[EndPoint[0]][EndPoint[1]].State = \"End\"\n console.log(path)\n consoleGridPrinter()\n}","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 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}","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 }","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}","animateShortestPath(nodesInShortestPathOrder) {\n for (let i = 1; i < nodesInShortestPathOrder.length-1; i++) {\n setTimeout(() => {\n const node = nodesInShortestPathOrder[i];\n document.getElementById(`node-${node.row}-${node.col}`).className =\n 'node node-shortest-path';\n }, 50 * i);\n }\n if(nodesInShortestPathOrder.length<=1){\n setTimeout(() => {\n alert(\"Path Not Found!!\");\n },1000);\n }\n }","findShortestPaths(source) {\n source.setDistance(0)\n let unsettledNodes = []\n let settledNodes = []\n\n unsettledNodes.push(source)\n let a = 0\n while (unsettledNodes.length != 0) {\n a++\n let currentNode = this.getLowestDistanceNode(unsettledNodes)\n unsettledNodes.splice(unsettledNodes.indexOf(currentNode), 1)\n\n for (let i = 0; i < currentNode.adjacentNodes.length; i++) {\n let adjacentNode = currentNode.adjacentNodes[i][0]\n let edgeWeight = currentNode.adjacentNodes[i][1]\n if (!settledNodes.includes(adjacentNode) && !unsettledNodes.includes(adjacentNode)) {\n this.calculateMinimumDistance(adjacentNode, edgeWeight, currentNode)\n unsettledNodes.push(adjacentNode)\n }\n }\n settledNodes.push(currentNode)\n }\n //console.log(a + \" iterations\")\n }","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 }","findPaths(){\n gridArray.forEach(function(yValue, yCoord){\n yValue.forEach(function(xValue, xCoord){\n BadBoggle.searchPath([[yCoord, xCoord]], yCoord, xCoord);\n });\n });\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}","function findPath(startPos, goalPos, pathNumber, ignoreTowerSpawns, ignoreTowers) {\n //copy mapGrid array to a temp array\n var grid = copyArray(gameLoop.returnMapOfPath(pathNumber));\n\n //Set Goal\n grid[goalPos.indexX][goalPos.indexY] = 'GOAL';\n\n // Each \"location\" will store its coordinates\n // and the shortest path required to arrive there\n var location = {\n distX: startPos.indexX,\n distY: startPos.indexY,\n path: [],\n block: 'START'\n };\n\n // Initialize the queue with the start location already inside\n var queue = [location];\n\n // Loop through the grid searching for the goal\n while (queue.length > 0) {\n // Take the first location off the queue\n var currentLocation = queue.shift();\n\n // Explore North\n var newLocation = exploreInDirection(currentLocation, 0, grid, ignoreTowerSpawns, ignoreTowers);\n if (newLocation.block === 'GOAL') {\n return newLocation.path;\n } else if (newLocation.block === 'Valid') {\n queue.push(newLocation);\n }\n\n // Explore East\n var newLocation = exploreInDirection(currentLocation, 1, grid, ignoreTowerSpawns, ignoreTowers);\n if (newLocation.block === 'GOAL') {\n return newLocation.path;\n } else if (newLocation.block === 'Valid') {\n queue.push(newLocation);\n }\n\n // Explore South\n var newLocation = exploreInDirection(currentLocation, 2, grid, ignoreTowerSpawns, ignoreTowers);\n if (newLocation.block === 'GOAL') {\n return newLocation.path;\n } else if (newLocation.block === 'Valid') {\n queue.push(newLocation);\n }\n\n // Explore West\n var newLocation = exploreInDirection(currentLocation, 3, grid, ignoreTowerSpawns, ignoreTowers);\n if (newLocation.block === 'GOAL') {\n return newLocation.path;\n } else if (newLocation.block === 'Valid') {\n queue.push(newLocation);\n }\n }\n\n // No valid path found\n return false;\n\n}","function optimize(ast) {\n }","function optimize(ast) {\n }","function optimizeBootModules () {\n\t\t\tgrunt.log.writeln('OK'.green);\n\t\t\tif (!options.dirs || !options.dirs.length) {\n\t\t\t\tfinalize();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tgrunt.util.async.forEachSeries(options.dirs, function(dir, next) {\n\t\t\t\tif (typeof dir === 'string') {\n\t\t\t\t\tdir = {\n\t\t\t\t\t\tcombine: false,\n\t\t\t\t\t\tname: dir\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\toptimizeDir(dir, next);\n\t\t\t}, function () {\n\t\t\t\tfinalize();\n\t\t\t});\n\t\t}","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 possiblePaths(n,paths){\nif(n==1){\n paths=1;\n return paths;\n}\nif(n==2){\n paths=2;\n return paths;\n}\nif(n==3){\n paths=4;\n return paths;\n}\npaths=possiblePaths(n-1)+possiblePaths(n-2)+possiblePaths(n-3);\nreturn paths;\n}","function calculatePath() {\n // create Nodes from the Start and End x,y coordinates\n let mypathStart = Node(null, { x: pathStart[0], y: pathStart[1] });\n let mypathEnd = Node(null, { x: pathEnd[0], y: pathEnd[1] });\n // create an array that will contain all world cells\n let AStar = new Array(worldSize);\n // list of currently open Nodes\n let Open = [mypathStart];\n // list of the final output array\n let result = [];\n // reference to a Node (that is nearby)\n let myNeighbours;\n // reference to a Node (that we are considering now)\n let myNode;\n // reference to a Node (that starts a path in question)\n let myPath;\n // temp integer variables used in the calculations\n let length, max, min, i, j;\n // iterate through the open list until none are left\n do {\n max = worldSize;\n min = -1;\n for (i = 0; i < length; i++) {\n if (Open[i].f < max) {\n max = Open[i].f;\n min = i;\n }\n }\n // grab the next node and remove it from Open array\n myNode = Open.splice(min, 1)[0];\n // is it the destination node?\n if (myNode.value === mypathEnd.value) {\n // we found a path!\n do {\n result.unshift([myNode.x, myNode.y]);\n\n myNode = myNode.Parent;\n }\n while (myNode !== null);\n\n // clear the working arrays\n AStar = Open = [];\n\n return result;\n }\n\n // find which nearby nodes are walkable\n myNeighbours = neighbours(myNode.x, myNode.y);\n for (i = 0, j = myNeighbours.length; i < j; i++) {\n // test each one that hasn't been tried already\n myPath = Node(myNode, myNeighbours[i]);\n if (!AStar[myPath.value]) {\n // estimated cost of this particular route so far\n myPath.g = myNode.g + distanceFunction(myNeighbours[i], myNode);\n // estimated cost of entire guessed route to the destination\n myPath.f = myPath.g + distanceFunction(myNeighbours[i], mypathEnd);\n // remember this new path for testing above\n Open.push(myPath);\n // mark this node in the world graph as visited\n AStar[myPath.value] = true;\n }\n }\n\n length = Open.length;\n } while (0 < length);\n\n return result;\n }","function calculatePath() {\n\t // create Nodes from the Start and End x,y coordinates\n\t var mypathStart = Node(null, { x: pathStart[0], y: pathStart[1] });\n\t var mypathEnd = Node(null, { x: pathEnd[0], y: pathEnd[1] });\n\t // create an array that will contain all world cells\n\t var AStar = new Array(worldSize);\n\t // list of currently open Nodes\n\t var Open = [mypathStart];\n\t // list of closed Nodes\n\t var Closed = [];\n\t // list of the final output array\n\t var result = [];\n\t // reference to a Node (that is nearby)\n\t var myNeighbours;\n\t // reference to a Node (that we are considering now)\n\t var myNode;\n\t // reference to a Node (that starts a path in question)\n\t var myPath;\n\t // temp integer variables used in the calculations\n\t var length, max, min, i, j;\n\t // iterate through the open list until none are left\n\t while (length = Open.length) {\n\t max = worldSize * 999999;\n\t min = -1;\n\t for (i = 0; i < length; i++) {\n\t if (Open[i].f < max) {\n\t max = Open[i].f;\n\t min = i;\n\t }\n\t }\n\t // grab the next node and remove it from Open array\n\t myNode = Open.splice(min, 1)[0];\n\t // is it the destination node?\n\t if (myNode.value === mypathEnd.value) {\n\t myPath = Closed[Closed.push(myNode) - 1];\n\t do {\n\t result.push([myPath.x, myPath.y]);\n\t } while (myPath = myPath.Parent);\n\t // clear the working arrays\n\t AStar = Closed = Open = [];\n\t // we want to return start to finish\n\t result.reverse();\n\t } else // not the destination\n\t {\n\t // find which nearby nodes are walkable\n\t myNeighbours = Neighbours(myNode.x, myNode.y);\n\t // test each one that hasn't been tried already\n\t for (i = 0, j = myNeighbours.length; i < j; i++) {\n\t myPath = Node(myNode, myNeighbours[i], world[myNeighbours[i].x][myNeighbours[i].y]);\n\t if (!AStar[myPath.value]) {\n\t // estimated cost of this particular route so far\n\t myPath.g += myNode.g + distanceFunction(myNeighbours[i], myNode);\n\t // estimated cost of entire guessed route to the destination\n\t myPath.f = myPath.g + distanceFunction(myNeighbours[i], mypathEnd);\n\t // remember this new path for testing above\n\t Open.push(myPath);\n\t // mark this node in the world graph as visited\n\t AStar[myPath.value] = true;\n\t }\n\t }\n\t // remember this route as having no more untested options\n\t Closed.push(myNode);\n\t }\n\t } // keep iterating until the Open list is empty\n\t return result;\n\t }","solveDFS() {\n for (let maxDepth = 0; maxDepth <= 10; maxDepth++) {\n let path = this.dfs(maxDepth);\n if (path) {\n this.drawSolvedPath(path);\n return path;\n }\n }\n return null;\n }","computePathToComplete(){\n if (Object.keys(this.state.legs_dict).length !== 0 &&Object.keys(this.state.stops_dict).length !== 0 && this.state.driver_location !== null) {\n\n // Time required to complete all legs\n var time_complete_all_legs = 0\n // Time required to complete driver's remaining path\n var time_complete = 0\n \n // Append legs dictionary with start and stop locations and compute time required to drive from start to stop.\n // Also, compute times to complete driver's path and all legs\n var new_legs_dict = {}\n var is_passed_driver_leg = false\n\n for (var key in this.state.legs_dict) {\n var dict_specs = this.state.legs_dict[key]\n dict_specs[\"startStop_x\"] = this.state.stops_dict[dict_specs[\"startStop\"]][\"x\"]\n dict_specs[\"startStop_y\"] = this.state.stops_dict[dict_specs[\"startStop\"]][\"y\"]\n dict_specs[\"endStop_x\"] = this.state.stops_dict[dict_specs[\"endStop\"]][\"x\"]\n dict_specs[\"endStop_y\"] = this.state.stops_dict[dict_specs[\"endStop\"]][\"y\"]\n \n // Distance between subsequent stops\n var dist = Math.sqrt(Math.pow(dict_specs[\"endStop_x\"] - dict_specs[\"startStop_x\"], 2) + \n Math.pow(dict_specs[\"endStop_y\"] - dict_specs[\"startStop_y\"], 2))\n // Time required to drive from the start to the stop point\n dict_specs[\"time\"] = dist / dict_specs[\"speedLimit\"]\n\n // Update leg info\n new_legs_dict[key] = dict_specs\n\n // Update time to complete the entire path and the remaining path\n time_complete_all_legs += new_legs_dict[key][\"time\"]\n if (is_passed_driver_leg) time_complete += new_legs_dict[key][\"time\"]\n if (key === this.state.driver_location[\"activeLegID\"]) is_passed_driver_leg = true\n }\n\n // Update time to complete the remaining path with the time to complete the current leg\n time_complete += new_legs_dict[this.state.driver_location[\"activeLegID\"]][\"time\"] * (100 - parseInt(this.state.driver_location[\"legProgress\"])) / 100\n \n this.setState({legs_dict: new_legs_dict,\n bonus2_time_complete_all_legs: time_complete_all_legs,\n bonus2_time_complete: time_complete\n })\n } else {\n this.setState({alert_info: {status: true,\n type: \"warning\",\n reason: \"computePath\",\n message: \"Legs, stops and driver location are reqired for this feature to work\"}})\n }\n }","function paths(data, ctx) {\n\t ctx.clearRect(-1, -1, w() + 2, h() + 2);\n\t ctx.beginPath();\n\t data.forEach(function (d) {\n\t if (__.bundleDimension !== null && __.bundlingStrength > 0 || __.smoothness > 0) {\n\t single_curve(d, ctx);\n\t } else {\n\t single_path(d, ctx);\n\t }\n\t });\n\t ctx.stroke();\n\t }","searchPath( pastPositions, currY, currX ){\n var wentSomewhere = false;\n \n //Try to go up\n if(BadBoggle.validPath(pastPositions, currY - 1, currX)){\n BadBoggle.searchPath( \n pastPositions.concat([[currY - 1, currX]]),\n currY - 1,\n currX\n );\n\n wentSomewhere = true;\n }\n\n //Try to go right \n if(BadBoggle.validPath(pastPositions, currY, currX + 1)){\n BadBoggle.searchPath( \n pastPositions.concat([[currY, currX + 1]]),\n currY,\n currX + 1\n );\n\n wentSomewhere = true;\n }\n\n //Try to go down \n if(BadBoggle.validPath(pastPositions, currY + 1, currX)){\n BadBoggle.searchPath( \n pastPositions.concat([[currY + 1, currX]]),\n currY + 1,\n currX\n );\n\n wentSomewhere = true;\n }\n\n //Try to go left \n if(BadBoggle.validPath(pastPositions, currY, currX - 1)){\n BadBoggle.searchPath( \n pastPositions.concat([[currY, currX - 1]]),\n currY,\n currX - 1\n );\n\n wentSomewhere = true;\n }\n\n // If all paths are exhausted, add the path to the array\n if(wentSomewhere === false){\n var pathString = '';\n pastPositions.forEach(function(coords){\n pathString += gridArray[coords[0]][coords[1]];\n });\n gridPaths.push( pathString );\n }\n }","function iterateFromLeaves(f) {\n function optimizeNextFromLeaves(node) {\n if (node instanceof SourceNode) {\n return;\n }\n var next = node.parent;\n if (f(node)) {\n optimizeNextFromLeaves(next);\n }\n }\n return optimizeNextFromLeaves;\n }","generateAndTestMap(){\r\n let test = null;\r\n let ok = false\r\n while(test === null && !ok) {\r\n this.generateField();\r\n\r\n let pf = new Pathfinding(this);\r\n test = pf.findPath()\r\n }\r\n if(test.length < this.minPath) test = this.generateAndTestMap();\r\n return test;\r\n }","findWay(passedGrid) {\n // console.log('moj gridek', passedGrid)\n var pathFinder = (entranceX, entranceY, grid) => {\n var distanceFromTop = entranceX;\n var distanceFromLeft = entranceY;\n\n var location = {\n distanceFromTop: distanceFromTop,\n distanceFromLeft: distanceFromLeft,\n path: [],\n status: 'Start'\n }\n\n //inicjalizacja kolejki\n var queue = [];\n queue.push(location);\n\n //loop grida\n while (queue.length > 0) {\n //zwrocenie pierwszego elementu z kolejki\n var currentLocation = queue.shift();\n\n //polnoc\n var newLocation = explore(currentLocation, 'North', grid);\n //jesli wyjscie przekazac do stanu aplikacji kolejke z najkrotsza sciezka\n if (newLocation.status === 'Exit') {\n this.setState(prevState => ({\n exit: [...prevState.exit, newLocation.path]\n }))\n return newLocation.path;\n //droga\n } else if (newLocation.status === 'Valid') {\n queue.push(newLocation);\n }\n\n //wschod\n var newLocation = explore(currentLocation, 'East', grid);\n if (newLocation.status === 'Exit') {\n this.setState(prevState => ({\n exit: [...prevState.exit, newLocation.path]\n }))\n return newLocation.path;\n } else if (newLocation.status === 'Valid') {\n queue.push(newLocation);\n }\n\n //poludnie\n var newLocation = explore(currentLocation, 'South', grid);\n if (newLocation.status === 'Exit') {\n this.setState(prevState => ({\n exit: [...prevState.exit, newLocation.path]\n }))\n return newLocation.path;\n } else if (newLocation.status === 'Valid') {\n queue.push(newLocation);\n }\n\n //zachod\n var newLocation = explore(currentLocation, 'West', grid);\n if (newLocation.status === 'Exit') {\n this.setState(prevState => ({\n exit: [...prevState.exit, newLocation.path]\n }))\n return newLocation.path;\n } else if (newLocation.status === 'Valid') {\n queue.push(newLocation);\n }\n }\n //nie znaleziono drogi\n this.setState(prevState => ({\n exit: [...prevState.exit, 'Nie znaleziono wyjścia, ten grobowiec będzie twoim grobowcem']\n }))\n return false;\n }\n\n //sprawdzenie typu lokacji\n var locationStatus = (location, grid) => {\n let gridSize = grid.length;\n let dft = location.distanceFromTop;\n let dfl = location.distanceFromLeft;\n // console.log(gridSize, 'size')\n // console.log(location)\n // console.log(grid, dft, dfl);\n\n if (location.distanceFromLeft < 0 ||\n location.distanceFromLeft >= gridSize ||\n location.distanceFromTop < 0 ||\n location.distanceFromTop >= gridSize) {\n //poza gridem\n return 'Invalid';\n //jesli wyjscie\n } else if (grid[dft][dfl].type === 'w') {\n return 'Exit';\n //jesli nie droga (zablokowana lub odwiedzona)\n } else if (grid[dft][dfl].type !== 'o') {\n return 'Blocked';\n //jesli droga\n } else {\n return 'Valid';\n }\n }\n\n //chodzenie\n var explore = (currentLocation, direction, grid) => {\n var newPath = currentLocation.path.slice();\n newPath.push(direction);\n\n var dft = currentLocation.distanceFromTop;\n var dfl = currentLocation.distanceFromLeft;\n\n if (direction === 'North') {\n dft -= 1;\n } else if (direction === 'East') {\n dfl += 1;\n } else if (direction === 'South') {\n dft += 1;\n } else if (direction === 'West') {\n dfl -= 1;\n }\n\n var newLocation = {\n distanceFromTop: dft,\n distanceFromLeft: dfl,\n path: newPath,\n status: 'Unknown'\n };\n\n newLocation.status = locationStatus(newLocation, grid);\n\n //jesli droga, to oznacz lokacje jako odwiedzoną\n if (newLocation.status === 'Valid') {\n grid[newLocation.distanceFromTop][newLocation.distanceFromLeft] = 'Visited';\n }\n\n return newLocation;\n }\n console.log(pathFinder(this.state.startY, this.state.startX, passedGrid));\n }","nextStep(){\n this.search.shift()\n this.search = this.children.concat(this.search)\n\n if( this.search.length == 0){\n this.finished = true\n }\n else{\n this.state = this.search[0]\n this.children = []\n\n // If it is a final state\n if( this.blockInPath(this.state, this.maze.getFinish()) && this.state.length < this.cost){\n this.bestPath = this.state\n this.cost = this.state.length\n }\n // Branch and Bound: Examine the following paths only if they are better than the current best\n else if(this.state.length + 1 < this.cost){\n // Get the children paths with no repeating nodes\n this.children = this.getChildren(this.state).filter( child => !this.blockInPath(this.state, child[child.length - 1]) )\n \n }\n }\n \n }","function nextStepPaths(x, z, xCount, zCount, board, endChar, xPrev, zPrev, ignorePointsBehind, dst) {\n function checkAdjacent(expect, expect2, expect3, xx, zz, notExpect) {\n if (xx === xPrev && zz === zPrev) {\n return null;\n }\n var ch = board[zz][xx];\n if (ch === expect || ch === expect2 || ch === expect3) {\n dst.push({ x: xx, z: zz });\n }\n else if (notExpect === ch) { }\n else if (ch === endChar) {\n return { x: xx, z: zz };\n }\n return null;\n }\n var res = ForEachUtil.forEachDirection(x, z, xCount, zCount, {\n top: function (x, z) { return checkAdjacent('|', '/', '\\\\', x, z, '-'); },\n topRight: function (x, z) { return checkAdjacent('/', '|', '-', x, z, '\\\\'); },\n right: function (x, z) { return checkAdjacent('-', '/', '\\\\', x, z, '|'); },\n bottomRight: function (x, z) { return checkAdjacent('\\\\', '|', '-', x, z, '/'); },\n bottom: function (x, z) { return checkAdjacent('|', '/', '\\\\', x, z, '-'); },\n bottomLeft: function (x, z) { return checkAdjacent('/', '|', '-', x, z, '\\\\'); },\n left: function (x, z) { return checkAdjacent('-', '/', '\\\\', x, z, '|'); },\n topLeft: function (x, z) { return checkAdjacent('\\\\', '|', '-', x, z, '//'); },\n }, ignorePointsBehind, xPrev, zPrev);\n return res;\n }","followPaths(path_so_far) {\n // logging\n this.get_paths_ran += 1;\n if (this.get_paths_ran % 10000 == 0) {\n Log(\"get paths ran \" + String(this.get_paths_ran));\n }\n let note = this.db[path_so_far.all_members.last()];\n let all_members = path_so_far.all_members;\n let items = path_so_far.items;\n let new_paths_to_follow = [];\n let note_links_to = note.links_to.slice();\n let note_linked_from = note.linked_from.slice();\n note_links_to.forEach((link) => {\n // check whether the linked note also links to the current note\n let linked_to_or_both_ways = LINKED_TO;\n if (note_linked_from.contains(link)) {\n // remove it from the passive links to be followed later\n let index = note_linked_from.indexOf(link, 0);\n note_linked_from.splice(index, 1);\n linked_to_or_both_ways = LINKED_BOTH;\n }\n let new_path = {\n all_members: all_members.concat(link),\n items: items.concat([[link, linked_to_or_both_ways]]),\n };\n new_paths_to_follow.push(new_path);\n });\n note_linked_from.forEach((link) => {\n let new_path = {\n all_members: all_members.concat(link),\n items: items.concat([[link, LINKED_FROM]]),\n };\n new_paths_to_follow.push(new_path);\n });\n let called_itself = false; // whether the function called itself\n // function calls itself to explore every new path\n new_paths_to_follow.forEach((path) => {\n // the path without the next note that is to be explored\n let all_items_so_far = path.all_members.slice(0, -1);\n let last_item_path = path.all_members.last();\n let last_item = this.getNoteFromPath(last_item_path);\n // stop if this note is already part of the explored path\n if (all_items_so_far.includes(last_item_path)) {\n return;\n }\n // stop if the path meanders too much\n if (path.all_members.length - last_item.distance_from_CN > 1) {\n return;\n }\n this.followPaths(path);\n called_itself = true;\n });\n if (!called_itself) {\n // only add the path if it does't lead anywhere else. No need to have paths that are parts of other paths\n this.all_paths.push(path_so_far);\n }\n }","function getForwardPathsLoopgains(paths){\r\n var forwardLoopgains = [];\r\n\r\n paths.forEach(p => {\r\n var forwardEdges = extractPathEdges(p);\r\n var flg = calculateLoopGain(forwardEdges);\r\n forwardLoopgains.push(flg);\r\n });\r\n\r\n return forwardLoopgains;\r\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 }","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}","function findAndAdd2ProngsOnAllPaths(shape) {\n let for2ProngsArray = shape.for2ProngsArray;\n for (let k = 0; k < for2ProngsArray.length; k++) {\n let for2Prongs = for2ProngsArray[k];\n findAndAdd2Prongs(shape, k, for2Prongs);\n }\n}","function solveMaze(){\n var Xqueue=[parseInt(src_x)]; \n var Yqueue=[parseInt(src_y)]; \n let pathFound=false;\n var xLoc;\n var yLoc;\n\n while(Xqueue.length>0 && !pathFound){\n xLoc=Xqueue.shift();\n yLoc=Yqueue.shift();\n if(xLoc>1){\n if(tiles[xLoc-1][yLoc].state=='f'){\n pathFound=true;\n }\n }\n if(xLoc<tileColCount-1){\n if(tiles[xLoc+1][yLoc].state=='f'){\n pathFound=true;\n }\n }\n if(yLoc>1){\n if(tiles[xLoc][yLoc-1].state=='f'){\n pathFound=true;\n }\n }\n \n if(yLoc<tileRowCount-1){\n if(tiles[xLoc][yLoc+1].state=='f'){\n pathFound=true;\n }\n }\n if(xLoc>1){\n if(tiles[xLoc-1][yLoc].state=='e'){\n Xqueue.push(xLoc-1);\n Yqueue.push(yLoc);\n tiles[xLoc-1][yLoc].state=tiles[xLoc][yLoc].state+'l';\n // rect(xloc-1,yLoc,tileW,tileH,tiles[xLoc-1][yLoc].state);\n }\n }\n if(xLoc<tileColCount-1){\n if(tiles[xLoc+1][yLoc].state=='e'){\n Xqueue.push(xLoc+1);\n Yqueue.push(yLoc);\n tiles[xLoc+1][yLoc].state=tiles[xLoc][yLoc].state+'r';\n //rect(xloc+1,yLoc,tileW,tileH,tiles[xLoc+1][yLoc].state);\n }\n }\n if(yLoc>1){\n if(tiles[xLoc][yLoc-1].state=='e'){\n Xqueue.push(xLoc);\n Yqueue.push(yLoc-1);\n tiles[xLoc][yLoc-1].state=tiles[xLoc][yLoc].state+'u';\n // rect(xloc,yLoc-1,tileW,tileH,tiles[xLoc][yLoc-1].state);\n }\n }\n if(yLoc<tileRowCount-1){\n if(tiles[xLoc][yLoc+1].state=='e'){\n Xqueue.push(xLoc);\n Yqueue.push(yLoc+1);\n tiles[xLoc][yLoc+1].state=tiles[xLoc][yLoc].state+'d';\n // rect(xloc,yLoc+1,tileW,tileH,tiles[xLoc][yLoc+1].state);\n }\n }\n //setInterval(draw(),100);\n }\n if(!pathFound){\n output.innerHTML=\"No Solution\";\n }\n else{\n output.innerHTML=\"Solved\";\n let path=tiles[xLoc][yLoc].state; \n let pathLength=path.length;\n let currX=parseInt(src_x); \n let currY=parseInt(src_y); \n for(let i=0;i<pathLength-1;i++){\n if(path.charAt(i+1)=='u'){\n currY-=1;\n }\n if(path.charAt(i+1)=='d'){\n currY+=1;\n }\n if(path.charAt(i+1)=='l'){\n currX-=1;\n }\n if(path.charAt(i+1)=='r'){\n currX+=1;\n }\n tiles[currX][currY].state='p';\n }\n }\n}","buildPath(num) {\n var result = new Set();\n var cur = num;\n const maxBound = this.props.maxBound;\n while (!result.has(cur) && cur <= maxBound && cur >= -maxBound) {\n result.add(cur);\n cur = this.getDestination(cur);\n }\n return [...result];\n }","function calculatePath()\n\n{\n\n// create Nodes from the Start and End x,y coordinates\n\nvar\n\nmypathStart = Node(null, {x:pathStart[0], y:pathStart[1]});\n\nvar mypathEnd = Node(null, {x:pathEnd[0], y:pathEnd[1]});\n\n// create an array that will contain all world cells\n\nvar AStar = new Array(worldSize);\n\n// list of currently open Nodes\n\nvar Open = [mypathStart];\n\n// list of closed Nodes\n\nvar Closed = [];\n\n// list of the final output array\n\nvar result = [];\n\n// reference to a Node (that is nearby)\n\nvar myNeighbours;\n\n// reference to a Node (that we are considering now)\n\nvar myNode;\n\n// reference to a Node (that starts a path in question)\n\nvar myPath;\n\n// temp integer variables used in the calculations\n\nvar length, max, min, i, j;\n\n// iterate through the open list until none are left\n\nwhile(length = Open.length)\n\n{\n\nmax = worldSize;\n\nmin = -1;\n\nfor(i = 0; i < length; i++)\n\n{\n\nif(Open[i].f < max)\n\n{\n\nmax = Open[i].f;\n\nmin = i;\n\n}\n\n}\n\n// grab the next node and remove it from Open array\n\nmyNode = Open.splice(min, 1)[0];\n\n// is it the destination node?\n\nif(myNode.value === mypathEnd.value)\n\n{\n\nmyPath = Closed[Closed.push(myNode) - 1];\n\ndo\n\n{\n\nresult.push([myPath.x, myPath.y]);\n\n}\n\nwhile (myPath = myPath.Parent);\n\n// clear the working arrays\n\nAStar = Closed = Open = [];\n\n// we want to return start to finish\n\nresult.reverse();\n\n}\n\nelse // not the destination\n\n{\n\n// find which nearby nodes are walkable\n\nmyNeighbours = Neighbours(myNode.x, myNode.y);\n\n// test each one that hasn't been tried already\n\nfor(i = 0, j = myNeighbours.length; i < j; i++)\n\n{\n\nmyPath = Node(myNode, myNeighbours[i]);\n\nif (!AStar[myPath.value])\n\n{\n\n// estimated cost of this particular route so far\n\nmyPath.g = myNode.g + distanceFunction(myNeighbours[i], myNode);\n\n// estimated cost of entire guessed route to the destination\n\nmyPath.f = myPath.g + distanceFunction(myNeighbours[i], mypathEnd);\n\n// remember this new path for testing above\n\nOpen.push(myPath);\n\n// mark this node in the world graph as visited\n\nAStar[myPath.value] = true;\n\n}\n\n}\n\n// remember this route as having no more untested options\n\nClosed.push(myNode);\n\n}\n\n} // keep iterating until the Open list is empty\n\nreturn result;\n\n}","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}","function buildPath(pathStack, timer, visitedNodes, visitedNodesPainted) {\r\n\r\n pathStack.forEach(element => {\r\n setTimeout(function() {element.classList += \" pathNode\"}, timer * 50)\r\n timer++\r\n });\r\n}","function hivtrace_get_path(next, i, j) {\n\n var all_paths = [];\n var i = parseInt(i);\n var j = parseInt(j);\n\n for (var c = 0; c < next[i][j].length; c++) {\n\n var k = next[i][j][c];\n var intermediate = k;\n\n if (intermediate == null || intermediate == i) {\n return [\n [parseInt(i), parseInt(j)]\n ];\n } else {\n\n var paths_i_k = hivtrace_get_path(next, i, intermediate);\n var paths_k_j = hivtrace_get_path(next, intermediate, j);\n\n for (var i_k_index = 0; i_k_index < paths_i_k.length; i_k_index++) {\n var i_k = paths_i_k[i_k_index];\n for (var k_j_index = 0; k_j_index < paths_k_j.length; k_j_index++) {\n var k_j = paths_k_j[k_j_index];\n if (i_k.length) {\n if ((i_k[0] == i) && (i_k[i_k.length - 1] == k) && (k_j[0] == k) && (k_j[k_j.length - 1] == j)) {\n i_k.pop()\n all_paths.push(i_k.concat(k_j));\n }\n }\n }\n }\n }\n }\n\n return all_paths;\n\n}","shortestPath(start, goal) {\n // start isn't moveable to\n if (!this.moveable(start.x / this.tileW, start.y / this.tileH)) {\n return [];\n }\n let openSet = [];\n let closedSet = [];\n openSet.push(start);\n\n // clear path finding data\n for (let y = 0; y < round(height / this.tileH); y++) {\n for (let x = 0; x < round(width / this.tileW); x++) {\n this.map[y][x].f = 0;\n this.map[y][x].g = 0;\n this.map[y][x].h = 0;\n this.map[y][x].parent = null;\n }\n }\n\n while (openSet.length > 0) {\n // get lowest cost node in open set\n let currentNode = openSet[0];\n for (let i = 0; i < openSet.length; i++) {\n if (openSet[i].f < currentNode.f)\n currentNode = openSet[i];\n }\n\n // if end has been reached, then finish\n if (currentNode.x == goal.x && currentNode.y == goal.y) {\n let path = []\n while (currentNode.parent != null) {\n path.push(currentNode);\n currentNode = currentNode.parent;\n }\n return path.reverse();\n }\n\n // remove currentNode from openset, and put into closed set\n closedSet.push(currentNode);\n for (let i = openSet.length - 1; i >= 0; i--) {\n if (openSet[i] === currentNode) {\n openSet.splice(i, 1);\n }\n }\n\n // evaluate currentNode's neighbours\n for (let i = 0; i < currentNode.neighbours.length; i++) {\n let neighbour = currentNode.neighbours[i];\n if (!this.moveable(neighbour.x / this.tileW, neighbour.y / this.tileH)) {\n continue;\n }\n if (closedSet.includes(neighbour))\n continue;\n // valid neighbour found..\n let gScore = currentNode.g + 1;\n let bestG = false;\n if (!openSet.includes(neighbour)) {\n // first time at neighbour, so it's the best\n bestG = true;\n neighbour.h = this.heuristic(neighbour.x, neighbour.y, goal.x, goal.y);\n openSet.push(neighbour);\n } else if (gScore < neighbour.g) {\n // worse path to it exists in openset..\n bestG = true;\n openSet.splice(openSet.indexOf(neighbour), 1);\n }\n\n if (bestG) {\n neighbour.parent = currentNode;\n neighbour.g = gScore;\n neighbour.f = neighbour.h + neighbour.g;\n }\n }\n }\n // no path found\n return [];\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 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 optimize (root, options) {\n\t if (!root) { return }\n\t isStaticKey = genStaticKeysCached(options.staticKeys || '');\n\t isPlatformReservedTag = options.isReservedTag || no;\n\t // first pass: mark all non-static nodes.\n\t markStatic$1(root);\n\t // second pass: mark static roots.\n\t markStaticRoots(root, false);\n\t}","function optimize (root, options) {\n\t if (!root) { return }\n\t isStaticKey = genStaticKeysCached(options.staticKeys || '');\n\t isPlatformReservedTag = options.isReservedTag || no;\n\t // first pass: mark all non-static nodes.\n\t markStatic$1(root);\n\t // second pass: mark static roots.\n\t markStaticRoots(root, false);\n\t}","function optimize (root, options) {\n\t if (!root) { return }\n\t isStaticKey = genStaticKeysCached(options.staticKeys || '');\n\t isPlatformReservedTag = options.isReservedTag || no;\n\t // first pass: mark all non-static nodes.\n\t markStatic$1(root);\n\t // second pass: mark static roots.\n\t markStaticRoots(root, false);\n\t}"],"string":"[\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 }\",\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 }\",\n \"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}\",\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 }\",\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}\",\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 }\",\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}\",\n \"function shortenPaths(graph) {\\n var foundNonTrivialPaths = true,\\n startNode = null,\\n startNodeName = null,\\n minWeight = 0;\\n\\n while(foundNonTrivialPaths) {\\n foundNonTrivialPaths = false;\\n for(startNodeName in graph) {\\n startNode = graph[startNodeName];\\n depthFirstSearch(\\n startNodeName, \\n graph, \\n followingNonTrivialPath(\\n [],\\n [\\n correctMinimumWeight,\\n modifyStep\\n ],\\n [\\n resetMinimumWeight\\n ]\\n )\\n );\\n }\\n }\\n\\n function followingNonTrivialPath (startFns, stepFns, endFns) {\\n return function inner (path, pathIndex) {\\n if(path.length > 1) {\\n foundNonTrivialPaths = true;\\n startFns.forEach(function eachStartFn (startFn) {\\n startFn.call(this, path, pathIndex);\\n });\\n stepFns.forEach(function eachStepFn (fn) {\\n path.forEach(stepFns);\\n });\\n endFns.forEach(function eachEndFn (endFn) {\\n endFn.call(this, path, pathIndex);\\n });\\n }\\n }\\n }\\n\\n function modifyStep (step, stepIndex, path) { \\n if(step.edge.weight === minWeight) {\\n delete step.node.edges[step.nextNodeName];\\n }\\n else {\\n // reduce weight of edge by lowest weight along non-trivial path\\n step.edge.weight -= minWeight;\\n }\\n\\n if(stepIndex === path.length - 1) {\\n // get/create edge between start and end of current path\\n ensureAttr(startNode.edges, step.nextNodeName, { weight: 0});\\n startNode.edges[step.nextNodeName].weight += minWeight; \\n } \\n }\\n\\n function correctMinimumWeight (step) {\\n if(step.edge != null && step.edge.weight > 0 && minWeight === 0 || minWeight > 0 && step.edge.weight < minWeight) {\\n minWeight = step.edge.weight;\\n }\\n }\\n \\n function resetMinimumWeight () {\\n minWeight = 0;\\n }\\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}\",\n \"isReachable(vertID1, vertID2, curr=null, path=[]) {\\n if(curr == vertID1) {\\n return [];\\n }\\n if(curr == vertID2) {\\n path.push(curr);\\n return path;\\n }\\n let result = [];\\n curr = curr || vertID1;\\n for(let edge of this.edgeList) {\\n if(edge[0] == curr) {\\n path.push(edge[0]);\\n result.push(this.isReachable(vertID1, vertID2, edge[1], path));\\n }\\n }\\n return result;\\n }\",\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}\",\n \"function build_full_paths(FI, FP, Paths) {\\n var i = 0,\\n L = 0,\\n R = 0,\\n C = 0,\\n j = 0,\\n pl = Paths.length;\\n var dad = [],\\n q = [];\\n\\n for (; i < pl; ++i) {\\n dad[i] = q[i] = i;\\n FP[i] = Paths[i];\\n }\\n\\n for (; j < q.length; ++j) {\\n i = q[j];\\n L = FI[i].L;\\n R = FI[i].R;\\n C = FI[i].C;\\n\\n if (dad[i] === i) {\\n if (L !== -1\\n /*NOSTREAM*/\\n && dad[L] !== L) dad[i] = dad[L];\\n if (R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n }\\n\\n if (C !== -1\\n /*NOSTREAM*/\\n ) dad[C] = i;\\n\\n if (L !== -1 && i != dad[i]) {\\n dad[L] = dad[i];\\n if (q.lastIndexOf(L) < j) q.push(L);\\n }\\n\\n if (R !== -1 && i != dad[i]) {\\n dad[R] = dad[i];\\n if (q.lastIndexOf(R) < j) q.push(R);\\n }\\n }\\n\\n for (i = 1; i < pl; ++i) if (dad[i] === i) {\\n if (R !== -1\\n /*NOSTREAM*/\\n && dad[R] !== R) dad[i] = dad[R];else if (L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n }\\n\\n for (i = 1; i < pl; ++i) {\\n if (FI[i].type === 0\\n /* unknown */\\n ) continue;\\n j = i;\\n if (j != dad[j]) do {\\n j = dad[j];\\n FP[i] = FP[j] + \\\"/\\\" + FP[i];\\n } while (j !== 0 && -1 !== dad[j] && j != dad[j]);\\n dad[i] = -1;\\n }\\n\\n FP[0] += \\\"/\\\";\\n\\n for (i = 1; i < pl; ++i) {\\n if (FI[i].type !== 2\\n /* stream */\\n ) FP[i] += \\\"/\\\";\\n }\\n }\",\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}\",\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}\",\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 }\",\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 }\",\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}\",\n \"function applyPath(){\\n\\t\\tvar cap = [];\\n\\t\\tdelta = 0;\\n\\t\\tGraph.instance.edges.forEach(function(key,edge){\\n\\t\\t\\tstate.edgePrevCost[edge.id] = edge.resources[1];\\n\\t\\t});\\n\\t\\tfor (var i =0; i<state.edgesOfSP.length; i++){\\n\\t\\t\\t\\n\\t\\t\\tcap[i] = state.edgesOfSP[i].resources[0]-state.edgesOfSP[i].state.flow;\\n\\t\\t\\t\\n\\t\\t}\\n var minCap = d3.min(cap);\\n\\t\\t\\n\\t\\tvar excessDemandMin = Math.min(Graph.instance.nodes.get(state.sourceId).b , -Graph.instance.nodes.get(state.targetId).b);\\n\\t\\tdelta = Math.min(minCap, excessDemandMin);\\n\\t\\t\\n\\t\\n\\t\\tfor (var i = 0; i < state.edgesOfSP.length; i++){\\n \\n var edge = state.edgesOfSP[i];\\n\\n edge.state.flow += edge.start.state.predecessor[\\\"direction\\\"] * delta;\\n\\t\\t\\tminCost += delta * edge.edges[\\\"cost\\\"];\\n }\\n\\t\\tGraph.instance.nodes.forEach(function(key,node){\\n\\t\\t\\tbs[node.id] = node.b;\\n\\t\\t\\tif(node.id == state.sourceId){\\n\\t\\t\\t\\tnode.b = node.b-delta;\\n\\t\\t\\t\\tbOfS = node.b;\\n\\t\\t\\t}else if(node.id == state.targetId){\\n\\t\\t\\t\\tnode.b = node.b + delta;\\n\\t\\t\\t\\tbOfT = node.b;\\n\\t\\t\\t\\t\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tnode.b = 0;\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\tGraph.instance.edges.forEach(function(key, edge) {\\n\\t\\t\\tedge.inSP = false;\\n\\t\\t\\tif(edge.state.flow == edge.resources[0]){\\n\\t\\t\\t\\tedge.state.usedUp = true;\\t\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tedge.state.usedUp = false;\\t\\n\\n\\t\\t\\t}\\n });\\n logger.log(\\\"Applied augmenting path with flow \\\"+state.augmentation);\\n\\t\\tdel = 0;\\n\\t\\tstate.distancesOfNodes = [];\\n state.show_residual_graph = false;\\n\\t\\tstate.shortestPath = [];\\n state.current_step = STEP_MAINLOOP;\\n\\t\\t\\n\\t}\",\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 }\",\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}\",\n \"function findPath (start, stop, mapToUse) {\\n var checked = [];\\n var queue = [];\\n var villages = [];\\n\\n queue.push([start]);\\n checked.push(start);\\n\\n while(queue.length !== 0){\\n var path = queue.shift(); // Get shortest path\\n var t = path[path.length - 1]; // Take last element without removing it\\n var tx = t[0];\\n var ty = t[1];\\n\\n // If the last element is the one we are looking for\\n // return the path\\n if((mapToUse[tx][ty]).position.equals(stop)){\\n return path;\\n }\\n\\n var newPath = [];\\n // Add all adjacent nodes to paths and push them to the \\\"prio\\\" queue\\n // Paths cannot go through moutains\\n if(customIndexOf(checked, [(tx+1),ty]) == -1 &&\\n !isOutOfBounds(tx+1, ty, mapToUse) &&\\n isPassable(tx+1, ty, mapToUse)){\\n newPath = path.slice();\\n checked.push([(tx+1),ty]); // Push node to checked so we dont use it again\\n newPath.push([(tx+1),ty]);\\n queue.push(newPath.slice()); // Push old path plus new node to prio queue\\n }\\n\\n if (customIndexOf(checked, [(tx-1),ty]) == -1 &&\\n !isOutOfBounds(tx-1, ty, mapToUse) &&\\n isPassable(tx-1, ty, mapToUse)) {\\n newPath = path.slice();\\n checked.push([(tx-1),ty]);\\n newPath.push([(tx-1),ty]);\\n queue.push(newPath.slice());\\n }\\n\\n if (customIndexOf(checked, [tx,(ty+1)]) == -1 &&\\n !isOutOfBounds(tx, ty+1, mapToUse) &&\\n isPassable(tx, ty+1, mapToUse)) {\\n newPath = path.slice();\\n checked.push([tx,(ty+1)]);\\n newPath.push([tx,(ty+1)]);\\n queue.push(newPath.slice());\\n }\\n\\n if (customIndexOf(checked, [tx,(ty-1)]) == -1 &&\\n !isOutOfBounds(tx, ty-1, mapToUse) &&\\n isPassable(tx, ty-1, mapToUse)) {\\n newPath = path.slice();\\n checked.push([tx,(ty-1)]);\\n newPath.push([tx,(ty-1)]);\\n queue.push(newPath.slice());\\n }\\n\\n queue.sort(function(a, b){return a.length - b.length;}); // This is needed as I'm too lazy to create/use a prio queue\\n }\\n\\n return null;\\n}\",\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}\",\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 }\",\n \"function traverse(cur_pos, tc, b, visited, optPaths) {\\n if(tc<0) return -2;\\n\\n if(cur_pos==b){\\n optPaths[b][\\\"spt\\\"] = tc;\\n optPaths[b][\\\"path\\\"] = [];\\n optPaths[b][\\\"path\\\"].push(b);\\n optPaths[b][\\\"res\\\"] = graph_vertices[b];\\n console.log(\\\"base case\\\");\\n return optPaths[b][\\\"res\\\"];\\n }\\n\\n // let copiedOptPaths = JSON.parse(JSON.stringify(optPaths));\\n let maxRes = -1, rec_ans, maxST = -1;\\n visited[cur_pos] = 1;\\n let temp_path = [];\\n\\n for(let i=0; i<graph_edges[cur_pos].length; i++){\\n let toVis = graph_edges[cur_pos][i][0];\\n let nbr_wt = graph_edges[cur_pos][i][1];\\n console.log(toVis, nbr_wt);\\n \\n if(visited[toVis]==0){\\n visited[toVis]=1;\\n rec_ans = traverse(toVis, tc-nbr_wt, b, visited, optPaths);\\n visited[toVis]=0;\\n\\n // if(rec_ans>maxRes || (rec_ans==maxRes && (maxST<optPaths[b][\\\"spt\\\"]))){\\n if(parseInt(rec_ans)>parseInt(maxRes) || (rec_ans==maxRes && (maxST<optPaths[b][\\\"spt\\\"]))){\\n maxRes = rec_ans;\\n maxST = optPaths[b][\\\"spt\\\"];\\n\\n temp_path = optPaths[toVis][\\\"path\\\"];\\n // optPaths[cur_pos] = optPaths[toVis];\\n console.log(\\\"max res update:\\\", maxRes, optPaths[cur_pos][\\\"path\\\"]);\\n }\\n }\\n\\n }\\n\\n if(maxRes != -1){\\n optPaths[cur_pos][\\\"res\\\"] = maxRes + graph_vertices[cur_pos];\\n temp_path.unshift(cur_pos);\\n }\\n \\n optPaths[cur_pos][\\\"path\\\"] = temp_path;\\n optPaths[cur_pos][\\\"spt\\\"] = maxST;\\n // optPaths[cur_pos][\\\"res\\\"] += graph_vertices[cur_pos];\\n\\n visited[cur_pos] = 0; // backtracking\\n if(maxRes==-1) return -2;\\n\\n console.log(\\\"return value:\\\", optPaths[cur_pos][\\\"res\\\"]);\\n return optPaths[cur_pos][\\\"res\\\"];\\n}\",\n \"function solvePath() {\\n let r = 19\\n let c = 19\\n shortestPath.push(board[r][c])\\n while (true) {\\n let parent = board[r][c].parentNode\\n shortestPath.unshift(parent);\\n r = parent.r\\n c = parent.c\\n if (r == 0 && c == 0) {\\n return\\n }\\n }\\n}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\\n\\t\\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\\n\\t}\\n\\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = i;\\n\\t\\tif(j != dad[j]) do {\\n\\t\\t\\tj = dad[j];\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\\n\\t\\tdad[i] = -1;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\n}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\\n\\t\\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\\n\\t}\\n\\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = i;\\n\\t\\tif(j != dad[j]) do {\\n\\t\\t\\tj = dad[j];\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\\n\\t\\tdad[i] = -1;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\n}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\\n\\t\\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\\n\\t}\\n\\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = i;\\n\\t\\tif(j != dad[j]) do {\\n\\t\\t\\tj = dad[j];\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\\n\\t\\tdad[i] = -1;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\n}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\\n\\t\\tif(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\\n\\t}\\n\\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = i;\\n\\t\\tif(j != dad[j]) do {\\n\\t\\t\\tj = dad[j];\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t} while (j !== 0 && -1 !== dad[j] && j != dad[j]);\\n\\t\\tdad[i] = -1;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\n}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }\\n\\t}\\n\\tfor(i=1; i < pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0 && j !== dad[j]) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\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}\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = new Array(pl), q = new Array(pl);\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\n}\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = new Array(pl), q = new Array(pl);\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\n}\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = new Array(pl), q = new Array(pl);\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\n}\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = new Array(pl), q = new Array(pl);\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\n}\",\n \"function augmentingPaths (graph, start, end) {\\n \\n// Keep track of vertices with that have been visited with \\\"processedList\\\" to avoid cycles\\n// If a cycle existed and \\\"end\\\" could not be found the code would execute forever\\n// Also, using \\\"processedList\\\" may be faster in graphs with a large edges/vertices ratio\\nprocessedList = [];\\nprocessedList.push(start)\\n \\n// \\\"Queue\\\" keeps track of the growth of the paths as the breadth first search proceeds\\nqueue = [];\\nqueue.push([start]);\\n \\nwhile (queue.length > 0) {\\n path = [];\\n path = queue[0];\\n queue.splice(0, 1);\\n\\n vert = path[path.length - 1];\\n \\n \\n if (vert == end) {\\n return path;\\n }\\n\\n adjacentVerts = [];\\n\\n for (var j = 0; j < graph.length; j++) {\\n if (graph[vert][j] != 0) {\\n adjacentVerts.push(j);\\n }\\n }\\n\\n for (var i = 0; i < adjacentVerts.length; i++) {\\n\\n currVert = adjacentVerts[i];\\n\\n if (!(processedList.includes(currVert))) {\\n processedList.push(currVert);\\n newPath = path.slice();\\n newPath.push(currVert);\\n queue.push(newPath);\\n }\\n }\\n}\\nreturn (\\\"Failure\\\")\\n}\",\n \"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}\",\n \"function setPath(body) {\\n if (body.grid1 != null) {\\n setPath1(path1 => [...path1, start]);\\n \\n for (let data of body.grid1){ \\n let pos = {lat: data.lat, lng: data.long};\\n // console.log(pos);\\n setPath1(path1 => [...path1, pos]);\\n // setGrid(grid => [...grid, pos]);\\n \\n } \\n setPath1(path1 => [...path1, end]);\\n setPath1Length(body.grid1Length);\\n setPath1NetElev(body.grid1ElevNet);\\n setPath1Shortest(body.grid1Shortest);\\n }\\n if (body.grid2 != null) { \\n setPath2(path2 => [...path2, start]);\\n for (let data of body.grid2){ \\n let pos = {lat: data.lat, lng: data.long};\\n setPath2(path2 => [...path2, pos]);\\n }\\n \\n setPath2(path2 => [...path2, end]);\\n setPath2Length(body.grid2Length);\\n setPath2NetElev(body.grid2ElevNet);\\n setPath2Shortest(body.grid2Shortest);\\n }\\n if (body.grid3 != null) { \\n setPath3(path3=> [...path3, start]);\\n for (let data of body.grid3){ \\n let pos = {lat: data.lat, lng: data.long};\\n setPath3(path3 => [...path3, pos]);\\n }\\n \\n setPath3(path3 => [...path3, end]);\\n\\n }\\n \\n }\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0 && j !== dad[j]) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\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}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0 && j !== dad[j]) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\n}\",\n \"function build_full_paths(FI, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0 && j !== dad[j]) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t}\\n}\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\n}\",\n \"function build_full_paths(FI, FPD, FP, Paths) {\\n\\tvar i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;\\n\\tvar dad = [], q = [];\\n\\n\\tfor(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }\\n\\n\\tfor(; j < q.length; ++j) {\\n\\t\\ti = q[j];\\n\\t\\tL = FI[i].L; R = FI[i].R; C = FI[i].C;\\n\\t\\tif(dad[i] === i) {\\n\\t\\t\\tif(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];\\n\\t\\t\\tif(R !== -1 && dad[R] !== R) dad[i] = dad[R];\\n\\t\\t}\\n\\t\\tif(C !== -1 /*NOSTREAM*/) dad[C] = i;\\n\\t\\tif(L !== -1) { dad[L] = dad[i]; q.push(L); }\\n\\t\\tif(R !== -1) { dad[R] = dad[i]; q.push(R); }\\n\\t}\\n\\tfor(i=1; i !== pl; ++i) if(dad[i] === i) {\\n\\t\\tif(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];\\n\\t\\telse if(L !== -1 && dad[L] !== L) dad[i] = dad[L];\\n\\t}\\n\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type === 0 /* unknown */) continue;\\n\\t\\tj = dad[i];\\n\\t\\tif(j === 0) FP[i] = FP[0] + \\\"/\\\" + FP[i];\\n\\t\\telse while(j !== 0) {\\n\\t\\t\\tFP[i] = FP[j] + \\\"/\\\" + FP[i];\\n\\t\\t\\tj = dad[j];\\n\\t\\t}\\n\\t\\tdad[i] = 0;\\n\\t}\\n\\n\\tFP[0] += \\\"/\\\";\\n\\tfor(i=1; i < pl; ++i) {\\n\\t\\tif(FI[i].type !== 2 /* stream */) FP[i] += \\\"/\\\";\\n\\t\\tFPD[FP[i]] = FI[i];\\n\\t}\\n}\",\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}\",\n \"function buildRoutes(path) {\\n\\n for (var name in path) {\\n var current = path[name];\\n\\n if (traverse(path, current, name)) {\\n buildRoutes(addRoutes(current, path, name));\\n }\\n\\n }\\n }\",\n \"function calculateNextVelInPaths(){\\n pathStats.size += pathStats.calculateSpeed;\\n for (let i = 0; i < pathStats.calculateSpeed; i++){\\n for (const p of allPlanets){\\n p.calculateNextVelInPath();\\n }\\n }\\n}\",\n \"function bestPathFinder(bPath , path){\\n if (path < bPath){\\n return path;\\n }\\n return bPath\\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}\",\n \"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}\",\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 }\",\n \"function calculatePath (startIndex, endIndex, onlyMeasure = false) {\\n // startIndex ist der Index im TileArray von dem der Pfad startet\\n // endIndex ist der Index im TileArray zu dem der Pfad geht\\n // onlyMeasure = true begrenzt den Pfad nicht auf die maximale Bewegungsweite während einem Kampf\\n \\n let mappedList = [];\\n let frontierList = [];\\n let frontierListValues = [];\\n let activeNode;\\n let pathFound = false;\\n let pathToTravel = [];\\n let distance = 0;\\n \\n //Fange Ausnahmen ab startIndex = endIndex\\n if (startIndex == endIndex || endIndex == undefined) {\\n return {\\n first: pathToTravel,\\n second: distance\\n }\\n }\\n \\n // finde A und füge ihn der frontierList hinzu {name, wayPointUsefulness}\\n tileArray[startIndex].entryPoint = \\\"Start\\\";\\n tileArray[startIndex].distanceTravelled = 0;\\n tileArray[startIndex].wayPointUsefulness = tileArray[startIndex].distanceTravelled + tileArray[startIndex].estimatedWayToB(endIndex);\\n tileArray[startIndex].difDegree = Phaser.Math.Angle.BetweenPoints(tileArray[startIndex], tileArray[endIndex]);\\n frontierList.push(tileArray[startIndex]);\\n \\n // gehe folgende Schleife solange durch bis es einen Weg gibt\\n while (pathFound == false) {\\n \\n // Wenn kein Weg möglich ist brich diese Schleife ab\\n if (frontierList.length == 0) {\\n pathToTravel = [];\\n break;\\n }\\n \\n // gehe frontierList durch nach niedrigster wayPointUsefulness + Tiebreaker (geringster Winkelunterschied zur Luftlinie)\\n frontierListValues.length = 0;\\n for (let i = 0; i < frontierList.length; i++) {\\n let difDegree = Math.abs(Phaser.Math.Angle.ShortestBetween(tileArray[startIndex].difDegree, frontierList[i].difDegree))/1000;\\n frontierListValues.push(frontierList[i].wayPointUsefulness + difDegree);\\n }\\n activeNode = frontierListValues.indexOf(Math.min(...frontierListValues));\\n \\n // Wenn Knoten mit Niedrigster wayPointUsefulness schon das Ziel ist, ist A* fertig\\n if (frontierList[activeNode].name == endIndex) {\\n pathFound = true; // unterbricht diese Schleife und damit das Pfadsuchen\\n let backtraceIndex = endIndex; // Sucht den Index des Zielfeldes\\n pathToTravel.unshift(backtraceIndex); // Fügt das Zielfeld dem Pfad hinzu\\n \\n while (tileArray[tileArray[backtraceIndex].entryPoint].name != startIndex) {\\n pathToTravel.unshift(tileArray[backtraceIndex].entryPoint);\\n backtraceIndex = tileArray[backtraceIndex].entryPoint;\\n }\\n \\n break;\\n }\\n \\n // berechne für diesen alle neighbors\\n frontierList[activeNode].checkForNeighbors();\\n \\n // Füge Neighbors des aktuellen Knotens der Frontierlist hinzu\\n for (let i = 0; i < frontierList[activeNode].neighbors.length; i++) {\\n \\n let distanceTravelled = frontierList[activeNode].distanceTravelled + frontierList[activeNode].neighborsDistance[i];\\n if (containsObject(frontierList[activeNode].neighbors[i], frontierList)) {\\n if (distanceTravelled < frontierList[activeNode].neighbors[i].distanceTravelled) {\\n frontierList[activeNode].neighbors[i].distanceTravelled = distanceTravelled;\\n frontierList[activeNode].neighbors[i].wayPointUsefulness = frontierList[activeNode].neighbors[i].distanceTravelled + frontierList[activeNode].neighbors[i].estimatedWayToB(endIndex);\\n frontierList[activeNode].neighbors[i].entryPoint = frontierList[activeNode].name;\\n }\\n } else if (containsObject(frontierList[activeNode].neighbors[i], mappedList)) {\\n continue;\\n } else {\\n frontierList[activeNode].neighbors[i].distanceTravelled = frontierList[activeNode].distanceTravelled + frontierList[activeNode].neighborsDistance[i];\\n frontierList[activeNode].neighbors[i].wayPointUsefulness = frontierList[activeNode].neighbors[i].distanceTravelled + frontierList[activeNode].neighbors[i].estimatedWayToB(endIndex);\\n frontierList[activeNode].neighbors[i].entryPoint = frontierList[activeNode].name;\\n frontierList[activeNode].neighbors[i].difDegree = Phaser.Math.Angle.BetweenPoints(frontierList[activeNode].neighbors[i], tileArray[endIndex])\\n frontierList.push(frontierList[activeNode].neighbors[i]);\\n }\\n }\\n \\n // Füge den aktiven Knoten der mappedList hinzu und Lösche den aktven Knoten aus der frontierList\\n mappedList.push(frontierList[activeNode]);\\n frontierList.splice(activeNode,1);\\n }\\n \\n // wenn gerade ein Kampf ist soll die Bewegung begrenzt sein auf die Maximale Bewegungsweite des aktiven Charakters\\n if (fightmode == true && onlyMeasure == false) {\\n movementStopper: for (let l = 0; l < pathToTravel.length; l++) {\\n if (tileArray[pathToTravel[l]].distanceTravelled > activeChar.movementCounter) {\\n pathToTravel.length = l;\\n break movementStopper;\\n }\\n }\\n }\\n \\n // wenn das Ziefeld der Bewegung besetzt ist, wird die Bewegung gekürzt\\n checkEnd: while (pathToTravel.length > 0) {\\n if (checkFor (tileArray[pathToTravel[pathToTravel.length-1]].occupiedBy, Figure) || checkFor (tileArray[pathToTravel[pathToTravel.length-1]].occupiedBy, Enemy)) {\\n pathToTravel.length = pathToTravel.length-1;\\n } else {\\n break checkEnd;\\n }\\n }\\n \\n // speichert die Entfernung bis zum Ende des Pfades\\n if (pathToTravel.length > 0) {\\n distance += tileArray[pathToTravel[pathToTravel.length-1]].distanceTravelled;\\n }\\n \\n // räumt alle Tiles wieder auf\\n clearNodes();\\n return {\\n first: pathToTravel,\\n second: distance\\n }\\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 }\",\n \"path(start, end)\\n {\\n // Check if the end is reachable\\n let endInfo = this.positionInfo(end);\\n if (endInfo.passable === false)\\n return undefined;\\n\\n // For node n, parent[n] is the node immediately preceding it on the cheapest path from start to n currently known\\n let parent = new Map();\\n\\n // For node n, gScore[n] is the cost of the cheapest path from start to n currently known\\n let gScore = new Map([[start.toString(), 0]]);\\n\\n // For node n, fScore[n] = gScore[n] + h(n)\\n let fScore = new Map([[start.toString(), 0]]);\\n\\n // The heap of discovered nodes that need to be (re-)expanded\\n let openHeap = new BinaryHeap(node => fScore.get(node.toString()) || 0);\\n openHeap.push(start);\\n\\n // The set of closed nodes\\n let closedSet = new Set();\\n\\n // Iterate while the heap is not empty\\n while (openHeap.size > 0)\\n {\\n // Grab the lowest f(x) to process next\\n let node = openHeap.pop();\\n\\n // End case -- result has been found, return the traced path\\n if (node.x === end.x && node.y === end.y)\\n {\\n let path = [node];\\n while (parent.has(node.toString()))\\n {\\n node = parent.get(node.toString());\\n path.unshift(node);\\n }\\n return path.map(position => this.positionInfo(position));\\n }\\n\\n // Normal case -- move node from open to closed, process each of its neighbors\\n closedSet.add(node.toString());\\n\\n // Find all neighbors for the current node\\n for (let neighbor of this.getNeighbors(node))\\n {\\n let neighborInfo = this.positionInfo(neighbor);\\n\\n // If the neighbor is already closed or is not passable, then continue\\n if (closedSet.has(neighbor.toString()) || neighborInfo.passable === false)\\n continue;\\n\\n // The g score is the shortest distance from start to current node\\n // We need to check if the path we have arrived at this neighbor is the shortest one we have seen yet\\n let gScoreTentative = gScore.get(node.toString()) + neighborInfo.cost;\\n if (!gScore.has(neighbor.toString()) || gScoreTentative < gScore.get(neighbor.toString()))\\n {\\n parent.set(neighbor.toString(), node);\\n gScore.set(neighbor.toString(), gScoreTentative);\\n fScore.set(neighbor.toString(), gScoreTentative + Vector.manhattanDistance(neighbor, end));\\n\\n if (!openHeap.has(neighbor))\\n openHeap.push(neighbor);\\n else\\n openHeap.rescoreElement(neighbor);\\n }\\n }\\n }\\n\\n // No path found, so return undefined\\n return undefined;\\n }\",\n \"function pathGatherer(){\\n var indicator = Grid[EndPoint[0]][EndPoint[1]].VisitedAt\\n var currentPoint = [EndPoint[0],EndPoint[1]]\\n var path = []\\n\\n while( indicator != 0){\\n console.log(indicator)\\n console.log(\\\"Current: \\\" + currentPoint[0] + \\\"-\\\" + currentPoint[1])\\n if(currentPoint[0]!=EndPoint[0] | currentPoint[1]!=EndPoint[1]){\\n console.log(currentPoint,\\\"not equal to\\\",EndPoint)\\n document.getElementById(Grid[currentPoint[0]][currentPoint[1]].id).innerHTML=\\\"<div id='path\\\"+currentPoint[0]+\\\"x\\\"+currentPoint[1]+\\\"' class='path'></div>\\\";\\n document.getElementById(\\\"path\\\"+currentPoint[0]+\\\"x\\\"+currentPoint[1]).style.animationDelay=indicator/15+\\\"s\\\"\\n }\\n \\n Grid[currentPoint[0]][currentPoint[1]].State = \\\"Path\\\"\\n //update, find the \\n indicator -= 1\\n //-x NORTH\\n if(currentPoint[0] > 0){\\n if(Grid[currentPoint[0]-1][currentPoint[1]].VisitedAt == indicator){\\n path.push([currentPoint[0],currentPoint[1],\\\"NORTH\\\"])\\n currentPoint[0] -= 1\\n continue\\n }\\n \\n }\\n //+x SOUTH\\n if(currentPoint[0] < GRID_ROW_SIZE-1){\\n if(Grid[currentPoint[0]+1][currentPoint[1]].VisitedAt == indicator){\\n path.push([currentPoint[0],currentPoint[1],\\\"SOUTH\\\"])\\n currentPoint[0] += 1\\n continue\\n }\\n \\n }\\n //-y WEST\\n if(currentPoint[1] > 0){\\n if(Grid[currentPoint[0]][currentPoint[1]-1].VisitedAt == indicator){\\n path.push([currentPoint[0],currentPoint[1],\\\"WEST\\\"])\\n currentPoint[1] -= 1\\n continue\\n }\\n \\n }\\n //+y EAST\\n if(currentPoint[1] < GRID_COL_SIZE-1){\\n if(Grid[currentPoint[0]][currentPoint[1]+1].VisitedAt == indicator){\\n path.push([currentPoint[0],currentPoint[1],\\\"EAST\\\"])\\n currentPoint[1] += 1\\n continue\\n }\\n \\n }\\n\\n }\\n //!! the path is the REVERSE PATH from the END to the START \\n Grid[EndPoint[0]][EndPoint[1]].State = \\\"End\\\"\\n console.log(path)\\n consoleGridPrinter()\\n}\",\n \"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 }\",\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}\",\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 }\",\n \"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}\",\n \"animateShortestPath(nodesInShortestPathOrder) {\\n for (let i = 1; i < nodesInShortestPathOrder.length-1; i++) {\\n setTimeout(() => {\\n const node = nodesInShortestPathOrder[i];\\n document.getElementById(`node-${node.row}-${node.col}`).className =\\n 'node node-shortest-path';\\n }, 50 * i);\\n }\\n if(nodesInShortestPathOrder.length<=1){\\n setTimeout(() => {\\n alert(\\\"Path Not Found!!\\\");\\n },1000);\\n }\\n }\",\n \"findShortestPaths(source) {\\n source.setDistance(0)\\n let unsettledNodes = []\\n let settledNodes = []\\n\\n unsettledNodes.push(source)\\n let a = 0\\n while (unsettledNodes.length != 0) {\\n a++\\n let currentNode = this.getLowestDistanceNode(unsettledNodes)\\n unsettledNodes.splice(unsettledNodes.indexOf(currentNode), 1)\\n\\n for (let i = 0; i < currentNode.adjacentNodes.length; i++) {\\n let adjacentNode = currentNode.adjacentNodes[i][0]\\n let edgeWeight = currentNode.adjacentNodes[i][1]\\n if (!settledNodes.includes(adjacentNode) && !unsettledNodes.includes(adjacentNode)) {\\n this.calculateMinimumDistance(adjacentNode, edgeWeight, currentNode)\\n unsettledNodes.push(adjacentNode)\\n }\\n }\\n settledNodes.push(currentNode)\\n }\\n //console.log(a + \\\" iterations\\\")\\n }\",\n \"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 }\",\n \"findPaths(){\\n gridArray.forEach(function(yValue, yCoord){\\n yValue.forEach(function(xValue, xCoord){\\n BadBoggle.searchPath([[yCoord, xCoord]], yCoord, xCoord);\\n });\\n });\\n }\",\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}\",\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}\",\n \"function findPath(startPos, goalPos, pathNumber, ignoreTowerSpawns, ignoreTowers) {\\n //copy mapGrid array to a temp array\\n var grid = copyArray(gameLoop.returnMapOfPath(pathNumber));\\n\\n //Set Goal\\n grid[goalPos.indexX][goalPos.indexY] = 'GOAL';\\n\\n // Each \\\"location\\\" will store its coordinates\\n // and the shortest path required to arrive there\\n var location = {\\n distX: startPos.indexX,\\n distY: startPos.indexY,\\n path: [],\\n block: 'START'\\n };\\n\\n // Initialize the queue with the start location already inside\\n var queue = [location];\\n\\n // Loop through the grid searching for the goal\\n while (queue.length > 0) {\\n // Take the first location off the queue\\n var currentLocation = queue.shift();\\n\\n // Explore North\\n var newLocation = exploreInDirection(currentLocation, 0, grid, ignoreTowerSpawns, ignoreTowers);\\n if (newLocation.block === 'GOAL') {\\n return newLocation.path;\\n } else if (newLocation.block === 'Valid') {\\n queue.push(newLocation);\\n }\\n\\n // Explore East\\n var newLocation = exploreInDirection(currentLocation, 1, grid, ignoreTowerSpawns, ignoreTowers);\\n if (newLocation.block === 'GOAL') {\\n return newLocation.path;\\n } else if (newLocation.block === 'Valid') {\\n queue.push(newLocation);\\n }\\n\\n // Explore South\\n var newLocation = exploreInDirection(currentLocation, 2, grid, ignoreTowerSpawns, ignoreTowers);\\n if (newLocation.block === 'GOAL') {\\n return newLocation.path;\\n } else if (newLocation.block === 'Valid') {\\n queue.push(newLocation);\\n }\\n\\n // Explore West\\n var newLocation = exploreInDirection(currentLocation, 3, grid, ignoreTowerSpawns, ignoreTowers);\\n if (newLocation.block === 'GOAL') {\\n return newLocation.path;\\n } else if (newLocation.block === 'Valid') {\\n queue.push(newLocation);\\n }\\n }\\n\\n // No valid path found\\n return false;\\n\\n}\",\n \"function optimize(ast) {\\n }\",\n \"function optimize(ast) {\\n }\",\n \"function optimizeBootModules () {\\n\\t\\t\\tgrunt.log.writeln('OK'.green);\\n\\t\\t\\tif (!options.dirs || !options.dirs.length) {\\n\\t\\t\\t\\tfinalize();\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tgrunt.util.async.forEachSeries(options.dirs, function(dir, next) {\\n\\t\\t\\t\\tif (typeof dir === 'string') {\\n\\t\\t\\t\\t\\tdir = {\\n\\t\\t\\t\\t\\t\\tcombine: false,\\n\\t\\t\\t\\t\\t\\tname: dir\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\toptimizeDir(dir, next);\\n\\t\\t\\t}, function () {\\n\\t\\t\\t\\tfinalize();\\n\\t\\t\\t});\\n\\t\\t}\",\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}\",\n \"function possiblePaths(n,paths){\\nif(n==1){\\n paths=1;\\n return paths;\\n}\\nif(n==2){\\n paths=2;\\n return paths;\\n}\\nif(n==3){\\n paths=4;\\n return paths;\\n}\\npaths=possiblePaths(n-1)+possiblePaths(n-2)+possiblePaths(n-3);\\nreturn paths;\\n}\",\n \"function calculatePath() {\\n // create Nodes from the Start and End x,y coordinates\\n let mypathStart = Node(null, { x: pathStart[0], y: pathStart[1] });\\n let mypathEnd = Node(null, { x: pathEnd[0], y: pathEnd[1] });\\n // create an array that will contain all world cells\\n let AStar = new Array(worldSize);\\n // list of currently open Nodes\\n let Open = [mypathStart];\\n // list of the final output array\\n let result = [];\\n // reference to a Node (that is nearby)\\n let myNeighbours;\\n // reference to a Node (that we are considering now)\\n let myNode;\\n // reference to a Node (that starts a path in question)\\n let myPath;\\n // temp integer variables used in the calculations\\n let length, max, min, i, j;\\n // iterate through the open list until none are left\\n do {\\n max = worldSize;\\n min = -1;\\n for (i = 0; i < length; i++) {\\n if (Open[i].f < max) {\\n max = Open[i].f;\\n min = i;\\n }\\n }\\n // grab the next node and remove it from Open array\\n myNode = Open.splice(min, 1)[0];\\n // is it the destination node?\\n if (myNode.value === mypathEnd.value) {\\n // we found a path!\\n do {\\n result.unshift([myNode.x, myNode.y]);\\n\\n myNode = myNode.Parent;\\n }\\n while (myNode !== null);\\n\\n // clear the working arrays\\n AStar = Open = [];\\n\\n return result;\\n }\\n\\n // find which nearby nodes are walkable\\n myNeighbours = neighbours(myNode.x, myNode.y);\\n for (i = 0, j = myNeighbours.length; i < j; i++) {\\n // test each one that hasn't been tried already\\n myPath = Node(myNode, myNeighbours[i]);\\n if (!AStar[myPath.value]) {\\n // estimated cost of this particular route so far\\n myPath.g = myNode.g + distanceFunction(myNeighbours[i], myNode);\\n // estimated cost of entire guessed route to the destination\\n myPath.f = myPath.g + distanceFunction(myNeighbours[i], mypathEnd);\\n // remember this new path for testing above\\n Open.push(myPath);\\n // mark this node in the world graph as visited\\n AStar[myPath.value] = true;\\n }\\n }\\n\\n length = Open.length;\\n } while (0 < length);\\n\\n return result;\\n }\",\n \"function calculatePath() {\\n\\t // create Nodes from the Start and End x,y coordinates\\n\\t var mypathStart = Node(null, { x: pathStart[0], y: pathStart[1] });\\n\\t var mypathEnd = Node(null, { x: pathEnd[0], y: pathEnd[1] });\\n\\t // create an array that will contain all world cells\\n\\t var AStar = new Array(worldSize);\\n\\t // list of currently open Nodes\\n\\t var Open = [mypathStart];\\n\\t // list of closed Nodes\\n\\t var Closed = [];\\n\\t // list of the final output array\\n\\t var result = [];\\n\\t // reference to a Node (that is nearby)\\n\\t var myNeighbours;\\n\\t // reference to a Node (that we are considering now)\\n\\t var myNode;\\n\\t // reference to a Node (that starts a path in question)\\n\\t var myPath;\\n\\t // temp integer variables used in the calculations\\n\\t var length, max, min, i, j;\\n\\t // iterate through the open list until none are left\\n\\t while (length = Open.length) {\\n\\t max = worldSize * 999999;\\n\\t min = -1;\\n\\t for (i = 0; i < length; i++) {\\n\\t if (Open[i].f < max) {\\n\\t max = Open[i].f;\\n\\t min = i;\\n\\t }\\n\\t }\\n\\t // grab the next node and remove it from Open array\\n\\t myNode = Open.splice(min, 1)[0];\\n\\t // is it the destination node?\\n\\t if (myNode.value === mypathEnd.value) {\\n\\t myPath = Closed[Closed.push(myNode) - 1];\\n\\t do {\\n\\t result.push([myPath.x, myPath.y]);\\n\\t } while (myPath = myPath.Parent);\\n\\t // clear the working arrays\\n\\t AStar = Closed = Open = [];\\n\\t // we want to return start to finish\\n\\t result.reverse();\\n\\t } else // not the destination\\n\\t {\\n\\t // find which nearby nodes are walkable\\n\\t myNeighbours = Neighbours(myNode.x, myNode.y);\\n\\t // test each one that hasn't been tried already\\n\\t for (i = 0, j = myNeighbours.length; i < j; i++) {\\n\\t myPath = Node(myNode, myNeighbours[i], world[myNeighbours[i].x][myNeighbours[i].y]);\\n\\t if (!AStar[myPath.value]) {\\n\\t // estimated cost of this particular route so far\\n\\t myPath.g += myNode.g + distanceFunction(myNeighbours[i], myNode);\\n\\t // estimated cost of entire guessed route to the destination\\n\\t myPath.f = myPath.g + distanceFunction(myNeighbours[i], mypathEnd);\\n\\t // remember this new path for testing above\\n\\t Open.push(myPath);\\n\\t // mark this node in the world graph as visited\\n\\t AStar[myPath.value] = true;\\n\\t }\\n\\t }\\n\\t // remember this route as having no more untested options\\n\\t Closed.push(myNode);\\n\\t }\\n\\t } // keep iterating until the Open list is empty\\n\\t return result;\\n\\t }\",\n \"solveDFS() {\\n for (let maxDepth = 0; maxDepth <= 10; maxDepth++) {\\n let path = this.dfs(maxDepth);\\n if (path) {\\n this.drawSolvedPath(path);\\n return path;\\n }\\n }\\n return null;\\n }\",\n \"computePathToComplete(){\\n if (Object.keys(this.state.legs_dict).length !== 0 &&Object.keys(this.state.stops_dict).length !== 0 && this.state.driver_location !== null) {\\n\\n // Time required to complete all legs\\n var time_complete_all_legs = 0\\n // Time required to complete driver's remaining path\\n var time_complete = 0\\n \\n // Append legs dictionary with start and stop locations and compute time required to drive from start to stop.\\n // Also, compute times to complete driver's path and all legs\\n var new_legs_dict = {}\\n var is_passed_driver_leg = false\\n\\n for (var key in this.state.legs_dict) {\\n var dict_specs = this.state.legs_dict[key]\\n dict_specs[\\\"startStop_x\\\"] = this.state.stops_dict[dict_specs[\\\"startStop\\\"]][\\\"x\\\"]\\n dict_specs[\\\"startStop_y\\\"] = this.state.stops_dict[dict_specs[\\\"startStop\\\"]][\\\"y\\\"]\\n dict_specs[\\\"endStop_x\\\"] = this.state.stops_dict[dict_specs[\\\"endStop\\\"]][\\\"x\\\"]\\n dict_specs[\\\"endStop_y\\\"] = this.state.stops_dict[dict_specs[\\\"endStop\\\"]][\\\"y\\\"]\\n \\n // Distance between subsequent stops\\n var dist = Math.sqrt(Math.pow(dict_specs[\\\"endStop_x\\\"] - dict_specs[\\\"startStop_x\\\"], 2) + \\n Math.pow(dict_specs[\\\"endStop_y\\\"] - dict_specs[\\\"startStop_y\\\"], 2))\\n // Time required to drive from the start to the stop point\\n dict_specs[\\\"time\\\"] = dist / dict_specs[\\\"speedLimit\\\"]\\n\\n // Update leg info\\n new_legs_dict[key] = dict_specs\\n\\n // Update time to complete the entire path and the remaining path\\n time_complete_all_legs += new_legs_dict[key][\\\"time\\\"]\\n if (is_passed_driver_leg) time_complete += new_legs_dict[key][\\\"time\\\"]\\n if (key === this.state.driver_location[\\\"activeLegID\\\"]) is_passed_driver_leg = true\\n }\\n\\n // Update time to complete the remaining path with the time to complete the current leg\\n time_complete += new_legs_dict[this.state.driver_location[\\\"activeLegID\\\"]][\\\"time\\\"] * (100 - parseInt(this.state.driver_location[\\\"legProgress\\\"])) / 100\\n \\n this.setState({legs_dict: new_legs_dict,\\n bonus2_time_complete_all_legs: time_complete_all_legs,\\n bonus2_time_complete: time_complete\\n })\\n } else {\\n this.setState({alert_info: {status: true,\\n type: \\\"warning\\\",\\n reason: \\\"computePath\\\",\\n message: \\\"Legs, stops and driver location are reqired for this feature to work\\\"}})\\n }\\n }\",\n \"function paths(data, ctx) {\\n\\t ctx.clearRect(-1, -1, w() + 2, h() + 2);\\n\\t ctx.beginPath();\\n\\t data.forEach(function (d) {\\n\\t if (__.bundleDimension !== null && __.bundlingStrength > 0 || __.smoothness > 0) {\\n\\t single_curve(d, ctx);\\n\\t } else {\\n\\t single_path(d, ctx);\\n\\t }\\n\\t });\\n\\t ctx.stroke();\\n\\t }\",\n \"searchPath( pastPositions, currY, currX ){\\n var wentSomewhere = false;\\n \\n //Try to go up\\n if(BadBoggle.validPath(pastPositions, currY - 1, currX)){\\n BadBoggle.searchPath( \\n pastPositions.concat([[currY - 1, currX]]),\\n currY - 1,\\n currX\\n );\\n\\n wentSomewhere = true;\\n }\\n\\n //Try to go right \\n if(BadBoggle.validPath(pastPositions, currY, currX + 1)){\\n BadBoggle.searchPath( \\n pastPositions.concat([[currY, currX + 1]]),\\n currY,\\n currX + 1\\n );\\n\\n wentSomewhere = true;\\n }\\n\\n //Try to go down \\n if(BadBoggle.validPath(pastPositions, currY + 1, currX)){\\n BadBoggle.searchPath( \\n pastPositions.concat([[currY + 1, currX]]),\\n currY + 1,\\n currX\\n );\\n\\n wentSomewhere = true;\\n }\\n\\n //Try to go left \\n if(BadBoggle.validPath(pastPositions, currY, currX - 1)){\\n BadBoggle.searchPath( \\n pastPositions.concat([[currY, currX - 1]]),\\n currY,\\n currX - 1\\n );\\n\\n wentSomewhere = true;\\n }\\n\\n // If all paths are exhausted, add the path to the array\\n if(wentSomewhere === false){\\n var pathString = '';\\n pastPositions.forEach(function(coords){\\n pathString += gridArray[coords[0]][coords[1]];\\n });\\n gridPaths.push( pathString );\\n }\\n }\",\n \"function iterateFromLeaves(f) {\\n function optimizeNextFromLeaves(node) {\\n if (node instanceof SourceNode) {\\n return;\\n }\\n var next = node.parent;\\n if (f(node)) {\\n optimizeNextFromLeaves(next);\\n }\\n }\\n return optimizeNextFromLeaves;\\n }\",\n \"generateAndTestMap(){\\r\\n let test = null;\\r\\n let ok = false\\r\\n while(test === null && !ok) {\\r\\n this.generateField();\\r\\n\\r\\n let pf = new Pathfinding(this);\\r\\n test = pf.findPath()\\r\\n }\\r\\n if(test.length < this.minPath) test = this.generateAndTestMap();\\r\\n return test;\\r\\n }\",\n \"findWay(passedGrid) {\\n // console.log('moj gridek', passedGrid)\\n var pathFinder = (entranceX, entranceY, grid) => {\\n var distanceFromTop = entranceX;\\n var distanceFromLeft = entranceY;\\n\\n var location = {\\n distanceFromTop: distanceFromTop,\\n distanceFromLeft: distanceFromLeft,\\n path: [],\\n status: 'Start'\\n }\\n\\n //inicjalizacja kolejki\\n var queue = [];\\n queue.push(location);\\n\\n //loop grida\\n while (queue.length > 0) {\\n //zwrocenie pierwszego elementu z kolejki\\n var currentLocation = queue.shift();\\n\\n //polnoc\\n var newLocation = explore(currentLocation, 'North', grid);\\n //jesli wyjscie przekazac do stanu aplikacji kolejke z najkrotsza sciezka\\n if (newLocation.status === 'Exit') {\\n this.setState(prevState => ({\\n exit: [...prevState.exit, newLocation.path]\\n }))\\n return newLocation.path;\\n //droga\\n } else if (newLocation.status === 'Valid') {\\n queue.push(newLocation);\\n }\\n\\n //wschod\\n var newLocation = explore(currentLocation, 'East', grid);\\n if (newLocation.status === 'Exit') {\\n this.setState(prevState => ({\\n exit: [...prevState.exit, newLocation.path]\\n }))\\n return newLocation.path;\\n } else if (newLocation.status === 'Valid') {\\n queue.push(newLocation);\\n }\\n\\n //poludnie\\n var newLocation = explore(currentLocation, 'South', grid);\\n if (newLocation.status === 'Exit') {\\n this.setState(prevState => ({\\n exit: [...prevState.exit, newLocation.path]\\n }))\\n return newLocation.path;\\n } else if (newLocation.status === 'Valid') {\\n queue.push(newLocation);\\n }\\n\\n //zachod\\n var newLocation = explore(currentLocation, 'West', grid);\\n if (newLocation.status === 'Exit') {\\n this.setState(prevState => ({\\n exit: [...prevState.exit, newLocation.path]\\n }))\\n return newLocation.path;\\n } else if (newLocation.status === 'Valid') {\\n queue.push(newLocation);\\n }\\n }\\n //nie znaleziono drogi\\n this.setState(prevState => ({\\n exit: [...prevState.exit, 'Nie znaleziono wyjścia, ten grobowiec będzie twoim grobowcem']\\n }))\\n return false;\\n }\\n\\n //sprawdzenie typu lokacji\\n var locationStatus = (location, grid) => {\\n let gridSize = grid.length;\\n let dft = location.distanceFromTop;\\n let dfl = location.distanceFromLeft;\\n // console.log(gridSize, 'size')\\n // console.log(location)\\n // console.log(grid, dft, dfl);\\n\\n if (location.distanceFromLeft < 0 ||\\n location.distanceFromLeft >= gridSize ||\\n location.distanceFromTop < 0 ||\\n location.distanceFromTop >= gridSize) {\\n //poza gridem\\n return 'Invalid';\\n //jesli wyjscie\\n } else if (grid[dft][dfl].type === 'w') {\\n return 'Exit';\\n //jesli nie droga (zablokowana lub odwiedzona)\\n } else if (grid[dft][dfl].type !== 'o') {\\n return 'Blocked';\\n //jesli droga\\n } else {\\n return 'Valid';\\n }\\n }\\n\\n //chodzenie\\n var explore = (currentLocation, direction, grid) => {\\n var newPath = currentLocation.path.slice();\\n newPath.push(direction);\\n\\n var dft = currentLocation.distanceFromTop;\\n var dfl = currentLocation.distanceFromLeft;\\n\\n if (direction === 'North') {\\n dft -= 1;\\n } else if (direction === 'East') {\\n dfl += 1;\\n } else if (direction === 'South') {\\n dft += 1;\\n } else if (direction === 'West') {\\n dfl -= 1;\\n }\\n\\n var newLocation = {\\n distanceFromTop: dft,\\n distanceFromLeft: dfl,\\n path: newPath,\\n status: 'Unknown'\\n };\\n\\n newLocation.status = locationStatus(newLocation, grid);\\n\\n //jesli droga, to oznacz lokacje jako odwiedzoną\\n if (newLocation.status === 'Valid') {\\n grid[newLocation.distanceFromTop][newLocation.distanceFromLeft] = 'Visited';\\n }\\n\\n return newLocation;\\n }\\n console.log(pathFinder(this.state.startY, this.state.startX, passedGrid));\\n }\",\n \"nextStep(){\\n this.search.shift()\\n this.search = this.children.concat(this.search)\\n\\n if( this.search.length == 0){\\n this.finished = true\\n }\\n else{\\n this.state = this.search[0]\\n this.children = []\\n\\n // If it is a final state\\n if( this.blockInPath(this.state, this.maze.getFinish()) && this.state.length < this.cost){\\n this.bestPath = this.state\\n this.cost = this.state.length\\n }\\n // Branch and Bound: Examine the following paths only if they are better than the current best\\n else if(this.state.length + 1 < this.cost){\\n // Get the children paths with no repeating nodes\\n this.children = this.getChildren(this.state).filter( child => !this.blockInPath(this.state, child[child.length - 1]) )\\n \\n }\\n }\\n \\n }\",\n \"function nextStepPaths(x, z, xCount, zCount, board, endChar, xPrev, zPrev, ignorePointsBehind, dst) {\\n function checkAdjacent(expect, expect2, expect3, xx, zz, notExpect) {\\n if (xx === xPrev && zz === zPrev) {\\n return null;\\n }\\n var ch = board[zz][xx];\\n if (ch === expect || ch === expect2 || ch === expect3) {\\n dst.push({ x: xx, z: zz });\\n }\\n else if (notExpect === ch) { }\\n else if (ch === endChar) {\\n return { x: xx, z: zz };\\n }\\n return null;\\n }\\n var res = ForEachUtil.forEachDirection(x, z, xCount, zCount, {\\n top: function (x, z) { return checkAdjacent('|', '/', '\\\\\\\\', x, z, '-'); },\\n topRight: function (x, z) { return checkAdjacent('/', '|', '-', x, z, '\\\\\\\\'); },\\n right: function (x, z) { return checkAdjacent('-', '/', '\\\\\\\\', x, z, '|'); },\\n bottomRight: function (x, z) { return checkAdjacent('\\\\\\\\', '|', '-', x, z, '/'); },\\n bottom: function (x, z) { return checkAdjacent('|', '/', '\\\\\\\\', x, z, '-'); },\\n bottomLeft: function (x, z) { return checkAdjacent('/', '|', '-', x, z, '\\\\\\\\'); },\\n left: function (x, z) { return checkAdjacent('-', '/', '\\\\\\\\', x, z, '|'); },\\n topLeft: function (x, z) { return checkAdjacent('\\\\\\\\', '|', '-', x, z, '//'); },\\n }, ignorePointsBehind, xPrev, zPrev);\\n return res;\\n }\",\n \"followPaths(path_so_far) {\\n // logging\\n this.get_paths_ran += 1;\\n if (this.get_paths_ran % 10000 == 0) {\\n Log(\\\"get paths ran \\\" + String(this.get_paths_ran));\\n }\\n let note = this.db[path_so_far.all_members.last()];\\n let all_members = path_so_far.all_members;\\n let items = path_so_far.items;\\n let new_paths_to_follow = [];\\n let note_links_to = note.links_to.slice();\\n let note_linked_from = note.linked_from.slice();\\n note_links_to.forEach((link) => {\\n // check whether the linked note also links to the current note\\n let linked_to_or_both_ways = LINKED_TO;\\n if (note_linked_from.contains(link)) {\\n // remove it from the passive links to be followed later\\n let index = note_linked_from.indexOf(link, 0);\\n note_linked_from.splice(index, 1);\\n linked_to_or_both_ways = LINKED_BOTH;\\n }\\n let new_path = {\\n all_members: all_members.concat(link),\\n items: items.concat([[link, linked_to_or_both_ways]]),\\n };\\n new_paths_to_follow.push(new_path);\\n });\\n note_linked_from.forEach((link) => {\\n let new_path = {\\n all_members: all_members.concat(link),\\n items: items.concat([[link, LINKED_FROM]]),\\n };\\n new_paths_to_follow.push(new_path);\\n });\\n let called_itself = false; // whether the function called itself\\n // function calls itself to explore every new path\\n new_paths_to_follow.forEach((path) => {\\n // the path without the next note that is to be explored\\n let all_items_so_far = path.all_members.slice(0, -1);\\n let last_item_path = path.all_members.last();\\n let last_item = this.getNoteFromPath(last_item_path);\\n // stop if this note is already part of the explored path\\n if (all_items_so_far.includes(last_item_path)) {\\n return;\\n }\\n // stop if the path meanders too much\\n if (path.all_members.length - last_item.distance_from_CN > 1) {\\n return;\\n }\\n this.followPaths(path);\\n called_itself = true;\\n });\\n if (!called_itself) {\\n // only add the path if it does't lead anywhere else. No need to have paths that are parts of other paths\\n this.all_paths.push(path_so_far);\\n }\\n }\",\n \"function getForwardPathsLoopgains(paths){\\r\\n var forwardLoopgains = [];\\r\\n\\r\\n paths.forEach(p => {\\r\\n var forwardEdges = extractPathEdges(p);\\r\\n var flg = calculateLoopGain(forwardEdges);\\r\\n forwardLoopgains.push(flg);\\r\\n });\\r\\n\\r\\n return forwardLoopgains;\\r\\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 }\",\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}\",\n \"function findAndAdd2ProngsOnAllPaths(shape) {\\n let for2ProngsArray = shape.for2ProngsArray;\\n for (let k = 0; k < for2ProngsArray.length; k++) {\\n let for2Prongs = for2ProngsArray[k];\\n findAndAdd2Prongs(shape, k, for2Prongs);\\n }\\n}\",\n \"function solveMaze(){\\n var Xqueue=[parseInt(src_x)]; \\n var Yqueue=[parseInt(src_y)]; \\n let pathFound=false;\\n var xLoc;\\n var yLoc;\\n\\n while(Xqueue.length>0 && !pathFound){\\n xLoc=Xqueue.shift();\\n yLoc=Yqueue.shift();\\n if(xLoc>1){\\n if(tiles[xLoc-1][yLoc].state=='f'){\\n pathFound=true;\\n }\\n }\\n if(xLoc<tileColCount-1){\\n if(tiles[xLoc+1][yLoc].state=='f'){\\n pathFound=true;\\n }\\n }\\n if(yLoc>1){\\n if(tiles[xLoc][yLoc-1].state=='f'){\\n pathFound=true;\\n }\\n }\\n \\n if(yLoc<tileRowCount-1){\\n if(tiles[xLoc][yLoc+1].state=='f'){\\n pathFound=true;\\n }\\n }\\n if(xLoc>1){\\n if(tiles[xLoc-1][yLoc].state=='e'){\\n Xqueue.push(xLoc-1);\\n Yqueue.push(yLoc);\\n tiles[xLoc-1][yLoc].state=tiles[xLoc][yLoc].state+'l';\\n // rect(xloc-1,yLoc,tileW,tileH,tiles[xLoc-1][yLoc].state);\\n }\\n }\\n if(xLoc<tileColCount-1){\\n if(tiles[xLoc+1][yLoc].state=='e'){\\n Xqueue.push(xLoc+1);\\n Yqueue.push(yLoc);\\n tiles[xLoc+1][yLoc].state=tiles[xLoc][yLoc].state+'r';\\n //rect(xloc+1,yLoc,tileW,tileH,tiles[xLoc+1][yLoc].state);\\n }\\n }\\n if(yLoc>1){\\n if(tiles[xLoc][yLoc-1].state=='e'){\\n Xqueue.push(xLoc);\\n Yqueue.push(yLoc-1);\\n tiles[xLoc][yLoc-1].state=tiles[xLoc][yLoc].state+'u';\\n // rect(xloc,yLoc-1,tileW,tileH,tiles[xLoc][yLoc-1].state);\\n }\\n }\\n if(yLoc<tileRowCount-1){\\n if(tiles[xLoc][yLoc+1].state=='e'){\\n Xqueue.push(xLoc);\\n Yqueue.push(yLoc+1);\\n tiles[xLoc][yLoc+1].state=tiles[xLoc][yLoc].state+'d';\\n // rect(xloc,yLoc+1,tileW,tileH,tiles[xLoc][yLoc+1].state);\\n }\\n }\\n //setInterval(draw(),100);\\n }\\n if(!pathFound){\\n output.innerHTML=\\\"No Solution\\\";\\n }\\n else{\\n output.innerHTML=\\\"Solved\\\";\\n let path=tiles[xLoc][yLoc].state; \\n let pathLength=path.length;\\n let currX=parseInt(src_x); \\n let currY=parseInt(src_y); \\n for(let i=0;i<pathLength-1;i++){\\n if(path.charAt(i+1)=='u'){\\n currY-=1;\\n }\\n if(path.charAt(i+1)=='d'){\\n currY+=1;\\n }\\n if(path.charAt(i+1)=='l'){\\n currX-=1;\\n }\\n if(path.charAt(i+1)=='r'){\\n currX+=1;\\n }\\n tiles[currX][currY].state='p';\\n }\\n }\\n}\",\n \"buildPath(num) {\\n var result = new Set();\\n var cur = num;\\n const maxBound = this.props.maxBound;\\n while (!result.has(cur) && cur <= maxBound && cur >= -maxBound) {\\n result.add(cur);\\n cur = this.getDestination(cur);\\n }\\n return [...result];\\n }\",\n \"function calculatePath()\\n\\n{\\n\\n// create Nodes from the Start and End x,y coordinates\\n\\nvar\\n\\nmypathStart = Node(null, {x:pathStart[0], y:pathStart[1]});\\n\\nvar mypathEnd = Node(null, {x:pathEnd[0], y:pathEnd[1]});\\n\\n// create an array that will contain all world cells\\n\\nvar AStar = new Array(worldSize);\\n\\n// list of currently open Nodes\\n\\nvar Open = [mypathStart];\\n\\n// list of closed Nodes\\n\\nvar Closed = [];\\n\\n// list of the final output array\\n\\nvar result = [];\\n\\n// reference to a Node (that is nearby)\\n\\nvar myNeighbours;\\n\\n// reference to a Node (that we are considering now)\\n\\nvar myNode;\\n\\n// reference to a Node (that starts a path in question)\\n\\nvar myPath;\\n\\n// temp integer variables used in the calculations\\n\\nvar length, max, min, i, j;\\n\\n// iterate through the open list until none are left\\n\\nwhile(length = Open.length)\\n\\n{\\n\\nmax = worldSize;\\n\\nmin = -1;\\n\\nfor(i = 0; i < length; i++)\\n\\n{\\n\\nif(Open[i].f < max)\\n\\n{\\n\\nmax = Open[i].f;\\n\\nmin = i;\\n\\n}\\n\\n}\\n\\n// grab the next node and remove it from Open array\\n\\nmyNode = Open.splice(min, 1)[0];\\n\\n// is it the destination node?\\n\\nif(myNode.value === mypathEnd.value)\\n\\n{\\n\\nmyPath = Closed[Closed.push(myNode) - 1];\\n\\ndo\\n\\n{\\n\\nresult.push([myPath.x, myPath.y]);\\n\\n}\\n\\nwhile (myPath = myPath.Parent);\\n\\n// clear the working arrays\\n\\nAStar = Closed = Open = [];\\n\\n// we want to return start to finish\\n\\nresult.reverse();\\n\\n}\\n\\nelse // not the destination\\n\\n{\\n\\n// find which nearby nodes are walkable\\n\\nmyNeighbours = Neighbours(myNode.x, myNode.y);\\n\\n// test each one that hasn't been tried already\\n\\nfor(i = 0, j = myNeighbours.length; i < j; i++)\\n\\n{\\n\\nmyPath = Node(myNode, myNeighbours[i]);\\n\\nif (!AStar[myPath.value])\\n\\n{\\n\\n// estimated cost of this particular route so far\\n\\nmyPath.g = myNode.g + distanceFunction(myNeighbours[i], myNode);\\n\\n// estimated cost of entire guessed route to the destination\\n\\nmyPath.f = myPath.g + distanceFunction(myNeighbours[i], mypathEnd);\\n\\n// remember this new path for testing above\\n\\nOpen.push(myPath);\\n\\n// mark this node in the world graph as visited\\n\\nAStar[myPath.value] = true;\\n\\n}\\n\\n}\\n\\n// remember this route as having no more untested options\\n\\nClosed.push(myNode);\\n\\n}\\n\\n} // keep iterating until the Open list is empty\\n\\nreturn result;\\n\\n}\",\n \"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}\",\n \"function buildPath(pathStack, timer, visitedNodes, visitedNodesPainted) {\\r\\n\\r\\n pathStack.forEach(element => {\\r\\n setTimeout(function() {element.classList += \\\" pathNode\\\"}, timer * 50)\\r\\n timer++\\r\\n });\\r\\n}\",\n \"function hivtrace_get_path(next, i, j) {\\n\\n var all_paths = [];\\n var i = parseInt(i);\\n var j = parseInt(j);\\n\\n for (var c = 0; c < next[i][j].length; c++) {\\n\\n var k = next[i][j][c];\\n var intermediate = k;\\n\\n if (intermediate == null || intermediate == i) {\\n return [\\n [parseInt(i), parseInt(j)]\\n ];\\n } else {\\n\\n var paths_i_k = hivtrace_get_path(next, i, intermediate);\\n var paths_k_j = hivtrace_get_path(next, intermediate, j);\\n\\n for (var i_k_index = 0; i_k_index < paths_i_k.length; i_k_index++) {\\n var i_k = paths_i_k[i_k_index];\\n for (var k_j_index = 0; k_j_index < paths_k_j.length; k_j_index++) {\\n var k_j = paths_k_j[k_j_index];\\n if (i_k.length) {\\n if ((i_k[0] == i) && (i_k[i_k.length - 1] == k) && (k_j[0] == k) && (k_j[k_j.length - 1] == j)) {\\n i_k.pop()\\n all_paths.push(i_k.concat(k_j));\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n return all_paths;\\n\\n}\",\n \"shortestPath(start, goal) {\\n // start isn't moveable to\\n if (!this.moveable(start.x / this.tileW, start.y / this.tileH)) {\\n return [];\\n }\\n let openSet = [];\\n let closedSet = [];\\n openSet.push(start);\\n\\n // clear path finding data\\n for (let y = 0; y < round(height / this.tileH); y++) {\\n for (let x = 0; x < round(width / this.tileW); x++) {\\n this.map[y][x].f = 0;\\n this.map[y][x].g = 0;\\n this.map[y][x].h = 0;\\n this.map[y][x].parent = null;\\n }\\n }\\n\\n while (openSet.length > 0) {\\n // get lowest cost node in open set\\n let currentNode = openSet[0];\\n for (let i = 0; i < openSet.length; i++) {\\n if (openSet[i].f < currentNode.f)\\n currentNode = openSet[i];\\n }\\n\\n // if end has been reached, then finish\\n if (currentNode.x == goal.x && currentNode.y == goal.y) {\\n let path = []\\n while (currentNode.parent != null) {\\n path.push(currentNode);\\n currentNode = currentNode.parent;\\n }\\n return path.reverse();\\n }\\n\\n // remove currentNode from openset, and put into closed set\\n closedSet.push(currentNode);\\n for (let i = openSet.length - 1; i >= 0; i--) {\\n if (openSet[i] === currentNode) {\\n openSet.splice(i, 1);\\n }\\n }\\n\\n // evaluate currentNode's neighbours\\n for (let i = 0; i < currentNode.neighbours.length; i++) {\\n let neighbour = currentNode.neighbours[i];\\n if (!this.moveable(neighbour.x / this.tileW, neighbour.y / this.tileH)) {\\n continue;\\n }\\n if (closedSet.includes(neighbour))\\n continue;\\n // valid neighbour found..\\n let gScore = currentNode.g + 1;\\n let bestG = false;\\n if (!openSet.includes(neighbour)) {\\n // first time at neighbour, so it's the best\\n bestG = true;\\n neighbour.h = this.heuristic(neighbour.x, neighbour.y, goal.x, goal.y);\\n openSet.push(neighbour);\\n } else if (gScore < neighbour.g) {\\n // worse path to it exists in openset..\\n bestG = true;\\n openSet.splice(openSet.indexOf(neighbour), 1);\\n }\\n\\n if (bestG) {\\n neighbour.parent = currentNode;\\n neighbour.g = gScore;\\n neighbour.f = neighbour.h + neighbour.g;\\n }\\n }\\n }\\n // no path found\\n return [];\\n }\",\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}\",\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}\",\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}\",\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}\",\n \"function optimize (root, options) {\\n\\t if (!root) { return }\\n\\t isStaticKey = genStaticKeysCached(options.staticKeys || '');\\n\\t isPlatformReservedTag = options.isReservedTag || no;\\n\\t // first pass: mark all non-static nodes.\\n\\t markStatic$1(root);\\n\\t // second pass: mark static roots.\\n\\t markStaticRoots(root, false);\\n\\t}\",\n \"function optimize (root, options) {\\n\\t if (!root) { return }\\n\\t isStaticKey = genStaticKeysCached(options.staticKeys || '');\\n\\t isPlatformReservedTag = options.isReservedTag || no;\\n\\t // first pass: mark all non-static nodes.\\n\\t markStatic$1(root);\\n\\t // second pass: mark static roots.\\n\\t markStaticRoots(root, false);\\n\\t}\",\n \"function optimize (root, options) {\\n\\t if (!root) { return }\\n\\t isStaticKey = genStaticKeysCached(options.staticKeys || '');\\n\\t isPlatformReservedTag = options.isReservedTag || no;\\n\\t // first pass: mark all non-static nodes.\\n\\t markStatic$1(root);\\n\\t // second pass: mark static roots.\\n\\t markStaticRoots(root, false);\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.56938905","0.55985314","0.5439052","0.5374248","0.53719616","0.5370415","0.53631437","0.53431183","0.5274606","0.5250422","0.5237999","0.5236706","0.521821","0.52163726","0.5207558","0.52072245","0.5190481","0.5186431","0.5182813","0.5167651","0.5149536","0.5149528","0.51431626","0.5130375","0.5121384","0.5118311","0.5118311","0.5118311","0.5118311","0.5116414","0.511174","0.5109402","0.5109402","0.5109402","0.5109402","0.5105698","0.510177","0.50941586","0.50834286","0.5075167","0.50694364","0.50694364","0.50686353","0.50686353","0.5060095","0.5042528","0.5040009","0.5001958","0.4994568","0.49923694","0.49901757","0.49800992","0.49768046","0.49590918","0.495245","0.49388996","0.4935728","0.49342152","0.49255034","0.49237928","0.49121082","0.49106774","0.49090216","0.4902872","0.4902872","0.49027255","0.4900286","0.4900286","0.4897738","0.48964816","0.48922515","0.48910478","0.4888636","0.48792344","0.48750022","0.4873813","0.48696792","0.48679557","0.4867946","0.4858861","0.4853381","0.48526284","0.48400658","0.4839074","0.48387206","0.48315474","0.48209536","0.48158145","0.4811499","0.48099822","0.4807308","0.48056763","0.48023626","0.4795997","0.4793983","0.4793983","0.47892445","0.47892445","0.47769406","0.47769406","0.47769406"],"string":"[\n \"0.56938905\",\n \"0.55985314\",\n \"0.5439052\",\n \"0.5374248\",\n \"0.53719616\",\n \"0.5370415\",\n \"0.53631437\",\n \"0.53431183\",\n \"0.5274606\",\n \"0.5250422\",\n \"0.5237999\",\n \"0.5236706\",\n \"0.521821\",\n \"0.52163726\",\n \"0.5207558\",\n \"0.52072245\",\n \"0.5190481\",\n \"0.5186431\",\n \"0.5182813\",\n \"0.5167651\",\n \"0.5149536\",\n \"0.5149528\",\n \"0.51431626\",\n \"0.5130375\",\n \"0.5121384\",\n \"0.5118311\",\n \"0.5118311\",\n \"0.5118311\",\n \"0.5118311\",\n \"0.5116414\",\n \"0.511174\",\n \"0.5109402\",\n \"0.5109402\",\n \"0.5109402\",\n \"0.5109402\",\n \"0.5105698\",\n \"0.510177\",\n \"0.50941586\",\n \"0.50834286\",\n \"0.5075167\",\n \"0.50694364\",\n \"0.50694364\",\n \"0.50686353\",\n \"0.50686353\",\n \"0.5060095\",\n \"0.5042528\",\n \"0.5040009\",\n \"0.5001958\",\n \"0.4994568\",\n \"0.49923694\",\n \"0.49901757\",\n \"0.49800992\",\n \"0.49768046\",\n \"0.49590918\",\n \"0.495245\",\n \"0.49388996\",\n \"0.4935728\",\n \"0.49342152\",\n \"0.49255034\",\n \"0.49237928\",\n \"0.49121082\",\n \"0.49106774\",\n \"0.49090216\",\n \"0.4902872\",\n \"0.4902872\",\n \"0.49027255\",\n \"0.4900286\",\n \"0.4900286\",\n \"0.4897738\",\n \"0.48964816\",\n \"0.48922515\",\n \"0.48910478\",\n \"0.4888636\",\n \"0.48792344\",\n \"0.48750022\",\n \"0.4873813\",\n \"0.48696792\",\n \"0.48679557\",\n \"0.4867946\",\n \"0.4858861\",\n \"0.4853381\",\n \"0.48526284\",\n \"0.48400658\",\n \"0.4839074\",\n \"0.48387206\",\n \"0.48315474\",\n \"0.48209536\",\n \"0.48158145\",\n \"0.4811499\",\n \"0.48099822\",\n \"0.4807308\",\n \"0.48056763\",\n \"0.48023626\",\n \"0.4795997\",\n \"0.4793983\",\n \"0.4793983\",\n \"0.47892445\",\n \"0.47892445\",\n \"0.47769406\",\n \"0.47769406\",\n \"0.47769406\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80678,"cells":{"query":{"kind":"string","value":"Warns if there is a duplicate or missing key"},"document":{"kind":"string","value":"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;}"},"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":["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_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 }"],"string":"[\n \"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 }\",\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}\",\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}\",\n \"isUniqueConstraintViolation(error) {\\n return /duplicate key value violates unique constraint/.test(String(error));\\n }\",\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;}\",\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;}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;}\",\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;}\",\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;}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;}\",\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;}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;}\",\n \"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;}\",\n \"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;}\",\n \"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;}\",\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(false,'Encountered two children with the same key, `%s`. '+'Keys should be unique so that components maintain their identity '+'across 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;}\",\n \"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;}\",\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;}\",\n \"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}\",\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;}\",\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 \"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 \"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 \"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 \"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 \"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 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 }\",\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 \"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 }\",\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 \"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 \"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 \"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 \"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 \"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 \"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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 warnOnInvalidKey(child, knownKeys) {\\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 \"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 \"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 \"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 \"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 \"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 }\",\n \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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 \"function warnOnInvalidKey(child, knownKeys) {\\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]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.64586234","0.63743407","0.62774295","0.61566454","0.61478174","0.61425227","0.61372644","0.61251426","0.61251426","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"],"string":"[\n \"0.64586234\",\n \"0.63743407\",\n \"0.62774295\",\n \"0.61566454\",\n \"0.61478174\",\n \"0.61425227\",\n \"0.61372644\",\n \"0.61251426\",\n \"0.61251426\",\n \"0.6114083\",\n \"0.6114083\",\n \"0.6114083\",\n \"0.61133426\",\n \"0.61059004\",\n \"0.6096614\",\n \"0.60936666\",\n \"0.6082668\",\n \"0.5989997\",\n \"0.59782195\",\n \"0.59782195\",\n \"0.59782195\",\n \"0.59782195\",\n \"0.5968301\",\n \"0.5958314\",\n \"0.59582865\",\n \"0.5956432\",\n \"0.59424883\",\n \"0.59424883\",\n \"0.59424883\",\n \"0.59424883\",\n \"0.59424883\",\n \"0.59424883\",\n \"0.5940093\",\n \"0.59280837\",\n \"0.59280837\",\n \"0.59275055\",\n \"0.5918077\",\n \"0.59043187\",\n \"0.59043187\",\n \"0.59043187\",\n \"0.59043187\",\n \"0.5888681\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.58638847\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\",\n \"0.5862966\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.61219513"},"document_rank":{"kind":"string","value":"9"}}},{"rowIdx":80679,"cells":{"query":{"kind":"string","value":"itself. They will be added to the sideeffect list as we pass through the children and the parent."},"document":{"kind":"string","value":"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);}"},"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 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 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){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar last=returnFiber.lastEffect;if(last!==null){last.nextEffect=childToDelete;returnFiber.lastEffect=childToDelete;}else{returnFiber.firstEffect=returnFiber.lastEffect=childToDelete;}childToDelete.nextEffect=null;childToDelete.flags=Deletion;}function deleteRemainingChildren(returnFiber,currentFirstChild){if(!shouldTrackSideEffects){// Noop.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\n// instead.\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.flags=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.flags=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.flags=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,lanes){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,lanes){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\nvar created=createFiberFromElement(element,returnFiber.mode,lanes);created.ref=coerceRef(returnFiber,current,element);created.return=returnFiber;return created;}function updatePortal(returnFiber,current,portal,lanes){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,lanes,key){if(current===null||current.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,lanes,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,fragment);existing.return=returnFiber;return existing;}}function createChild(returnFiber,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys. If the previous node is implicitly keyed\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.mode,lanes);created.return=returnFiber;return created;}if(_typeof(newChild)==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{var _created=createFiberFromElement(newChild,returnFiber.mode,lanes);_created.ref=coerceRef(returnFiber,null,newChild);_created.return=returnFiber;return _created;}case REACT_PORTAL_TYPE:{var _created2=createFiberFromPortal(newChild,returnFiber.mode,lanes);_created2.return=returnFiber;return _created2;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created3=createFiberFromFragment(newChild,returnFiber.mode,lanes,null);_created3.return=returnFiber;return _created3;}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateSlot(returnFiber,oldFiber,newChild,lanes){// Update the fiber if the keys match, otherwise return null.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,lanes);}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,lanes,key);}return updateElement(returnFiber,oldFiber,newChild,lanes);}else{return null;}}case REACT_PORTAL_TYPE:{if(newChild.key===key){return updatePortal(returnFiber,oldFiber,newChild,lanes);}else{return null;}}}if(isArray$1(newChild)||getIteratorFn(newChild)){if(key!==null){return null;}return updateFragment(returnFiber,oldFiber,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateFromMap(existingChildren,returnFiber,newIdx,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys, so we neither have to check the old nor\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,lanes);}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,lanes,newChild.key);}return updateElement(returnFiber,_matchedFiber,newChild,lanes);}case REACT_PORTAL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber2,newChild,lanes);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber3=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber3,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}/**\n * Warns if there is a duplicate or missing key\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,lanes){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar knownKeys=null;for(var i=0;i<newChildren.length;i++){var child=newChildren[i];knownKeys=warnOnInvalidKey(child,knownKeys,returnFiber);}}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],lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],lanes);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],lanes);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,lanes){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\");}}{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is not supported. '+'Use an array of keyed ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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,returnFiber);}}}var newChildren=iteratorFn.call(newChildrenIterable);if(!(newChildren!=null)){{throw Error(\"An iterable object provided no iterator.\");}}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,lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber3=createChild(returnFiber,step.value,lanes);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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber4=updateFromMap(existingChildren,returnFiber,newIdx,step.value,lanes);if(_newFiber4!==null){if(shouldTrackSideEffects){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.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileSingleTextNode(returnFiber,currentFirstChild,textContent,lanes){// There's no need to check for keys on text nodes since we don't have a\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\n// and delete the existing ones.\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}function reconcileSingleElement(returnFiber,currentFirstChild,element,lanes){var key=element.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n// the first item in the list.\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\n// eslint-disable-next-lined no-fallthrough\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\ndeleteRemainingChildren(returnFiber,child);break;}else{deleteChild(returnFiber,child);}child=child.sibling;}if(element.type===REACT_FRAGMENT_TYPE){var created=createFiberFromFragment(element.props.children,returnFiber.mode,lanes,element.key);created.return=returnFiber;return created;}else{var _created4=createFiberFromElement(element,returnFiber.mode,lanes);_created4.ref=coerceRef(returnFiber,currentFirstChild,element);_created4.return=returnFiber;return _created4;}}function reconcileSinglePortal(returnFiber,currentFirstChild,portal,lanes){var key=portal.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n// the first item in the list.\nif(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||[]);existing.return=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction reconcileChildFibers(returnFiber,currentFirstChild,newChild,lanes){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level 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,lanes));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,lanes));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,lanes));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,lanes);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,lanes);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}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 Block:case FunctionComponent:case ForwardRef:case SimpleMemoComponent:{{{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.\");}}}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar last=returnFiber.lastEffect;if(last!==null){last.nextEffect=childToDelete;returnFiber.lastEffect=childToDelete;}else {returnFiber.firstEffect=returnFiber.lastEffect=childToDelete;}childToDelete.nextEffect=null;childToDelete.flags=Deletion;}function deleteRemainingChildren(returnFiber,currentFirstChild){if(!shouldTrackSideEffects){// Noop.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\n// instead.\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.flags=Placement;return lastPlacedIndex;}else {// This item can stay in place.\nreturn oldIndex;}}else {// This is an insertion.\nnewFiber.flags=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.flags=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,lanes){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}else {// Update\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,lanes){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\nvar created=createFiberFromElement(element,returnFiber.mode,lanes);created.ref=coerceRef(returnFiber,current,element);created.return=returnFiber;return created;}function updatePortal(returnFiber,current,portal,lanes){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}else {// Update\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,lanes,key){if(current===null||current.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,lanes,key);created.return=returnFiber;return created;}else {// Update\nvar existing=useFiber(current,fragment);existing.return=returnFiber;return existing;}}function createChild(returnFiber,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys. If the previous node is implicitly keyed\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.mode,lanes);created.return=returnFiber;return created;}if(typeof newChild==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{var _created=createFiberFromElement(newChild,returnFiber.mode,lanes);_created.ref=coerceRef(returnFiber,null,newChild);_created.return=returnFiber;return _created;}case REACT_PORTAL_TYPE:{var _created2=createFiberFromPortal(newChild,returnFiber.mode,lanes);_created2.return=returnFiber;return _created2;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created3=createFiberFromFragment(newChild,returnFiber.mode,lanes,null);_created3.return=returnFiber;return _created3;}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateSlot(returnFiber,oldFiber,newChild,lanes){// Update the fiber if the keys match, otherwise return null.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,lanes);}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,lanes,key);}return updateElement(returnFiber,oldFiber,newChild,lanes);}else {return null;}}case REACT_PORTAL_TYPE:{if(newChild.key===key){return updatePortal(returnFiber,oldFiber,newChild,lanes);}else {return null;}}}if(isArray$1(newChild)||getIteratorFn(newChild)){if(key!==null){return null;}return updateFragment(returnFiber,oldFiber,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateFromMap(existingChildren,returnFiber,newIdx,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys, so we neither have to check the old nor\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,lanes);}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,lanes,newChild.key);}return updateElement(returnFiber,_matchedFiber,newChild,lanes);}case REACT_PORTAL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber2,newChild,lanes);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber3=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber3,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}/**\n * Warns if there is a duplicate or missing key\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,lanes){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar knownKeys=null;for(var i=0;i<newChildren.length;i++){var child=newChildren[i];knownKeys=warnOnInvalidKey(child,knownKeys,returnFiber);}}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],lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],lanes);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=_newFiber;}else {previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],lanes);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,lanes){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\");}}{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is not supported. '+'Use an array of keyed ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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,returnFiber);}}}var newChildren=iteratorFn.call(newChildrenIterable);if(!(newChildren!=null)){{throw Error(\"An iterable object provided no iterator.\");}}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,lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber3=createChild(returnFiber,step.value,lanes);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.\nresultingFirstChild=_newFiber3;}else {previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber4=updateFromMap(existingChildren,returnFiber,newIdx,step.value,lanes);if(_newFiber4!==null){if(shouldTrackSideEffects){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.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileSingleTextNode(returnFiber,currentFirstChild,textContent,lanes){// There's no need to check for keys on text nodes since we don't have a\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\n// and delete the existing ones.\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}function reconcileSingleElement(returnFiber,currentFirstChild,element,lanes){var key=element.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n// the first item in the list.\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\n// eslint-disable-next-lined no-fallthrough\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\ndeleteRemainingChildren(returnFiber,child);break;}else {deleteChild(returnFiber,child);}child=child.sibling;}if(element.type===REACT_FRAGMENT_TYPE){var created=createFiberFromFragment(element.props.children,returnFiber.mode,lanes,element.key);created.return=returnFiber;return created;}else {var _created4=createFiberFromElement(element,returnFiber.mode,lanes);_created4.ref=coerceRef(returnFiber,currentFirstChild,element);_created4.return=returnFiber;return _created4;}}function reconcileSinglePortal(returnFiber,currentFirstChild,portal,lanes){var key=portal.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n// the first item in the list.\nif(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||[]);existing.return=returnFiber;return existing;}else {deleteRemainingChildren(returnFiber,child);break;}}else {deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction reconcileChildFibers(returnFiber,currentFirstChild,newChild,lanes){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level 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,lanes));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,lanes));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,lanes));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,lanes);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,lanes);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}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 Block:case FunctionComponent:case ForwardRef:case SimpleMemoComponent:{{{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.\");}}}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\n// instead.\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created[\"return\"]=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent);existing[\"return\"]=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing[\"return\"]=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\nvar 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\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created[\"return\"]=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,portal.children||[]);existing[\"return\"]=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,expirationTime,key){if(current===null||current.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created[\"return\"]=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,fragment);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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar 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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(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\n// new node for the key. If both are text nodes, they match.\nvar 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;}/**\n * Warns if there is a duplicate or missing key\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;}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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],expirationTime);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],expirationTime);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\nexistingChildren[\"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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\");}}{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is unsupported and will likely yield '+'unexpected results. Convert it to a sequence/iterable of keyed '+'ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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);if(!(newChildren!=null)){{throw Error(\"An iterable object provided no iterator.\");}}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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren[\"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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing[\"return\"]=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing[\"return\"]=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\n// eslint-disable-next-lined no-fallthrough\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3[\"return\"]=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(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||[]);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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\n// instead.\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\nvar 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\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,expirationTime,key){if(current===null||current.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,fragment);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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar 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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(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\n// new node for the key. If both are text nodes, they match.\nvar 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;}/**\n * Warns if there is a duplicate or missing key\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;}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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],expirationTime);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],expirationTime);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\");}}{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is unsupported and will likely yield '+'unexpected results. Convert it to a sequence/iterable of keyed '+'ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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);if(!(newChildren!=null)){{throw Error(\"An iterable object provided no iterator.\");}}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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\n// eslint-disable-next-lined no-fallthrough\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(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||[]);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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\n// instead.\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\nvar 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\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,expirationTime,key){if(current===null||current.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,fragment);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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar 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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(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\n// new node for the key. If both are text nodes, they match.\nvar 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;}/**\n * Warns if there is a duplicate or missing key\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;}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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],expirationTime);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],expirationTime);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\");}}{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is unsupported and will likely yield '+'unexpected results. Convert it to a sequence/iterable of keyed '+'ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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);if(!(newChildren!=null)){{throw Error(\"An iterable object provided no iterator.\");}}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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\n// eslint-disable-next-lined no-fallthrough\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(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||[]);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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\nvar existing=useFiber(current,element.props,expirationTime);existing.ref=coerceRef(current,element);existing['return']=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\nvar created=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);created.ref=coerceRef(current,element);created['return']=returnFiber;return created;}}function updateCall(returnFiber,current,call,expirationTime){// TODO: Should this also compare handler to determine whether to reuse?\nif(current===null||current.tag!==CallComponent){// Insert\nvar created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Move based on index\nvar existing=useFiber(current,call,expirationTime);existing['return']=returnFiber;return existing;}}function updateReturn(returnFiber,current,returnNode,expirationTime){if(current===null||current.tag!==ReturnComponent){// Insert\nvar created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}else{// Move based on index\nvar existing=useFiber(current,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}}function updatePortal(returnFiber,current,portal,expirationTime){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\nvar 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\nvar created=createFiberFromFragment(fragment,returnFiber.internalContextTag,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{if(newChild.type===REACT_FRAGMENT_TYPE){var _created=createFiberFromFragment(newChild.props.children,returnFiber.internalContextTag,expirationTime,newChild.key);_created['return']=returnFiber;return _created;}else{var _created2=createFiberFromElement(newChild,returnFiber.internalContextTag,expirationTime);_created2.ref=coerceRef(null,newChild);_created2['return']=returnFiber;return _created2;}}case REACT_CALL_TYPE:{var _created3=createFiberFromCall(newChild,returnFiber.internalContextTag,expirationTime);_created3['return']=returnFiber;return _created3;}case REACT_RETURN_TYPE:{var _created4=createFiberFromReturn(newChild,returnFiber.internalContextTag,expirationTime);_created4.type=newChild.value;_created4['return']=returnFiber;return _created4;}case REACT_PORTAL_TYPE:{var _created5=createFiberFromPortal(newChild,returnFiber.internalContextTag,expirationTime);_created5['return']=returnFiber;return _created5;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created6=createFiberFromFragment(newChild,returnFiber.internalContextTag,expirationTime,null);_created6['return']=returnFiber;return _created6;}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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{if(newChild.key===key){return updateCall(returnFiber,oldFiber,newChild,expirationTime);}else{return null;}}case REACT_RETURN_TYPE:{// 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.\nif(key===null){return updateReturn(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\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updateCall(returnFiber,_matchedFiber2,newChild,expirationTime);}case REACT_RETURN_TYPE:{// 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.\nvar _matchedFiber3=existingChildren.get(newIdx)||null;return updateReturn(returnFiber,_matchedFiber3,newChild,expirationTime);}case REACT_PORTAL_TYPE:{var _matchedFiber4=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber4,newChild,expirationTime);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber5=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber5,newChild,expirationTime,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}return null;}/**\n * Warns if there is a duplicate or missing key\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren['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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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\nif(typeof newChildrenIterable.entries==='function'){var possibleMap=newChildrenIterable;if(possibleMap.entries===iteratorFn){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());didWarnAboutMaps=true;}}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren['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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.internalContextTag,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\n// the first item in the list.\nif(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(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.internalContextTag,expirationTime,element.key);created['return']=returnFiber;return created;}else{var _created7=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);_created7.ref=coerceRef(currentFirstChild,element);_created7['return']=returnFiber;return _created7;}}function reconcileSingleCall(returnFiber,currentFirstChild,call,expirationTime){var key=call.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n// the first item in the list.\nif(child.key===key){if(child.tag===CallComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,call,expirationTime);existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}function reconcileSingleReturn(returnFiber,currentFirstChild,returnNode,expirationTime){// There's no need to check for keys on yields since they're stateless.\nvar child=currentFirstChild;if(child!==null){if(child.tag===ReturnComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);}}var created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}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\n// the first item in the list.\nif(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.internalContextTag,expirationTime);created['return']=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\nvar existing=useFiber(current,element.props,expirationTime);existing.ref=coerceRef(current,element);existing['return']=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\nvar created=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);created.ref=coerceRef(current,element);created['return']=returnFiber;return created;}}function updateCall(returnFiber,current,call,expirationTime){// TODO: Should this also compare handler to determine whether to reuse?\nif(current===null||current.tag!==CallComponent){// Insert\nvar created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Move based on index\nvar existing=useFiber(current,call,expirationTime);existing['return']=returnFiber;return existing;}}function updateReturn(returnFiber,current,returnNode,expirationTime){if(current===null||current.tag!==ReturnComponent){// Insert\nvar created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}else{// Move based on index\nvar existing=useFiber(current,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}}function updatePortal(returnFiber,current,portal,expirationTime){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\nvar 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\nvar created=createFiberFromFragment(fragment,returnFiber.internalContextTag,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{if(newChild.type===REACT_FRAGMENT_TYPE){var _created=createFiberFromFragment(newChild.props.children,returnFiber.internalContextTag,expirationTime,newChild.key);_created['return']=returnFiber;return _created;}else{var _created2=createFiberFromElement(newChild,returnFiber.internalContextTag,expirationTime);_created2.ref=coerceRef(null,newChild);_created2['return']=returnFiber;return _created2;}}case REACT_CALL_TYPE:{var _created3=createFiberFromCall(newChild,returnFiber.internalContextTag,expirationTime);_created3['return']=returnFiber;return _created3;}case REACT_RETURN_TYPE:{var _created4=createFiberFromReturn(newChild,returnFiber.internalContextTag,expirationTime);_created4.type=newChild.value;_created4['return']=returnFiber;return _created4;}case REACT_PORTAL_TYPE:{var _created5=createFiberFromPortal(newChild,returnFiber.internalContextTag,expirationTime);_created5['return']=returnFiber;return _created5;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created6=createFiberFromFragment(newChild,returnFiber.internalContextTag,expirationTime,null);_created6['return']=returnFiber;return _created6;}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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{if(newChild.key===key){return updateCall(returnFiber,oldFiber,newChild,expirationTime);}else{return null;}}case REACT_RETURN_TYPE:{// 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.\nif(key===null){return updateReturn(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\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updateCall(returnFiber,_matchedFiber2,newChild,expirationTime);}case REACT_RETURN_TYPE:{// 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.\nvar _matchedFiber3=existingChildren.get(newIdx)||null;return updateReturn(returnFiber,_matchedFiber3,newChild,expirationTime);}case REACT_PORTAL_TYPE:{var _matchedFiber4=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber4,newChild,expirationTime);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber5=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber5,newChild,expirationTime,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}return null;}/**\n * Warns if there is a duplicate or missing key\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren['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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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\nif(typeof newChildrenIterable.entries==='function'){var possibleMap=newChildrenIterable;if(possibleMap.entries===iteratorFn){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());didWarnAboutMaps=true;}}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren['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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.internalContextTag,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\n// the first item in the list.\nif(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(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.internalContextTag,expirationTime,element.key);created['return']=returnFiber;return created;}else{var _created7=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);_created7.ref=coerceRef(currentFirstChild,element);_created7['return']=returnFiber;return _created7;}}function reconcileSingleCall(returnFiber,currentFirstChild,call,expirationTime){var key=call.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n// the first item in the list.\nif(child.key===key){if(child.tag===CallComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,call,expirationTime);existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}function reconcileSingleReturn(returnFiber,currentFirstChild,returnNode,expirationTime){// There's no need to check for keys on yields since they're stateless.\nvar child=currentFirstChild;if(child!==null){if(child.tag===ReturnComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);}}var created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}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\n// the first item in the list.\nif(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.internalContextTag,expirationTime);created['return']=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\nvar 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\nvar 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\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar 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\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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;}/**\n * Warns if there is a duplicate or missing key\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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\nif(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.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(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\n// the first item in the list.\nif(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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created['return']=returnFiber;return created;}else{// Update\nvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\nvar 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\nvar 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\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created['return']=returnFiber;return created;}else{// Update\nvar 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\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar 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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(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\n// new node for the key. If both are text nodes, they match.\nvar 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;}/**\n * Warns if there is a duplicate or missing key\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(false,'Encountered two children with the same key, `%s`. '+'Keys should be unique so that components maintain their identity '+'across 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\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren['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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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\nif(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.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren['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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(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\n// the first item in the list.\nif(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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\nvar existing=useFiber(current$$1,element.props,expirationTime);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,portal.children||[],expirationTime);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar created=createFiberFromText(''+newChild,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_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(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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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(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\n// new node for the key. If both are text nodes, they match.\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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(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;}/**\n * Warns if there is a duplicate or missing key\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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;{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===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\n// the first item in the list.\nif(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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\nvar existing=useFiber(current$$1,element.props,expirationTime);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,portal.children||[],expirationTime);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar 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(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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(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(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\n// new node for the key. If both are text nodes, they match.\nvar 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(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;}/**\n * Warns if there is a duplicate or missing key\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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;{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(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\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===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\n// the first item in the list.\nif(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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\nreturn;}// Deletions are added in reversed order so we add it to the front.\n// At this point, the return fiber's effect list is empty except for\n// deletions, so we can just append the deletion to the list. The remaining\n// effects aren't added until the complete phase. Once we implement\n// resuming, this may not be true.\nvar 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.\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\n// assuming that after the first child we've already added everything.\nvar 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\n// keys quickly. Implicit (null) keys get added to this set with their index\nvar 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\n// to forget to do before returning it. E.g. for the single child case.\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\nreturn oldIndex;}}else{// This is an insertion.\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n// placement for inserting new children.\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\nvar existing=useFiber(current$$1,element.props);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\nvar existing=useFiber(current$$1,fragment);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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nvar 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(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.\nvar 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\n// we can continue to replace it without aborting even if it is not a text\n// node.\nif(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(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\n// new node for the key. If both are text nodes, they match.\nvar 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(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;}/**\n * Warns if there is a duplicate or missing key\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\nvar 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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;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.\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n// but using the iterator instead.\nvar 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;{// We don't support rendering Generators because it's a mutation.\n// See https://github.com/facebook/react/issues/12995\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\n// We'll get a different iterator later for the main pass.\nvar _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\n// unfortunate because it triggers the slow path all the time. We need\n// a better way to communicate whether this was a miss or null,\n// boolean, undefined, etc.\nif(!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\n// need to delete the existing child.\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\nresultingFirstChild=newFiber;}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.\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\n// since the rest will all be insertions.\nfor(;!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.\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\nfor(;!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\n// current, that means that we reused the fiber. We need to delete\n// it from the child list so that we don't add it to the deletion\n// list.\nexistingChildren.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\n// to add them to the deletion list.\nexistingChildren.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\n// way to define them.\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n// the rest.\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\n// and delete the existing ones.\ndeleteRemainingChildren(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\n// the first item in the list.\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===element.type){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.type===REACT_FRAGMENT_TYPE?element.props.children:element.props);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\n// the first item in the list.\nif(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||[]);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\n// itself. They will be added to the side-effect list as we pass through the\n// children and the parent.\nfunction 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);}return reconcileChildFibers;}","function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\n\treturn;}// 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\tvar 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.\n\treturn null;}// 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\tvar 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\n\t// keys quickly. Implicit (null) keys get added to this set with their index\n\tvar 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\n\t// to forget to do before returning it. E.g. for the single child case.\n\tvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\n\treturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\n\tnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\n\treturn oldIndex;}}else{// This is an insertion.\n\tnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\n\t// placement for inserting new children.\n\tif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\n\tvar created=createFiberFromText(textContent,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\n\tvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\n\tvar existing=useFiber(current,element.props,expirationTime);existing.ref=coerceRef(current,element);existing['return']=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\n\tvar created=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);created.ref=coerceRef(current,element);created['return']=returnFiber;return created;}}function updateCall(returnFiber,current,call,expirationTime){// TODO: Should this also compare handler to determine whether to reuse?\n\tif(current===null||current.tag!==CallComponent){// Insert\n\tvar created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Move based on index\n\tvar existing=useFiber(current,call,expirationTime);existing['return']=returnFiber;return existing;}}function updateReturn(returnFiber,current,returnNode,expirationTime){if(current===null||current.tag!==ReturnComponent){// Insert\n\tvar created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}else{// Move based on index\n\tvar existing=useFiber(current,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}}function updatePortal(returnFiber,current,portal,expirationTime){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\n\tvar created=createFiberFromPortal(portal,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\n\tvar 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\n\tvar created=createFiberFromFragment(fragment,returnFiber.internalContextTag,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\n\tvar 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\n\t// we can continue to replace it without aborting even if it is not a text\n\t// node.\n\tvar created=createFiberFromText(''+newChild,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{if(newChild.type===REACT_FRAGMENT_TYPE){var _created=createFiberFromFragment(newChild.props.children,returnFiber.internalContextTag,expirationTime,newChild.key);_created['return']=returnFiber;return _created;}else{var _created2=createFiberFromElement(newChild,returnFiber.internalContextTag,expirationTime);_created2.ref=coerceRef(null,newChild);_created2['return']=returnFiber;return _created2;}}case REACT_CALL_TYPE:{var _created3=createFiberFromCall(newChild,returnFiber.internalContextTag,expirationTime);_created3['return']=returnFiber;return _created3;}case REACT_RETURN_TYPE:{var _created4=createFiberFromReturn(newChild,returnFiber.internalContextTag,expirationTime);_created4.type=newChild.value;_created4['return']=returnFiber;return _created4;}case REACT_PORTAL_TYPE:{var _created5=createFiberFromPortal(newChild,returnFiber.internalContextTag,expirationTime);_created5['return']=returnFiber;return _created5;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created6=createFiberFromFragment(newChild,returnFiber.internalContextTag,expirationTime,null);_created6['return']=returnFiber;return _created6;}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.\n\tvar 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\n\t// we can continue to replace it without aborting even if it is not a text\n\t// node.\n\tif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{if(newChild.key===key){return updateCall(returnFiber,oldFiber,newChild,expirationTime);}else{return null;}}case REACT_RETURN_TYPE:{// 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\tif(key===null){return updateReturn(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\n\t// new node for the key. If both are text nodes, they match.\n\tvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updateCall(returnFiber,_matchedFiber2,newChild,expirationTime);}case REACT_RETURN_TYPE:{// 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\tvar _matchedFiber3=existingChildren.get(newIdx)||null;return updateReturn(returnFiber,_matchedFiber3,newChild,expirationTime);}case REACT_PORTAL_TYPE:{var _matchedFiber4=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber4,newChild,expirationTime);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber5=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber5,newChild,expirationTime,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}return null;}/**\n\t * Warns if there is a duplicate or missing key\n\t */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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// 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// 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// If you change this code, also update reconcileChildrenIterator() which\n\t// uses the same algorithm.\n\t{// First, validate keys.\n\tvar 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\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\tif(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\n\t// need to delete the existing child.\n\tdeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\n\tresultingFirstChild=newFiber;}else{// 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\tpreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\n\tdeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// 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\tfor(;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.\n\tresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\n\tvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\n\tfor(;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\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\texistingChildren['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\n\t// to add them to the deletion list.\n\texistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\n\t// but using the iterator instead.\n\tvar 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\n\tif(typeof newChildrenIterable.entries==='function'){var possibleMap=newChildrenIterable;if(possibleMap.entries===iteratorFn){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());didWarnAboutMaps=true;}}// First, validate keys.\n\t// We'll get a different iterator later for the main pass.\n\tvar _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\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\tif(!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\n\t// need to delete the existing child.\n\tdeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\n\tresultingFirstChild=newFiber;}else{// 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\tpreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\n\tdeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// 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\tfor(;!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.\n\tresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\n\tvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\n\tfor(;!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\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\texistingChildren['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\n\t// to add them to the deletion list.\n\texistingChildren.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\n\t// way to define them.\n\tif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\n\t// the rest.\n\tdeleteRemainingChildren(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\n\t// and delete the existing ones.\n\tdeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.internalContextTag,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\n\t// the first item in the list.\n\tif(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(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.internalContextTag,expirationTime,element.key);created['return']=returnFiber;return created;}else{var _created7=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);_created7.ref=coerceRef(currentFirstChild,element);_created7['return']=returnFiber;return _created7;}}function reconcileSingleCall(returnFiber,currentFirstChild,call,expirationTime){var key=call.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\n\t// the first item in the list.\n\tif(child.key===key){if(child.tag===CallComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,call,expirationTime);existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}function reconcileSingleReturn(returnFiber,currentFirstChild,returnNode,expirationTime){// There's no need to check for keys on yields since they're stateless.\n\tvar child=currentFirstChild;if(child!==null){if(child.tag===ReturnComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);}}var created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}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\n\t// the first item in the list.\n\tif(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.internalContextTag,expirationTime);created['return']=returnFiber;return created;}// 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\tfunction 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);}return reconcileChildFibers;}","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\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.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 } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to 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\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 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 }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to 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 // 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 } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to 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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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\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\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== 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\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\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 !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\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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 {\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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\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\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== 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\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\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 !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\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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 {\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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\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\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== 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\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\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 !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\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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 {\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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\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\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== 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\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\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 (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\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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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\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\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== 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\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\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 !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\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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 {\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, 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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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\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\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== 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\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\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 (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\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 {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\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 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.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.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.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$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 = 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 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.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$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$$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 = 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}"],"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 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){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar last=returnFiber.lastEffect;if(last!==null){last.nextEffect=childToDelete;returnFiber.lastEffect=childToDelete;}else{returnFiber.firstEffect=returnFiber.lastEffect=childToDelete;}childToDelete.nextEffect=null;childToDelete.flags=Deletion;}function deleteRemainingChildren(returnFiber,currentFirstChild){if(!shouldTrackSideEffects){// Noop.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\n// instead.\\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.flags=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.flags=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.flags=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,lanes){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,lanes){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\\nvar created=createFiberFromElement(element,returnFiber.mode,lanes);created.ref=coerceRef(returnFiber,current,element);created.return=returnFiber;return created;}function updatePortal(returnFiber,current,portal,lanes){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,lanes,key){if(current===null||current.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,lanes,key);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,fragment);existing.return=returnFiber;return existing;}}function createChild(returnFiber,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys. If the previous node is implicitly keyed\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar created=createFiberFromText(''+newChild,returnFiber.mode,lanes);created.return=returnFiber;return created;}if(_typeof(newChild)==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{var _created=createFiberFromElement(newChild,returnFiber.mode,lanes);_created.ref=coerceRef(returnFiber,null,newChild);_created.return=returnFiber;return _created;}case REACT_PORTAL_TYPE:{var _created2=createFiberFromPortal(newChild,returnFiber.mode,lanes);_created2.return=returnFiber;return _created2;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created3=createFiberFromFragment(newChild,returnFiber.mode,lanes,null);_created3.return=returnFiber;return _created3;}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateSlot(returnFiber,oldFiber,newChild,lanes){// Update the fiber if the keys match, otherwise return null.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,lanes);}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,lanes,key);}return updateElement(returnFiber,oldFiber,newChild,lanes);}else{return null;}}case REACT_PORTAL_TYPE:{if(newChild.key===key){return updatePortal(returnFiber,oldFiber,newChild,lanes);}else{return null;}}}if(isArray$1(newChild)||getIteratorFn(newChild)){if(key!==null){return null;}return updateFragment(returnFiber,oldFiber,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateFromMap(existingChildren,returnFiber,newIdx,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys, so we neither have to check the old nor\\n// new node for the key. If both are text nodes, they match.\\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,lanes);}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,lanes,newChild.key);}return updateElement(returnFiber,_matchedFiber,newChild,lanes);}case REACT_PORTAL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber2,newChild,lanes);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber3=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber3,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}/**\\n * Warns if there is a duplicate or missing key\\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,lanes){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar knownKeys=null;for(var i=0;i<newChildren.length;i++){var child=newChildren[i];knownKeys=warnOnInvalidKey(child,knownKeys,returnFiber);}}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],lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],lanes);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],lanes);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,lanes){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\\\");}}{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is not supported. '+'Use an array of keyed ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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,returnFiber);}}}var newChildren=iteratorFn.call(newChildrenIterable);if(!(newChildren!=null)){{throw Error(\\\"An iterable object provided no iterator.\\\");}}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,lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber3=createChild(returnFiber,step.value,lanes);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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber4=updateFromMap(existingChildren,returnFiber,newIdx,step.value,lanes);if(_newFiber4!==null){if(shouldTrackSideEffects){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.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileSingleTextNode(returnFiber,currentFirstChild,textContent,lanes){// There's no need to check for keys on text nodes since we don't have a\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\\n// and delete the existing ones.\\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}function reconcileSingleElement(returnFiber,currentFirstChild,element,lanes){var key=element.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n// the first item in the list.\\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\\n// eslint-disable-next-lined no-fallthrough\\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\\ndeleteRemainingChildren(returnFiber,child);break;}else{deleteChild(returnFiber,child);}child=child.sibling;}if(element.type===REACT_FRAGMENT_TYPE){var created=createFiberFromFragment(element.props.children,returnFiber.mode,lanes,element.key);created.return=returnFiber;return created;}else{var _created4=createFiberFromElement(element,returnFiber.mode,lanes);_created4.ref=coerceRef(returnFiber,currentFirstChild,element);_created4.return=returnFiber;return _created4;}}function reconcileSinglePortal(returnFiber,currentFirstChild,portal,lanes){var key=portal.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n// the first item in the list.\\nif(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||[]);existing.return=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction reconcileChildFibers(returnFiber,currentFirstChild,newChild,lanes){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level 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,lanes));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,lanes));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,lanes));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,lanes);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,lanes);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}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 Block:case FunctionComponent:case ForwardRef:case SimpleMemoComponent:{{{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.\\\");}}}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar last=returnFiber.lastEffect;if(last!==null){last.nextEffect=childToDelete;returnFiber.lastEffect=childToDelete;}else {returnFiber.firstEffect=returnFiber.lastEffect=childToDelete;}childToDelete.nextEffect=null;childToDelete.flags=Deletion;}function deleteRemainingChildren(returnFiber,currentFirstChild){if(!shouldTrackSideEffects){// Noop.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\n// instead.\\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.flags=Placement;return lastPlacedIndex;}else {// This item can stay in place.\\nreturn oldIndex;}}else {// This is an insertion.\\nnewFiber.flags=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.flags=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,lanes){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}else {// Update\\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,lanes){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\\nvar created=createFiberFromElement(element,returnFiber.mode,lanes);created.ref=coerceRef(returnFiber,current,element);created.return=returnFiber;return created;}function updatePortal(returnFiber,current,portal,lanes){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}else {// Update\\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,lanes,key){if(current===null||current.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,lanes,key);created.return=returnFiber;return created;}else {// Update\\nvar existing=useFiber(current,fragment);existing.return=returnFiber;return existing;}}function createChild(returnFiber,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys. If the previous node is implicitly keyed\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar created=createFiberFromText(''+newChild,returnFiber.mode,lanes);created.return=returnFiber;return created;}if(typeof newChild==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{var _created=createFiberFromElement(newChild,returnFiber.mode,lanes);_created.ref=coerceRef(returnFiber,null,newChild);_created.return=returnFiber;return _created;}case REACT_PORTAL_TYPE:{var _created2=createFiberFromPortal(newChild,returnFiber.mode,lanes);_created2.return=returnFiber;return _created2;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created3=createFiberFromFragment(newChild,returnFiber.mode,lanes,null);_created3.return=returnFiber;return _created3;}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateSlot(returnFiber,oldFiber,newChild,lanes){// Update the fiber if the keys match, otherwise return null.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,lanes);}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,lanes,key);}return updateElement(returnFiber,oldFiber,newChild,lanes);}else {return null;}}case REACT_PORTAL_TYPE:{if(newChild.key===key){return updatePortal(returnFiber,oldFiber,newChild,lanes);}else {return null;}}}if(isArray$1(newChild)||getIteratorFn(newChild)){if(key!==null){return null;}return updateFragment(returnFiber,oldFiber,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}function updateFromMap(existingChildren,returnFiber,newIdx,newChild,lanes){if(typeof newChild==='string'||typeof newChild==='number'){// Text nodes don't have keys, so we neither have to check the old nor\\n// new node for the key. If both are text nodes, they match.\\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,lanes);}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,lanes,newChild.key);}return updateElement(returnFiber,_matchedFiber,newChild,lanes);}case REACT_PORTAL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber2,newChild,lanes);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber3=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber3,newChild,lanes,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}return null;}/**\\n * Warns if there is a duplicate or missing key\\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,lanes){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar knownKeys=null;for(var i=0;i<newChildren.length;i++){var child=newChildren[i];knownKeys=warnOnInvalidKey(child,knownKeys,returnFiber);}}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],lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],lanes);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=_newFiber;}else {previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],lanes);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,lanes){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\\\");}}{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is not supported. '+'Use an array of keyed ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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,returnFiber);}}}var newChildren=iteratorFn.call(newChildrenIterable);if(!(newChildren!=null)){{throw Error(\\\"An iterable object provided no iterator.\\\");}}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,lanes);if(newFiber===null){// TODO: This breaks on empty slots like null children. That's\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber3=createChild(returnFiber,step.value,lanes);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.\\nresultingFirstChild=_newFiber3;}else {previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!step.done;newIdx++,step=newChildren.next()){var _newFiber4=updateFromMap(existingChildren,returnFiber,newIdx,step.value,lanes);if(_newFiber4!==null){if(shouldTrackSideEffects){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.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileSingleTextNode(returnFiber,currentFirstChild,textContent,lanes){// There's no need to check for keys on text nodes since we don't have a\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\\n// and delete the existing ones.\\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.mode,lanes);created.return=returnFiber;return created;}function reconcileSingleElement(returnFiber,currentFirstChild,element,lanes){var key=element.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n// the first item in the list.\\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\\n// eslint-disable-next-lined no-fallthrough\\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\\ndeleteRemainingChildren(returnFiber,child);break;}else {deleteChild(returnFiber,child);}child=child.sibling;}if(element.type===REACT_FRAGMENT_TYPE){var created=createFiberFromFragment(element.props.children,returnFiber.mode,lanes,element.key);created.return=returnFiber;return created;}else {var _created4=createFiberFromElement(element,returnFiber.mode,lanes);_created4.ref=coerceRef(returnFiber,currentFirstChild,element);_created4.return=returnFiber;return _created4;}}function reconcileSinglePortal(returnFiber,currentFirstChild,portal,lanes){var key=portal.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n// the first item in the list.\\nif(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||[]);existing.return=returnFiber;return existing;}else {deleteRemainingChildren(returnFiber,child);break;}}else {deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromPortal(portal,returnFiber.mode,lanes);created.return=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction reconcileChildFibers(returnFiber,currentFirstChild,newChild,lanes){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level 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,lanes));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,lanes));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,lanes));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,lanes);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,lanes);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType(returnFiber);}}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 Block:case FunctionComponent:case ForwardRef:case SimpleMemoComponent:{{{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.\\\");}}}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\n// instead.\\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created[\\\"return\\\"]=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent);existing[\\\"return\\\"]=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing[\\\"return\\\"]=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\\nvar 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\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created[\\\"return\\\"]=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,portal.children||[]);existing[\\\"return\\\"]=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,expirationTime,key){if(current===null||current.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created[\\\"return\\\"]=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,fragment);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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar 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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(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\\n// new node for the key. If both are text nodes, they match.\\nvar 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;}/**\\n * Warns if there is a duplicate or missing key\\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;}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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],expirationTime);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],expirationTime);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\\nexistingChildren[\\\"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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\\\");}}{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is unsupported and will likely yield '+'unexpected results. Convert it to a sequence/iterable of keyed '+'ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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);if(!(newChildren!=null)){{throw Error(\\\"An iterable object provided no iterator.\\\");}}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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren[\\\"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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing[\\\"return\\\"]=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing[\\\"return\\\"]=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\\n// eslint-disable-next-lined no-fallthrough\\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3[\\\"return\\\"]=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(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||[]);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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\n// instead.\\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\\nvar 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\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,expirationTime,key){if(current===null||current.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,fragment);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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar 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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(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\\n// new node for the key. If both are text nodes, they match.\\nvar 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;}/**\\n * Warns if there is a duplicate or missing key\\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;}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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],expirationTime);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],expirationTime);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\\\");}}{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is unsupported and will likely yield '+'unexpected results. Convert it to a sequence/iterable of keyed '+'ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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);if(!(newChildren!=null)){{throw Error(\\\"An iterable object provided no iterator.\\\");}}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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\\n// eslint-disable-next-lined no-fallthrough\\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(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||[]);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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\n// instead.\\nvar 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){// We currently set sibling to null and index to 0 here because it is easy\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null){if(current.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(current,element)){// Move based on index\\nvar existing=useFiber(current,element.props);existing.ref=coerceRef(returnFiber,current,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}}// Insert\\nvar 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\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current,fragment,expirationTime,key){if(current===null||current.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,fragment);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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar 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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(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\\n// new node for the key. If both are text nodes, they match.\\nvar 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;}/**\\n * Warns if there is a duplicate or missing key\\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;}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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber=createChild(returnFiber,newChildren[newIdx],expirationTime);if(_newFiber===null){continue;}lastPlacedIndex=placeChild(_newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;newIdx<newChildren.length;newIdx++){var _newFiber2=updateFromMap(existingChildren,returnFiber,newIdx,newChildren[newIdx],expirationTime);if(_newFiber2!==null){if(shouldTrackSideEffects){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.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar iteratorFn=getIteratorFn(newChildrenIterable);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.\\\");}}{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){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.');}didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){if(!didWarnAboutMaps){error('Using Maps as children is unsupported and will likely yield '+'unexpected results. Convert it to a sequence/iterable of keyed '+'ReactElements instead.');}didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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);if(!(newChildren!=null)){{throw Error(\\\"An iterable object provided no iterator.\\\");}}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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(child.key===key){switch(child.tag){case Fragment:{if(element.type===REACT_FRAGMENT_TYPE){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.props.children);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}break;}case Block:// We intentionally fallthrough here if enableBlocksAPI is not on.\\n// eslint-disable-next-lined no-fallthrough\\ndefault:{if(child.elementType===element.type||// Keep this check inline so it only runs on the false path:\\nisCompatibleFamilyForHotReloading(child,element)){deleteRemainingChildren(returnFiber,child.sibling);var _existing3=useFiber(child,element.props);_existing3.ref=coerceRef(returnFiber,child,element);_existing3.return=returnFiber;{_existing3._debugSource=element._source;_existing3._debugOwner=element._owner;}return _existing3;}break;}}// Didn't match.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(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||[]);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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\\nvar existing=useFiber(current,element.props,expirationTime);existing.ref=coerceRef(current,element);existing['return']=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\\nvar created=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);created.ref=coerceRef(current,element);created['return']=returnFiber;return created;}}function updateCall(returnFiber,current,call,expirationTime){// TODO: Should this also compare handler to determine whether to reuse?\\nif(current===null||current.tag!==CallComponent){// Insert\\nvar created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Move based on index\\nvar existing=useFiber(current,call,expirationTime);existing['return']=returnFiber;return existing;}}function updateReturn(returnFiber,current,returnNode,expirationTime){if(current===null||current.tag!==ReturnComponent){// Insert\\nvar created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}else{// Move based on index\\nvar existing=useFiber(current,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}}function updatePortal(returnFiber,current,portal,expirationTime){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\\nvar 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\\nvar created=createFiberFromFragment(fragment,returnFiber.internalContextTag,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar created=createFiberFromText(''+newChild,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{if(newChild.type===REACT_FRAGMENT_TYPE){var _created=createFiberFromFragment(newChild.props.children,returnFiber.internalContextTag,expirationTime,newChild.key);_created['return']=returnFiber;return _created;}else{var _created2=createFiberFromElement(newChild,returnFiber.internalContextTag,expirationTime);_created2.ref=coerceRef(null,newChild);_created2['return']=returnFiber;return _created2;}}case REACT_CALL_TYPE:{var _created3=createFiberFromCall(newChild,returnFiber.internalContextTag,expirationTime);_created3['return']=returnFiber;return _created3;}case REACT_RETURN_TYPE:{var _created4=createFiberFromReturn(newChild,returnFiber.internalContextTag,expirationTime);_created4.type=newChild.value;_created4['return']=returnFiber;return _created4;}case REACT_PORTAL_TYPE:{var _created5=createFiberFromPortal(newChild,returnFiber.internalContextTag,expirationTime);_created5['return']=returnFiber;return _created5;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created6=createFiberFromFragment(newChild,returnFiber.internalContextTag,expirationTime,null);_created6['return']=returnFiber;return _created6;}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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{if(newChild.key===key){return updateCall(returnFiber,oldFiber,newChild,expirationTime);}else{return null;}}case REACT_RETURN_TYPE:{// 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.\\nif(key===null){return updateReturn(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\\n// new node for the key. If both are text nodes, they match.\\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updateCall(returnFiber,_matchedFiber2,newChild,expirationTime);}case REACT_RETURN_TYPE:{// 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.\\nvar _matchedFiber3=existingChildren.get(newIdx)||null;return updateReturn(returnFiber,_matchedFiber3,newChild,expirationTime);}case REACT_PORTAL_TYPE:{var _matchedFiber4=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber4,newChild,expirationTime);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber5=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber5,newChild,expirationTime,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}return null;}/**\\n * Warns if there is a duplicate or missing key\\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren['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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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\\nif(typeof newChildrenIterable.entries==='function'){var possibleMap=newChildrenIterable;if(possibleMap.entries===iteratorFn){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());didWarnAboutMaps=true;}}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren['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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(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\\n// and delete the existing ones.\\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.internalContextTag,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\\n// the first item in the list.\\nif(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(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.internalContextTag,expirationTime,element.key);created['return']=returnFiber;return created;}else{var _created7=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);_created7.ref=coerceRef(currentFirstChild,element);_created7['return']=returnFiber;return _created7;}}function reconcileSingleCall(returnFiber,currentFirstChild,call,expirationTime){var key=call.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n// the first item in the list.\\nif(child.key===key){if(child.tag===CallComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,call,expirationTime);existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}function reconcileSingleReturn(returnFiber,currentFirstChild,returnNode,expirationTime){// There's no need to check for keys on yields since they're stateless.\\nvar child=currentFirstChild;if(child!==null){if(child.tag===ReturnComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);}}var created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}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\\n// the first item in the list.\\nif(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.internalContextTag,expirationTime);created['return']=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\\nvar existing=useFiber(current,element.props,expirationTime);existing.ref=coerceRef(current,element);existing['return']=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\\nvar created=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);created.ref=coerceRef(current,element);created['return']=returnFiber;return created;}}function updateCall(returnFiber,current,call,expirationTime){// TODO: Should this also compare handler to determine whether to reuse?\\nif(current===null||current.tag!==CallComponent){// Insert\\nvar created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Move based on index\\nvar existing=useFiber(current,call,expirationTime);existing['return']=returnFiber;return existing;}}function updateReturn(returnFiber,current,returnNode,expirationTime){if(current===null||current.tag!==ReturnComponent){// Insert\\nvar created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}else{// Move based on index\\nvar existing=useFiber(current,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}}function updatePortal(returnFiber,current,portal,expirationTime){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\\nvar 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\\nvar created=createFiberFromFragment(fragment,returnFiber.internalContextTag,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar created=createFiberFromText(''+newChild,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{if(newChild.type===REACT_FRAGMENT_TYPE){var _created=createFiberFromFragment(newChild.props.children,returnFiber.internalContextTag,expirationTime,newChild.key);_created['return']=returnFiber;return _created;}else{var _created2=createFiberFromElement(newChild,returnFiber.internalContextTag,expirationTime);_created2.ref=coerceRef(null,newChild);_created2['return']=returnFiber;return _created2;}}case REACT_CALL_TYPE:{var _created3=createFiberFromCall(newChild,returnFiber.internalContextTag,expirationTime);_created3['return']=returnFiber;return _created3;}case REACT_RETURN_TYPE:{var _created4=createFiberFromReturn(newChild,returnFiber.internalContextTag,expirationTime);_created4.type=newChild.value;_created4['return']=returnFiber;return _created4;}case REACT_PORTAL_TYPE:{var _created5=createFiberFromPortal(newChild,returnFiber.internalContextTag,expirationTime);_created5['return']=returnFiber;return _created5;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created6=createFiberFromFragment(newChild,returnFiber.internalContextTag,expirationTime,null);_created6['return']=returnFiber;return _created6;}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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{if(newChild.key===key){return updateCall(returnFiber,oldFiber,newChild,expirationTime);}else{return null;}}case REACT_RETURN_TYPE:{// 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.\\nif(key===null){return updateReturn(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\\n// new node for the key. If both are text nodes, they match.\\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updateCall(returnFiber,_matchedFiber2,newChild,expirationTime);}case REACT_RETURN_TYPE:{// 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.\\nvar _matchedFiber3=existingChildren.get(newIdx)||null;return updateReturn(returnFiber,_matchedFiber3,newChild,expirationTime);}case REACT_PORTAL_TYPE:{var _matchedFiber4=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber4,newChild,expirationTime);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber5=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber5,newChild,expirationTime,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}return null;}/**\\n * Warns if there is a duplicate or missing key\\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren['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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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\\nif(typeof newChildrenIterable.entries==='function'){var possibleMap=newChildrenIterable;if(possibleMap.entries===iteratorFn){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());didWarnAboutMaps=true;}}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren['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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(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\\n// and delete the existing ones.\\ndeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.internalContextTag,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\\n// the first item in the list.\\nif(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(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.internalContextTag,expirationTime,element.key);created['return']=returnFiber;return created;}else{var _created7=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);_created7.ref=coerceRef(currentFirstChild,element);_created7['return']=returnFiber;return _created7;}}function reconcileSingleCall(returnFiber,currentFirstChild,call,expirationTime){var key=call.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n// the first item in the list.\\nif(child.key===key){if(child.tag===CallComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,call,expirationTime);existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}function reconcileSingleReturn(returnFiber,currentFirstChild,returnNode,expirationTime){// There's no need to check for keys on yields since they're stateless.\\nvar child=currentFirstChild;if(child!==null){if(child.tag===ReturnComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);}}var created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}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\\n// the first item in the list.\\nif(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.internalContextTag,expirationTime);created['return']=returnFiber;return created;}// This API will tag the children with the side-effect of the reconciliation\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\\nvar 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\\nvar 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\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar 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\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar created=createFiberFromText(''+newChild,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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\\n// new node for the key. If both are text nodes, they match.\\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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;}/**\\n * Warns if there is a duplicate or missing key\\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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\\nif(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.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(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\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(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\\n// the first item in the list.\\nif(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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created['return']=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\\nvar 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\\nvar 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\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created['return']=returnFiber;return created;}else{// Update\\nvar 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\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar 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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(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\\n// new node for the key. If both are text nodes, they match.\\nvar 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;}/**\\n * Warns if there is a duplicate or missing key\\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(false,'Encountered two children with the same key, `%s`. '+'Keys should be unique so that components maintain their identity '+'across 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\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren['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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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\\nif(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.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren['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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(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\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(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\\n// the first item in the list.\\nif(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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\\nvar existing=useFiber(current$$1,element.props,expirationTime);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,portal.children||[],expirationTime);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar created=createFiberFromText(''+newChild,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_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(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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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(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\\n// new node for the key. If both are text nodes, they match.\\nvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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(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;}/**\\n * Warns if there is a duplicate or missing key\\n */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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;{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(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\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===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\\n// the first item in the list.\\nif(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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,textContent,expirationTime);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\\nvar existing=useFiber(current$$1,element.props,expirationTime);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,portal.children||[],expirationTime);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar 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(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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(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(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\\n// new node for the key. If both are text nodes, they match.\\nvar 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(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;}/**\\n * Warns if there is a duplicate or missing key\\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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;{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(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\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===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\\n// the first item in the list.\\nif(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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\nreturn;}// Deletions are added in reversed order so we add it to the front.\\n// At this point, the return fiber's effect list is empty except for\\n// deletions, so we can just append the deletion to the list. The remaining\\n// effects aren't added until the complete phase. Once we implement\\n// resuming, this may not be true.\\nvar 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.\\nreturn null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by\\n// assuming that after the first child we've already added everything.\\nvar 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\\n// keys quickly. Implicit (null) keys get added to this set with their index\\nvar 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\\n// to forget to do before returning it. E.g. for the single child case.\\nvar clone=createWorkInProgress(fiber,pendingProps);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\nreturn lastPlacedIndex;}var current$$1=newFiber.alternate;if(current$$1!==null){var oldIndex=current$$1.index;if(oldIndex<lastPlacedIndex){// This is a move.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\nreturn oldIndex;}}else{// This is an insertion.\\nnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n// placement for inserting new children.\\nif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current$$1,textContent,expirationTime){if(current$$1===null||current$$1.tag!==HostText){// Insert\\nvar created=createFiberFromText(textContent,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,textContent);existing.return=returnFiber;return existing;}}function updateElement(returnFiber,current$$1,element,expirationTime){if(current$$1!==null&¤t$$1.elementType===element.type){// Move based on index\\nvar existing=useFiber(current$$1,element.props);existing.ref=coerceRef(returnFiber,current$$1,element);existing.return=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\\nvar created=createFiberFromElement(element,returnFiber.mode,expirationTime);created.ref=coerceRef(returnFiber,current$$1,element);created.return=returnFiber;return created;}}function updatePortal(returnFiber,current$$1,portal,expirationTime){if(current$$1===null||current$$1.tag!==HostPortal||current$$1.stateNode.containerInfo!==portal.containerInfo||current$$1.stateNode.implementation!==portal.implementation){// Insert\\nvar created=createFiberFromPortal(portal,returnFiber.mode,expirationTime);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,portal.children||[]);existing.return=returnFiber;return existing;}}function updateFragment(returnFiber,current$$1,fragment,expirationTime,key){if(current$$1===null||current$$1.tag!==Fragment){// Insert\\nvar created=createFiberFromFragment(fragment,returnFiber.mode,expirationTime,key);created.return=returnFiber;return created;}else{// Update\\nvar existing=useFiber(current$$1,fragment);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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nvar 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(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.\\nvar 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\\n// we can continue to replace it without aborting even if it is not a text\\n// node.\\nif(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(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\\n// new node for the key. If both are text nodes, they match.\\nvar 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(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;}/**\\n * Warns if there is a duplicate or missing key\\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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// This algorithm can't optimize by searching from both ends since we\\n// don't have backpointers on fibers. I'm trying to see how 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{// First, validate keys.\\nvar 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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;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.\\nresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n// but using the iterator instead.\\nvar 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;{// We don't support rendering Generators because it's a mutation.\\n// See https://github.com/facebook/react/issues/12995\\nif(typeof Symbol==='function'&&// $FlowFixMe Flow doesn't know about toStringTag\\nnewChildrenIterable[Symbol.toStringTag]==='Generator'){!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;didWarnAboutGenerators=true;}// Warn about using Maps as children\\nif(newChildrenIterable.entries===iteratorFn){!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;didWarnAboutMaps=true;}// First, validate keys.\\n// We'll get a different iterator later for the main pass.\\nvar _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\\n// unfortunate because it triggers the slow path all the time. We need\\n// a better way to communicate whether this was a miss or null,\\n// boolean, undefined, etc.\\nif(!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\\n// need to delete the existing child.\\ndeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\nresultingFirstChild=newFiber;}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.\\npreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\ndeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// If we don't have any more existing children we can choose a fast path\\n// since the rest will all be insertions.\\nfor(;!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.\\nresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\nvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\nfor(;!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\\n// current, that means that we reused the fiber. We need to delete\\n// it from the child list so that we don't add it to the deletion\\n// list.\\nexistingChildren.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\\n// to add them to the deletion list.\\nexistingChildren.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\\n// way to define them.\\nif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n// the rest.\\ndeleteRemainingChildren(returnFiber,currentFirstChild.sibling);var existing=useFiber(currentFirstChild,textContent);existing.return=returnFiber;return existing;}// The existing first child is not a text node so we need to create one\\n// and delete the existing ones.\\ndeleteRemainingChildren(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\\n// the first item in the list.\\nif(child.key===key){if(child.tag===Fragment?element.type===REACT_FRAGMENT_TYPE:child.elementType===element.type){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,element.type===REACT_FRAGMENT_TYPE?element.props.children:element.props);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\\n// the first item in the list.\\nif(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||[]);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\\n// itself. They will be added to the side-effect list as we pass through the\\n// children and the parent.\\nfunction 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);}return reconcileChildFibers;}\",\n \"function ChildReconciler(shouldTrackSideEffects){function deleteChild(returnFiber,childToDelete){if(!shouldTrackSideEffects){// Noop.\\n\\treturn;}// 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\\tvar 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.\\n\\treturn null;}// 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\\tvar 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\\n\\t// keys quickly. Implicit (null) keys get added to this set with their index\\n\\tvar 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\\n\\t// to forget to do before returning it. E.g. for the single child case.\\n\\tvar clone=createWorkInProgress(fiber,pendingProps,expirationTime);clone.index=0;clone.sibling=null;return clone;}function placeChild(newFiber,lastPlacedIndex,newIndex){newFiber.index=newIndex;if(!shouldTrackSideEffects){// Noop.\\n\\treturn lastPlacedIndex;}var current=newFiber.alternate;if(current!==null){var oldIndex=current.index;if(oldIndex<lastPlacedIndex){// This is a move.\\n\\tnewFiber.effectTag=Placement;return lastPlacedIndex;}else{// This item can stay in place.\\n\\treturn oldIndex;}}else{// This is an insertion.\\n\\tnewFiber.effectTag=Placement;return lastPlacedIndex;}}function placeSingleChild(newFiber){// This is simpler for the single child case. We only need to do a\\n\\t// placement for inserting new children.\\n\\tif(shouldTrackSideEffects&&newFiber.alternate===null){newFiber.effectTag=Placement;}return newFiber;}function updateTextNode(returnFiber,current,textContent,expirationTime){if(current===null||current.tag!==HostText){// Insert\\n\\tvar created=createFiberFromText(textContent,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\\n\\tvar existing=useFiber(current,textContent,expirationTime);existing['return']=returnFiber;return existing;}}function updateElement(returnFiber,current,element,expirationTime){if(current!==null&¤t.type===element.type){// Move based on index\\n\\tvar existing=useFiber(current,element.props,expirationTime);existing.ref=coerceRef(current,element);existing['return']=returnFiber;{existing._debugSource=element._source;existing._debugOwner=element._owner;}return existing;}else{// Insert\\n\\tvar created=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);created.ref=coerceRef(current,element);created['return']=returnFiber;return created;}}function updateCall(returnFiber,current,call,expirationTime){// TODO: Should this also compare handler to determine whether to reuse?\\n\\tif(current===null||current.tag!==CallComponent){// Insert\\n\\tvar created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Move based on index\\n\\tvar existing=useFiber(current,call,expirationTime);existing['return']=returnFiber;return existing;}}function updateReturn(returnFiber,current,returnNode,expirationTime){if(current===null||current.tag!==ReturnComponent){// Insert\\n\\tvar created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}else{// Move based on index\\n\\tvar existing=useFiber(current,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}}function updatePortal(returnFiber,current,portal,expirationTime){if(current===null||current.tag!==HostPortal||current.stateNode.containerInfo!==portal.containerInfo||current.stateNode.implementation!==portal.implementation){// Insert\\n\\tvar created=createFiberFromPortal(portal,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}else{// Update\\n\\tvar 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\\n\\tvar created=createFiberFromFragment(fragment,returnFiber.internalContextTag,expirationTime,key);created['return']=returnFiber;return created;}else{// Update\\n\\tvar 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\\n\\t// we can continue to replace it without aborting even if it is not a text\\n\\t// node.\\n\\tvar created=createFiberFromText(''+newChild,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}if((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:{if(newChild.type===REACT_FRAGMENT_TYPE){var _created=createFiberFromFragment(newChild.props.children,returnFiber.internalContextTag,expirationTime,newChild.key);_created['return']=returnFiber;return _created;}else{var _created2=createFiberFromElement(newChild,returnFiber.internalContextTag,expirationTime);_created2.ref=coerceRef(null,newChild);_created2['return']=returnFiber;return _created2;}}case REACT_CALL_TYPE:{var _created3=createFiberFromCall(newChild,returnFiber.internalContextTag,expirationTime);_created3['return']=returnFiber;return _created3;}case REACT_RETURN_TYPE:{var _created4=createFiberFromReturn(newChild,returnFiber.internalContextTag,expirationTime);_created4.type=newChild.value;_created4['return']=returnFiber;return _created4;}case REACT_PORTAL_TYPE:{var _created5=createFiberFromPortal(newChild,returnFiber.internalContextTag,expirationTime);_created5['return']=returnFiber;return _created5;}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _created6=createFiberFromFragment(newChild,returnFiber.internalContextTag,expirationTime,null);_created6['return']=returnFiber;return _created6;}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.\\n\\tvar 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\\n\\t// we can continue to replace it without aborting even if it is not a text\\n\\t// node.\\n\\tif(key!==null){return null;}return updateTextNode(returnFiber,oldFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{if(newChild.key===key){return updateCall(returnFiber,oldFiber,newChild,expirationTime);}else{return null;}}case REACT_RETURN_TYPE:{// 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\\tif(key===null){return updateReturn(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\\n\\t// new node for the key. If both are text nodes, they match.\\n\\tvar matchedFiber=existingChildren.get(newIdx)||null;return updateTextNode(returnFiber,matchedFiber,''+newChild,expirationTime);}if((typeof newChild==='undefined'?'undefined':_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_CALL_TYPE:{var _matchedFiber2=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updateCall(returnFiber,_matchedFiber2,newChild,expirationTime);}case REACT_RETURN_TYPE:{// 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\\tvar _matchedFiber3=existingChildren.get(newIdx)||null;return updateReturn(returnFiber,_matchedFiber3,newChild,expirationTime);}case REACT_PORTAL_TYPE:{var _matchedFiber4=existingChildren.get(newChild.key===null?newIdx:newChild.key)||null;return updatePortal(returnFiber,_matchedFiber4,newChild,expirationTime);}}if(isArray$1(newChild)||getIteratorFn(newChild)){var _matchedFiber5=existingChildren.get(newIdx)||null;return updateFragment(returnFiber,_matchedFiber5,newChild,expirationTime,null);}throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}return null;}/**\\n\\t * Warns if there is a duplicate or missing key\\n\\t */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 reconcileChildrenArray(returnFiber,currentFirstChild,newChildren,expirationTime){// 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// 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// 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// If you change this code, also update reconcileChildrenIterator() which\\n\\t// uses the same algorithm.\\n\\t{// First, validate keys.\\n\\tvar 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\\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\\tif(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\\n\\t// need to delete the existing child.\\n\\tdeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\n\\tresultingFirstChild=newFiber;}else{// 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\\tpreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(newIdx===newChildren.length){// We've reached the end of the new children. We can delete the rest.\\n\\tdeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// 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\\tfor(;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.\\n\\tresultingFirstChild=_newFiber;}else{previousNewFiber.sibling=_newFiber;}previousNewFiber=_newFiber;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\n\\tvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\n\\tfor(;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\\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\\texistingChildren['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\\n\\t// to add them to the deletion list.\\n\\texistingChildren.forEach(function(child){return deleteChild(returnFiber,child);});}return resultingFirstChild;}function reconcileChildrenIterator(returnFiber,currentFirstChild,newChildrenIterable,expirationTime){// This is the same implementation as reconcileChildrenArray(),\\n\\t// but using the iterator instead.\\n\\tvar 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\\n\\tif(typeof newChildrenIterable.entries==='function'){var possibleMap=newChildrenIterable;if(possibleMap.entries===iteratorFn){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());didWarnAboutMaps=true;}}// First, validate keys.\\n\\t// We'll get a different iterator later for the main pass.\\n\\tvar _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\\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\\tif(!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\\n\\t// need to delete the existing child.\\n\\tdeleteChild(returnFiber,oldFiber);}}lastPlacedIndex=placeChild(newFiber,lastPlacedIndex,newIdx);if(previousNewFiber===null){// TODO: Move out of the loop. This only happens for the first run.\\n\\tresultingFirstChild=newFiber;}else{// 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\\tpreviousNewFiber.sibling=newFiber;}previousNewFiber=newFiber;oldFiber=nextOldFiber;}if(step.done){// We've reached the end of the new children. We can delete the rest.\\n\\tdeleteRemainingChildren(returnFiber,oldFiber);return resultingFirstChild;}if(oldFiber===null){// 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\\tfor(;!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.\\n\\tresultingFirstChild=_newFiber3;}else{previousNewFiber.sibling=_newFiber3;}previousNewFiber=_newFiber3;}return resultingFirstChild;}// Add all children to a key map for quick lookups.\\n\\tvar existingChildren=mapRemainingChildren(returnFiber,oldFiber);// Keep scanning and use the map to restore deleted items as moves.\\n\\tfor(;!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\\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\\texistingChildren['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\\n\\t// to add them to the deletion list.\\n\\texistingChildren.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\\n\\t// way to define them.\\n\\tif(currentFirstChild!==null&¤tFirstChild.tag===HostText){// We already have an existing node so let's just update it and delete\\n\\t// the rest.\\n\\tdeleteRemainingChildren(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\\n\\t// and delete the existing ones.\\n\\tdeleteRemainingChildren(returnFiber,currentFirstChild);var created=createFiberFromText(textContent,returnFiber.internalContextTag,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\\n\\t// the first item in the list.\\n\\tif(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(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.internalContextTag,expirationTime,element.key);created['return']=returnFiber;return created;}else{var _created7=createFiberFromElement(element,returnFiber.internalContextTag,expirationTime);_created7.ref=coerceRef(currentFirstChild,element);_created7['return']=returnFiber;return _created7;}}function reconcileSingleCall(returnFiber,currentFirstChild,call,expirationTime){var key=call.key;var child=currentFirstChild;while(child!==null){// TODO: If key === null and child.key === null, then this only applies to\\n\\t// the first item in the list.\\n\\tif(child.key===key){if(child.tag===CallComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,call,expirationTime);existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);break;}}else{deleteChild(returnFiber,child);}child=child.sibling;}var created=createFiberFromCall(call,returnFiber.internalContextTag,expirationTime);created['return']=returnFiber;return created;}function reconcileSingleReturn(returnFiber,currentFirstChild,returnNode,expirationTime){// There's no need to check for keys on yields since they're stateless.\\n\\tvar child=currentFirstChild;if(child!==null){if(child.tag===ReturnComponent){deleteRemainingChildren(returnFiber,child.sibling);var existing=useFiber(child,null,expirationTime);existing.type=returnNode.value;existing['return']=returnFiber;return existing;}else{deleteRemainingChildren(returnFiber,child);}}var created=createFiberFromReturn(returnNode,returnFiber.internalContextTag,expirationTime);created.type=returnNode.value;created['return']=returnFiber;return created;}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\\n\\t// the first item in the list.\\n\\tif(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.internalContextTag,expirationTime);created['return']=returnFiber;return created;}// 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\\tfunction 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);}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 }\",\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\\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.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 } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to 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\\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 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 }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to 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 // 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 } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to 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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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\\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\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== 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\\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\\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 !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\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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 {\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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\\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\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== 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\\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\\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 !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\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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 {\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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\\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\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== 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\\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\\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 !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\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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 {\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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\\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\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== 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\\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\\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 (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\\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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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\\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\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== 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\\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\\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 !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\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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 {\\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, 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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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\\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\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== 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\\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\\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 (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\\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 {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\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 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.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.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.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$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 = 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 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.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$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$$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 = 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]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6270052","0.6207396","0.61424965","0.61410725","0.61407506","0.61407506","0.61407506","0.6133052","0.6133052","0.6133052","0.6133052","0.61278206","0.61278206","0.61144173","0.6083676","0.60557383","0.60557383","0.60557383","0.60557383","0.60513395","0.60397846","0.60385156","0.60385156","0.60385156","0.60385156","0.60385156","0.60385156","0.602916","0.602916","0.602916","0.60196525","0.6003365","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.59950495","0.5988887","0.5988887","0.5988887","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59839875","0.59263915","0.59263915","0.59263915","0.59263915","0.59263915","0.59263915","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987","0.59193987"],"string":"[\n \"0.6270052\",\n \"0.6207396\",\n \"0.61424965\",\n \"0.61410725\",\n \"0.61407506\",\n \"0.61407506\",\n \"0.61407506\",\n \"0.6133052\",\n \"0.6133052\",\n \"0.6133052\",\n \"0.6133052\",\n \"0.61278206\",\n \"0.61278206\",\n \"0.61144173\",\n \"0.6083676\",\n \"0.60557383\",\n \"0.60557383\",\n \"0.60557383\",\n \"0.60557383\",\n \"0.60513395\",\n \"0.60397846\",\n \"0.60385156\",\n \"0.60385156\",\n \"0.60385156\",\n \"0.60385156\",\n \"0.60385156\",\n \"0.60385156\",\n \"0.602916\",\n \"0.602916\",\n \"0.602916\",\n \"0.60196525\",\n \"0.6003365\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.59950495\",\n \"0.5988887\",\n \"0.5988887\",\n \"0.5988887\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59839875\",\n \"0.59263915\",\n \"0.59263915\",\n \"0.59263915\",\n \"0.59263915\",\n \"0.59263915\",\n \"0.59263915\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\",\n \"0.59193987\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80680,"cells":{"query":{"kind":"string","value":"By default, return `true` to log errors to the console. Forks can return `false` if this isn't desirable."},"document":{"kind":"string","value":"function showErrorDialog(capturedError){return true;}"},"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 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}","isErr() {\n return true;\n }","isErr() {\n return false;\n }","function logError(err) { if(console && console.log) console.log('Error!', err); return false; }","error(error) {\n return true;\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 }","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}","function handleError(message) {\n console.error(message);\n return false;\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 onError(err){\n if (err) {\n console.log(err, err.stack);\n return true;\n }\n }","function isSuccess(self) {\n return Ex.fold_(self.exit, _ => false, _ => true);\n}","function fuseRun() {\n return new Promise((resolve, reject) => {\n let _error = console.error;\n let errors = false;\n\n console.error = function() {\n errors = true;\n _error(...arguments);\n setTimeout(() => {\n reject(new Error('Build errors occurred'));\n }, 2000);\n };\n\n return fuse.run().then(() => {\n console.error = _error;\n if (errors) return reject(new Error('Build errors occurred'));\n resolve(true);\n });\n });\n }","function test() {\n\treturn console.log(true);\n\treturn console.log(false);\n}","function saneSpawnWithOutput(cmd, args, opts) {\n cmd = path.normalize(cmd);\n opts = opts || {};\n opts.shell = true;\n // it's OK, I know what I'm doing\n const result = _DO_NOT_USE_spawn(cmd, args, opts);\n if (!spawnWasSuccessful(result)) {\n return false;\n }\n return {status: result.status == 0, stdout: result.stdout.toString()};\n}","function f() {\n console.log(\"Hello!\");\n return true;\n}","static get LOG_ERRORS() {\n return false;\n }","get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }","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}","_sendErrors() {\n if (this.errors.length) {\n process.stderr.write(this.errors.join('\\n'));\n process.exit(1);\n }\n }","_isInteractive()\n\t\t{\n\t\t\treturn process.stdout.isTTY && !process.env.CI;\n\t\t}","function run(cb) {\n syncTries++;\n\n console.log('\\n Try: ' + syncTries);\n console.log('-------------');\n\n let kid = child_process.spawn(argv._[0], argv._.slice(1), {\n encoding: 'utf8'\n });\n\n kid.stdout.pipe(process.stdout);\n kid.stderr.pipe(process.stdout);\n\n kid.on('close', function(code) {\n return cb(code);\n });\n}","function say() {\n console.log(\"ok\");\n return false;\n}","function endIfErr (err) {\n if (err) {\n console.error(err);\n process.exit(1);\n }\n}","function endIfErr (err) {\n if (err) {\n console.error(err)\n process.exit(1)\n }\n}","function error(msg) {\n console.error(msg);\n process.exit(1);\n}","function forkWithErrorHandler_(self, handler, __trace) {\n return (0, _core.fork)((0, _onExit.onError_)(self, x => (0, _index2.fold)(handler, _core.halt)((0, _index.failureOrCause)(x))), __trace);\n}","function puts(error, stdout, stderr) {\r\n if(stdout){\r\n console.log(stdout);\r\n }\r\n if(stderr){\r\n console.log(stderr);\r\n }\r\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 cleanError (msg) {\n console.error('Error: ' + msg)\n return process.exit(1)\n}","function execcallback(error, stdout, stderr) {\n // if (stilltesting) {\n console.log('stdout: ' + stdout);\n console.log('stderr: ' + stderr);\n if (error !== null) {\n console.log('exec error: ' + error);\n }\n // }\n}","_end(done){\r\n this.fork.stdout.on('data', data => {\r\n this.stdio.stdout.splitPush(data)\r\n })\r\n\r\n this.fork.stderr.on('data', data => {\r\n this.stdio.stderr.splitPush(data)\r\n })\r\n\r\n this.fork.on('exit', (signal, code) => { \r\n done(null, JSON.stringify({\r\n source: this.source.pathname,\r\n args: this.args,\r\n stdio: this.stdio,\r\n signal,\r\n code\r\n }, null, 2))\r\n })\r\n }","function showVersionAndExit(): never {\n process.stdout.write(`${BUILD_INFO.VERSION_STRING}\\n`);\n log.debug(\"BUILD_INFO_COMMIT: %s\", BUILD_INFO.COMMIT);\n log.debug(\"BUILD_INFO_TIME_RFC3339: %s\", BUILD_INFO.BUILD_TIME_RFC3339);\n log.debug(\"BUILD_INFO_HOSTNAME: %s\", BUILD_INFO.BUILD_HOSTNAME);\n log.debug(\"BUILD_INFO_BRANCH_NAME: %s\", BUILD_INFO.BRANCH_NAME);\n\n // Cleanly shut down logging system.\n throw new ExitSuccess();\n}","function outputConsole(err, data) {\n if (err) console.log('Unexpected problem : ', err);\n else console.log('Everything was fine ');\n}","function processError(err) {\n if (err) {\n console.error(err);\n }\n process.exit(1);\n}","function check() {\n console.log('checkcheck');\n return true;\n}","function logErrorAndExit(e) {\n console.error(e);\n process.exit(1);\n}","function error() {\n // Hint\n // throw new Error(\"Can't nest deeper than \" + Nest.options.maxDepth);\n return false;\n }","isRunning() {\n return this._process !== null;\n }","function debuglog(){\n if(false)\n console.log.apply(this,arguments)\n}","function isPrime(value) {\n for(var i = 2; i < value; i++) {\n if(value % i === 0) {\n console.log(false);\n return false;\n }\n }\n console.log(true);\n return true;\n}","function useColors() {\n return 'colors' in exports.inspectOpts ?\n Boolean(exports.inspectOpts.colors) :\n tty.isatty(process.stderr.fd);\n}","function checkIfShouldExit(choice) {\n if (choice.toLowerCase() === \"q\") {\n // Log a message and exit the current node process\n console.table(\"\\n====================================================\\n\")\n console.log(\"Goodbye! Hope to see you again!\");\n console.table(\"\\n====================================================\\n\")\n process.exit(0);\n }\n}","function checkIfShouldExit(choice) {\n\tif (choice.toLowerCase() === \"q\") {\n\t // Log a message and exit the current node process\n\t console.log(\"Goodbye!\");\n\t process.exit(0);\n\t}\n }","function main(){\n return false;\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 h$run(a) {\n ;\n var t = h$fork(a, false);\n h$startMainLoop();\n return t;\n}","function errorHandler(error) {\n gulpUtil.beep();\n return true;\n}","run() {\n\t\tthrow new Error;\n\t}","function check(err) {\n\tif (!err) { return }\n\tconsole.log(\"ERROR\", err)\n\tthrow err\n}","function returnConsole() {\n console.log('A message here');\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 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}","async function parent() {\n logger();\n console.log(\"parent called\");\n}","hasExited() {\n return this.has_exited;\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 errorExit( err ) {\n\tconsole.log( err.message );\n\tprocess.exit( 1 );\n}","function debug(...args) {\n if (false) {\n console.log(...args);\n }\n }","function myErrorFunc(error) {\n if (error) {\n return console.log(error);\n } else {\n console.log(\"Success\");\n }\n}","function useColors() {\n\t return 'colors' in exports.inspectOpts\n\t ? Boolean(exports.inspectOpts.colors)\n\t : tty.isatty(process.stderr.fd);\n\t}","async function run(funsAndArgs) {\n console.log('😌');\n let result = false;\n try {\n for (const [fun, args] of funsAndArgs) {\n console.log(`🙋 ${fun.name} ${args.join(' ')}`);\n if (!await fun(args)) {\n console.log(`🙅 ${fun.name}`);\n return;\n }\n console.log(`🙆 ${fun.name}`);\n }\n result = true;\n } catch (e) {\n console.error(e);\n } finally {\n console.log(result ? `🎉 ${rot13('Nqinapr Nhfgenyvn!')} 🇳🇿` : '😱');\n }\n return result;\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","async function getResyncFailed() {\n const options = {};\n\n const logs = await bashService.exec('docker', ['logs', 'download'], options);\n\n if (logs.out.includes('failed') || logs.out.includes('Failed')) {\n return true;\n } else {\n return false;\n }\n}","function reportErrors (err) {\n console.error(err.stack)\n process.exit(1)\n}","function printTailoringStatusAndExit() {\n\tlet msg;\n\tif (persistedTailoringState === cStateNotTailored) {\n\t\tmsg = \"The npm module has not been tailored for a specific runtime environment.\";\n\t} else {\n\t\tmsg = `The npm module has been tailored for runtime environment: ${persistedTailoringState}`;\n\t}\n\tconsole.log(`TAILORING STATE: ${msg}`);\n\tprocess.exit(0);\n}"],"string":"[\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 \"isErr() {\\n return true;\\n }\",\n \"isErr() {\\n return false;\\n }\",\n \"function logError(err) { if(console && console.log) console.log('Error!', err); return false; }\",\n \"error(error) {\\n return true;\\n }\",\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 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 \"function handleError(message) {\\n console.error(message);\\n return false;\\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 onError(err){\\n if (err) {\\n console.log(err, err.stack);\\n return true;\\n }\\n }\",\n \"function isSuccess(self) {\\n return Ex.fold_(self.exit, _ => false, _ => true);\\n}\",\n \"function fuseRun() {\\n return new Promise((resolve, reject) => {\\n let _error = console.error;\\n let errors = false;\\n\\n console.error = function() {\\n errors = true;\\n _error(...arguments);\\n setTimeout(() => {\\n reject(new Error('Build errors occurred'));\\n }, 2000);\\n };\\n\\n return fuse.run().then(() => {\\n console.error = _error;\\n if (errors) return reject(new Error('Build errors occurred'));\\n resolve(true);\\n });\\n });\\n }\",\n \"function test() {\\n\\treturn console.log(true);\\n\\treturn console.log(false);\\n}\",\n \"function saneSpawnWithOutput(cmd, args, opts) {\\n cmd = path.normalize(cmd);\\n opts = opts || {};\\n opts.shell = true;\\n // it's OK, I know what I'm doing\\n const result = _DO_NOT_USE_spawn(cmd, args, opts);\\n if (!spawnWasSuccessful(result)) {\\n return false;\\n }\\n return {status: result.status == 0, stdout: result.stdout.toString()};\\n}\",\n \"function f() {\\n console.log(\\\"Hello!\\\");\\n return true;\\n}\",\n \"static get LOG_ERRORS() {\\n return false;\\n }\",\n \"get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\",\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 \"_sendErrors() {\\n if (this.errors.length) {\\n process.stderr.write(this.errors.join('\\\\n'));\\n process.exit(1);\\n }\\n }\",\n \"_isInteractive()\\n\\t\\t{\\n\\t\\t\\treturn process.stdout.isTTY && !process.env.CI;\\n\\t\\t}\",\n \"function run(cb) {\\n syncTries++;\\n\\n console.log('\\\\n Try: ' + syncTries);\\n console.log('-------------');\\n\\n let kid = child_process.spawn(argv._[0], argv._.slice(1), {\\n encoding: 'utf8'\\n });\\n\\n kid.stdout.pipe(process.stdout);\\n kid.stderr.pipe(process.stdout);\\n\\n kid.on('close', function(code) {\\n return cb(code);\\n });\\n}\",\n \"function say() {\\n console.log(\\\"ok\\\");\\n return false;\\n}\",\n \"function endIfErr (err) {\\n if (err) {\\n console.error(err);\\n process.exit(1);\\n }\\n}\",\n \"function endIfErr (err) {\\n if (err) {\\n console.error(err)\\n process.exit(1)\\n }\\n}\",\n \"function error(msg) {\\n console.error(msg);\\n process.exit(1);\\n}\",\n \"function forkWithErrorHandler_(self, handler, __trace) {\\n return (0, _core.fork)((0, _onExit.onError_)(self, x => (0, _index2.fold)(handler, _core.halt)((0, _index.failureOrCause)(x))), __trace);\\n}\",\n \"function puts(error, stdout, stderr) {\\r\\n if(stdout){\\r\\n console.log(stdout);\\r\\n }\\r\\n if(stderr){\\r\\n console.log(stderr);\\r\\n }\\r\\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 cleanError (msg) {\\n console.error('Error: ' + msg)\\n return process.exit(1)\\n}\",\n \"function execcallback(error, stdout, stderr) {\\n // if (stilltesting) {\\n console.log('stdout: ' + stdout);\\n console.log('stderr: ' + stderr);\\n if (error !== null) {\\n console.log('exec error: ' + error);\\n }\\n // }\\n}\",\n \"_end(done){\\r\\n this.fork.stdout.on('data', data => {\\r\\n this.stdio.stdout.splitPush(data)\\r\\n })\\r\\n\\r\\n this.fork.stderr.on('data', data => {\\r\\n this.stdio.stderr.splitPush(data)\\r\\n })\\r\\n\\r\\n this.fork.on('exit', (signal, code) => { \\r\\n done(null, JSON.stringify({\\r\\n source: this.source.pathname,\\r\\n args: this.args,\\r\\n stdio: this.stdio,\\r\\n signal,\\r\\n code\\r\\n }, null, 2))\\r\\n })\\r\\n }\",\n \"function showVersionAndExit(): never {\\n process.stdout.write(`${BUILD_INFO.VERSION_STRING}\\\\n`);\\n log.debug(\\\"BUILD_INFO_COMMIT: %s\\\", BUILD_INFO.COMMIT);\\n log.debug(\\\"BUILD_INFO_TIME_RFC3339: %s\\\", BUILD_INFO.BUILD_TIME_RFC3339);\\n log.debug(\\\"BUILD_INFO_HOSTNAME: %s\\\", BUILD_INFO.BUILD_HOSTNAME);\\n log.debug(\\\"BUILD_INFO_BRANCH_NAME: %s\\\", BUILD_INFO.BRANCH_NAME);\\n\\n // Cleanly shut down logging system.\\n throw new ExitSuccess();\\n}\",\n \"function outputConsole(err, data) {\\n if (err) console.log('Unexpected problem : ', err);\\n else console.log('Everything was fine ');\\n}\",\n \"function processError(err) {\\n if (err) {\\n console.error(err);\\n }\\n process.exit(1);\\n}\",\n \"function check() {\\n console.log('checkcheck');\\n return true;\\n}\",\n \"function logErrorAndExit(e) {\\n console.error(e);\\n process.exit(1);\\n}\",\n \"function error() {\\n // Hint\\n // throw new Error(\\\"Can't nest deeper than \\\" + Nest.options.maxDepth);\\n return false;\\n }\",\n \"isRunning() {\\n return this._process !== null;\\n }\",\n \"function debuglog(){\\n if(false)\\n console.log.apply(this,arguments)\\n}\",\n \"function isPrime(value) {\\n for(var i = 2; i < value; i++) {\\n if(value % i === 0) {\\n console.log(false);\\n return false;\\n }\\n }\\n console.log(true);\\n return true;\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ?\\n Boolean(exports.inspectOpts.colors) :\\n tty.isatty(process.stderr.fd);\\n}\",\n \"function checkIfShouldExit(choice) {\\n if (choice.toLowerCase() === \\\"q\\\") {\\n // Log a message and exit the current node process\\n console.table(\\\"\\\\n====================================================\\\\n\\\")\\n console.log(\\\"Goodbye! Hope to see you again!\\\");\\n console.table(\\\"\\\\n====================================================\\\\n\\\")\\n process.exit(0);\\n }\\n}\",\n \"function checkIfShouldExit(choice) {\\n\\tif (choice.toLowerCase() === \\\"q\\\") {\\n\\t // Log a message and exit the current node process\\n\\t console.log(\\\"Goodbye!\\\");\\n\\t process.exit(0);\\n\\t}\\n }\",\n \"function main(){\\n return false;\\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 h$run(a) {\\n ;\\n var t = h$fork(a, false);\\n h$startMainLoop();\\n return t;\\n}\",\n \"function errorHandler(error) {\\n gulpUtil.beep();\\n return true;\\n}\",\n \"run() {\\n\\t\\tthrow new Error;\\n\\t}\",\n \"function check(err) {\\n\\tif (!err) { return }\\n\\tconsole.log(\\\"ERROR\\\", err)\\n\\tthrow err\\n}\",\n \"function returnConsole() {\\n console.log('A message here');\\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 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 \"async function parent() {\\n logger();\\n console.log(\\\"parent called\\\");\\n}\",\n \"hasExited() {\\n return this.has_exited;\\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 errorExit( err ) {\\n\\tconsole.log( err.message );\\n\\tprocess.exit( 1 );\\n}\",\n \"function debug(...args) {\\n if (false) {\\n console.log(...args);\\n }\\n }\",\n \"function myErrorFunc(error) {\\n if (error) {\\n return console.log(error);\\n } else {\\n console.log(\\\"Success\\\");\\n }\\n}\",\n \"function useColors() {\\n\\t return 'colors' in exports.inspectOpts\\n\\t ? Boolean(exports.inspectOpts.colors)\\n\\t : tty.isatty(process.stderr.fd);\\n\\t}\",\n \"async function run(funsAndArgs) {\\n console.log('😌');\\n let result = false;\\n try {\\n for (const [fun, args] of funsAndArgs) {\\n console.log(`🙋 ${fun.name} ${args.join(' ')}`);\\n if (!await fun(args)) {\\n console.log(`🙅 ${fun.name}`);\\n return;\\n }\\n console.log(`🙆 ${fun.name}`);\\n }\\n result = true;\\n } catch (e) {\\n console.error(e);\\n } finally {\\n console.log(result ? `🎉 ${rot13('Nqinapr Nhfgenyvn!')} 🇳🇿` : '😱');\\n }\\n return result;\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"async function getResyncFailed() {\\n const options = {};\\n\\n const logs = await bashService.exec('docker', ['logs', 'download'], options);\\n\\n if (logs.out.includes('failed') || logs.out.includes('Failed')) {\\n return true;\\n } else {\\n return false;\\n }\\n}\",\n \"function reportErrors (err) {\\n console.error(err.stack)\\n process.exit(1)\\n}\",\n \"function printTailoringStatusAndExit() {\\n\\tlet msg;\\n\\tif (persistedTailoringState === cStateNotTailored) {\\n\\t\\tmsg = \\\"The npm module has not been tailored for a specific runtime environment.\\\";\\n\\t} else {\\n\\t\\tmsg = `The npm module has been tailored for runtime environment: ${persistedTailoringState}`;\\n\\t}\\n\\tconsole.log(`TAILORING STATE: ${msg}`);\\n\\tprocess.exit(0);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5841752","0.5626627","0.54532874","0.5435985","0.5388693","0.52739596","0.52606153","0.521972","0.52030414","0.52020115","0.5161493","0.51220864","0.50915825","0.50780183","0.5064728","0.5037048","0.5015287","0.50104046","0.4995979","0.4994261","0.4985101","0.4956564","0.49529803","0.48889494","0.4886779","0.48558494","0.4849502","0.4848925","0.48379895","0.48252907","0.4815132","0.47990215","0.47936946","0.4793615","0.47919935","0.47830865","0.47826135","0.4778413","0.47647476","0.47586888","0.47537208","0.47518507","0.4741382","0.47359425","0.4734212","0.4731729","0.47288105","0.4721782","0.47201934","0.47079897","0.4696539","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.46933648","0.4691705","0.46895033","0.4688851","0.4688851","0.4688851","0.4688851","0.4688851","0.4688851","0.4688851","0.4688851","0.4688851","0.4687028","0.46772787","0.46752024","0.46723548","0.46678895","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.4665237","0.46645695","0.46563673","0.4646246"],"string":"[\n \"0.5841752\",\n \"0.5626627\",\n \"0.54532874\",\n \"0.5435985\",\n \"0.5388693\",\n \"0.52739596\",\n \"0.52606153\",\n \"0.521972\",\n \"0.52030414\",\n \"0.52020115\",\n \"0.5161493\",\n \"0.51220864\",\n \"0.50915825\",\n \"0.50780183\",\n \"0.5064728\",\n \"0.5037048\",\n \"0.5015287\",\n \"0.50104046\",\n \"0.4995979\",\n \"0.4994261\",\n \"0.4985101\",\n \"0.4956564\",\n \"0.49529803\",\n \"0.48889494\",\n \"0.4886779\",\n \"0.48558494\",\n \"0.4849502\",\n \"0.4848925\",\n \"0.48379895\",\n \"0.48252907\",\n \"0.4815132\",\n \"0.47990215\",\n \"0.47936946\",\n \"0.4793615\",\n \"0.47919935\",\n \"0.47830865\",\n \"0.47826135\",\n \"0.4778413\",\n \"0.47647476\",\n \"0.47586888\",\n \"0.47537208\",\n \"0.47518507\",\n \"0.4741382\",\n \"0.47359425\",\n \"0.4734212\",\n \"0.4731729\",\n \"0.47288105\",\n \"0.4721782\",\n \"0.47201934\",\n \"0.47079897\",\n \"0.4696539\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.46933648\",\n \"0.4691705\",\n \"0.46895033\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4688851\",\n \"0.4687028\",\n \"0.46772787\",\n \"0.46752024\",\n \"0.46723548\",\n \"0.46678895\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.4665237\",\n \"0.46645695\",\n \"0.46563673\",\n \"0.4646246\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80681,"cells":{"query":{"kind":"string","value":"Capture errors so they don't interrupt unmounting."},"document":{"kind":"string","value":"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}"},"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,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 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, 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 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,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 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, 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 safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6382642","0.5924542","0.58511907","0.58511907","0.58511907","0.58496785","0.5823018","0.5823018","0.5823018","0.5767682","0.5741241","0.5741241","0.5741241","0.5741241","0.5741241","0.56881076","0.56881076","0.56589913","0.56378233","0.56378233","0.56378233","0.56378233","0.56378233","0.56378233","0.56098413","0.559434","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5593422","0.5591753","0.55684173","0.55684173","0.5557047","0.55557096","0.55557096","0.55557096","0.55557096","0.5551171","0.5548788","0.5548363","0.5548363","0.5548363","0.5548363","0.5548363","0.5548363","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509","0.553509"],"string":"[\n \"0.6382642\",\n \"0.5924542\",\n \"0.58511907\",\n \"0.58511907\",\n \"0.58511907\",\n \"0.58496785\",\n \"0.5823018\",\n \"0.5823018\",\n \"0.5823018\",\n \"0.5767682\",\n \"0.5741241\",\n \"0.5741241\",\n \"0.5741241\",\n \"0.5741241\",\n \"0.5741241\",\n \"0.56881076\",\n \"0.56881076\",\n \"0.56589913\",\n \"0.56378233\",\n \"0.56378233\",\n \"0.56378233\",\n \"0.56378233\",\n \"0.56378233\",\n \"0.56378233\",\n \"0.56098413\",\n \"0.559434\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5593422\",\n \"0.5591753\",\n \"0.55684173\",\n \"0.55684173\",\n \"0.5557047\",\n \"0.55557096\",\n \"0.55557096\",\n \"0.55557096\",\n \"0.55557096\",\n \"0.5551171\",\n \"0.5548788\",\n \"0.5548363\",\n \"0.5548363\",\n \"0.5548363\",\n \"0.5548363\",\n \"0.5548363\",\n \"0.5548363\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\",\n \"0.553509\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.57305086"},"document_rank":{"kind":"string","value":"16"}}},{"rowIdx":80682,"cells":{"query":{"kind":"string","value":"deletion, so don't let them throw. Hostoriginating errors should interrupt deletion, so it's okay"},"document":{"kind":"string","value":"function commitUnmount(current$$1){onCommitUnmount(current$$1);switch(current$$1.tag){case FunctionComponent:case ForwardRef:case MemoComponent:case SimpleMemoComponent:{var updateQueue=current$$1.updateQueue;if(updateQueue!==null){var lastEffect=updateQueue.lastEffect;if(lastEffect!==null){var firstEffect=lastEffect.next;var effect=firstEffect;do{var destroy=effect.destroy;if(destroy!==undefined){safelyCallDestroy(current$$1,destroy);}effect=effect.next;}while(effect!==firstEffect);}}break;}case ClassComponent:{safelyDetachRef(current$$1);var instance=current$$1.stateNode;if(typeof instance.componentWillUnmount==='function'){safelyCallComponentWillUnmount(current$$1,instance);}return;}case HostComponent:{safelyDetachRef(current$$1);return;}case HostPortal:{// TODO: this is recursive.\n// We are also not using this parent because\n// the portal will get pushed immediately.\nif(supportsMutation){unmountHostComponents(current$$1);}else if(supportsPersistence){emptyPortalContainer(current$$1);}return;}}}"},"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 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}","remove () {\n // cleanup\n }","delete() {}","detach() {\n throw new Error('Not Implemented');\n }","detach() {\n throw new Error('Not Implemented');\n }","cleanup() {}","cleanup() {}","function _handleRemove() {\n Promise.all(deletePromises).catch(error => console.log(error));\n next(err);\n }","removed() {}","removed() {}","disconnectedCallback() {\r\n\t\t\tconsole.log(\"deleted\");\r\n\t\t}","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 }","cleanUpDeadCreeps () {\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 linkCleanup() {\n\t\tvar links = new DBRow(lit.tables.LINK);\n\t\tlinks.query().then(function() {\n\t\t\tvar href = \"\";\n\n\t\t\twhile(links.next()){\n\t\t\t\thref = links.getValue(lit.LINK);\n\t\t\t\tvar isValid = true;//test link using something\n\t\t\t\tif (isValid)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tlinks.delete().then(function() { //if it's not valid delete the current link\n\n\t\t\t\t\t}, function() {\n\t\t\t\t\t\tlog.warn(\"The link \" + href + \" was unable to be deleted but is invalid, consider manually deleting the link.\")\n\t\t\t\t\t})\n\t\t\t}\n\n\t\t}, function(err) {\n\n\t\t});\n\t}","function exit(code) { \n debug(\"caught exit\");\n console.log(\"Trying to remove hosts from manage-hosts\");\n self.remove(hostMap, function() {\n process.exit(); \n });\n }","cleanup() {\n\n\t}","function stoogeDeleted(model, error) {\n if (typeof error != 'undefined') {\n callback(error);\n return;\n }\n // model parameter is what was deleted\n self.shouldBeTrue(undefined === model.get('id')); // ID removed\n self.shouldBeTrue(model.get('name') == 'Curly'); // the rest remains\n // Is it really dead?\n var curly = new self.Stooge();\n curly.set('id', self.deletedModelId);\n spec.integrationStore.getModel(curly, hesDeadJim);\n }","die() {\n let entry;\n while (entry = this._queue.pop()) {\n entry.reject();\n }\n this._queue = null;\n }","delete() {\n this.items().then(instances => {\n instances.forEach(instance => {\n instance.delete();\n })\n }).catch(error => {\n debugger;\n throw error;\n })\n }","delete() {\n\n }","detach() {\n throw new Error('incompatible reuse strategy');\n }","function cleanup(){\n\t\t\tdelete pending[ serial]\n\t\t}","function somethingBad() {\n nock.cleanAll()\n }","function _remove() {\n return;\n }","async function cleanOrigin( origin ) {\n const fdb = await origin.fdb;\n // Iterate over deleted records, build lists of items to delete by category.\n const deleted = {};\n await fdb.forEach('status','deleted', record => {\n // Read values from the record.\n const { path, category } = record;\n // Construct a request URL.\n const url = origin.url+path;\n // Construct an deletion item.\n const item = { path, url };\n // Record the fileset category.\n const list = deleted[category];\n if( list ) {\n list.push( item );\n }\n else {\n deleted[category] = [ item ];\n }\n });\n // Iterate over each fileset category and remove deleted files from its cache.\n for( const category in deleted ) {\n // Get the fileset cache name..\n const { cacheName } = getFileset( origin, category );\n // Open the cache.\n const cache = await caches.open( cacheName );\n // Get the list of deleted items.\n const items = deleted[category];\n log('debug','%s Deleting %d files from fileset %s...', IconDelete, items.length, category );\n // Iterate over the deleted items.\n for( const { path, url } of items ) {\n const request = new Request( url );\n // Delete from the cache.\n cache.delete( request );\n // Delete the object store record.\n await fdb.remove( path );\n }\n }\n // Prune commit records - delete any commit record with no active file records.\n await fdb.forEach('category', '$commit', async ( record ) => {\n const { path, info: { commit } } = record;\n const count = await fdb.indexCount('commit', commit );\n log('debug','commit %s count %d', commit, count );\n if( count == 0 ) {\n log('debug','%s Deleting commit record for %s...', IconDelete, commit );\n await fdb.remove( path );\n }\n });\n}","delete() {\n if (!this.msg) throw new Error(\"Tried to delete embed pages but they havn't even been created yet.\");\n this.msg.delete().catch(() => null);\n }","destroy() { /* There are no resources to clean up on MySQL server */ }","delete(element) {\n return Promise.reject('not implement');\n }","deleteRecord() {\n this._super(...arguments);\n const gist = this.gist;\n if(gist) {\n gist.registerDeletedFile(this.id);\n\n // Following try/catch should not be necessary. Bug in ember data?\n try {\n gist.get('files').removeObject(this);\n } catch(e) {\n /* squash */\n }\n }\n }","delete() {\r\n return super.deleteCore();\r\n }","delete() {\r\n return super.deleteCore();\r\n }","delete() {\r\n return super.deleteCore();\r\n }","async onDeleted() {\n this.log('device deleted', this.getName(), this.settings.serialNumber);\n this.client && this.client.end();\n this.timeout && clearTimeout(this.timeout);\n this.shouldSync = false;\n this.setUnavailable();\n }","function destroyed() {\n throw new Error('Call made to destroyed method');\n}","_destroy() {}","function deleteMovieError() {\n console.log('Unble to delete movie...');\n}","async function cleanup() {\n const packageResponse = await client.getPackage(packagePayload.Name, { resolveWithFullResponse: true });\n const propertySetTypeResponse = await client.getPropertySetType(\n propertySetTypePayload.Name,\n null,\n { resolveWithFullResponse: true },\n );\n const thingTypeResponse = await client.getThingType(thingTypePayload.Name, null, { resolveWithFullResponse: true });\n\n const things = await client.getThingsByThingType(thingTypePayload.Name);\n things.value.forEach(async (thing) => {\n await client.deleteThing(thing._id);\n console.log(`Thing deleted: ${thing._id}`);\n });\n\n await client.deleteThingType(thingTypePayload.Name, thingTypeResponse.headers.etag);\n console.log(`Thing type deleted: ${thingTypePayload.Name}`);\n await client.deletePropertySetType(propertySetTypePayload.Name, propertySetTypeResponse.headers.etag);\n console.log(`Property set type deleted: ${propertySetTypePayload.Name}`);\n await client.deletePackage(packagePayload.Name, packageResponse.headers.etag);\n console.log(`Package deleted: ${packagePayload.Name}`);\n}","function socketError() {\n this.destroy();\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 }","softDrop() {\r\n if (this.actual.softDrop()) {\r\n this.crashed();\r\n }\r\n }","function socketError () {\n this.destroy();\n}","function socketError () {\n this.destroy();\n}","function erasereinforce(){\n\tdelete Reinforce;\n}","async handleDeletions(keysToDelete) {\n if (this.parent) {\n await this.ensureIndexLoaded()\n }\n let condemned = this.index.getNodesByType(keysToDelete)\n if (Object.keys(condemned.local).length) {\n await this.dynamoClient.deleteAttributes({\n tableName: this.tableName,\n key: this.key,\n attributes: Object.keys(condemned.local)\n }).catch((err) => {u.error('failure in DBObject.handleDeletions', err)})\n }\n \n // Lateral\n let idsToDelete = []\n Object.keys(condemned.lateral).forEach((path) => {\n let node = condemned.lateral[path]\n idsToDelete = idsToDelete.concat(node.getLateralPointers())\n })\n await this._deleteLateral(idsToDelete)\n \n // Elsewhere\n let childNodesWithShitToDelete = {}\n Object.keys(condemned.elsewhere).forEach((path) => {\n let node = condemned.elsewhere[path]\n let pointer = node.getVerticalPointer()\n childNodesWithShitToDelete[pointer] = childNodesWithShitToDelete[pointer] || [] \n childNodesWithShitToDelete[pointer].push(path)\n })\n let pointers = Object.keys(childNodesWithShitToDelete)\n for (let i = 0; i < pointers.length; i++) {\n let pointer = pointers[i]\n let paths = childNodesWithShitToDelete[pointer]\n await this.cachedDirectChildren[pointer].handleDeletions(paths)\n }\n\n // If this is subordinate and we've deleted the last entry, delete the entire node\n if (this.parent) {\n keysToDelete.forEach((path) => {\n delete this.index.i[path]\n })\n this.index.updateMetaNodes()\n let allKeysInIndex = this.index.getChildren()\n if (!allKeysInIndex.length) {await this.destroy()}\n }\n\n // TODO: COLLECTION, FILE, REF\n }","handleFailure (error_)\n\t{\n\t\t// todo: Undo all actions\n\t\tthis.cleanup ();\n\t\tthrow error_;\n\t}","Remove() {}","function cleanupInvalid() {\n //Check for invalid Droplets\n for(var i=droplets.length-1;i >= 0;i--) {\n if(!droplets[i].valid) {\n droplets.splice(i,1);\n }\n }\n\n //Check for invalid Flowers\n for(var i=flowers.length-1;i >= 0;i--) {\n if(!flowers[i].valid) {\n flowers.splice(i,1);\n }\n } \n}","static cleanup() {\n return connect(DB_NAME).then(db => {\n const transaction = db.transaction([STORE_NAME], 'readwrite');\n const store = transaction.objectStore(STORE_NAME);\n const request = store.index('expires').openCursor(IDBKeyRange.upperBound(Date.now()));\n return new Promise((resolve, reject) => {\n request.onsuccess = event => {\n const cursor = event.target.result;\n\n if (cursor) {\n cursor.delete(); // Ignoring return value … it's not terrible if this goes wrong.\n\n cursor.continue();\n } else {\n resolve(db);\n }\n };\n\n request.onerror = reject;\n });\n }).then(db => {\n db.close();\n });\n }","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","destroy() {}","function socketError () {\n\t this.destroy();\n\t}","function socketError () {\n\t this.destroy();\n\t}","function socketOnError() {\n this.destroy();\n}","function socketOnError() {\n this.destroy();\n}","function socketOnError() {\n this.destroy();\n}","internalCleanup() {\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 }","detach() {}","delete() {\n this.afterDelete();\n Fiber.yield(true)\n }","static async _delete() {\n\t\tconst serviceName = Config.str(\"serviceName\");\n\n\t\tconsole.log(\"DELETE 1) Find Target Group Arn\");\n\n\t\tconst targetGroup = await ELBManager.describeTargetGroup(serviceName);\n\t\tconst targetGroupArn = targetGroup.TargetGroupArn;\n\t\tif (!targetGroupArn) {\n\t\t\tthrow new Error(\"Could not find target group associated with service: \" + serviceName);\n\t\t}\n\n\t\tconsole.log(\"DELETE 2) Find ELB Rule for Target Group\");\n\n\t\t// List the rules for our core listener\n\t\t// Find the one that refers to our target group from the previous step\n\t\tconst rules = await ELBManager.describeRules(Config.str(\"listenerArn\"));\n\t\tlet ruleArn;\n\t\tfor (const rule of rules) {\n\t\t\tfor (const action of rule.Actions) {\n\t\t\t\tif (action.TargetGroupArn === targetGroupArn) {\n\t\t\t\t\truleArn = rule.RuleArn;\n\t\t\t\t\tconsole.log(\"FOUND RULE: \" + ruleArn);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (ruleArn) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// If we found the rule delete - this should always happen, but we do as an if statement for safety\n\t\tif (ruleArn) {\n\t\t\tconsole.log(\"DELETE 3) Delete Rule\");\n\t\t\tawait ELBManager.deleteRule(ruleArn);\n\t\t}\n\n\t\t// Sleep for a little bit - otherwise we get a message saying the rule still exists\n\t\tawait Util.sleep(10000);\n\n\t\tconsole.log(\"DELETE 4) Delete Target Group\");\n\t\tawait ELBManager.deleteTargetGroup(targetGroupArn);\n\n\t\tconsole.log(\"DELETE 5) Delete Service\");\n\t\tawait ECSManager.deleteService();\n\t}","function testExec_ThrowsMissingFrom() {\n asyncTestCase.waitForAsync('testExec_ThrowsMissingFrom');\n var query = new lf.query.DeleteBuilder(hr.db.getGlobal());\n query.exec().then(\n fail,\n function(e) {\n asyncTestCase.continueTesting();\n });\n}","delete() {\n this.deleted = true;\n }","function terminateOngoingUpload(key) {\n db.getTasks(\"owner_id\", key).then((rows) => {\n if (!rows)\n return;\n\n rows.forEach(row => {\n // file upload ongoing\n if (rows.status == constants.UPLOADING) {\n // file can be removed because the upload was approved\n // (ie the server didn't have the file before upload)\n let promises = [\n db.removeTask(row.taskID),\n db.removeFile(row.file_id)\n ];\n\n Promise.all(promises).then(() => {\n removeChunks(row.file_id);\n })\n .catch(function(err) {\n console.log(err);\n });\n }\n });\n });\n}","function socketOnError () {\n this.destroy();\n}","function socketOnError () {\n this.destroy();\n}","function socketOnError () {\n this.destroy();\n}","disconnectedCallback() {\n this.repository.delete();\n }","function onFileSystemFail(err) {\n console.log('deleteFileFromPersistentStorage file system fail: ' + fileName);\n console.log('error code = ' + err.code);\n }","[_delistFromMeta] () {\n const root = this.root\n if (!root.realpath || !this.path)\n return\n root.inventory.delete(this)\n root.tops.delete(this)\n if (root.meta)\n root.meta.delete(this.path)\n /* istanbul ignore next - should be impossible */\n debug(() => {\n if ([...root.inventory.values()].includes(this))\n throw new Error('failed to delist')\n })\n }","async cleanup() {\n\n }","die() {\n this.views.forEach(_view => {\n _view.setValueObj(HDummyValue.new());\n });\n this.views = [];\n if (this.id) {\n require('comm/values').del(this.id);\n }\n }","die() {\n this.views.forEach(_view => {\n _view.setValueObj(HDummyValue.new());\n });\n this.views = [];\n if (this.id) {\n require('comm/values').del(this.id);\n }\n }","receivedOp (op) {\n if (this.awaiting <= 0) {\n this.onevent(op)\n } else if (op.struct === 'Delete') {\n var self = this\n var checkDelete = function checkDelete (d) {\n if (d.length == null) {\n throw new Error('This shouldn\\'t happen! d.length must be defined!')\n }\n // we check if o deletes something in self.waiting\n // if so, we remove the deleted operation\n for (var w = 0; w < self.waiting.length; w++) {\n var i = self.waiting[w]\n if (i.struct === 'Insert' && i.id[0] === d.target[0]) {\n var iLength = i.hasOwnProperty('content') ? i.content.length : 1\n var dStart = d.target[1]\n var dEnd = d.target[1] + (d.length || 1)\n var iStart = i.id[1]\n var iEnd = i.id[1] + iLength\n // Check if they don't overlap\n if (iEnd <= dStart || dEnd <= iStart) {\n // no overlapping\n continue\n }\n // we check all overlapping cases. All cases:\n /*\n 1) iiiii\n ddddd\n --> modify i and d\n 2) iiiiiii\n ddddd\n --> modify i, remove d\n 3) iiiiiii\n ddd\n --> remove d, modify i, and create another i (for the right hand side)\n 4) iiiii\n ddddddd\n --> remove i, modify d\n 5) iiiiiii\n ddddddd\n --> remove both i and d (**)\n 6) iiiiiii\n ddddd\n --> modify i, remove d\n 7) iii\n ddddddd\n --> remove i, create and apply two d with checkDelete(d) (**)\n 8) iiiii\n ddddddd\n --> remove i, modify d (**)\n 9) iiiii\n ddddd\n --> modify i and d\n (**) (also check if i contains content or type)\n */\n // TODO: I left some debugger statements, because I want to debug all cases once in production. REMEMBER END TODO\n if (iStart < dStart) {\n if (dStart < iEnd) {\n if (iEnd < dEnd) {\n // Case 1\n // remove the right part of i's content\n i.content.splice(dStart - iStart)\n // remove the start of d's deletion\n d.length = dEnd - iEnd\n d.target = [d.target[0], iEnd]\n continue\n } else if (iEnd === dEnd) {\n // Case 2\n i.content.splice(dStart - iStart)\n // remove d, we do that by simply ending this function\n return\n } else { // (dEnd < iEnd)\n // Case 3\n var newI = {\n id: [i.id[0], dEnd],\n content: i.content.slice(dEnd - iStart),\n struct: 'Insert'\n }\n self.waiting.push(newI)\n i.content.splice(dStart - iStart)\n return\n }\n }\n } else if (dStart === iStart) {\n if (iEnd < dEnd) {\n // Case 4\n d.length = dEnd - iEnd\n d.target = [d.target[0], iEnd]\n i.content = []\n continue\n } else if (iEnd === dEnd) {\n // Case 5\n self.waiting.splice(w, 1)\n return\n } else { // (dEnd < iEnd)\n // Case 6\n i.content = i.content.slice(dEnd - iStart)\n i.id = [i.id[0], dEnd]\n return\n }\n } else { // (dStart < iStart)\n if (iStart < dEnd) {\n // they overlap\n /*\n 7) iii\n ddddddd\n --> remove i, create and apply two d with checkDelete(d) (**)\n 8) iiiii\n ddddddd\n --> remove i, modify d (**)\n 9) iiiii\n ddddd\n --> modify i and d\n */\n if (iEnd < dEnd) {\n // Case 7\n // debugger // TODO: You did not test this case yet!!!! (add the debugger here)\n self.waiting.splice(w, 1)\n checkDelete({\n target: [d.target[0], dStart],\n length: iStart - dStart,\n struct: 'Delete'\n })\n checkDelete({\n target: [d.target[0], iEnd],\n length: iEnd - dEnd,\n struct: 'Delete'\n })\n return\n } else if (iEnd === dEnd) {\n // Case 8\n self.waiting.splice(w, 1)\n w--\n d.length -= iLength\n continue\n } else { // dEnd < iEnd\n // Case 9\n d.length = iStart - dStart\n i.content.splice(0, dEnd - iStart)\n i.id = [i.id[0], dEnd]\n continue\n }\n }\n }\n }\n }\n // finished with remaining operations\n self.waiting.push(d)\n }\n if (op.key == null) {\n // deletes in list\n checkDelete(op)\n } else {\n // deletes in map\n this.waiting.push(op)\n }\n } else {\n this.waiting.push(op)\n }\n }","remove() {\n // alert(\"DEAD ok !\");\n }","destructor() {\n\t\tObject.keys(this.clients).forEach((hash) => {\n\t\t\tthis.removeClient(hash);\n\t\t});\n\t}","onDeleted() {\n\t\tthis.isDeleted = true;\n\t\tthis.getDriver().removeListener('nodes_changed', this.onNodesChanged);\n\t}","function postMortem() {\n throw new Error('This method cannot be called because this Handsontable instance has been destroyed');\n }","doDestroy() {}","handleDelete() {\n API.deleteNode(this.props.node).then(() => {\n this.props.node.remove();\n this.props.engine.repaintCanvas();\n }).catch(err => console.log(err));\n }","ondelete(deltas) { /* ?? */}","function checkDeleting(v, name) {\n if (v === undefined) {\n throw new Sk.builtin.TypeError(`${name} may not be deleted`);\n }\n}","function checkDeleting(v, name) {\n if (v === undefined) {\n throw new Sk.builtin.TypeError(`${name} may not be deleted`);\n }\n}","function deleteShelterError(error) {\n vm.error = \"Could not delete shelter at this time. Please try again later.\";\n scrollToError();\n }","cleanupDeps() {\n // 源码有更多\n this.depIds = this.newDepIds;\n this.newDepIds.clear(); // 清除最新记录 depIds 集合\n this.deps = this.newDeps;\n this.newDeps.length = 0; // 清除最新记录 dep 集合\n }","async abort() {\n return;\n }","function notifydeleted(){\n\tdpost(\"notifydeleted function called\\n\");\n// \tcpost(\"ABOUT to got deleted\\n\");\n\tdeletenodeFromDB(myNodeName);\n\n\t// call all nodes inside the same nodespace and tell them\n\t// to remove connections to this node from the database\n\tmessnamed(myNodeSpace + \"::vpl::nodespace\", \"removeConnection\", myNodeName);\n messnamed(myNodeID + \"::props\", \"close\");\n// \tcpost(myNodeName + \" got deleted\\n\");\n myIOlets.freepeer();\n}"],"string":"[\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 \"remove () {\\n // cleanup\\n }\",\n \"delete() {}\",\n \"detach() {\\n throw new Error('Not Implemented');\\n }\",\n \"detach() {\\n throw new Error('Not Implemented');\\n }\",\n \"cleanup() {}\",\n \"cleanup() {}\",\n \"function _handleRemove() {\\n Promise.all(deletePromises).catch(error => console.log(error));\\n next(err);\\n }\",\n \"removed() {}\",\n \"removed() {}\",\n \"disconnectedCallback() {\\r\\n\\t\\t\\tconsole.log(\\\"deleted\\\");\\r\\n\\t\\t}\",\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 \"cleanUpDeadCreeps () {\\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 linkCleanup() {\\n\\t\\tvar links = new DBRow(lit.tables.LINK);\\n\\t\\tlinks.query().then(function() {\\n\\t\\t\\tvar href = \\\"\\\";\\n\\n\\t\\t\\twhile(links.next()){\\n\\t\\t\\t\\thref = links.getValue(lit.LINK);\\n\\t\\t\\t\\tvar isValid = true;//test link using something\\n\\t\\t\\t\\tif (isValid)\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tlinks.delete().then(function() { //if it's not valid delete the current link\\n\\n\\t\\t\\t\\t\\t}, function() {\\n\\t\\t\\t\\t\\t\\tlog.warn(\\\"The link \\\" + href + \\\" was unable to be deleted but is invalid, consider manually deleting the link.\\\")\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t}\\n\\n\\t\\t}, function(err) {\\n\\n\\t\\t});\\n\\t}\",\n \"function exit(code) { \\n debug(\\\"caught exit\\\");\\n console.log(\\\"Trying to remove hosts from manage-hosts\\\");\\n self.remove(hostMap, function() {\\n process.exit(); \\n });\\n }\",\n \"cleanup() {\\n\\n\\t}\",\n \"function stoogeDeleted(model, error) {\\n if (typeof error != 'undefined') {\\n callback(error);\\n return;\\n }\\n // model parameter is what was deleted\\n self.shouldBeTrue(undefined === model.get('id')); // ID removed\\n self.shouldBeTrue(model.get('name') == 'Curly'); // the rest remains\\n // Is it really dead?\\n var curly = new self.Stooge();\\n curly.set('id', self.deletedModelId);\\n spec.integrationStore.getModel(curly, hesDeadJim);\\n }\",\n \"die() {\\n let entry;\\n while (entry = this._queue.pop()) {\\n entry.reject();\\n }\\n this._queue = null;\\n }\",\n \"delete() {\\n this.items().then(instances => {\\n instances.forEach(instance => {\\n instance.delete();\\n })\\n }).catch(error => {\\n debugger;\\n throw error;\\n })\\n }\",\n \"delete() {\\n\\n }\",\n \"detach() {\\n throw new Error('incompatible reuse strategy');\\n }\",\n \"function cleanup(){\\n\\t\\t\\tdelete pending[ serial]\\n\\t\\t}\",\n \"function somethingBad() {\\n nock.cleanAll()\\n }\",\n \"function _remove() {\\n return;\\n }\",\n \"async function cleanOrigin( origin ) {\\n const fdb = await origin.fdb;\\n // Iterate over deleted records, build lists of items to delete by category.\\n const deleted = {};\\n await fdb.forEach('status','deleted', record => {\\n // Read values from the record.\\n const { path, category } = record;\\n // Construct a request URL.\\n const url = origin.url+path;\\n // Construct an deletion item.\\n const item = { path, url };\\n // Record the fileset category.\\n const list = deleted[category];\\n if( list ) {\\n list.push( item );\\n }\\n else {\\n deleted[category] = [ item ];\\n }\\n });\\n // Iterate over each fileset category and remove deleted files from its cache.\\n for( const category in deleted ) {\\n // Get the fileset cache name..\\n const { cacheName } = getFileset( origin, category );\\n // Open the cache.\\n const cache = await caches.open( cacheName );\\n // Get the list of deleted items.\\n const items = deleted[category];\\n log('debug','%s Deleting %d files from fileset %s...', IconDelete, items.length, category );\\n // Iterate over the deleted items.\\n for( const { path, url } of items ) {\\n const request = new Request( url );\\n // Delete from the cache.\\n cache.delete( request );\\n // Delete the object store record.\\n await fdb.remove( path );\\n }\\n }\\n // Prune commit records - delete any commit record with no active file records.\\n await fdb.forEach('category', '$commit', async ( record ) => {\\n const { path, info: { commit } } = record;\\n const count = await fdb.indexCount('commit', commit );\\n log('debug','commit %s count %d', commit, count );\\n if( count == 0 ) {\\n log('debug','%s Deleting commit record for %s...', IconDelete, commit );\\n await fdb.remove( path );\\n }\\n });\\n}\",\n \"delete() {\\n if (!this.msg) throw new Error(\\\"Tried to delete embed pages but they havn't even been created yet.\\\");\\n this.msg.delete().catch(() => null);\\n }\",\n \"destroy() { /* There are no resources to clean up on MySQL server */ }\",\n \"delete(element) {\\n return Promise.reject('not implement');\\n }\",\n \"deleteRecord() {\\n this._super(...arguments);\\n const gist = this.gist;\\n if(gist) {\\n gist.registerDeletedFile(this.id);\\n\\n // Following try/catch should not be necessary. Bug in ember data?\\n try {\\n gist.get('files').removeObject(this);\\n } catch(e) {\\n /* squash */\\n }\\n }\\n }\",\n \"delete() {\\r\\n return super.deleteCore();\\r\\n }\",\n \"delete() {\\r\\n return super.deleteCore();\\r\\n }\",\n \"delete() {\\r\\n return super.deleteCore();\\r\\n }\",\n \"async onDeleted() {\\n this.log('device deleted', this.getName(), this.settings.serialNumber);\\n this.client && this.client.end();\\n this.timeout && clearTimeout(this.timeout);\\n this.shouldSync = false;\\n this.setUnavailable();\\n }\",\n \"function destroyed() {\\n throw new Error('Call made to destroyed method');\\n}\",\n \"_destroy() {}\",\n \"function deleteMovieError() {\\n console.log('Unble to delete movie...');\\n}\",\n \"async function cleanup() {\\n const packageResponse = await client.getPackage(packagePayload.Name, { resolveWithFullResponse: true });\\n const propertySetTypeResponse = await client.getPropertySetType(\\n propertySetTypePayload.Name,\\n null,\\n { resolveWithFullResponse: true },\\n );\\n const thingTypeResponse = await client.getThingType(thingTypePayload.Name, null, { resolveWithFullResponse: true });\\n\\n const things = await client.getThingsByThingType(thingTypePayload.Name);\\n things.value.forEach(async (thing) => {\\n await client.deleteThing(thing._id);\\n console.log(`Thing deleted: ${thing._id}`);\\n });\\n\\n await client.deleteThingType(thingTypePayload.Name, thingTypeResponse.headers.etag);\\n console.log(`Thing type deleted: ${thingTypePayload.Name}`);\\n await client.deletePropertySetType(propertySetTypePayload.Name, propertySetTypeResponse.headers.etag);\\n console.log(`Property set type deleted: ${propertySetTypePayload.Name}`);\\n await client.deletePackage(packagePayload.Name, packageResponse.headers.etag);\\n console.log(`Package deleted: ${packagePayload.Name}`);\\n}\",\n \"function socketError() {\\n this.destroy();\\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 \"softDrop() {\\r\\n if (this.actual.softDrop()) {\\r\\n this.crashed();\\r\\n }\\r\\n }\",\n \"function socketError () {\\n this.destroy();\\n}\",\n \"function socketError () {\\n this.destroy();\\n}\",\n \"function erasereinforce(){\\n\\tdelete Reinforce;\\n}\",\n \"async handleDeletions(keysToDelete) {\\n if (this.parent) {\\n await this.ensureIndexLoaded()\\n }\\n let condemned = this.index.getNodesByType(keysToDelete)\\n if (Object.keys(condemned.local).length) {\\n await this.dynamoClient.deleteAttributes({\\n tableName: this.tableName,\\n key: this.key,\\n attributes: Object.keys(condemned.local)\\n }).catch((err) => {u.error('failure in DBObject.handleDeletions', err)})\\n }\\n \\n // Lateral\\n let idsToDelete = []\\n Object.keys(condemned.lateral).forEach((path) => {\\n let node = condemned.lateral[path]\\n idsToDelete = idsToDelete.concat(node.getLateralPointers())\\n })\\n await this._deleteLateral(idsToDelete)\\n \\n // Elsewhere\\n let childNodesWithShitToDelete = {}\\n Object.keys(condemned.elsewhere).forEach((path) => {\\n let node = condemned.elsewhere[path]\\n let pointer = node.getVerticalPointer()\\n childNodesWithShitToDelete[pointer] = childNodesWithShitToDelete[pointer] || [] \\n childNodesWithShitToDelete[pointer].push(path)\\n })\\n let pointers = Object.keys(childNodesWithShitToDelete)\\n for (let i = 0; i < pointers.length; i++) {\\n let pointer = pointers[i]\\n let paths = childNodesWithShitToDelete[pointer]\\n await this.cachedDirectChildren[pointer].handleDeletions(paths)\\n }\\n\\n // If this is subordinate and we've deleted the last entry, delete the entire node\\n if (this.parent) {\\n keysToDelete.forEach((path) => {\\n delete this.index.i[path]\\n })\\n this.index.updateMetaNodes()\\n let allKeysInIndex = this.index.getChildren()\\n if (!allKeysInIndex.length) {await this.destroy()}\\n }\\n\\n // TODO: COLLECTION, FILE, REF\\n }\",\n \"handleFailure (error_)\\n\\t{\\n\\t\\t// todo: Undo all actions\\n\\t\\tthis.cleanup ();\\n\\t\\tthrow error_;\\n\\t}\",\n \"Remove() {}\",\n \"function cleanupInvalid() {\\n //Check for invalid Droplets\\n for(var i=droplets.length-1;i >= 0;i--) {\\n if(!droplets[i].valid) {\\n droplets.splice(i,1);\\n }\\n }\\n\\n //Check for invalid Flowers\\n for(var i=flowers.length-1;i >= 0;i--) {\\n if(!flowers[i].valid) {\\n flowers.splice(i,1);\\n }\\n } \\n}\",\n \"static cleanup() {\\n return connect(DB_NAME).then(db => {\\n const transaction = db.transaction([STORE_NAME], 'readwrite');\\n const store = transaction.objectStore(STORE_NAME);\\n const request = store.index('expires').openCursor(IDBKeyRange.upperBound(Date.now()));\\n return new Promise((resolve, reject) => {\\n request.onsuccess = event => {\\n const cursor = event.target.result;\\n\\n if (cursor) {\\n cursor.delete(); // Ignoring return value … it's not terrible if this goes wrong.\\n\\n cursor.continue();\\n } else {\\n resolve(db);\\n }\\n };\\n\\n request.onerror = reject;\\n });\\n }).then(db => {\\n db.close();\\n });\\n }\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"destroy() {}\",\n \"function socketError () {\\n\\t this.destroy();\\n\\t}\",\n \"function socketError () {\\n\\t this.destroy();\\n\\t}\",\n \"function socketOnError() {\\n this.destroy();\\n}\",\n \"function socketOnError() {\\n this.destroy();\\n}\",\n \"function socketOnError() {\\n this.destroy();\\n}\",\n \"internalCleanup() {\\n\\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 \"detach() {}\",\n \"delete() {\\n this.afterDelete();\\n Fiber.yield(true)\\n }\",\n \"static async _delete() {\\n\\t\\tconst serviceName = Config.str(\\\"serviceName\\\");\\n\\n\\t\\tconsole.log(\\\"DELETE 1) Find Target Group Arn\\\");\\n\\n\\t\\tconst targetGroup = await ELBManager.describeTargetGroup(serviceName);\\n\\t\\tconst targetGroupArn = targetGroup.TargetGroupArn;\\n\\t\\tif (!targetGroupArn) {\\n\\t\\t\\tthrow new Error(\\\"Could not find target group associated with service: \\\" + serviceName);\\n\\t\\t}\\n\\n\\t\\tconsole.log(\\\"DELETE 2) Find ELB Rule for Target Group\\\");\\n\\n\\t\\t// List the rules for our core listener\\n\\t\\t// Find the one that refers to our target group from the previous step\\n\\t\\tconst rules = await ELBManager.describeRules(Config.str(\\\"listenerArn\\\"));\\n\\t\\tlet ruleArn;\\n\\t\\tfor (const rule of rules) {\\n\\t\\t\\tfor (const action of rule.Actions) {\\n\\t\\t\\t\\tif (action.TargetGroupArn === targetGroupArn) {\\n\\t\\t\\t\\t\\truleArn = rule.RuleArn;\\n\\t\\t\\t\\t\\tconsole.log(\\\"FOUND RULE: \\\" + ruleArn);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (ruleArn) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// If we found the rule delete - this should always happen, but we do as an if statement for safety\\n\\t\\tif (ruleArn) {\\n\\t\\t\\tconsole.log(\\\"DELETE 3) Delete Rule\\\");\\n\\t\\t\\tawait ELBManager.deleteRule(ruleArn);\\n\\t\\t}\\n\\n\\t\\t// Sleep for a little bit - otherwise we get a message saying the rule still exists\\n\\t\\tawait Util.sleep(10000);\\n\\n\\t\\tconsole.log(\\\"DELETE 4) Delete Target Group\\\");\\n\\t\\tawait ELBManager.deleteTargetGroup(targetGroupArn);\\n\\n\\t\\tconsole.log(\\\"DELETE 5) Delete Service\\\");\\n\\t\\tawait ECSManager.deleteService();\\n\\t}\",\n \"function testExec_ThrowsMissingFrom() {\\n asyncTestCase.waitForAsync('testExec_ThrowsMissingFrom');\\n var query = new lf.query.DeleteBuilder(hr.db.getGlobal());\\n query.exec().then(\\n fail,\\n function(e) {\\n asyncTestCase.continueTesting();\\n });\\n}\",\n \"delete() {\\n this.deleted = true;\\n }\",\n \"function terminateOngoingUpload(key) {\\n db.getTasks(\\\"owner_id\\\", key).then((rows) => {\\n if (!rows)\\n return;\\n\\n rows.forEach(row => {\\n // file upload ongoing\\n if (rows.status == constants.UPLOADING) {\\n // file can be removed because the upload was approved\\n // (ie the server didn't have the file before upload)\\n let promises = [\\n db.removeTask(row.taskID),\\n db.removeFile(row.file_id)\\n ];\\n\\n Promise.all(promises).then(() => {\\n removeChunks(row.file_id);\\n })\\n .catch(function(err) {\\n console.log(err);\\n });\\n }\\n });\\n });\\n}\",\n \"function socketOnError () {\\n this.destroy();\\n}\",\n \"function socketOnError () {\\n this.destroy();\\n}\",\n \"function socketOnError () {\\n this.destroy();\\n}\",\n \"disconnectedCallback() {\\n this.repository.delete();\\n }\",\n \"function onFileSystemFail(err) {\\n console.log('deleteFileFromPersistentStorage file system fail: ' + fileName);\\n console.log('error code = ' + err.code);\\n }\",\n \"[_delistFromMeta] () {\\n const root = this.root\\n if (!root.realpath || !this.path)\\n return\\n root.inventory.delete(this)\\n root.tops.delete(this)\\n if (root.meta)\\n root.meta.delete(this.path)\\n /* istanbul ignore next - should be impossible */\\n debug(() => {\\n if ([...root.inventory.values()].includes(this))\\n throw new Error('failed to delist')\\n })\\n }\",\n \"async cleanup() {\\n\\n }\",\n \"die() {\\n this.views.forEach(_view => {\\n _view.setValueObj(HDummyValue.new());\\n });\\n this.views = [];\\n if (this.id) {\\n require('comm/values').del(this.id);\\n }\\n }\",\n \"die() {\\n this.views.forEach(_view => {\\n _view.setValueObj(HDummyValue.new());\\n });\\n this.views = [];\\n if (this.id) {\\n require('comm/values').del(this.id);\\n }\\n }\",\n \"receivedOp (op) {\\n if (this.awaiting <= 0) {\\n this.onevent(op)\\n } else if (op.struct === 'Delete') {\\n var self = this\\n var checkDelete = function checkDelete (d) {\\n if (d.length == null) {\\n throw new Error('This shouldn\\\\'t happen! d.length must be defined!')\\n }\\n // we check if o deletes something in self.waiting\\n // if so, we remove the deleted operation\\n for (var w = 0; w < self.waiting.length; w++) {\\n var i = self.waiting[w]\\n if (i.struct === 'Insert' && i.id[0] === d.target[0]) {\\n var iLength = i.hasOwnProperty('content') ? i.content.length : 1\\n var dStart = d.target[1]\\n var dEnd = d.target[1] + (d.length || 1)\\n var iStart = i.id[1]\\n var iEnd = i.id[1] + iLength\\n // Check if they don't overlap\\n if (iEnd <= dStart || dEnd <= iStart) {\\n // no overlapping\\n continue\\n }\\n // we check all overlapping cases. All cases:\\n /*\\n 1) iiiii\\n ddddd\\n --> modify i and d\\n 2) iiiiiii\\n ddddd\\n --> modify i, remove d\\n 3) iiiiiii\\n ddd\\n --> remove d, modify i, and create another i (for the right hand side)\\n 4) iiiii\\n ddddddd\\n --> remove i, modify d\\n 5) iiiiiii\\n ddddddd\\n --> remove both i and d (**)\\n 6) iiiiiii\\n ddddd\\n --> modify i, remove d\\n 7) iii\\n ddddddd\\n --> remove i, create and apply two d with checkDelete(d) (**)\\n 8) iiiii\\n ddddddd\\n --> remove i, modify d (**)\\n 9) iiiii\\n ddddd\\n --> modify i and d\\n (**) (also check if i contains content or type)\\n */\\n // TODO: I left some debugger statements, because I want to debug all cases once in production. REMEMBER END TODO\\n if (iStart < dStart) {\\n if (dStart < iEnd) {\\n if (iEnd < dEnd) {\\n // Case 1\\n // remove the right part of i's content\\n i.content.splice(dStart - iStart)\\n // remove the start of d's deletion\\n d.length = dEnd - iEnd\\n d.target = [d.target[0], iEnd]\\n continue\\n } else if (iEnd === dEnd) {\\n // Case 2\\n i.content.splice(dStart - iStart)\\n // remove d, we do that by simply ending this function\\n return\\n } else { // (dEnd < iEnd)\\n // Case 3\\n var newI = {\\n id: [i.id[0], dEnd],\\n content: i.content.slice(dEnd - iStart),\\n struct: 'Insert'\\n }\\n self.waiting.push(newI)\\n i.content.splice(dStart - iStart)\\n return\\n }\\n }\\n } else if (dStart === iStart) {\\n if (iEnd < dEnd) {\\n // Case 4\\n d.length = dEnd - iEnd\\n d.target = [d.target[0], iEnd]\\n i.content = []\\n continue\\n } else if (iEnd === dEnd) {\\n // Case 5\\n self.waiting.splice(w, 1)\\n return\\n } else { // (dEnd < iEnd)\\n // Case 6\\n i.content = i.content.slice(dEnd - iStart)\\n i.id = [i.id[0], dEnd]\\n return\\n }\\n } else { // (dStart < iStart)\\n if (iStart < dEnd) {\\n // they overlap\\n /*\\n 7) iii\\n ddddddd\\n --> remove i, create and apply two d with checkDelete(d) (**)\\n 8) iiiii\\n ddddddd\\n --> remove i, modify d (**)\\n 9) iiiii\\n ddddd\\n --> modify i and d\\n */\\n if (iEnd < dEnd) {\\n // Case 7\\n // debugger // TODO: You did not test this case yet!!!! (add the debugger here)\\n self.waiting.splice(w, 1)\\n checkDelete({\\n target: [d.target[0], dStart],\\n length: iStart - dStart,\\n struct: 'Delete'\\n })\\n checkDelete({\\n target: [d.target[0], iEnd],\\n length: iEnd - dEnd,\\n struct: 'Delete'\\n })\\n return\\n } else if (iEnd === dEnd) {\\n // Case 8\\n self.waiting.splice(w, 1)\\n w--\\n d.length -= iLength\\n continue\\n } else { // dEnd < iEnd\\n // Case 9\\n d.length = iStart - dStart\\n i.content.splice(0, dEnd - iStart)\\n i.id = [i.id[0], dEnd]\\n continue\\n }\\n }\\n }\\n }\\n }\\n // finished with remaining operations\\n self.waiting.push(d)\\n }\\n if (op.key == null) {\\n // deletes in list\\n checkDelete(op)\\n } else {\\n // deletes in map\\n this.waiting.push(op)\\n }\\n } else {\\n this.waiting.push(op)\\n }\\n }\",\n \"remove() {\\n // alert(\\\"DEAD ok !\\\");\\n }\",\n \"destructor() {\\n\\t\\tObject.keys(this.clients).forEach((hash) => {\\n\\t\\t\\tthis.removeClient(hash);\\n\\t\\t});\\n\\t}\",\n \"onDeleted() {\\n\\t\\tthis.isDeleted = true;\\n\\t\\tthis.getDriver().removeListener('nodes_changed', this.onNodesChanged);\\n\\t}\",\n \"function postMortem() {\\n throw new Error('This method cannot be called because this Handsontable instance has been destroyed');\\n }\",\n \"doDestroy() {}\",\n \"handleDelete() {\\n API.deleteNode(this.props.node).then(() => {\\n this.props.node.remove();\\n this.props.engine.repaintCanvas();\\n }).catch(err => console.log(err));\\n }\",\n \"ondelete(deltas) { /* ?? */}\",\n \"function checkDeleting(v, name) {\\n if (v === undefined) {\\n throw new Sk.builtin.TypeError(`${name} may not be deleted`);\\n }\\n}\",\n \"function checkDeleting(v, name) {\\n if (v === undefined) {\\n throw new Sk.builtin.TypeError(`${name} may not be deleted`);\\n }\\n}\",\n \"function deleteShelterError(error) {\\n vm.error = \\\"Could not delete shelter at this time. Please try again later.\\\";\\n scrollToError();\\n }\",\n \"cleanupDeps() {\\n // 源码有更多\\n this.depIds = this.newDepIds;\\n this.newDepIds.clear(); // 清除最新记录 depIds 集合\\n this.deps = this.newDeps;\\n this.newDeps.length = 0; // 清除最新记录 dep 集合\\n }\",\n \"async abort() {\\n return;\\n }\",\n \"function notifydeleted(){\\n\\tdpost(\\\"notifydeleted function called\\\\n\\\");\\n// \\tcpost(\\\"ABOUT to got deleted\\\\n\\\");\\n\\tdeletenodeFromDB(myNodeName);\\n\\n\\t// call all nodes inside the same nodespace and tell them\\n\\t// to remove connections to this node from the database\\n\\tmessnamed(myNodeSpace + \\\"::vpl::nodespace\\\", \\\"removeConnection\\\", myNodeName);\\n messnamed(myNodeID + \\\"::props\\\", \\\"close\\\");\\n// \\tcpost(myNodeName + \\\" got deleted\\\\n\\\");\\n myIOlets.freepeer();\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65547734","0.6395657","0.6280557","0.6153434","0.6153434","0.60908616","0.60908616","0.60645497","0.60639924","0.60639924","0.5951789","0.5949893","0.59108114","0.5875467","0.5855062","0.5827057","0.5824024","0.58122593","0.58100647","0.5797361","0.5781014","0.577103","0.57511634","0.57320035","0.5726191","0.5719346","0.57175606","0.5711342","0.5686956","0.56791615","0.5672498","0.5672498","0.5672498","0.5670062","0.566969","0.56611276","0.56564605","0.56463265","0.56221855","0.5615482","0.5615482","0.5615482","0.5615482","0.5615482","0.5615482","0.55859816","0.5574575","0.5574575","0.5531519","0.5520559","0.5515479","0.55100286","0.54972166","0.5496541","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.5495065","0.54910254","0.54910254","0.5475288","0.5475288","0.5475288","0.54716676","0.5455493","0.54524344","0.5437744","0.5437681","0.5430123","0.54267764","0.54226565","0.5422084","0.5422084","0.5422084","0.542202","0.5421526","0.5414079","0.5398873","0.5398806","0.5398806","0.53978276","0.5395834","0.5393374","0.53925","0.53871495","0.5387042","0.5378471","0.53758764","0.5371292","0.5371292","0.5350193","0.5340336","0.533629","0.5335688"],"string":"[\n \"0.65547734\",\n \"0.6395657\",\n \"0.6280557\",\n \"0.6153434\",\n \"0.6153434\",\n \"0.60908616\",\n \"0.60908616\",\n \"0.60645497\",\n \"0.60639924\",\n \"0.60639924\",\n \"0.5951789\",\n \"0.5949893\",\n \"0.59108114\",\n \"0.5875467\",\n \"0.5855062\",\n \"0.5827057\",\n \"0.5824024\",\n \"0.58122593\",\n \"0.58100647\",\n \"0.5797361\",\n \"0.5781014\",\n \"0.577103\",\n \"0.57511634\",\n \"0.57320035\",\n \"0.5726191\",\n \"0.5719346\",\n \"0.57175606\",\n \"0.5711342\",\n \"0.5686956\",\n \"0.56791615\",\n \"0.5672498\",\n \"0.5672498\",\n \"0.5672498\",\n \"0.5670062\",\n \"0.566969\",\n \"0.56611276\",\n \"0.56564605\",\n \"0.56463265\",\n \"0.56221855\",\n \"0.5615482\",\n \"0.5615482\",\n \"0.5615482\",\n \"0.5615482\",\n \"0.5615482\",\n \"0.5615482\",\n \"0.55859816\",\n \"0.5574575\",\n \"0.5574575\",\n \"0.5531519\",\n \"0.5520559\",\n \"0.5515479\",\n \"0.55100286\",\n \"0.54972166\",\n \"0.5496541\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.5495065\",\n \"0.54910254\",\n \"0.54910254\",\n \"0.5475288\",\n \"0.5475288\",\n \"0.5475288\",\n \"0.54716676\",\n \"0.5455493\",\n \"0.54524344\",\n \"0.5437744\",\n \"0.5437681\",\n \"0.5430123\",\n \"0.54267764\",\n \"0.54226565\",\n \"0.5422084\",\n \"0.5422084\",\n \"0.5422084\",\n \"0.542202\",\n \"0.5421526\",\n \"0.5414079\",\n \"0.5398873\",\n \"0.5398806\",\n \"0.5398806\",\n \"0.53978276\",\n \"0.5395834\",\n \"0.5393374\",\n \"0.53925\",\n \"0.53871495\",\n \"0.5387042\",\n \"0.5378471\",\n \"0.53758764\",\n \"0.5371292\",\n \"0.5371292\",\n \"0.5350193\",\n \"0.5340336\",\n \"0.533629\",\n \"0.5335688\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80683,"cells":{"query":{"kind":"string","value":"onYield is called upon exiting. We use these in lieu of returning a tuple. I've also chosen not to inline them into renderRoot because these will eventually be lifted into the renderer."},"document":{"kind":"string","value":"function onFatal(root){root.finishedWork=null;}"},"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":["exitYield_stmt(ctx) {\n\t}","exitYield_expr(ctx) {\n\t}","function hzYield() {\n\t\treturn t.callExpression(\n\t\t\tt.memberExpression(\n\t\t\t\tt.identifier(\"hzUserLib\"),\n\t\t\t\tt.identifier(\"yield\")\n\t\t\t),\n\t\t\t[t.ObjectExpression([\n\t\t\t\tt.ObjectProperty(t.identifier(\"value\"), t.identifier(\"undefined\")),\n\t\t\t\tt.ObjectProperty(t.identifier(\"done\"), t.BooleanLiteral(false))\n\t\t\t])]\n\t\t);\n\t}","enterYield_stmt(ctx) {\n\t}","function _render() {\n _render = (0, _asyncToGenerator2.default)(\n /*#__PURE__*/\n _regenerator.default.mark(function _callee2(props) {\n return _regenerator.default.wrap(\n function _callee2$(_context2) {\n while (1) {\n switch ((_context2.prev = _context2.next)) {\n case 0:\n if (!props.err) {\n _context2.next = 4;\n break;\n }\n\n _context2.next = 3;\n return renderError(props);\n\n case 3:\n return _context2.abrupt(\"return\");\n\n case 4:\n _context2.prev = 4;\n _context2.next = 7;\n return doRender(props);\n\n case 7:\n _context2.next = 13;\n break;\n\n case 9:\n _context2.prev = 9;\n _context2.t0 = _context2[\"catch\"](4);\n _context2.next = 13;\n return renderError(\n (0, _objectSpread2.default)({}, props, {\n err: _context2.t0,\n })\n );\n\n case 13:\n case \"end\":\n return _context2.stop();\n }\n }\n },\n _callee2,\n this,\n [[4, 9]]\n );\n })\n );\n return _render.apply(this, arguments);\n }","function parseYield() {\n next();\n if (!match(TokenType.semi) && !canInsertSemicolon()) {\n eat(TokenType.star);\n parseMaybeAssign();\n }\n}","enterYield_expr(ctx) {\n\t}","function matchYield(){return state.yieldAllowed && matchKeyword('yield',!strict);}","function matchYield() {\n return state.yieldAllowed && matchKeyword('yield', !strict);\n }","function matchYield() {\n return state.yieldAllowed && matchKeyword('yield', !strict);\n }","function matchYield() {\n return state.yieldAllowed && matchKeyword('yield', !strict);\n }","function matchYield() {\n return state.yieldAllowed && matchKeyword('yield', !strict);\n }","function matchYield() {\n return state.yieldAllowed && matchKeyword('yield', !strict);\n }","function parseYieldExpression() {\n\t var argument, expr, delegate, previousAllowYield;\n\n\t argument = null;\n\t expr = new Node();\n\t delegate = false;\n\n\t expectKeyword('yield');\n\n\t if (!hasLineTerminator) {\n\t previousAllowYield = state.allowYield;\n\t state.allowYield = false;\n\t delegate = match('*');\n\t if (delegate) {\n\t lex();\n\t argument = parseAssignmentExpression();\n\t } else {\n\t if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\n\t argument = parseAssignmentExpression();\n\t }\n\t }\n\t state.allowYield = previousAllowYield;\n\t }\n\n\t return expr.finishYieldExpression(argument, delegate);\n\t }","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 }","formatYieldChildren(children){\n let {labelName, valueName, \n placeHolder, multi, style, className} = this.props;\n const {filterText, value, open} = this.state;\n\n let nodes = [], tags = [];\n React.Children.map(children, (item, index) => {\n const props = item.props;\n const item_val = props[valueName];\n const item_label = props[labelName];\n let selected = false;\n if (multi) {\n const _index = value.indexOf(item_val);\n selected = _index !== -1;\n if(selected) tags[_index] = item_label;\n } else {\n selected = value === item_val;\n if (selected) {\n placeHolder = item_label;\n }\n }\n \n if(this.filterTextMatched(filterText, item_label, item_val)) {\n nodes.push(\n <DropDownOption key={index}\n value={item_val} \n label={item_label}\n disabled={props.disabled}\n onClick={() => this.handleChangeSelect(item_val)}\n selected={selected}>\n {props.children}\n </DropDownOption>\n )\n }\n });\n\n let labelNode = this.formatLabel(multi ? tags : placeHolder)\n\n className = klassName('dropdown', className);\n\n if (open) {\n className = `${className} _active`;\n }\n\n return <div className={className} style={style}>\n {labelNode}\n <span className=\"_list\">\n {open ? nodes : null}\n {this.formatLoading()}\n </span>\n </div>;\n }","function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\n return function (blockArguments, self) {\n // Render state is used to track the progress of the helper (since it\n // may call into us multiple times). As the user-land helper calls\n // into library code, we track what needs to be cleaned up after the\n // helper has returned.\n //\n // Here, we remember that a template has been yielded and so we do not\n // need to remove the previous template. (If no template is yielded\n // this render by the helper, we assume nothing should be shown and\n // remove any previous rendered templates.)\n renderState.morphToClear = null;\n\n // In this conditional is true, it means that on the previous rendering pass\n // the helper yielded multiple items via `yieldItem()`, but this time they\n // are yielding a single template. In that case, we mark the morph list for\n // cleanup so it is removed from the DOM.\n if (morph.morphList) {\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\n renderState.morphListToClear = null;\n }\n\n var scope = parentScope;\n\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\n }\n\n // Check to make sure that we actually **need** a new scope, and can't\n // share the parent scope. Note that we need to move this check into\n // a host hook, because the host's notion of scope may require a new\n // scope in more cases than the ones we can determine statically.\n if (self !== undefined || parentScope === null || template.arity) {\n scope = env.hooks.createChildScope(parentScope);\n }\n\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\n\n // Render the template that was selected by the helper\n var renderOptions = new _render.RenderOptions(morph, self, blockArguments);\n _render2.default(template, env, scope, renderOptions);\n };\n}","handle(context, type, onNext) {\n return __awaiter(this, void 0, void 0, function* () {\n let returnValue = null;\n function runHandler(index) {\n return __awaiter(this, void 0, void 0, function* () {\n if (index < handlers.length) {\n const val = yield handlers[index](context, () => runHandler(index + 1));\n // if a value is returned, and we have not yet set the return value,\n // capture it. This is used to allow InvokeResponses to be returned.\n if (typeof (val) !== 'undefined' && returnValue === null) {\n returnValue = val;\n }\n }\n else {\n const val = yield onNext();\n if (typeof (val) !== 'undefined') {\n returnValue = val;\n }\n }\n });\n }\n const handlers = this.handlers[type] || [];\n yield runHandler(0);\n return returnValue;\n });\n }","function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\n return function (blockArguments, self) {\n // Render state is used to track the progress of the helper (since it\n // may call into us multiple times). As the user-land helper calls\n // into library code, we track what needs to be cleaned up after the\n // helper has returned.\n //\n // Here, we remember that a template has been yielded and so we do not\n // need to remove the previous template. (If no template is yielded\n // this render by the helper, we assume nothing should be shown and\n // remove any previous rendered templates.)\n renderState.morphToClear = null;\n\n // In this conditional is true, it means that on the previous rendering pass\n // the helper yielded multiple items via `yieldItem()`, but this time they\n // are yielding a single template. In that case, we mark the morph list for\n // cleanup so it is removed from the DOM.\n if (morph.morphList) {\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\n renderState.morphListToClear = null;\n }\n\n var scope = parentScope;\n\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\n }\n\n // Check to make sure that we actually **need** a new scope, and can't\n // share the parent scope. Note that we need to move this check into\n // a host hook, because the host's notion of scope may require a new\n // scope in more cases than the ones we can determine statically.\n if (self !== undefined || parentScope === null || template.arity) {\n scope = env.hooks.createChildScope(parentScope);\n }\n\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\n\n // Render the template that was selected by the helper\n var renderOptions = new _render.RenderOptions(morph, self, blockArguments);\n _render.default(template, env, scope, renderOptions);\n };\n }","function parseYieldExpression() {\n var argument, expr, delegate, previousAllowYield;\n\n argument = null;\n expr = new Node();\n delegate = false;\n\n expectKeyword('yield');\n\n if (!hasLineTerminator) {\n previousAllowYield = state.allowYield;\n state.allowYield = false;\n delegate = match('*');\n if (delegate) {\n lex();\n argument = parseAssignmentExpression();\n } else {\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\n argument = parseAssignmentExpression();\n }\n }\n state.allowYield = previousAllowYield;\n }\n\n return expr.finishYieldExpression(argument, delegate);\n }","function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\n return function (blockArguments, self) {\n // Render state is used to track the progress of the helper (since it\n // may call into us multiple times). As the user-land helper calls\n // into library code, we track what needs to be cleaned up after the\n // helper has returned.\n //\n // Here, we remember that a template has been yielded and so we do not\n // need to remove the previous template. (If no template is yielded\n // this render by the helper, we assume nothing should be shown and\n // remove any previous rendered templates.)\n renderState.morphToClear = null;\n\n // In this conditional is true, it means that on the previous rendering pass\n // the helper yielded multiple items via `yieldItem()`, but this time they\n // are yielding a single template. In that case, we mark the morph list for\n // cleanup so it is removed from the DOM.\n if (morph.morphList) {\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\n renderState.morphListToClear = null;\n }\n\n var scope = parentScope;\n\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\n }\n\n // Check to make sure that we actually **need** a new scope, and can't\n // share the parent scope. Note that we need to move this check into\n // a host hook, because the host's notion of scope may require a new\n // scope in more cases than the ones we can determine statically.\n if (self !== undefined || parentScope === null || template.arity) {\n scope = env.hooks.createChildScope(parentScope);\n }\n\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\n\n // Render the template that was selected by the helper\n _render.default(template, env, scope, { renderNode: morph, self: self, blockArguments: blockArguments });\n };\n }","function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\n return function (blockArguments, self) {\n // Render state is used to track the progress of the helper (since it\n // may call into us multiple times). As the user-land helper calls\n // into library code, we track what needs to be cleaned up after the\n // helper has returned.\n //\n // Here, we remember that a template has been yielded and so we do not\n // need to remove the previous template. (If no template is yielded\n // this render by the helper, we assume nothing should be shown and\n // remove any previous rendered templates.)\n renderState.morphToClear = null;\n\n // In this conditional is true, it means that on the previous rendering pass\n // the helper yielded multiple items via `yieldItem()`, but this time they\n // are yielding a single template. In that case, we mark the morph list for\n // cleanup so it is removed from the DOM.\n if (morph.morphList) {\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\n renderState.morphListToClear = null;\n }\n\n var scope = parentScope;\n\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\n }\n\n // Check to make sure that we actually **need** a new scope, and can't\n // share the parent scope. Note that we need to move this check into\n // a host hook, because the host's notion of scope may require a new\n // scope in more cases than the ones we can determine statically.\n if (self !== undefined || parentScope === null || template.arity) {\n scope = env.hooks.createChildScope(parentScope);\n }\n\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\n\n // Render the template that was selected by the helper\n _render.default(template, env, scope, { renderNode: morph, self: self, blockArguments: blockArguments });\n };\n }","*end() {\n while (this.stack.length > 0)\n yield* this.pop();\n }","function parseYieldExpression() {\n var argument, expr, delegate, previousAllowYield;\n\n argument = null;\n expr = new Node();\n\n expectKeyword('yield');\n\n if (!hasLineTerminator) {\n previousAllowYield = state.allowYield;\n state.allowYield = false;\n delegate = match('*');\n if (delegate) {\n lex();\n argument = parseAssignmentExpression();\n } else {\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\n argument = parseAssignmentExpression();\n }\n }\n state.allowYield = previousAllowYield;\n }\n\n return expr.finishYieldExpression(argument, delegate);\n }","function parseYieldExpression() {\n var argument, expr, delegate, previousAllowYield;\n\n argument = null;\n expr = new Node();\n delegate = false;\n\n expectKeyword('yield');\n\n if (!hasLineTerminator) {\n previousAllowYield = state.allowYield;\n state.allowYield = false;\n delegate = match('*');\n if (delegate) {\n lex();\n argument = parseAssignmentExpression();\n } else {\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\n argument = parseAssignmentExpression();\n }\n }\n state.allowYield = previousAllowYield;\n }\n\n return expr.finishYieldExpression(argument, delegate);\n }","function parseYieldExpression() {\n var argument, expr, delegate, previousAllowYield;\n\n argument = null;\n expr = new Node();\n delegate = false;\n\n expectKeyword('yield');\n\n if (!hasLineTerminator) {\n previousAllowYield = state.allowYield;\n state.allowYield = false;\n delegate = match('*');\n if (delegate) {\n lex();\n argument = parseAssignmentExpression();\n } else {\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\n argument = parseAssignmentExpression();\n }\n }\n state.allowYield = previousAllowYield;\n }\n\n return expr.finishYieldExpression(argument, delegate);\n }","function parseYieldExpression() {\n var argument, expr, delegate;\n\n expr = new Node();\n\n if (!state.allowYield) {\n tolerateUnexpectedToken(lookahead, Messages.IllegalYield);\n }\n\n expectKeyword('yield');\n\n if (!hasLineTerminator) {\n delegate = match('*');\n if (delegate) {\n lex();\n argument = parseExpression();\n } else {\n if (!match(';') && !match('}') && lookahead.type !== Token.EOF) {\n argument = parseExpression();\n }\n }\n }\n\n return expr.finishYieldExpression(argument, delegate);\n }","*end() {\n while (this.stack.length > 0)\n yield* this.pop();\n }","defaultNextEvent(context) {\n const runDialogs = () => __awaiter(this, void 0, void 0, function* () {\n yield this.handle(context, 'Dialog', () => __awaiter(this, void 0, void 0, function* () {\n // noop\n }));\n });\n return runDialogs;\n }","onDispose() {\n return __awaiter(this, void 0, void 0, function* () {\n if (this.arena.winner && this.arena.loser)\n try {\n yield this.updateGameRecords(this.arena.winner, this.arena.loser);\n if (!this.updateMissions)\n return;\n yield this.updateMissionGoals(this.arena.winner, this.arena.loser);\n if (!this.allowMatchCalculations)\n return;\n yield results.updateGameResults(Object.assign(Object.assign({}, this.arena.loser.season), { coins: this.arena.loser.coins, season: 1, id: this.arena.loser.id }));\n yield results.updateGameResults(Object.assign(Object.assign({}, this.arena.winner.season), { coins: this.arena.winner.coins, season: 1, id: this.arena.winner.id }));\n }\n catch (e) {\n logger_1.log.error(e);\n }\n });\n }","exitPair(ctx) {\n }","function YieldExpression(node, parent) {\n\t return t.isBinary(parent) || t.isUnaryLike(parent) || t.isCallExpression(parent) || t.isMemberExpression(parent) || t.isNewExpression(parent) || t.isConditionalExpression(parent) || t.isYieldExpression(parent);\n\t}","function YieldExpression(node, parent) {\n\t return t.isBinary(parent) || t.isUnaryLike(parent) || t.isCallExpression(parent) || t.isMemberExpression(parent) || t.isNewExpression(parent) || t.isConditionalExpression(parent) || t.isYieldExpression(parent);\n\t}","_displayBlocks() { /////////////////////\n return (\n <ViroNode>\n {this._makeBlocks()}\n </ViroNode>\n )\n }","function generator2() {\n yield 5;\n}","*forwards() {\r\n yield this;\r\n yield* this.descendants();\r\n }","function YieldExpression(node, parent) {\n return t.isBinary(parent) || t.isUnaryLike(parent) || t.isCallExpression(parent) || t.isMemberExpression(parent) || t.isNewExpression(parent) || t.isConditionalExpression(parent) || t.isYieldExpression(parent);\n}","*entries() {\n for (const item of this) {\n yield [item, item];\n }\n }","exitPair(ctx) {\n\t}","render() {\r\n return;\r\n }","*all() {\n for (let cur = this.from; cur <= this.to; cur++) {\n yield this.glass(Address4.fromInteger(cur).address)\n }\n }","function returnHandler(data){\n allHandle(data);\n }","function handleOneNext() {\n var prevResult = arguments.length <= 0 || arguments[0] === undefined ? null : arguments[0];\n\n try {\n var yielded = genObj.next(prevResult); // may throw\n if (yielded.done) {\n if (yielded.value !== undefined) {\n // Something was explicitly returned:\n // Report the value as a result to the caller\n callbacks.success(yielded.value);\n }\n } else {\n setTimeout(runYieldedValue, 0, yielded.value);\n }\n }\n // Catch unforeseen errors in genObj\n catch (error) {\n if (callbacks) {\n callbacks.failure(error);\n } else {\n throw error;\n }\n }\n }","render() {\n\n // for i of x\n\n // RULE 5: MUST RETURN BACK JSX\n return (\n <div className=\"MYMEMES\">\n { bla() }\n { array.map( (val) => {\n return this.videos(val.imgSrc, val.title);\n })\n }\n </div>\n );\n }","function stackConsumers(retFn) {\n const values = [];\n let fn = () => retFn(values);\n\n for (let i = 0; i < contexts.length; i++) {\n const Context = contexts[i];\n const childFn = fn;\n\n fn = () => (\n <Context.Consumer>\n {(value) => {\n values[i] = value;\n return childFn();\n }}\n </Context.Consumer>\n );\n }\n\n return fn();\n}","*nodes(){\n if(!this.root) return;\n let stack = [this.root];\n while(stack.length){\n const node = stack.pop();\n if(node.left) stack.push(node.left);\n if(node.right) stack.push(node.right);\n yield node;\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 }","*match(root) {\n const context = { scope: root };\n yield* this.matchInternal(root, 0, context);\n }","onCloseTag() {\n const poppedTag = this.activeTagStack.pop();\n // If we were converting a tag to a string, and the tag was not self-closing, close it here.\n if (poppedTag.childrenStringEmitClosingTag) {\n poppedTag.childrenStringTags.push(poppedTag.childrenStringEmitClosingTag);\n }\n // Set the literal value if we were collecting XML tags to string\n if (poppedTag.childrenTagsToString) {\n poppedTag.datatype = this.dataFactory.namedNode(RdfXmlParser.RDF + 'XMLLiteral');\n poppedTag.text = poppedTag.childrenStringTags.join('');\n poppedTag.hadChildren = false; // Force a literal triple to be emitted hereafter\n }\n if (poppedTag.childrenCollectionSubject) {\n // Terminate the rdf:List\n this.emitTriple(poppedTag.childrenCollectionSubject, poppedTag.childrenCollectionPredicate, this.dataFactory.namedNode(RdfXmlParser.RDF + 'nil'), poppedTag.reifiedStatementId);\n }\n else if (poppedTag.predicate) {\n if (!poppedTag.hadChildren && poppedTag.childrenParseType !== ParseType.PROPERTY) {\n // Property element contains text\n this.emitTriple(poppedTag.subject, poppedTag.predicate, this.dataFactory.literal(poppedTag.text || '', poppedTag.datatype || poppedTag.language), poppedTag.reifiedStatementId);\n }\n else if (!poppedTag.predicateEmitted) {\n // Emit remaining properties on an anonymous property element\n const subject = this.dataFactory.blankNode();\n this.emitTriple(poppedTag.subject, poppedTag.predicate, subject, poppedTag.reifiedStatementId);\n for (let i = 0; i < poppedTag.predicateSubPredicates.length; i++) {\n this.emitTriple(subject, poppedTag.predicateSubPredicates[i], poppedTag.predicateSubObjects[i], null);\n }\n }\n }\n }","*blocks() {\r\n\t\tfor (let i = 0; i < this.#blocks.length; i++) {\r\n\t\t\tyield this.#blocks[i]\r\n\t\t}\r\n\t}","function _contextNext() {\n\t\n\t // Get the next node from the sequence\n\t if (!this._contextState.nextSequence) {\n\t return undefined;\n\t }\n\t if (this._context.reverse) {\n\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\n\t if (!this._contextState.nextSequence) {\n\t return undefined;\n\t }\n\t }\n\t var renderNode = this._contextState.nextSequence.get();\n\t if (!renderNode) {\n\t this._contextState.nextSequence = undefined;\n\t return undefined;\n\t }\n\t var nextSequence = this._contextState.nextSequence;\n\t if (!this._context.reverse) {\n\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\n\t }\n\t if (this._contextState.lastRenderNode === renderNode) {\n\t throw 'ViewSequence is corrupted, should never contain the same renderNode twice, index: ' + nextSequence.getIndex();\n\t }\n\t this._contextState.lastRenderNode = renderNode;\n\t return {\n\t renderNode: renderNode,\n\t viewSequence: nextSequence,\n\t next: true,\n\t index: ++this._contextState.nextGetIndex\n\t };\n\t }","exitDecorated(ctx) {\n\t}","exitBlock(ctx) {\n\t}","render() {\n\t\treturn (\n\t\t\tnull\n\t\t)\n\t}","function decorateContextFunction(ctx, next) {\r\n ctx.render = (content) => render(content, document.querySelector('main'));\r\n ctx.setUserNav = setUserNav;\r\n next();\r\n}","function renderEverything() {\n renderPepperonni()\n renderMushrooms()\n renderGreenPeppers()\n renderWhiteSauce()\n renderGlutenFreeCrust()\n\n renderButtons()\n renderPrice()\n}","function renderEverything() {\n renderPepperonni()\n renderMushrooms()\n renderGreenPeppers()\n renderWhiteSauce()\n renderGlutenFreeCrust()\n\n renderButtons()\n renderPrice()\n}","function allPages(req, res, template, block, next) {\n\n // All available parameters\n // NOTE: This only works here because this template is last:true (see exports).\n var params = res.params;\n\n // Get some data (e.g. this could be a call off to Mongo based on the params\n var item = {\n variable: \"Hello World\",\n params: params\n };\n\n // Now render the output\n calipso.theme.renderItem(req, res, template, block, {\n item: item\n },next);\n\n}","routeCallback(req, res) {\n return __awaiter(this, void 0, void 0, function* () {\n try {\n return yield this.callback(req, res);\n }\n catch (error) {\n this.handleError(error, res);\n }\n });\n }","squareToRender() {\n const element = [];\n for (let i = 0; i < 3; i++) {\n element.push(this.handleSquare(i))\n }\n return element.map((item, index) => <Fragment key={index}>{item}</Fragment>);\n }","getEventsToRender() {}","function YieldBlock(to, params) {\n return [op('SimpleArgs', {\n params,\n hash: null,\n atNames: true\n }), op(23\n /* GetBlock */\n , to), op(24\n /* SpreadBlock */\n ), op('Option', op(60\n /* CompileBlock */\n )), op(63\n /* InvokeYield */\n ), op(39\n /* PopScope */\n ), op(1\n /* PopFrame */\n )];\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","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","* iterNodeIds() {\n yield* this.nodes.keys();\n }","*descendants() {\r\n let state = this.next;\r\n while (state != null) {\r\n yield state;\r\n state = state.next;\r\n }\r\n }","function renderEverything() {\n renderPepperonni() ;\n renderMushrooms() ;\n renderGreenPeppers() ;\n renderWhiteSauce() ;\n renderGlutenFreeCrust() ;\n // renderButtons() -- not done, integrated this into the render of each ingredient ;\n renderPrice() ;\n}","async *walk() {\n for await (let relPath of this.walkRecursively('')) {\n yield relPath;\n }\n }","*[Symbol.iterator]() {\n for (let node = this.first, position = 0; node; position++, node = node.next) {\n yield node.value;\n }\n }","render() {\n return <> </>\n }","*backwards() {\r\n yield this;\r\n yield* this.ancestors();\r\n }","static rendered () {}","static rendered () {}","ReturnStatement(path) {\n if (path.node.argument.type === 'SequenceExpression') {\n path.replaceWithMultiple(\n path.node.argument.expressions.map(e => t.expressionStatement(e))\n );\n }\n }","render() {\n\t\tthis.a1.render(this.context);\n\t\tthis.b1.render(this.context);\n\t\tthis.c1.render(this.context);\n\t\tthis.c2.render(this.context);\n\t\tthis.d1.render(this.context);\n\t\tthis.e1.render(this.context);\n\t\tthis.f1.render(this.context);\n\t\tthis.g1.render(this.context);\n\t\tthis.a1s.render(this.context);\n\t\tthis.c1s.render(this.context);\n\t\tthis.d1s.render(this.context);\n\t\tthis.f1s.render(this.context);\n\t\tthis.g1s.render(this.context);\n\n\t}","function generators() {\n\t\t\t\tBlockly.JavaScript.fw = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.rr = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.rl = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.lt = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.start = function(block) {\n\t\t\t\t\treturn '';\n\t\t\t\t};\n\t\t\t}","function generator(node) {\n\t var body = [];\n\t var container = t.functionExpression(null, [], t.blockStatement(body), true);\n\t container.shadow = true;\n\n\t body.push(_helpersBuildComprehension2[\"default\"](node, function () {\n\t return t.expressionStatement(t.yieldExpression(node.body));\n\t }));\n\n\t return t.callExpression(container, []);\n\t}","function generator(node) {\n\t var body = [];\n\t var container = t.functionExpression(null, [], t.blockStatement(body), true);\n\t container.shadow = true;\n\n\t body.push(_helpersBuildComprehension2[\"default\"](node, function () {\n\t return t.expressionStatement(t.yieldExpression(node.body));\n\t }));\n\n\t return t.callExpression(container, []);\n\t}","function _contextNext() {\n\n\t // Get the next node from the sequence\n\t if (!this._contextState.nextSequence) {\n\t return undefined;\n\t }\n\t if (this._context.reverse) {\n\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\n\t if (!this._contextState.nextSequence) {\n\t return undefined;\n\t }\n\t }\n\t var renderNode = this._contextState.nextSequence.get();\n\t if (!renderNode) {\n\t this._contextState.nextSequence = undefined;\n\t return undefined;\n\t }\n\t var nextSequence = this._contextState.nextSequence;\n\t if (!this._context.reverse) {\n\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\n\t }\n\t return {\n\t renderNode: renderNode,\n\t viewSequence: nextSequence,\n\t next: true,\n\t index: ++this._contextState.nextGetIndex\n\t };\n\t }","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n renderButtons();\n renderPrice();\n renderReceipt()\n}","onUnload(callback) {\n return __awaiter(this, void 0, void 0, function* () {\n try {\n if (this.refreshEufySecurityTimeout)\n clearTimeout(this.refreshEufySecurityTimeout);\n yield this.clearEvents(this.personDetected, types_1.CameraStateID.PERSON_DETECTED);\n yield this.clearEvents(this.motionDetected, types_1.CameraStateID.MOTION_DETECTED);\n yield this.clearEvents(this.ringing, types_1.DoorbellStateID.RINGING);\n yield this.clearEvents(this.cryingDetected, types_1.IndoorCameraStateID.CRYING_DETECTED);\n yield this.clearEvents(this.soundDetected, types_1.IndoorCameraStateID.SOUND_DETECTED);\n yield this.clearEvents(this.petDetected, types_1.IndoorCameraStateID.PET_DETECTED);\n yield this.clearEvents(this.downloadEvent);\n if (this.eufy)\n this.setPushPersistentIds(this.eufy.getPushPersistentIds());\n this.writePersistentData();\n if (this.eufy)\n this.eufy.close();\n callback();\n }\n catch (e) {\n callback();\n }\n });\n }","function execute(generator, yieldValue) {\r\n let next = generator.next(yieldValue);\r\n\r\n if (!next.done) {\r\n next.value.then(\r\n result => execute(generator, result),\r\n err => generator.throw(err)\r\n );\r\n } else {\r\n // block is for 'return' from generators\r\n alert(next.value);\r\n }\r\n}","function renderEverything() {\n renderPepperonni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n renderPrice();\n}","exitWrappedGraph(ctx) {\n\t}","exitComp_iter(ctx) {\n\t}","function complete(){\n callbackCount++;\n if(callbackCount >= 1){\n // console.log(context)\n res.render('users', context);\n }\n }","function get_each_context$8(ctx, list, i) {\n var child_ctx = ctx.slice();\n child_ctx[10] = list[i];\n return child_ctx;\n } // (49:0) {#if items && items.length}","visitChildren(ctx) {\n if (!ctx) {\n return;\n }\n if (ctx.children) {\n return ctx.children.map((child) => {\n if (child.children && child.children.length !== 0) {\n return child.accept(this);\n }\n return child.getText();\n });\n }\n }","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function renderEverything() {\n renderPepperoni();\n renderMushrooms();\n renderGreenPeppers();\n renderWhiteSauce();\n renderGlutenFreeCrust();\n\n renderButtons();\n renderPrice();\n}","function generator(node) {\n var body = [];\n var container = t.functionExpression(null, [], t.blockStatement(body), true);\n container.shadow = true;\n\n body.push(_helpersBuildComprehension2[\"default\"](node, function () {\n return t.expressionStatement(t.yieldExpression(node.body));\n }));\n\n return t.callExpression(container, []);\n}","exitDecorators(ctx) {\n\t}","function hzYieldArg(argExp, delegate = false) {\n\t\tconst callExp = hzYield();\n\t\tcallExp.callee.property.name = \"yieldValue\";\n\t\tcallExp.arguments[0].properties[0].value = argExp;\n\t\tcallExp.arguments[1] = t.BooleanLiteral(delegate);\n\t\treturn callExp;\n\t}","renderResponse(responseURI, response) {\n return __awaiter(this, void 0, void 0, function* () {\n yield this.renderResponseConcrete(responseURI, response);\n });\n }","exitList_iter(ctx) {\n\t}","function Test_GetAdminMsg() {\n return __awaiter(this, void 0, void 0, function () {\n var out_rpc_msg;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n console.log(\"Begin: Test_GetAdminMsg\");\n return [4 /*yield*/, api.GetAdminMsg()];\n case 1:\n out_rpc_msg = _a.sent();\n console.log(out_rpc_msg);\n console.log(\"End: Test_GetAdminMsg\");\n console.log(\"-----\");\n console.log();\n return [2 /*return*/];\n }\n });\n });\n}"],"string":"[\n \"exitYield_stmt(ctx) {\\n\\t}\",\n \"exitYield_expr(ctx) {\\n\\t}\",\n \"function hzYield() {\\n\\t\\treturn t.callExpression(\\n\\t\\t\\tt.memberExpression(\\n\\t\\t\\t\\tt.identifier(\\\"hzUserLib\\\"),\\n\\t\\t\\t\\tt.identifier(\\\"yield\\\")\\n\\t\\t\\t),\\n\\t\\t\\t[t.ObjectExpression([\\n\\t\\t\\t\\tt.ObjectProperty(t.identifier(\\\"value\\\"), t.identifier(\\\"undefined\\\")),\\n\\t\\t\\t\\tt.ObjectProperty(t.identifier(\\\"done\\\"), t.BooleanLiteral(false))\\n\\t\\t\\t])]\\n\\t\\t);\\n\\t}\",\n \"enterYield_stmt(ctx) {\\n\\t}\",\n \"function _render() {\\n _render = (0, _asyncToGenerator2.default)(\\n /*#__PURE__*/\\n _regenerator.default.mark(function _callee2(props) {\\n return _regenerator.default.wrap(\\n function _callee2$(_context2) {\\n while (1) {\\n switch ((_context2.prev = _context2.next)) {\\n case 0:\\n if (!props.err) {\\n _context2.next = 4;\\n break;\\n }\\n\\n _context2.next = 3;\\n return renderError(props);\\n\\n case 3:\\n return _context2.abrupt(\\\"return\\\");\\n\\n case 4:\\n _context2.prev = 4;\\n _context2.next = 7;\\n return doRender(props);\\n\\n case 7:\\n _context2.next = 13;\\n break;\\n\\n case 9:\\n _context2.prev = 9;\\n _context2.t0 = _context2[\\\"catch\\\"](4);\\n _context2.next = 13;\\n return renderError(\\n (0, _objectSpread2.default)({}, props, {\\n err: _context2.t0,\\n })\\n );\\n\\n case 13:\\n case \\\"end\\\":\\n return _context2.stop();\\n }\\n }\\n },\\n _callee2,\\n this,\\n [[4, 9]]\\n );\\n })\\n );\\n return _render.apply(this, arguments);\\n }\",\n \"function parseYield() {\\n next();\\n if (!match(TokenType.semi) && !canInsertSemicolon()) {\\n eat(TokenType.star);\\n parseMaybeAssign();\\n }\\n}\",\n \"enterYield_expr(ctx) {\\n\\t}\",\n \"function matchYield(){return state.yieldAllowed && matchKeyword('yield',!strict);}\",\n \"function matchYield() {\\n return state.yieldAllowed && matchKeyword('yield', !strict);\\n }\",\n \"function matchYield() {\\n return state.yieldAllowed && matchKeyword('yield', !strict);\\n }\",\n \"function matchYield() {\\n return state.yieldAllowed && matchKeyword('yield', !strict);\\n }\",\n \"function matchYield() {\\n return state.yieldAllowed && matchKeyword('yield', !strict);\\n }\",\n \"function matchYield() {\\n return state.yieldAllowed && matchKeyword('yield', !strict);\\n }\",\n \"function parseYieldExpression() {\\n\\t var argument, expr, delegate, previousAllowYield;\\n\\n\\t argument = null;\\n\\t expr = new Node();\\n\\t delegate = false;\\n\\n\\t expectKeyword('yield');\\n\\n\\t if (!hasLineTerminator) {\\n\\t previousAllowYield = state.allowYield;\\n\\t state.allowYield = false;\\n\\t delegate = match('*');\\n\\t if (delegate) {\\n\\t lex();\\n\\t argument = parseAssignmentExpression();\\n\\t } else {\\n\\t if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\\n\\t argument = parseAssignmentExpression();\\n\\t }\\n\\t }\\n\\t state.allowYield = previousAllowYield;\\n\\t }\\n\\n\\t return expr.finishYieldExpression(argument, delegate);\\n\\t }\",\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 \"formatYieldChildren(children){\\n let {labelName, valueName, \\n placeHolder, multi, style, className} = this.props;\\n const {filterText, value, open} = this.state;\\n\\n let nodes = [], tags = [];\\n React.Children.map(children, (item, index) => {\\n const props = item.props;\\n const item_val = props[valueName];\\n const item_label = props[labelName];\\n let selected = false;\\n if (multi) {\\n const _index = value.indexOf(item_val);\\n selected = _index !== -1;\\n if(selected) tags[_index] = item_label;\\n } else {\\n selected = value === item_val;\\n if (selected) {\\n placeHolder = item_label;\\n }\\n }\\n \\n if(this.filterTextMatched(filterText, item_label, item_val)) {\\n nodes.push(\\n <DropDownOption key={index}\\n value={item_val} \\n label={item_label}\\n disabled={props.disabled}\\n onClick={() => this.handleChangeSelect(item_val)}\\n selected={selected}>\\n {props.children}\\n </DropDownOption>\\n )\\n }\\n });\\n\\n let labelNode = this.formatLabel(multi ? tags : placeHolder)\\n\\n className = klassName('dropdown', className);\\n\\n if (open) {\\n className = `${className} _active`;\\n }\\n\\n return <div className={className} style={style}>\\n {labelNode}\\n <span className=\\\"_list\\\">\\n {open ? nodes : null}\\n {this.formatLoading()}\\n </span>\\n </div>;\\n }\",\n \"function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\\n return function (blockArguments, self) {\\n // Render state is used to track the progress of the helper (since it\\n // may call into us multiple times). As the user-land helper calls\\n // into library code, we track what needs to be cleaned up after the\\n // helper has returned.\\n //\\n // Here, we remember that a template has been yielded and so we do not\\n // need to remove the previous template. (If no template is yielded\\n // this render by the helper, we assume nothing should be shown and\\n // remove any previous rendered templates.)\\n renderState.morphToClear = null;\\n\\n // In this conditional is true, it means that on the previous rendering pass\\n // the helper yielded multiple items via `yieldItem()`, but this time they\\n // are yielding a single template. In that case, we mark the morph list for\\n // cleanup so it is removed from the DOM.\\n if (morph.morphList) {\\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\\n renderState.morphListToClear = null;\\n }\\n\\n var scope = parentScope;\\n\\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\\n }\\n\\n // Check to make sure that we actually **need** a new scope, and can't\\n // share the parent scope. Note that we need to move this check into\\n // a host hook, because the host's notion of scope may require a new\\n // scope in more cases than the ones we can determine statically.\\n if (self !== undefined || parentScope === null || template.arity) {\\n scope = env.hooks.createChildScope(parentScope);\\n }\\n\\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\\n\\n // Render the template that was selected by the helper\\n var renderOptions = new _render.RenderOptions(morph, self, blockArguments);\\n _render2.default(template, env, scope, renderOptions);\\n };\\n}\",\n \"handle(context, type, onNext) {\\n return __awaiter(this, void 0, void 0, function* () {\\n let returnValue = null;\\n function runHandler(index) {\\n return __awaiter(this, void 0, void 0, function* () {\\n if (index < handlers.length) {\\n const val = yield handlers[index](context, () => runHandler(index + 1));\\n // if a value is returned, and we have not yet set the return value,\\n // capture it. This is used to allow InvokeResponses to be returned.\\n if (typeof (val) !== 'undefined' && returnValue === null) {\\n returnValue = val;\\n }\\n }\\n else {\\n const val = yield onNext();\\n if (typeof (val) !== 'undefined') {\\n returnValue = val;\\n }\\n }\\n });\\n }\\n const handlers = this.handlers[type] || [];\\n yield runHandler(0);\\n return returnValue;\\n });\\n }\",\n \"function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\\n return function (blockArguments, self) {\\n // Render state is used to track the progress of the helper (since it\\n // may call into us multiple times). As the user-land helper calls\\n // into library code, we track what needs to be cleaned up after the\\n // helper has returned.\\n //\\n // Here, we remember that a template has been yielded and so we do not\\n // need to remove the previous template. (If no template is yielded\\n // this render by the helper, we assume nothing should be shown and\\n // remove any previous rendered templates.)\\n renderState.morphToClear = null;\\n\\n // In this conditional is true, it means that on the previous rendering pass\\n // the helper yielded multiple items via `yieldItem()`, but this time they\\n // are yielding a single template. In that case, we mark the morph list for\\n // cleanup so it is removed from the DOM.\\n if (morph.morphList) {\\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\\n renderState.morphListToClear = null;\\n }\\n\\n var scope = parentScope;\\n\\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\\n }\\n\\n // Check to make sure that we actually **need** a new scope, and can't\\n // share the parent scope. Note that we need to move this check into\\n // a host hook, because the host's notion of scope may require a new\\n // scope in more cases than the ones we can determine statically.\\n if (self !== undefined || parentScope === null || template.arity) {\\n scope = env.hooks.createChildScope(parentScope);\\n }\\n\\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\\n\\n // Render the template that was selected by the helper\\n var renderOptions = new _render.RenderOptions(morph, self, blockArguments);\\n _render.default(template, env, scope, renderOptions);\\n };\\n }\",\n \"function parseYieldExpression() {\\n var argument, expr, delegate, previousAllowYield;\\n\\n argument = null;\\n expr = new Node();\\n delegate = false;\\n\\n expectKeyword('yield');\\n\\n if (!hasLineTerminator) {\\n previousAllowYield = state.allowYield;\\n state.allowYield = false;\\n delegate = match('*');\\n if (delegate) {\\n lex();\\n argument = parseAssignmentExpression();\\n } else {\\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\\n argument = parseAssignmentExpression();\\n }\\n }\\n state.allowYield = previousAllowYield;\\n }\\n\\n return expr.finishYieldExpression(argument, delegate);\\n }\",\n \"function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\\n return function (blockArguments, self) {\\n // Render state is used to track the progress of the helper (since it\\n // may call into us multiple times). As the user-land helper calls\\n // into library code, we track what needs to be cleaned up after the\\n // helper has returned.\\n //\\n // Here, we remember that a template has been yielded and so we do not\\n // need to remove the previous template. (If no template is yielded\\n // this render by the helper, we assume nothing should be shown and\\n // remove any previous rendered templates.)\\n renderState.morphToClear = null;\\n\\n // In this conditional is true, it means that on the previous rendering pass\\n // the helper yielded multiple items via `yieldItem()`, but this time they\\n // are yielding a single template. In that case, we mark the morph list for\\n // cleanup so it is removed from the DOM.\\n if (morph.morphList) {\\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\\n renderState.morphListToClear = null;\\n }\\n\\n var scope = parentScope;\\n\\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\\n }\\n\\n // Check to make sure that we actually **need** a new scope, and can't\\n // share the parent scope. Note that we need to move this check into\\n // a host hook, because the host's notion of scope may require a new\\n // scope in more cases than the ones we can determine statically.\\n if (self !== undefined || parentScope === null || template.arity) {\\n scope = env.hooks.createChildScope(parentScope);\\n }\\n\\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\\n\\n // Render the template that was selected by the helper\\n _render.default(template, env, scope, { renderNode: morph, self: self, blockArguments: blockArguments });\\n };\\n }\",\n \"function yieldTemplate(template, env, parentScope, morph, renderState, visitor) {\\n return function (blockArguments, self) {\\n // Render state is used to track the progress of the helper (since it\\n // may call into us multiple times). As the user-land helper calls\\n // into library code, we track what needs to be cleaned up after the\\n // helper has returned.\\n //\\n // Here, we remember that a template has been yielded and so we do not\\n // need to remove the previous template. (If no template is yielded\\n // this render by the helper, we assume nothing should be shown and\\n // remove any previous rendered templates.)\\n renderState.morphToClear = null;\\n\\n // In this conditional is true, it means that on the previous rendering pass\\n // the helper yielded multiple items via `yieldItem()`, but this time they\\n // are yielding a single template. In that case, we mark the morph list for\\n // cleanup so it is removed from the DOM.\\n if (morph.morphList) {\\n _htmlbarsUtilTemplateUtils.clearMorphList(morph.morphList, morph, env);\\n renderState.morphListToClear = null;\\n }\\n\\n var scope = parentScope;\\n\\n if (morph.lastYielded && isStableTemplate(template, morph.lastYielded)) {\\n return morph.lastResult.revalidateWith(env, undefined, self, blockArguments, visitor);\\n }\\n\\n // Check to make sure that we actually **need** a new scope, and can't\\n // share the parent scope. Note that we need to move this check into\\n // a host hook, because the host's notion of scope may require a new\\n // scope in more cases than the ones we can determine statically.\\n if (self !== undefined || parentScope === null || template.arity) {\\n scope = env.hooks.createChildScope(parentScope);\\n }\\n\\n morph.lastYielded = { self: self, template: template, shadowTemplate: null };\\n\\n // Render the template that was selected by the helper\\n _render.default(template, env, scope, { renderNode: morph, self: self, blockArguments: blockArguments });\\n };\\n }\",\n \"*end() {\\n while (this.stack.length > 0)\\n yield* this.pop();\\n }\",\n \"function parseYieldExpression() {\\n var argument, expr, delegate, previousAllowYield;\\n\\n argument = null;\\n expr = new Node();\\n\\n expectKeyword('yield');\\n\\n if (!hasLineTerminator) {\\n previousAllowYield = state.allowYield;\\n state.allowYield = false;\\n delegate = match('*');\\n if (delegate) {\\n lex();\\n argument = parseAssignmentExpression();\\n } else {\\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\\n argument = parseAssignmentExpression();\\n }\\n }\\n state.allowYield = previousAllowYield;\\n }\\n\\n return expr.finishYieldExpression(argument, delegate);\\n }\",\n \"function parseYieldExpression() {\\n var argument, expr, delegate, previousAllowYield;\\n\\n argument = null;\\n expr = new Node();\\n delegate = false;\\n\\n expectKeyword('yield');\\n\\n if (!hasLineTerminator) {\\n previousAllowYield = state.allowYield;\\n state.allowYield = false;\\n delegate = match('*');\\n if (delegate) {\\n lex();\\n argument = parseAssignmentExpression();\\n } else {\\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\\n argument = parseAssignmentExpression();\\n }\\n }\\n state.allowYield = previousAllowYield;\\n }\\n\\n return expr.finishYieldExpression(argument, delegate);\\n }\",\n \"function parseYieldExpression() {\\n var argument, expr, delegate, previousAllowYield;\\n\\n argument = null;\\n expr = new Node();\\n delegate = false;\\n\\n expectKeyword('yield');\\n\\n if (!hasLineTerminator) {\\n previousAllowYield = state.allowYield;\\n state.allowYield = false;\\n delegate = match('*');\\n if (delegate) {\\n lex();\\n argument = parseAssignmentExpression();\\n } else {\\n if (!match(';') && !match('}') && !match(')') && lookahead.type !== Token.EOF) {\\n argument = parseAssignmentExpression();\\n }\\n }\\n state.allowYield = previousAllowYield;\\n }\\n\\n return expr.finishYieldExpression(argument, delegate);\\n }\",\n \"function parseYieldExpression() {\\n var argument, expr, delegate;\\n\\n expr = new Node();\\n\\n if (!state.allowYield) {\\n tolerateUnexpectedToken(lookahead, Messages.IllegalYield);\\n }\\n\\n expectKeyword('yield');\\n\\n if (!hasLineTerminator) {\\n delegate = match('*');\\n if (delegate) {\\n lex();\\n argument = parseExpression();\\n } else {\\n if (!match(';') && !match('}') && lookahead.type !== Token.EOF) {\\n argument = parseExpression();\\n }\\n }\\n }\\n\\n return expr.finishYieldExpression(argument, delegate);\\n }\",\n \"*end() {\\n while (this.stack.length > 0)\\n yield* this.pop();\\n }\",\n \"defaultNextEvent(context) {\\n const runDialogs = () => __awaiter(this, void 0, void 0, function* () {\\n yield this.handle(context, 'Dialog', () => __awaiter(this, void 0, void 0, function* () {\\n // noop\\n }));\\n });\\n return runDialogs;\\n }\",\n \"onDispose() {\\n return __awaiter(this, void 0, void 0, function* () {\\n if (this.arena.winner && this.arena.loser)\\n try {\\n yield this.updateGameRecords(this.arena.winner, this.arena.loser);\\n if (!this.updateMissions)\\n return;\\n yield this.updateMissionGoals(this.arena.winner, this.arena.loser);\\n if (!this.allowMatchCalculations)\\n return;\\n yield results.updateGameResults(Object.assign(Object.assign({}, this.arena.loser.season), { coins: this.arena.loser.coins, season: 1, id: this.arena.loser.id }));\\n yield results.updateGameResults(Object.assign(Object.assign({}, this.arena.winner.season), { coins: this.arena.winner.coins, season: 1, id: this.arena.winner.id }));\\n }\\n catch (e) {\\n logger_1.log.error(e);\\n }\\n });\\n }\",\n \"exitPair(ctx) {\\n }\",\n \"function YieldExpression(node, parent) {\\n\\t return t.isBinary(parent) || t.isUnaryLike(parent) || t.isCallExpression(parent) || t.isMemberExpression(parent) || t.isNewExpression(parent) || t.isConditionalExpression(parent) || t.isYieldExpression(parent);\\n\\t}\",\n \"function YieldExpression(node, parent) {\\n\\t return t.isBinary(parent) || t.isUnaryLike(parent) || t.isCallExpression(parent) || t.isMemberExpression(parent) || t.isNewExpression(parent) || t.isConditionalExpression(parent) || t.isYieldExpression(parent);\\n\\t}\",\n \"_displayBlocks() { /////////////////////\\n return (\\n <ViroNode>\\n {this._makeBlocks()}\\n </ViroNode>\\n )\\n }\",\n \"function generator2() {\\n yield 5;\\n}\",\n \"*forwards() {\\r\\n yield this;\\r\\n yield* this.descendants();\\r\\n }\",\n \"function YieldExpression(node, parent) {\\n return t.isBinary(parent) || t.isUnaryLike(parent) || t.isCallExpression(parent) || t.isMemberExpression(parent) || t.isNewExpression(parent) || t.isConditionalExpression(parent) || t.isYieldExpression(parent);\\n}\",\n \"*entries() {\\n for (const item of this) {\\n yield [item, item];\\n }\\n }\",\n \"exitPair(ctx) {\\n\\t}\",\n \"render() {\\r\\n return;\\r\\n }\",\n \"*all() {\\n for (let cur = this.from; cur <= this.to; cur++) {\\n yield this.glass(Address4.fromInteger(cur).address)\\n }\\n }\",\n \"function returnHandler(data){\\n allHandle(data);\\n }\",\n \"function handleOneNext() {\\n var prevResult = arguments.length <= 0 || arguments[0] === undefined ? null : arguments[0];\\n\\n try {\\n var yielded = genObj.next(prevResult); // may throw\\n if (yielded.done) {\\n if (yielded.value !== undefined) {\\n // Something was explicitly returned:\\n // Report the value as a result to the caller\\n callbacks.success(yielded.value);\\n }\\n } else {\\n setTimeout(runYieldedValue, 0, yielded.value);\\n }\\n }\\n // Catch unforeseen errors in genObj\\n catch (error) {\\n if (callbacks) {\\n callbacks.failure(error);\\n } else {\\n throw error;\\n }\\n }\\n }\",\n \"render() {\\n\\n // for i of x\\n\\n // RULE 5: MUST RETURN BACK JSX\\n return (\\n <div className=\\\"MYMEMES\\\">\\n { bla() }\\n { array.map( (val) => {\\n return this.videos(val.imgSrc, val.title);\\n })\\n }\\n </div>\\n );\\n }\",\n \"function stackConsumers(retFn) {\\n const values = [];\\n let fn = () => retFn(values);\\n\\n for (let i = 0; i < contexts.length; i++) {\\n const Context = contexts[i];\\n const childFn = fn;\\n\\n fn = () => (\\n <Context.Consumer>\\n {(value) => {\\n values[i] = value;\\n return childFn();\\n }}\\n </Context.Consumer>\\n );\\n }\\n\\n return fn();\\n}\",\n \"*nodes(){\\n if(!this.root) return;\\n let stack = [this.root];\\n while(stack.length){\\n const node = stack.pop();\\n if(node.left) stack.push(node.left);\\n if(node.right) stack.push(node.right);\\n yield node;\\n }\\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 \"*match(root) {\\n const context = { scope: root };\\n yield* this.matchInternal(root, 0, context);\\n }\",\n \"onCloseTag() {\\n const poppedTag = this.activeTagStack.pop();\\n // If we were converting a tag to a string, and the tag was not self-closing, close it here.\\n if (poppedTag.childrenStringEmitClosingTag) {\\n poppedTag.childrenStringTags.push(poppedTag.childrenStringEmitClosingTag);\\n }\\n // Set the literal value if we were collecting XML tags to string\\n if (poppedTag.childrenTagsToString) {\\n poppedTag.datatype = this.dataFactory.namedNode(RdfXmlParser.RDF + 'XMLLiteral');\\n poppedTag.text = poppedTag.childrenStringTags.join('');\\n poppedTag.hadChildren = false; // Force a literal triple to be emitted hereafter\\n }\\n if (poppedTag.childrenCollectionSubject) {\\n // Terminate the rdf:List\\n this.emitTriple(poppedTag.childrenCollectionSubject, poppedTag.childrenCollectionPredicate, this.dataFactory.namedNode(RdfXmlParser.RDF + 'nil'), poppedTag.reifiedStatementId);\\n }\\n else if (poppedTag.predicate) {\\n if (!poppedTag.hadChildren && poppedTag.childrenParseType !== ParseType.PROPERTY) {\\n // Property element contains text\\n this.emitTriple(poppedTag.subject, poppedTag.predicate, this.dataFactory.literal(poppedTag.text || '', poppedTag.datatype || poppedTag.language), poppedTag.reifiedStatementId);\\n }\\n else if (!poppedTag.predicateEmitted) {\\n // Emit remaining properties on an anonymous property element\\n const subject = this.dataFactory.blankNode();\\n this.emitTriple(poppedTag.subject, poppedTag.predicate, subject, poppedTag.reifiedStatementId);\\n for (let i = 0; i < poppedTag.predicateSubPredicates.length; i++) {\\n this.emitTriple(subject, poppedTag.predicateSubPredicates[i], poppedTag.predicateSubObjects[i], null);\\n }\\n }\\n }\\n }\",\n \"*blocks() {\\r\\n\\t\\tfor (let i = 0; i < this.#blocks.length; i++) {\\r\\n\\t\\t\\tyield this.#blocks[i]\\r\\n\\t\\t}\\r\\n\\t}\",\n \"function _contextNext() {\\n\\t\\n\\t // Get the next node from the sequence\\n\\t if (!this._contextState.nextSequence) {\\n\\t return undefined;\\n\\t }\\n\\t if (this._context.reverse) {\\n\\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\\n\\t if (!this._contextState.nextSequence) {\\n\\t return undefined;\\n\\t }\\n\\t }\\n\\t var renderNode = this._contextState.nextSequence.get();\\n\\t if (!renderNode) {\\n\\t this._contextState.nextSequence = undefined;\\n\\t return undefined;\\n\\t }\\n\\t var nextSequence = this._contextState.nextSequence;\\n\\t if (!this._context.reverse) {\\n\\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\\n\\t }\\n\\t if (this._contextState.lastRenderNode === renderNode) {\\n\\t throw 'ViewSequence is corrupted, should never contain the same renderNode twice, index: ' + nextSequence.getIndex();\\n\\t }\\n\\t this._contextState.lastRenderNode = renderNode;\\n\\t return {\\n\\t renderNode: renderNode,\\n\\t viewSequence: nextSequence,\\n\\t next: true,\\n\\t index: ++this._contextState.nextGetIndex\\n\\t };\\n\\t }\",\n \"exitDecorated(ctx) {\\n\\t}\",\n \"exitBlock(ctx) {\\n\\t}\",\n \"render() {\\n\\t\\treturn (\\n\\t\\t\\tnull\\n\\t\\t)\\n\\t}\",\n \"function decorateContextFunction(ctx, next) {\\r\\n ctx.render = (content) => render(content, document.querySelector('main'));\\r\\n ctx.setUserNav = setUserNav;\\r\\n next();\\r\\n}\",\n \"function renderEverything() {\\n renderPepperonni()\\n renderMushrooms()\\n renderGreenPeppers()\\n renderWhiteSauce()\\n renderGlutenFreeCrust()\\n\\n renderButtons()\\n renderPrice()\\n}\",\n \"function renderEverything() {\\n renderPepperonni()\\n renderMushrooms()\\n renderGreenPeppers()\\n renderWhiteSauce()\\n renderGlutenFreeCrust()\\n\\n renderButtons()\\n renderPrice()\\n}\",\n \"function allPages(req, res, template, block, next) {\\n\\n // All available parameters\\n // NOTE: This only works here because this template is last:true (see exports).\\n var params = res.params;\\n\\n // Get some data (e.g. this could be a call off to Mongo based on the params\\n var item = {\\n variable: \\\"Hello World\\\",\\n params: params\\n };\\n\\n // Now render the output\\n calipso.theme.renderItem(req, res, template, block, {\\n item: item\\n },next);\\n\\n}\",\n \"routeCallback(req, res) {\\n return __awaiter(this, void 0, void 0, function* () {\\n try {\\n return yield this.callback(req, res);\\n }\\n catch (error) {\\n this.handleError(error, res);\\n }\\n });\\n }\",\n \"squareToRender() {\\n const element = [];\\n for (let i = 0; i < 3; i++) {\\n element.push(this.handleSquare(i))\\n }\\n return element.map((item, index) => <Fragment key={index}>{item}</Fragment>);\\n }\",\n \"getEventsToRender() {}\",\n \"function YieldBlock(to, params) {\\n return [op('SimpleArgs', {\\n params,\\n hash: null,\\n atNames: true\\n }), op(23\\n /* GetBlock */\\n , to), op(24\\n /* SpreadBlock */\\n ), op('Option', op(60\\n /* CompileBlock */\\n )), op(63\\n /* InvokeYield */\\n ), op(39\\n /* PopScope */\\n ), op(1\\n /* PopFrame */\\n )];\\n}\",\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 \"* iterNodeIds() {\\n yield* this.nodes.keys();\\n }\",\n \"*descendants() {\\r\\n let state = this.next;\\r\\n while (state != null) {\\r\\n yield state;\\r\\n state = state.next;\\r\\n }\\r\\n }\",\n \"function renderEverything() {\\n renderPepperonni() ;\\n renderMushrooms() ;\\n renderGreenPeppers() ;\\n renderWhiteSauce() ;\\n renderGlutenFreeCrust() ;\\n // renderButtons() -- not done, integrated this into the render of each ingredient ;\\n renderPrice() ;\\n}\",\n \"async *walk() {\\n for await (let relPath of this.walkRecursively('')) {\\n yield relPath;\\n }\\n }\",\n \"*[Symbol.iterator]() {\\n for (let node = this.first, position = 0; node; position++, node = node.next) {\\n yield node.value;\\n }\\n }\",\n \"render() {\\n return <> </>\\n }\",\n \"*backwards() {\\r\\n yield this;\\r\\n yield* this.ancestors();\\r\\n }\",\n \"static rendered () {}\",\n \"static rendered () {}\",\n \"ReturnStatement(path) {\\n if (path.node.argument.type === 'SequenceExpression') {\\n path.replaceWithMultiple(\\n path.node.argument.expressions.map(e => t.expressionStatement(e))\\n );\\n }\\n }\",\n \"render() {\\n\\t\\tthis.a1.render(this.context);\\n\\t\\tthis.b1.render(this.context);\\n\\t\\tthis.c1.render(this.context);\\n\\t\\tthis.c2.render(this.context);\\n\\t\\tthis.d1.render(this.context);\\n\\t\\tthis.e1.render(this.context);\\n\\t\\tthis.f1.render(this.context);\\n\\t\\tthis.g1.render(this.context);\\n\\t\\tthis.a1s.render(this.context);\\n\\t\\tthis.c1s.render(this.context);\\n\\t\\tthis.d1s.render(this.context);\\n\\t\\tthis.f1s.render(this.context);\\n\\t\\tthis.g1s.render(this.context);\\n\\n\\t}\",\n \"function generators() {\\n\\t\\t\\t\\tBlockly.JavaScript.fw = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.rr = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.rl = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.lt = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.start = function(block) {\\n\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t};\\n\\t\\t\\t}\",\n \"function generator(node) {\\n\\t var body = [];\\n\\t var container = t.functionExpression(null, [], t.blockStatement(body), true);\\n\\t container.shadow = true;\\n\\n\\t body.push(_helpersBuildComprehension2[\\\"default\\\"](node, function () {\\n\\t return t.expressionStatement(t.yieldExpression(node.body));\\n\\t }));\\n\\n\\t return t.callExpression(container, []);\\n\\t}\",\n \"function generator(node) {\\n\\t var body = [];\\n\\t var container = t.functionExpression(null, [], t.blockStatement(body), true);\\n\\t container.shadow = true;\\n\\n\\t body.push(_helpersBuildComprehension2[\\\"default\\\"](node, function () {\\n\\t return t.expressionStatement(t.yieldExpression(node.body));\\n\\t }));\\n\\n\\t return t.callExpression(container, []);\\n\\t}\",\n \"function _contextNext() {\\n\\n\\t // Get the next node from the sequence\\n\\t if (!this._contextState.nextSequence) {\\n\\t return undefined;\\n\\t }\\n\\t if (this._context.reverse) {\\n\\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\\n\\t if (!this._contextState.nextSequence) {\\n\\t return undefined;\\n\\t }\\n\\t }\\n\\t var renderNode = this._contextState.nextSequence.get();\\n\\t if (!renderNode) {\\n\\t this._contextState.nextSequence = undefined;\\n\\t return undefined;\\n\\t }\\n\\t var nextSequence = this._contextState.nextSequence;\\n\\t if (!this._context.reverse) {\\n\\t this._contextState.nextSequence = this._contextState.nextSequence.getNext();\\n\\t }\\n\\t return {\\n\\t renderNode: renderNode,\\n\\t viewSequence: nextSequence,\\n\\t next: true,\\n\\t index: ++this._contextState.nextGetIndex\\n\\t };\\n\\t }\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n renderButtons();\\n renderPrice();\\n renderReceipt()\\n}\",\n \"onUnload(callback) {\\n return __awaiter(this, void 0, void 0, function* () {\\n try {\\n if (this.refreshEufySecurityTimeout)\\n clearTimeout(this.refreshEufySecurityTimeout);\\n yield this.clearEvents(this.personDetected, types_1.CameraStateID.PERSON_DETECTED);\\n yield this.clearEvents(this.motionDetected, types_1.CameraStateID.MOTION_DETECTED);\\n yield this.clearEvents(this.ringing, types_1.DoorbellStateID.RINGING);\\n yield this.clearEvents(this.cryingDetected, types_1.IndoorCameraStateID.CRYING_DETECTED);\\n yield this.clearEvents(this.soundDetected, types_1.IndoorCameraStateID.SOUND_DETECTED);\\n yield this.clearEvents(this.petDetected, types_1.IndoorCameraStateID.PET_DETECTED);\\n yield this.clearEvents(this.downloadEvent);\\n if (this.eufy)\\n this.setPushPersistentIds(this.eufy.getPushPersistentIds());\\n this.writePersistentData();\\n if (this.eufy)\\n this.eufy.close();\\n callback();\\n }\\n catch (e) {\\n callback();\\n }\\n });\\n }\",\n \"function execute(generator, yieldValue) {\\r\\n let next = generator.next(yieldValue);\\r\\n\\r\\n if (!next.done) {\\r\\n next.value.then(\\r\\n result => execute(generator, result),\\r\\n err => generator.throw(err)\\r\\n );\\r\\n } else {\\r\\n // block is for 'return' from generators\\r\\n alert(next.value);\\r\\n }\\r\\n}\",\n \"function renderEverything() {\\n renderPepperonni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n renderPrice();\\n}\",\n \"exitWrappedGraph(ctx) {\\n\\t}\",\n \"exitComp_iter(ctx) {\\n\\t}\",\n \"function complete(){\\n callbackCount++;\\n if(callbackCount >= 1){\\n // console.log(context)\\n res.render('users', context);\\n }\\n }\",\n \"function get_each_context$8(ctx, list, i) {\\n var child_ctx = ctx.slice();\\n child_ctx[10] = list[i];\\n return child_ctx;\\n } // (49:0) {#if items && items.length}\",\n \"visitChildren(ctx) {\\n if (!ctx) {\\n return;\\n }\\n if (ctx.children) {\\n return ctx.children.map((child) => {\\n if (child.children && child.children.length !== 0) {\\n return child.accept(this);\\n }\\n return child.getText();\\n });\\n }\\n }\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function renderEverything() {\\n renderPepperoni();\\n renderMushrooms();\\n renderGreenPeppers();\\n renderWhiteSauce();\\n renderGlutenFreeCrust();\\n\\n renderButtons();\\n renderPrice();\\n}\",\n \"function generator(node) {\\n var body = [];\\n var container = t.functionExpression(null, [], t.blockStatement(body), true);\\n container.shadow = true;\\n\\n body.push(_helpersBuildComprehension2[\\\"default\\\"](node, function () {\\n return t.expressionStatement(t.yieldExpression(node.body));\\n }));\\n\\n return t.callExpression(container, []);\\n}\",\n \"exitDecorators(ctx) {\\n\\t}\",\n \"function hzYieldArg(argExp, delegate = false) {\\n\\t\\tconst callExp = hzYield();\\n\\t\\tcallExp.callee.property.name = \\\"yieldValue\\\";\\n\\t\\tcallExp.arguments[0].properties[0].value = argExp;\\n\\t\\tcallExp.arguments[1] = t.BooleanLiteral(delegate);\\n\\t\\treturn callExp;\\n\\t}\",\n \"renderResponse(responseURI, response) {\\n return __awaiter(this, void 0, void 0, function* () {\\n yield this.renderResponseConcrete(responseURI, response);\\n });\\n }\",\n \"exitList_iter(ctx) {\\n\\t}\",\n \"function Test_GetAdminMsg() {\\n return __awaiter(this, void 0, void 0, function () {\\n var out_rpc_msg;\\n return __generator(this, function (_a) {\\n switch (_a.label) {\\n case 0:\\n console.log(\\\"Begin: Test_GetAdminMsg\\\");\\n return [4 /*yield*/, api.GetAdminMsg()];\\n case 1:\\n out_rpc_msg = _a.sent();\\n console.log(out_rpc_msg);\\n console.log(\\\"End: Test_GetAdminMsg\\\");\\n console.log(\\\"-----\\\");\\n console.log();\\n return [2 /*return*/];\\n }\\n });\\n });\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.56866634","0.5684245","0.5497083","0.5296737","0.5290775","0.52903396","0.52688825","0.5127838","0.5015035","0.49599028","0.49599028","0.49599028","0.49599028","0.4956098","0.49541187","0.49217808","0.4916253","0.48688143","0.48666376","0.48553962","0.483992","0.483992","0.4799903","0.47973102","0.47894996","0.47894996","0.4775974","0.474141","0.4659574","0.45813015","0.45282486","0.45180175","0.45180175","0.44805604","0.4469075","0.44632208","0.4458119","0.44511828","0.44354555","0.44262844","0.44100404","0.43988037","0.43700755","0.43535194","0.43475673","0.43279994","0.43208462","0.43055308","0.43038493","0.42882645","0.42785233","0.42779917","0.4274677","0.42587042","0.4257772","0.42507824","0.42507824","0.4247143","0.4245858","0.42307445","0.42307237","0.42299086","0.4227097","0.4227097","0.42268836","0.41988608","0.4193915","0.41845855","0.41825598","0.4180134","0.417929","0.41789684","0.41789684","0.4174549","0.4172427","0.41706312","0.41663513","0.41663513","0.41626203","0.41481903","0.41433612","0.41354784","0.41325158","0.41323835","0.41266522","0.4123138","0.41199866","0.4118395","0.4112045","0.4112045","0.4112045","0.4112045","0.4112045","0.4112045","0.4112045","0.4105815","0.41032514","0.41015592","0.4101496","0.41000903","0.4090637"],"string":"[\n \"0.56866634\",\n \"0.5684245\",\n \"0.5497083\",\n \"0.5296737\",\n \"0.5290775\",\n \"0.52903396\",\n \"0.52688825\",\n \"0.5127838\",\n \"0.5015035\",\n \"0.49599028\",\n \"0.49599028\",\n \"0.49599028\",\n \"0.49599028\",\n \"0.4956098\",\n \"0.49541187\",\n \"0.49217808\",\n \"0.4916253\",\n \"0.48688143\",\n \"0.48666376\",\n \"0.48553962\",\n \"0.483992\",\n \"0.483992\",\n \"0.4799903\",\n \"0.47973102\",\n \"0.47894996\",\n \"0.47894996\",\n \"0.4775974\",\n \"0.474141\",\n \"0.4659574\",\n \"0.45813015\",\n \"0.45282486\",\n \"0.45180175\",\n \"0.45180175\",\n \"0.44805604\",\n \"0.4469075\",\n \"0.44632208\",\n \"0.4458119\",\n \"0.44511828\",\n \"0.44354555\",\n \"0.44262844\",\n \"0.44100404\",\n \"0.43988037\",\n \"0.43700755\",\n \"0.43535194\",\n \"0.43475673\",\n \"0.43279994\",\n \"0.43208462\",\n \"0.43055308\",\n \"0.43038493\",\n \"0.42882645\",\n \"0.42785233\",\n \"0.42779917\",\n \"0.4274677\",\n \"0.42587042\",\n \"0.4257772\",\n \"0.42507824\",\n \"0.42507824\",\n \"0.4247143\",\n \"0.4245858\",\n \"0.42307445\",\n \"0.42307237\",\n \"0.42299086\",\n \"0.4227097\",\n \"0.4227097\",\n \"0.42268836\",\n \"0.41988608\",\n \"0.4193915\",\n \"0.41845855\",\n \"0.41825598\",\n \"0.4180134\",\n \"0.417929\",\n \"0.41789684\",\n \"0.41789684\",\n \"0.4174549\",\n \"0.4172427\",\n \"0.41706312\",\n \"0.41663513\",\n \"0.41663513\",\n \"0.41626203\",\n \"0.41481903\",\n \"0.41433612\",\n \"0.41354784\",\n \"0.41325158\",\n \"0.41323835\",\n \"0.41266522\",\n \"0.4123138\",\n \"0.41199866\",\n \"0.4118395\",\n \"0.4112045\",\n \"0.4112045\",\n \"0.4112045\",\n \"0.4112045\",\n \"0.4112045\",\n \"0.4112045\",\n \"0.4112045\",\n \"0.4105815\",\n \"0.41032514\",\n \"0.41015592\",\n \"0.4101496\",\n \"0.41000903\",\n \"0.4090637\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80684,"cells":{"query":{"kind":"string","value":"It's up to the renderer to call renderRoot at some point in the future."},"document":{"kind":"string","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{scheduleCallbackWithExpirationTime(root,expirationTime);}}"},"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":["_render() {\n this._reactComponent = this._getReactComponent();\n if (!this._root) this._root = createRoot(this._container.getElement()[0]);\n this._root.render(this._reactComponent);\n }","_renderNewRootComponent(/* instance, ... */) { }","function completeRender() {\n\t\t\t\t\t\tvar console = window.console;\n\t\t\t\t\t\tvar afterRender = root.afterRender;\n\n\t\t\t\t\t\tif (afterRender) {\n\t\t\t\t\t\t\tafterRender.call(root, root);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t/**\n\t\t\t\t\t\t * Always emit an afterRender event.\n\t\t\t\t\t\t */\n\t\t\t\t\t\troot.trigger(\"afterRender\", root);\n\n\t\t\t\t\t\t/**\n\t\t\t\t\t\t * If there are multiple top level elements and `el: false` is used,\n\t\t\t\t\t\t * display a warning message and a stack trace.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tif (manager.noel && root.$el.length > 1) {\n\t\t\t\t\t\t\t/**\n\t\t\t\t\t\t\t * Do not display a warning while testing or if warning suppression\n\t\t\t\t\t\t\t * is enabled.\n\t\t\t\t\t\t\t */\n\t\t\t\t\t\t\tif (_.isFunction(console.warn) && !root.suppressWarnings) {\n\t\t\t\t\t\t\t\tconsole.warn(\"`el: false` with multiple top level elements is \" +\n\t\t\t\t\t\t\t\t\t\t\"not supported.\");\n\n\t\t\t\t\t\t\t\t/**\n\t\t\t\t\t\t\t\t * Provide a stack trace if available to aid with debugging.\n\t\t\t\t\t\t\t\t */\n\t\t\t\t\t\t\t\tif (_.isFunction(console.trace)) {\n\t\t\t\t\t\t\t\t\tconsole.trace();\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}","function render () {\n\t // If this is called synchronously we need to\n\t // cancel any pending future updates\n\t clearFrame()\n\n\t // If the rendering from the previous frame is still going,\n\t // we'll just wait until the next frame. Ideally renders should\n\t // not take over 16ms to stay within a single frame, but this should\n\t // catch it if it does.\n\t if (isRendering) {\n\t frameId = raf(render)\n\t return\n\t } else {\n\t isRendering = true\n\t }\n\n\t // 1. If there isn't a native element rendered for the current mounted element\n\t // then we need to create it from scratch.\n\t // 2. If a new element has been mounted, we should diff them.\n\t // 3. We should update check all child components for changes.\n\t if (!currentNativeElement) {\n\t currentElement = app.element\n\t currentNativeElement = toNative(rootId, '0', currentElement)\n\t if (container.children.length > 0) {\n\t console.info('deku: The container element is not empty. These elements will be removed. Read more: http://cl.ly/b0Sr')\n\t }\n\t if (container === document.body) {\n\t console.warn('deku: Using document.body is allowed but it can cause some issues. Read more: http://cl.ly/b0SC')\n\t }\n\t removeAllChildren(container)\n\t container.appendChild(currentNativeElement)\n\t } else if (currentElement !== app.element) {\n\t currentNativeElement = patch(rootId, currentElement, app.element, currentNativeElement)\n\t currentElement = app.element\n\t updateChildren(rootId)\n\t } else {\n\t updateChildren(rootId)\n\t }\n\n\t // Call mount events on all new entities\n\t flushMountQueue()\n\n\t // Allow rendering again.\n\t isRendering = false\n\n\t }","function render () {\n // If this is called synchronously we need to\n // cancel any pending future updates\n clearFrame()\n\n // If the rendering from the previous frame is still going,\n // we'll just wait until the next frame. Ideally renders should\n // not take over 16ms to stay within a single frame, but this should\n // catch it if it does.\n if (isRendering) {\n frameId = raf(render)\n return\n } else {\n isRendering = true\n }\n\n // 1. If there isn't a native element rendered for the current mounted element\n // then we need to create it from scratch.\n // 2. If a new element has been mounted, we should diff them.\n // 3. We should update check all child components for changes.\n if (!currentNativeElement) {\n currentElement = app.element\n currentNativeElement = toNative(rootId, '0', currentElement)\n container.appendChild(currentNativeElement)\n } else if (currentElement !== app.element) {\n currentNativeElement = patch(rootId, currentElement, app.element, currentNativeElement)\n currentElement = app.element\n updateChildren(rootId)\n } else {\n updateChildren(rootId)\n }\n\n // Allow rendering again.\n isRendering = false\n }","function completeRender() {\n var console = window.console;\n var afterRender = root.afterRender;\n\n if (afterRender) {\n afterRender.call(root, root);\n }\n\n // Always emit an afterRender event.\n root.trigger(\"afterRender\", root);\n\n // If there are multiple top level elements and `el: false` is used,\n // display a warning message and a stack trace.\n if (manager.noel && root.$el.length > 1) {\n // Do not display a warning while testing or if warning suppression\n // is enabled.\n if (_.isFunction(console.warn) && !root.suppressWarnings) {\n console.warn(\"`el: false` with multiple top level elements is \" +\n \"not supported.\");\n\n // Provide a stack trace if available to aid with debugging.\n if (_.isFunction(console.trace)) {\n console.trace();\n }\n }\n }\n }","render() {\n this._userEvent('beforeRender');\n const html = this.template.render({data: this.viewData}, (data) => {\n return this.wrapTemplate(data);\n });\n if (!this.wrapper) {\n this.wrapper = this._createWrapper();\n }\n this.updateNode(this.wrapper, html);\n this.resize();\n this._userEvent('afterRender');\n }","function render(element) {\n ROOT_NODE = createElement('ROOT');\n const container = ROOT_NODE;\n\n // Returns the current fiber (flushed fiber)\n const node = DesktopRenderer.createContainer(ROOT_NODE);\n\n // Schedules a top level update with current fiber and a priority level (depending upon the context)\n DesktopRenderer.updateContainer(element, node, null);\n ROOT_NODE.render();\n // DesktopRenderer.injectIntoDevTools({\n // bundleType: 1,\n // version: '0.1.0',\n // rendererPackageName: 'custom-renderer',\n // findHostInstanceByFiber: DesktopRenderer.findHostInstance\n // })\n}","function render() {\n renderRegistry();\n renderDirectory();\n renderOverride();\n}","function actuallyRender() {\n var options = root.getAllOptions();\n var manager = root.__manager__;\n var parent = manager.parent;\n var rentManager = parent && parent.__manager__;\n\n // The `_viewRender` method is broken out to abstract away from having\n // too much code in `processRender`.\n root._render(LayoutManager._viewRender, options).done(function() {\n // If there are no children to worry about, complete the render\n // instantly.\n if (!_.keys(root.views).length) {\n return resolve();\n }\n\n // Create a list of promises to wait on until rendering is done.\n // Since this method will run on all children as well, its sufficient\n // for a full hierarchical. \n var promises = _.map(root.views, function(view) {\n var insert = _.isArray(view);\n\n // If items are being inserted, they will be in a non-zero length\n // Array.\n if (insert && view.length) {\n // Schedule each view to be rendered in order and return a promise\n // representing the result of the final rendering.\n return _.reduce(view.slice(1), function(prevRender, view) {\n return prevRender.then(function() {\n return view.render();\n });\n // The first view should be rendered immediately, and the resulting\n // promise used to initialize the reduction.\n }, view[0].render());\n }\n\n // Only return the fetch deferred, resolve the main deferred after\n // the element has been attached to it's parent.\n return !insert ? view.render() : view;\n });\n\n // Once all nested Views have been rendered, resolve this View's\n // deferred.\n options.when(promises).done(function() {\n resolve();\n });\n });\n }","createRenderRoot() {\n return this;\n }","function actuallyRender() {\n\n\t\t\t\t\t/**\n\t\t\t\t\t * The `_viewRender` method is broken out to abstract away from having\n\t\t\t\t\t * too much code in `actuallyRender`.\n\t\t\t\t\t */\n\t\t\t\t\troot._render().done(function () {\n\t\t\t\t\t\tvar promises;\n\t\t\t\t\t\t/**\n\t\t\t\t\t\t * If there are no children to worry about, complete the render\n\t\t\t\t\t\t * instantly.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tif (!_.keys(root.views).length) {\n\t\t\t\t\t\t\treturn resolve();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t/**\n\t\t\t\t\t\t * Create a list of promises to wait on until rendering is done.\n\t\t\t\t\t\t * Since this method will run on all children as well, its sufficient\n\t\t\t\t\t\t * for a full hierarchical.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tpromises = _.map(root.views, function (view) {\n\t\t\t\t\t\t\tvar insert = _.isArray(view);\n\n\t\t\t\t\t\t\t/**\n\t\t\t\t\t\t\t * If items are being inserted, they will be in a non-zero length\n\t\t\t\t\t\t\t * Array.\n\t\t\t\t\t\t\t */\n\t\t\t\t\t\t\tif (insert && view.length) {\n\t\t\t\t\t\t\t\t/**\n\t\t\t\t\t\t\t\t * Mark each subview's manager so they don't attempt to attach by\n\t\t\t\t\t\t\t\t * themselves. Return a single promise representing the entire\n\t\t\t\t\t\t\t\t * render.\n\t\t\t\t\t\t\t\t */\n\t\t\t\t\t\t\t\treturn root.when(_.map(view, function (subView) {\n\t\t\t\t\t\t\t\t\tsubView.__manager__.insertedViaFragment = true;\n\t\t\t\t\t\t\t\t\treturn subView.render().__manager__.renderDeferred;\n\t\t\t\t\t\t\t\t}));\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t/**\n\t\t\t\t\t\t\t * Only return the fetch deferred, resolve the main deferred after\n\t\t\t\t\t\t\t * the element has been attached to it's parent.\n\t\t\t\t\t\t\t */\n\t\t\t\t\t\t\treturn !insert ? view.render().__manager__.renderDeferred : view;\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\t/**\n\t\t\t\t\t\t * Once all nested Views have been rendered, resolve this View's\n\t\t\t\t\t\t * deferred.\n\t\t\t\t\t\t */\n\t\t\t\t\t\troot.when(promises).done(resolve);\n\t\t\t\t\t});\n\t\t\t\t}","function render()\n {\n if (me.triggerEvent('renderBefore', data) === false)\n return;\n\n // remove all child nodes\n container.html('');\n\n // render child nodes\n for (var i=0; i < data.length; i++) {\n data[i].level = 0;\n render_node(data[i], container);\n }\n\n me.triggerEvent('renderAfter', container);\n }","function actuallyRender() {\n var options = root._options();\n var manager = root.__manager__;\n var parent = manager.parent;\n var rentManager = parent && parent.__manager__;\n\n // The `_viewRender` method is broken out to abstract away from having\n // too much code in `processRender`.\n root._render(LayoutManager._viewRender, options).done(function() {\n // If there are no children to worry about, complete the render\n // instantly.\n if (!_.keys(root.views).length) {\n return resolve();\n }\n\n // Create a list of promises to wait on until rendering is done.\n // Since this method will run on all children as well, its sufficient\n // for a full hierarchical. \n var promises = _.map(root.views, function(view) {\n var append = _.isArray(view);\n\n // If items are being inserted, they will be in a non-zero length\n // Array.\n if (append && view.length) {\n // Only need to wait for the first View to complete, the rest\n // will be synchronous, by virtue of having the template cached.\n return view[0].render().pipe(function() {\n // Map over all the View's to be inserted and call render on\n // them all. Once they have all resolved, resolve the other\n // deferred.\n return options.when(_.map(view.slice(1), function(insertView) {\n return insertView.render();\n }));\n });\n }\n\n // Only return the fetch deferred, resolve the main deferred after\n // the element has been attached to it's parent.\n return !append ? view.render() : view;\n });\n\n // Once all nested Views have been rendered, resolve this View's\n // deferred.\n options.when(promises).done(function() {\n resolve();\n });\n });\n }","onRender()/*: void*/ {\n this.render();\n }","ready() {\n this._root = this._createRoot();\n super.ready();\n this._firstRendered();\n }","function renderTopLevel()\n{\n $(\"#wrapper\").prepend(templates['header']());\n $('#center_wrap').append(templates['files']());\n $('#center_wrap').append(templates['panes']());\n console.log('-- rendered top level UI html --');\n}","function actuallyRender() {\n\n // The `_viewRender` method is broken out to abstract away from having\n // too much code in `actuallyRender`.\n root._render().done(function() {\n // If there are no children to worry about, complete the render\n // instantly.\n if (!_.keys(root.views).length) {\n return resolve();\n }\n\n // Create a list of promises to wait on until rendering is done.\n // Since this method will run on all children as well, its sufficient\n // for a full hierarchical.\n var promises = _.map(root.views, function(view) {\n var insert = _.isArray(view);\n\n // If items are being inserted, they will be in a non-zero length\n // Array.\n if (insert && view.length) {\n // Mark each subview's manager so they don't attempt to attach by\n // themselves. Return a single promise representing the entire\n // render.\n return root.when(_.map(view, function(subView) {\n subView.__manager__.insertedViaFragment = true;\n return subView.render().__manager__.renderDeferred;\n }));\n }\n\n // Only return the fetch deferred, resolve the main deferred after\n // the element has been attached to it's parent.\n return !insert ? view.render().__manager__.renderDeferred : view;\n });\n\n // Once all nested Views have been rendered, resolve this View's\n // deferred.\n root.when(promises).done(resolve);\n });\n }","render() {\n this.notify('initial-load', {});\n /**\n * Used to load context menu\n */\n this.trigger('load');\n this.notify('initial-end', {});\n this.renderElements();\n this.renderComplete();\n }","render() {\n this.notify('initial-load', {});\n /**\n * Used to load context menu\n */\n this.trigger('load');\n this.notify('initial-end', {});\n this.renderElements();\n this.renderComplete();\n }","render() {\n this.notify('initial-load', {});\n /**\n * Used to load context menu\n */\n this.trigger('load');\n this.notify('initial-end', {});\n this.renderElements();\n this.renderComplete();\n }","function render() {\n\t\t\t}","function Render() {\n ClearScreen();\n RenderEnergeticDroplets();\n ResetRenderingConditions();\n}","function render() {\n\n\t\t\t}","function main() {\n\t\t\ttry{\n\t\t\t\trender();\n\t\t\t} catch(e) {\n\t\t\t\tconsole.log(e);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif(rendering == true) {\n\t\t\t\traf(main.bind(this));\n\t\t\t}\n\t\t}","_renderScreen() {\n\t\tif (this._el && this._component) {\n\t\t\tthis._component.render(this._el);\n\t\t}\n\t}","render() {\n if (this.renderer) {\n this.renderer.call(this.owner, this.content, this.owner, this.model);\n }\n }","render() {\n //using template function to render component\n const html = this.getTemplate().call(this, (this.getData())).trim();\n // generate virtual dom tree\n const tree = tvdom.parse(html);\n const lastRender = this._lastRender;\n // update component\n if (lastRender) {\n // diff two trees: last and current\n const patches = tvdom.diff(lastRender.tree, tree);\n if (!this._isEmptyObject(patches)) {\n // patch last dom tree\n tvdom.patch(lastRender.root, patches);\n // save changes\n lastRender.html = html;\n lastRender.tree = tree;\n }\n } else {\n // first time render dom tree\n const root = tree.render();\n this._$mountPoint.empty().html(root);\n // save render states\n this._lastRender = { mountPoint: this.getMountPoint(), html, tree, root}\n }\n }","function render() {\n if (!willRender) {\n willRender = true;\n process.nextTick(function() {\n screen.render();\n willRender = false;\n });\n }\n}","function render() {\n\tclearCanvas();\n\tRenderer.draw();\n\t\n\t\t\n}","render() {\n if (!this.initialized) this.init();\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 }","render(container) {\n this.renderer.render(container);\n }","render() { this.screen.render() }","render() {\n\t\tif (!this.component_.element) {\n\t\t\tthis.component_.element = document.createElement('div');\n\t\t}\n\t\tthis.emit('rendered', !this.isRendered_);\n\t}","function init() { render(this); }","_update() {\n render(this._template(), this.shadowRoot, {eventContext: this});\n }","render() {\n const { rootNode, sizeSet } = this;\n let visualIndex = this.visualIndex;\n\n if (this.isSharedViewSet() && sizeSet.isPlaceOn(WORKING_SPACE_BOTTOM)) {\n visualIndex += sizeSet.sharedSize.nextSize;\n }\n\n let node = rootNode.childNodes[visualIndex];\n\n if (node.tagName !== this.childNodeType) {\n const newNode = this.nodesPool();\n\n rootNode.replaceChild(newNode, node);\n node = newNode;\n }\n\n this.collectedNodes.push(node);\n this.visualIndex += 1;\n }","render() {\n return this.renderChildren() || null;\n }","function createRootComponentView(rNode,def,rootView,rendererFactory,renderer,sanitizer){resetComponentState();var tView=rootView[TVIEW];var componentView=createLView(rootView,getOrCreateTView(def.template,def.consts,def.vars,def.directiveDefs,def.pipeDefs,def.viewQuery),null,def.onPush?8/* Dirty */:4/* CheckAlways */,rendererFactory,renderer,sanitizer);var tNode=createNodeAtIndex(0,3/* Element */,rNode,null,null);if(tView.firstTemplatePass){diPublicInInjector(getOrCreateNodeInjectorForNode(tNode,rootView),rootView,def.type);tNode.flags=1/* isComponent */;initNodeFlags(tNode,rootView.length,1);queueComponentIndexForCheck(tNode);}// Store component view at node index, with node as the HOST\ncomponentView[HOST]=rootView[HEADER_OFFSET];componentView[HOST_NODE]=tNode;return rootView[HEADER_OFFSET]=componentView;}","function render() {\n\t}","function handleRender() {\n view._isRendered = true;\n triggerDOMRefresh();\n }","function handleRender() {\n view._isRendered = true;\n triggerDOMRefresh();\n }","function render() {\n\t\t\n\t}","function fixRender()\n {\n cls.add(d.documentElement, 'v-fix-render');\n\n if (fixtimeout) clearTimeout(fixtimeout);\n\n fixtimeout = setTimeout(function () {\n cls.remove(d.documentElement, 'v-fix-render');\n }, 500);\n }","function completeRender() {\n var afterRender = options.afterRender;\n\n if (afterRender) {\n afterRender.call(root, root);\n }\n\n // Always emit an afterRender event.\n root.trigger(\"afterRender\", root);\n }","function completeRender() {\n var afterRender = options.afterRender;\n\n if (afterRender) {\n afterRender.call(root, root);\n }\n\n // Always emit an afterRender event.\n root.trigger(\"afterRender\", root);\n }","render() {\n // Subclasses should override\n }","render(){if(this.renderer){this.renderer.call(this.owner,this.content,this.owner,this.model)}}","function render() {\n\t// actually display the scene in the Dom element\n\trenderer.render( scene, camera );\n}","sysRender() {\n \n let rendered = this.render();\n \n // If render() returns a String, then insert that as innerHTML in the\n // Part View node. Otherwise, do something else (TODO)\n \n if (typeof rendered === 'string') {\n this.domNode.innerHTML = rendered;\n } else if (false) { // TODO: test for jQuery return, DOM Node object, etc.\n // WHAT? \n }\n }","render() {\n if (!this.initialized) {\n this.init();\n }\n }","onBeforeRendering() {}","render() {\n console.debug(`Rendering DOM of ${this.constructor.name}`);\n this.shadowRoot.innerHTML = this.html;\n if (this.script != null) {\n console.debug(`Running script of ${this.constructor.name}`);\n this.script();\n console.debug(`Finished running script of ${this.constructor.name}`);\n }\n console.debug(`Finished rendering DOM of ${this.constructor.name}`);\n }","function lateRender() {\n\t\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\n\t\t\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\n\t\t\t\trenderView();\n\t\t\t}\n\t\t},0);\n\t}","function lateRender() {\n\t\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\n\t\t\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\n\t\t\t\trenderView();\n\t\t\t}\n\t\t},0);\n\t}","function lateRender() {\n\t\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\n\t\t\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\n\t\t\t\trenderView();\n\t\t\t}\n\t\t},0);\n\t}","function lateRender() {\n\t\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\n\t\t\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\n\t\t\t\trenderView();\n\t\t\t}\n\t\t},0);\n\t}","function lateRender() {\n\t\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\n\t\t\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\n\t\t\t\trenderView();\n\t\t\t}\n\t\t},0);\n\t}","function handleRender() {\n\t view._isRendered = true;\n\t triggerDOMRefresh();\n\t }","function lateRender() {\n\t\tsetTimeout( function() { // IE7 needs this so dimensions are calculated correctly\n\t\t\t\t\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\n\t\t\t\t\t\trenderView();\n\t\t\t\t\t}\n\t\t\t\t}, 0);\n\t}","render() {\n\t\tthis.patch();\n\t}","function render() {\n\t if(stopped || scene.contextLost) {\n\t return\n\t }\n\t requestAnimationFrame(render)\n\t redraw()\n\t }","function render() {\n\t if(stopped || scene.contextLost) {\n\t return\n\t }\n\t requestAnimationFrame(render)\n\t redraw()\n\t }","static rendered () {}","static rendered () {}","renderIncDom() {\n\t\tif (this.component_.render) {\n\t\t\tthis.component_.render();\n\t\t} else {\n\t\t\tIncrementalDOM.elementVoid('div');\n\t\t}\n\t}","postRendering() {\n this.ctx.restore();\n }","build() {\n const componentsRenderer =\n this.namespace().ComponentRenderer.new({ rootComponent: this })\n\n this.renderWith(componentsRenderer)\n }","function render(element, launchInfo) {\n const container = createElement('ROOT');\n const node = ElectronRenderer.createContainer(container);\n\n // This is a hack to be able to test whether App passes this to `onReady`\n container.launchInfo = launchInfo;\n\n ElectronRenderer.updateContainer(element, node, null);\n\n return container;\n}","render () {\n let data = this.getData();\n this._tree = this._createTree(data);\n this._toolTip = this._createToolTip();\n this._updateTree(this.getRoot());\n }","render() {\n\t\trenderer.render(scene, camera);\n\t}","render() {\n\t\trenderer.render(scene, camera);\n\t}","onAfterRendering() {}","render() {\n const self = this;\n const data = self.get('data');\n if (!data) {\n throw new Error('data must be defined first');\n }\n self.clear();\n self.emit('beforerender');\n self.refreshLayout(this.get('fitView'));\n self.emit('afterrender');\n }","displayScene() {\n // entry point for graph rendering\n //TODO: Render loop starting at root of graph\n //console.log(this.nodes)\n this.components[this.idRoot].display();\n }","afterRender() { }","afterRender() { }","init() {\n this.render();\n }","init() {\n this.render();\n }","function render() {\n if(stopped || scene.contextLost) {\n return\n }\n requestAnimationFrame(render)\n redraw()\n }","render() {\n\n\t}","render() {\n\n\t}","function resolve() {\n\n // Insert all subViews into the parent at once.\n _.each(root.views, function(views, selector) {\n // Fragments aren't used on arrays of subviews.\n if (_.isArray(views)) {\n root.htmlBatch(root, views, selector);\n }\n });\n\n // If there is a parent and we weren't attached to it via the previous\n // method (single view), attach.\n if (parent && !manager.insertedViaFragment) {\n if (!root.contains(parent.el, root.el)) {\n // Apply the partial using parent's html() method.\n parent.partial(parent.$el, root.$el, rentManager, manager);\n }\n }\n\n // Ensure events are always correctly bound after rendering.\n root.delegateEvents();\n\n // Set this View as successfully rendered.\n root.hasRendered = true;\n manager.renderInProgress = false;\n\n // Clear triggeredByRAF flag.\n delete manager.triggeredByRAF;\n\n // Only process the queue if it exists.\n if (manager.queue && manager.queue.length) {\n // Ensure that the next render is only called after all other\n // `done` handlers have completed. This will prevent `render`\n // callbacks from firing out of order.\n (manager.queue.shift())();\n } else {\n // Once the queue is depleted, remove it, the render process has\n // completed.\n delete manager.queue;\n }\n\n // Reusable function for triggering the afterRender callback and event.\n function completeRender() {\n var console = window.console;\n var afterRender = root.afterRender;\n\n if (afterRender) {\n afterRender.call(root, root);\n }\n\n // Always emit an afterRender event.\n root.trigger(\"afterRender\", root);\n\n // If there are multiple top level elements and `el: false` is used,\n // display a warning message and a stack trace.\n if (manager.noel && root.$el.length > 1) {\n // Do not display a warning while testing or if warning suppression\n // is enabled.\n if (_.isFunction(console.warn) && !root.suppressWarnings) {\n console.warn(\"`el: false` with multiple top level elements is \" +\n \"not supported.\");\n\n // Provide a stack trace if available to aid with debugging.\n if (_.isFunction(console.trace)) {\n console.trace();\n }\n }\n }\n }\n\n // If the parent is currently rendering, wait until it has completed\n // until calling the nested View's `afterRender`.\n if (rentManager && (rentManager.renderInProgress || rentManager.queue)) {\n // Wait until the parent View has finished rendering, which could be\n // asynchronous, and trigger afterRender on this View once it has\n // completed.\n parent.once(\"afterRender\", completeRender);\n } else {\n // This View and its parent have both rendered.\n completeRender();\n }\n\n return def.resolveWith(root, [root]);\n }","_render() {}","render() {\n this.el.innerHTML = this.template();\n\n setTimeout(() => {\n this.bindUIElements();\n }, 0);\n }","render() {\n // background box.\n this.renderBackground();\n this.renderName();\n this.renderTimeLine();\n this.renderWave();\n }","function createRootComponentView(rNode, def, rootView, rendererFactory, renderer, sanitizer) {\n resetComponentState();\n var tView = rootView[TVIEW];\n var componentView = createLView(rootView, getOrCreateTView(def.template, def.consts, def.vars, def.directiveDefs, def.pipeDefs, def.viewQuery), null, def.onPush ? 8 /* Dirty */ : 4 /* CheckAlways */, rendererFactory, renderer, sanitizer);\n var tNode = createNodeAtIndex(0, 3 /* Element */, rNode, null, null);\n if (tView.firstTemplatePass) {\n diPublicInInjector(getOrCreateNodeInjectorForNode(tNode, rootView), rootView, def.type);\n tNode.flags = 1 /* isComponent */;\n initNodeFlags(tNode, rootView.length, 1);\n queueComponentIndexForCheck(tNode);\n }\n // Store component view at node index, with node as the HOST\n componentView[HOST] = rootView[HEADER_OFFSET];\n componentView[HOST_NODE] = tNode;\n return rootView[HEADER_OFFSET] = componentView;\n}","function createRootComponentView(rNode, def, rootView, rendererFactory, renderer, sanitizer) {\n resetComponentState();\n var tView = rootView[TVIEW];\n var componentView = createLView(rootView, getOrCreateTView(def.template, def.consts, def.vars, def.directiveDefs, def.pipeDefs, def.viewQuery), null, def.onPush ? 8 /* Dirty */ : 4 /* CheckAlways */, rendererFactory, renderer, sanitizer);\n var tNode = createNodeAtIndex(0, 3 /* Element */, rNode, null, null);\n if (tView.firstTemplatePass) {\n diPublicInInjector(getOrCreateNodeInjectorForNode(tNode, rootView), rootView, def.type);\n tNode.flags = 1 /* isComponent */;\n initNodeFlags(tNode, rootView.length, 1);\n queueComponentIndexForCheck(tNode);\n }\n // Store component view at node index, with node as the HOST\n componentView[HOST] = rootView[HEADER_OFFSET];\n componentView[HOST_NODE] = tNode;\n return rootView[HEADER_OFFSET] = componentView;\n}","render() {\n this.shadowRoot.innerHTML = this.template;\n }","renderMain()\n {\n if (this.state.registering)\n {\n return this.renderRegistration();\n }\n else if(!this.state.loggedin)\n {\n return this.renderLogIn();\n }\n else\n {\n return this.renderBrowser();\n }\n }","function render() {\n \trequestAnimationFrame( render );\n control.update(0.5);\n \trenderer.render( scene, camera );\n }","function render() {\n \trequestAnimationFrame( render );\n control.update(0.5);\n \trenderer.render( scene, camera );\n }","draw(modelView) {\n if (this.root != null && this.renderer != null) {\n this.renderer.draw(this.root, modelView);\n }\n }","render() { return super.render(); }","function createRootComponentView(rNode, def, rootView, rendererFactory, renderer, sanitizer) {\n resetComponentState();\n var tView = rootView[TVIEW];\n ngDevMode && assertDataInRange(rootView, 0 + HEADER_OFFSET);\n rootView[0 + HEADER_OFFSET] = rNode;\n var tNode = getOrCreateTNode(tView, null, 0, 3 /* Element */, null, null);\n var componentView = createLView(rootView, getOrCreateTView(def), null, def.onPush ? 64 /* Dirty */ : 16 /* CheckAlways */, rootView[HEADER_OFFSET], tNode, rendererFactory, renderer, sanitizer);\n if (tView.firstTemplatePass) {\n diPublicInInjector(getOrCreateNodeInjectorForNode(tNode, rootView), rootView, def.type);\n tNode.flags = 1 /* isComponent */;\n initNodeFlags(tNode, rootView.length, 1);\n queueComponentIndexForCheck(tNode);\n }\n // Store component view at node index, with node as the HOST\n return rootView[HEADER_OFFSET] = componentView;\n}","function render() {\n if (frameBuffers.length > 0) {\n drawScene(gl, programInfo);\n }\n requestAnimationFrame(render);\n }","function render() {\n\n\t\t\tisRendered = true;\n\n\t\t\trenderSource();\n\n\t\t}","Render(){\n throw new Error(\"Render() method must be implemented in child!\");\n }","initialize(){super.initialize(),this.renderRoot=this.createRenderRoot(),window.ShadowRoot&&this.renderRoot instanceof window.ShadowRoot&&this.adoptStyles()}","function render() {\n\n isRendered = true;\n\n renderSource();\n\n }"],"string":"[\n \"_render() {\\n this._reactComponent = this._getReactComponent();\\n if (!this._root) this._root = createRoot(this._container.getElement()[0]);\\n this._root.render(this._reactComponent);\\n }\",\n \"_renderNewRootComponent(/* instance, ... */) { }\",\n \"function completeRender() {\\n\\t\\t\\t\\t\\t\\tvar console = window.console;\\n\\t\\t\\t\\t\\t\\tvar afterRender = root.afterRender;\\n\\n\\t\\t\\t\\t\\t\\tif (afterRender) {\\n\\t\\t\\t\\t\\t\\t\\tafterRender.call(root, root);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t * Always emit an afterRender event.\\n\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\troot.trigger(\\\"afterRender\\\", root);\\n\\n\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t * If there are multiple top level elements and `el: false` is used,\\n\\t\\t\\t\\t\\t\\t * display a warning message and a stack trace.\\n\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\tif (manager.noel && root.$el.length > 1) {\\n\\t\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t\\t * Do not display a warning while testing or if warning suppression\\n\\t\\t\\t\\t\\t\\t\\t * is enabled.\\n\\t\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\t\\tif (_.isFunction(console.warn) && !root.suppressWarnings) {\\n\\t\\t\\t\\t\\t\\t\\t\\tconsole.warn(\\\"`el: false` with multiple top level elements is \\\" +\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"not supported.\\\");\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t\\t\\t * Provide a stack trace if available to aid with debugging.\\n\\t\\t\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\t\\t\\tif (_.isFunction(console.trace)) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tconsole.trace();\\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 \"function render () {\\n\\t // If this is called synchronously we need to\\n\\t // cancel any pending future updates\\n\\t clearFrame()\\n\\n\\t // If the rendering from the previous frame is still going,\\n\\t // we'll just wait until the next frame. Ideally renders should\\n\\t // not take over 16ms to stay within a single frame, but this should\\n\\t // catch it if it does.\\n\\t if (isRendering) {\\n\\t frameId = raf(render)\\n\\t return\\n\\t } else {\\n\\t isRendering = true\\n\\t }\\n\\n\\t // 1. If there isn't a native element rendered for the current mounted element\\n\\t // then we need to create it from scratch.\\n\\t // 2. If a new element has been mounted, we should diff them.\\n\\t // 3. We should update check all child components for changes.\\n\\t if (!currentNativeElement) {\\n\\t currentElement = app.element\\n\\t currentNativeElement = toNative(rootId, '0', currentElement)\\n\\t if (container.children.length > 0) {\\n\\t console.info('deku: The container element is not empty. These elements will be removed. Read more: http://cl.ly/b0Sr')\\n\\t }\\n\\t if (container === document.body) {\\n\\t console.warn('deku: Using document.body is allowed but it can cause some issues. Read more: http://cl.ly/b0SC')\\n\\t }\\n\\t removeAllChildren(container)\\n\\t container.appendChild(currentNativeElement)\\n\\t } else if (currentElement !== app.element) {\\n\\t currentNativeElement = patch(rootId, currentElement, app.element, currentNativeElement)\\n\\t currentElement = app.element\\n\\t updateChildren(rootId)\\n\\t } else {\\n\\t updateChildren(rootId)\\n\\t }\\n\\n\\t // Call mount events on all new entities\\n\\t flushMountQueue()\\n\\n\\t // Allow rendering again.\\n\\t isRendering = false\\n\\n\\t }\",\n \"function render () {\\n // If this is called synchronously we need to\\n // cancel any pending future updates\\n clearFrame()\\n\\n // If the rendering from the previous frame is still going,\\n // we'll just wait until the next frame. Ideally renders should\\n // not take over 16ms to stay within a single frame, but this should\\n // catch it if it does.\\n if (isRendering) {\\n frameId = raf(render)\\n return\\n } else {\\n isRendering = true\\n }\\n\\n // 1. If there isn't a native element rendered for the current mounted element\\n // then we need to create it from scratch.\\n // 2. If a new element has been mounted, we should diff them.\\n // 3. We should update check all child components for changes.\\n if (!currentNativeElement) {\\n currentElement = app.element\\n currentNativeElement = toNative(rootId, '0', currentElement)\\n container.appendChild(currentNativeElement)\\n } else if (currentElement !== app.element) {\\n currentNativeElement = patch(rootId, currentElement, app.element, currentNativeElement)\\n currentElement = app.element\\n updateChildren(rootId)\\n } else {\\n updateChildren(rootId)\\n }\\n\\n // Allow rendering again.\\n isRendering = false\\n }\",\n \"function completeRender() {\\n var console = window.console;\\n var afterRender = root.afterRender;\\n\\n if (afterRender) {\\n afterRender.call(root, root);\\n }\\n\\n // Always emit an afterRender event.\\n root.trigger(\\\"afterRender\\\", root);\\n\\n // If there are multiple top level elements and `el: false` is used,\\n // display a warning message and a stack trace.\\n if (manager.noel && root.$el.length > 1) {\\n // Do not display a warning while testing or if warning suppression\\n // is enabled.\\n if (_.isFunction(console.warn) && !root.suppressWarnings) {\\n console.warn(\\\"`el: false` with multiple top level elements is \\\" +\\n \\\"not supported.\\\");\\n\\n // Provide a stack trace if available to aid with debugging.\\n if (_.isFunction(console.trace)) {\\n console.trace();\\n }\\n }\\n }\\n }\",\n \"render() {\\n this._userEvent('beforeRender');\\n const html = this.template.render({data: this.viewData}, (data) => {\\n return this.wrapTemplate(data);\\n });\\n if (!this.wrapper) {\\n this.wrapper = this._createWrapper();\\n }\\n this.updateNode(this.wrapper, html);\\n this.resize();\\n this._userEvent('afterRender');\\n }\",\n \"function render(element) {\\n ROOT_NODE = createElement('ROOT');\\n const container = ROOT_NODE;\\n\\n // Returns the current fiber (flushed fiber)\\n const node = DesktopRenderer.createContainer(ROOT_NODE);\\n\\n // Schedules a top level update with current fiber and a priority level (depending upon the context)\\n DesktopRenderer.updateContainer(element, node, null);\\n ROOT_NODE.render();\\n // DesktopRenderer.injectIntoDevTools({\\n // bundleType: 1,\\n // version: '0.1.0',\\n // rendererPackageName: 'custom-renderer',\\n // findHostInstanceByFiber: DesktopRenderer.findHostInstance\\n // })\\n}\",\n \"function render() {\\n renderRegistry();\\n renderDirectory();\\n renderOverride();\\n}\",\n \"function actuallyRender() {\\n var options = root.getAllOptions();\\n var manager = root.__manager__;\\n var parent = manager.parent;\\n var rentManager = parent && parent.__manager__;\\n\\n // The `_viewRender` method is broken out to abstract away from having\\n // too much code in `processRender`.\\n root._render(LayoutManager._viewRender, options).done(function() {\\n // If there are no children to worry about, complete the render\\n // instantly.\\n if (!_.keys(root.views).length) {\\n return resolve();\\n }\\n\\n // Create a list of promises to wait on until rendering is done.\\n // Since this method will run on all children as well, its sufficient\\n // for a full hierarchical. \\n var promises = _.map(root.views, function(view) {\\n var insert = _.isArray(view);\\n\\n // If items are being inserted, they will be in a non-zero length\\n // Array.\\n if (insert && view.length) {\\n // Schedule each view to be rendered in order and return a promise\\n // representing the result of the final rendering.\\n return _.reduce(view.slice(1), function(prevRender, view) {\\n return prevRender.then(function() {\\n return view.render();\\n });\\n // The first view should be rendered immediately, and the resulting\\n // promise used to initialize the reduction.\\n }, view[0].render());\\n }\\n\\n // Only return the fetch deferred, resolve the main deferred after\\n // the element has been attached to it's parent.\\n return !insert ? view.render() : view;\\n });\\n\\n // Once all nested Views have been rendered, resolve this View's\\n // deferred.\\n options.when(promises).done(function() {\\n resolve();\\n });\\n });\\n }\",\n \"createRenderRoot() {\\n return this;\\n }\",\n \"function actuallyRender() {\\n\\n\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t * The `_viewRender` method is broken out to abstract away from having\\n\\t\\t\\t\\t\\t * too much code in `actuallyRender`.\\n\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\troot._render().done(function () {\\n\\t\\t\\t\\t\\t\\tvar promises;\\n\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t * If there are no children to worry about, complete the render\\n\\t\\t\\t\\t\\t\\t * instantly.\\n\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\tif (!_.keys(root.views).length) {\\n\\t\\t\\t\\t\\t\\t\\treturn resolve();\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t * Create a list of promises to wait on until rendering is done.\\n\\t\\t\\t\\t\\t\\t * Since this method will run on all children as well, its sufficient\\n\\t\\t\\t\\t\\t\\t * for a full hierarchical.\\n\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\tpromises = _.map(root.views, function (view) {\\n\\t\\t\\t\\t\\t\\t\\tvar insert = _.isArray(view);\\n\\n\\t\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t\\t * If items are being inserted, they will be in a non-zero length\\n\\t\\t\\t\\t\\t\\t\\t * Array.\\n\\t\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\t\\tif (insert && view.length) {\\n\\t\\t\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t\\t\\t * Mark each subview's manager so they don't attempt to attach by\\n\\t\\t\\t\\t\\t\\t\\t\\t * themselves. Return a single promise representing the entire\\n\\t\\t\\t\\t\\t\\t\\t\\t * render.\\n\\t\\t\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\t\\t\\treturn root.when(_.map(view, function (subView) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsubView.__manager__.insertedViaFragment = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\treturn subView.render().__manager__.renderDeferred;\\n\\t\\t\\t\\t\\t\\t\\t\\t}));\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t\\t * Only return the fetch deferred, resolve the main deferred after\\n\\t\\t\\t\\t\\t\\t\\t * the element has been attached to it's parent.\\n\\t\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\t\\treturn !insert ? view.render().__manager__.renderDeferred : view;\\n\\t\\t\\t\\t\\t\\t});\\n\\n\\t\\t\\t\\t\\t\\t/**\\n\\t\\t\\t\\t\\t\\t * Once all nested Views have been rendered, resolve this View's\\n\\t\\t\\t\\t\\t\\t * deferred.\\n\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\troot.when(promises).done(resolve);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\",\n \"function render()\\n {\\n if (me.triggerEvent('renderBefore', data) === false)\\n return;\\n\\n // remove all child nodes\\n container.html('');\\n\\n // render child nodes\\n for (var i=0; i < data.length; i++) {\\n data[i].level = 0;\\n render_node(data[i], container);\\n }\\n\\n me.triggerEvent('renderAfter', container);\\n }\",\n \"function actuallyRender() {\\n var options = root._options();\\n var manager = root.__manager__;\\n var parent = manager.parent;\\n var rentManager = parent && parent.__manager__;\\n\\n // The `_viewRender` method is broken out to abstract away from having\\n // too much code in `processRender`.\\n root._render(LayoutManager._viewRender, options).done(function() {\\n // If there are no children to worry about, complete the render\\n // instantly.\\n if (!_.keys(root.views).length) {\\n return resolve();\\n }\\n\\n // Create a list of promises to wait on until rendering is done.\\n // Since this method will run on all children as well, its sufficient\\n // for a full hierarchical. \\n var promises = _.map(root.views, function(view) {\\n var append = _.isArray(view);\\n\\n // If items are being inserted, they will be in a non-zero length\\n // Array.\\n if (append && view.length) {\\n // Only need to wait for the first View to complete, the rest\\n // will be synchronous, by virtue of having the template cached.\\n return view[0].render().pipe(function() {\\n // Map over all the View's to be inserted and call render on\\n // them all. Once they have all resolved, resolve the other\\n // deferred.\\n return options.when(_.map(view.slice(1), function(insertView) {\\n return insertView.render();\\n }));\\n });\\n }\\n\\n // Only return the fetch deferred, resolve the main deferred after\\n // the element has been attached to it's parent.\\n return !append ? view.render() : view;\\n });\\n\\n // Once all nested Views have been rendered, resolve this View's\\n // deferred.\\n options.when(promises).done(function() {\\n resolve();\\n });\\n });\\n }\",\n \"onRender()/*: void*/ {\\n this.render();\\n }\",\n \"ready() {\\n this._root = this._createRoot();\\n super.ready();\\n this._firstRendered();\\n }\",\n \"function renderTopLevel()\\n{\\n $(\\\"#wrapper\\\").prepend(templates['header']());\\n $('#center_wrap').append(templates['files']());\\n $('#center_wrap').append(templates['panes']());\\n console.log('-- rendered top level UI html --');\\n}\",\n \"function actuallyRender() {\\n\\n // The `_viewRender` method is broken out to abstract away from having\\n // too much code in `actuallyRender`.\\n root._render().done(function() {\\n // If there are no children to worry about, complete the render\\n // instantly.\\n if (!_.keys(root.views).length) {\\n return resolve();\\n }\\n\\n // Create a list of promises to wait on until rendering is done.\\n // Since this method will run on all children as well, its sufficient\\n // for a full hierarchical.\\n var promises = _.map(root.views, function(view) {\\n var insert = _.isArray(view);\\n\\n // If items are being inserted, they will be in a non-zero length\\n // Array.\\n if (insert && view.length) {\\n // Mark each subview's manager so they don't attempt to attach by\\n // themselves. Return a single promise representing the entire\\n // render.\\n return root.when(_.map(view, function(subView) {\\n subView.__manager__.insertedViaFragment = true;\\n return subView.render().__manager__.renderDeferred;\\n }));\\n }\\n\\n // Only return the fetch deferred, resolve the main deferred after\\n // the element has been attached to it's parent.\\n return !insert ? view.render().__manager__.renderDeferred : view;\\n });\\n\\n // Once all nested Views have been rendered, resolve this View's\\n // deferred.\\n root.when(promises).done(resolve);\\n });\\n }\",\n \"render() {\\n this.notify('initial-load', {});\\n /**\\n * Used to load context menu\\n */\\n this.trigger('load');\\n this.notify('initial-end', {});\\n this.renderElements();\\n this.renderComplete();\\n }\",\n \"render() {\\n this.notify('initial-load', {});\\n /**\\n * Used to load context menu\\n */\\n this.trigger('load');\\n this.notify('initial-end', {});\\n this.renderElements();\\n this.renderComplete();\\n }\",\n \"render() {\\n this.notify('initial-load', {});\\n /**\\n * Used to load context menu\\n */\\n this.trigger('load');\\n this.notify('initial-end', {});\\n this.renderElements();\\n this.renderComplete();\\n }\",\n \"function render() {\\n\\t\\t\\t}\",\n \"function Render() {\\n ClearScreen();\\n RenderEnergeticDroplets();\\n ResetRenderingConditions();\\n}\",\n \"function render() {\\n\\n\\t\\t\\t}\",\n \"function main() {\\n\\t\\t\\ttry{\\n\\t\\t\\t\\trender();\\n\\t\\t\\t} catch(e) {\\n\\t\\t\\t\\tconsole.log(e);\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(rendering == true) {\\n\\t\\t\\t\\traf(main.bind(this));\\n\\t\\t\\t}\\n\\t\\t}\",\n \"_renderScreen() {\\n\\t\\tif (this._el && this._component) {\\n\\t\\t\\tthis._component.render(this._el);\\n\\t\\t}\\n\\t}\",\n \"render() {\\n if (this.renderer) {\\n this.renderer.call(this.owner, this.content, this.owner, this.model);\\n }\\n }\",\n \"render() {\\n //using template function to render component\\n const html = this.getTemplate().call(this, (this.getData())).trim();\\n // generate virtual dom tree\\n const tree = tvdom.parse(html);\\n const lastRender = this._lastRender;\\n // update component\\n if (lastRender) {\\n // diff two trees: last and current\\n const patches = tvdom.diff(lastRender.tree, tree);\\n if (!this._isEmptyObject(patches)) {\\n // patch last dom tree\\n tvdom.patch(lastRender.root, patches);\\n // save changes\\n lastRender.html = html;\\n lastRender.tree = tree;\\n }\\n } else {\\n // first time render dom tree\\n const root = tree.render();\\n this._$mountPoint.empty().html(root);\\n // save render states\\n this._lastRender = { mountPoint: this.getMountPoint(), html, tree, root}\\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 \"function render() {\\n\\tclearCanvas();\\n\\tRenderer.draw();\\n\\t\\n\\t\\t\\n}\",\n \"render() {\\n if (!this.initialized) this.init();\\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 \"render(container) {\\n this.renderer.render(container);\\n }\",\n \"render() { this.screen.render() }\",\n \"render() {\\n\\t\\tif (!this.component_.element) {\\n\\t\\t\\tthis.component_.element = document.createElement('div');\\n\\t\\t}\\n\\t\\tthis.emit('rendered', !this.isRendered_);\\n\\t}\",\n \"function init() { render(this); }\",\n \"_update() {\\n render(this._template(), this.shadowRoot, {eventContext: this});\\n }\",\n \"render() {\\n const { rootNode, sizeSet } = this;\\n let visualIndex = this.visualIndex;\\n\\n if (this.isSharedViewSet() && sizeSet.isPlaceOn(WORKING_SPACE_BOTTOM)) {\\n visualIndex += sizeSet.sharedSize.nextSize;\\n }\\n\\n let node = rootNode.childNodes[visualIndex];\\n\\n if (node.tagName !== this.childNodeType) {\\n const newNode = this.nodesPool();\\n\\n rootNode.replaceChild(newNode, node);\\n node = newNode;\\n }\\n\\n this.collectedNodes.push(node);\\n this.visualIndex += 1;\\n }\",\n \"render() {\\n return this.renderChildren() || null;\\n }\",\n \"function createRootComponentView(rNode,def,rootView,rendererFactory,renderer,sanitizer){resetComponentState();var tView=rootView[TVIEW];var componentView=createLView(rootView,getOrCreateTView(def.template,def.consts,def.vars,def.directiveDefs,def.pipeDefs,def.viewQuery),null,def.onPush?8/* Dirty */:4/* CheckAlways */,rendererFactory,renderer,sanitizer);var tNode=createNodeAtIndex(0,3/* Element */,rNode,null,null);if(tView.firstTemplatePass){diPublicInInjector(getOrCreateNodeInjectorForNode(tNode,rootView),rootView,def.type);tNode.flags=1/* isComponent */;initNodeFlags(tNode,rootView.length,1);queueComponentIndexForCheck(tNode);}// Store component view at node index, with node as the HOST\\ncomponentView[HOST]=rootView[HEADER_OFFSET];componentView[HOST_NODE]=tNode;return rootView[HEADER_OFFSET]=componentView;}\",\n \"function render() {\\n\\t}\",\n \"function handleRender() {\\n view._isRendered = true;\\n triggerDOMRefresh();\\n }\",\n \"function handleRender() {\\n view._isRendered = true;\\n triggerDOMRefresh();\\n }\",\n \"function render() {\\n\\t\\t\\n\\t}\",\n \"function fixRender()\\n {\\n cls.add(d.documentElement, 'v-fix-render');\\n\\n if (fixtimeout) clearTimeout(fixtimeout);\\n\\n fixtimeout = setTimeout(function () {\\n cls.remove(d.documentElement, 'v-fix-render');\\n }, 500);\\n }\",\n \"function completeRender() {\\n var afterRender = options.afterRender;\\n\\n if (afterRender) {\\n afterRender.call(root, root);\\n }\\n\\n // Always emit an afterRender event.\\n root.trigger(\\\"afterRender\\\", root);\\n }\",\n \"function completeRender() {\\n var afterRender = options.afterRender;\\n\\n if (afterRender) {\\n afterRender.call(root, root);\\n }\\n\\n // Always emit an afterRender event.\\n root.trigger(\\\"afterRender\\\", root);\\n }\",\n \"render() {\\n // Subclasses should override\\n }\",\n \"render(){if(this.renderer){this.renderer.call(this.owner,this.content,this.owner,this.model)}}\",\n \"function render() {\\n\\t// actually display the scene in the Dom element\\n\\trenderer.render( scene, camera );\\n}\",\n \"sysRender() {\\n \\n let rendered = this.render();\\n \\n // If render() returns a String, then insert that as innerHTML in the\\n // Part View node. Otherwise, do something else (TODO)\\n \\n if (typeof rendered === 'string') {\\n this.domNode.innerHTML = rendered;\\n } else if (false) { // TODO: test for jQuery return, DOM Node object, etc.\\n // WHAT? \\n }\\n }\",\n \"render() {\\n if (!this.initialized) {\\n this.init();\\n }\\n }\",\n \"onBeforeRendering() {}\",\n \"render() {\\n console.debug(`Rendering DOM of ${this.constructor.name}`);\\n this.shadowRoot.innerHTML = this.html;\\n if (this.script != null) {\\n console.debug(`Running script of ${this.constructor.name}`);\\n this.script();\\n console.debug(`Finished running script of ${this.constructor.name}`);\\n }\\n console.debug(`Finished rendering DOM of ${this.constructor.name}`);\\n }\",\n \"function lateRender() {\\n\\t\\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\\n\\t\\t\\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\\n\\t\\t\\t\\trenderView();\\n\\t\\t\\t}\\n\\t\\t},0);\\n\\t}\",\n \"function lateRender() {\\n\\t\\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\\n\\t\\t\\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\\n\\t\\t\\t\\trenderView();\\n\\t\\t\\t}\\n\\t\\t},0);\\n\\t}\",\n \"function lateRender() {\\n\\t\\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\\n\\t\\t\\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\\n\\t\\t\\t\\trenderView();\\n\\t\\t\\t}\\n\\t\\t},0);\\n\\t}\",\n \"function lateRender() {\\n\\t\\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\\n\\t\\t\\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\\n\\t\\t\\t\\trenderView();\\n\\t\\t\\t}\\n\\t\\t},0);\\n\\t}\",\n \"function lateRender() {\\n\\t\\tsetTimeout(function() { // IE7 needs this so dimensions are calculated correctly\\n\\t\\t\\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\\n\\t\\t\\t\\trenderView();\\n\\t\\t\\t}\\n\\t\\t},0);\\n\\t}\",\n \"function handleRender() {\\n\\t view._isRendered = true;\\n\\t triggerDOMRefresh();\\n\\t }\",\n \"function lateRender() {\\n\\t\\tsetTimeout( function() { // IE7 needs this so dimensions are calculated correctly\\n\\t\\t\\t\\t\\tif (!currentView.start && bodyVisible()) { // !currentView.start makes sure this never happens more than once\\n\\t\\t\\t\\t\\t\\trenderView();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}, 0);\\n\\t}\",\n \"render() {\\n\\t\\tthis.patch();\\n\\t}\",\n \"function render() {\\n\\t if(stopped || scene.contextLost) {\\n\\t return\\n\\t }\\n\\t requestAnimationFrame(render)\\n\\t redraw()\\n\\t }\",\n \"function render() {\\n\\t if(stopped || scene.contextLost) {\\n\\t return\\n\\t }\\n\\t requestAnimationFrame(render)\\n\\t redraw()\\n\\t }\",\n \"static rendered () {}\",\n \"static rendered () {}\",\n \"renderIncDom() {\\n\\t\\tif (this.component_.render) {\\n\\t\\t\\tthis.component_.render();\\n\\t\\t} else {\\n\\t\\t\\tIncrementalDOM.elementVoid('div');\\n\\t\\t}\\n\\t}\",\n \"postRendering() {\\n this.ctx.restore();\\n }\",\n \"build() {\\n const componentsRenderer =\\n this.namespace().ComponentRenderer.new({ rootComponent: this })\\n\\n this.renderWith(componentsRenderer)\\n }\",\n \"function render(element, launchInfo) {\\n const container = createElement('ROOT');\\n const node = ElectronRenderer.createContainer(container);\\n\\n // This is a hack to be able to test whether App passes this to `onReady`\\n container.launchInfo = launchInfo;\\n\\n ElectronRenderer.updateContainer(element, node, null);\\n\\n return container;\\n}\",\n \"render () {\\n let data = this.getData();\\n this._tree = this._createTree(data);\\n this._toolTip = this._createToolTip();\\n this._updateTree(this.getRoot());\\n }\",\n \"render() {\\n\\t\\trenderer.render(scene, camera);\\n\\t}\",\n \"render() {\\n\\t\\trenderer.render(scene, camera);\\n\\t}\",\n \"onAfterRendering() {}\",\n \"render() {\\n const self = this;\\n const data = self.get('data');\\n if (!data) {\\n throw new Error('data must be defined first');\\n }\\n self.clear();\\n self.emit('beforerender');\\n self.refreshLayout(this.get('fitView'));\\n self.emit('afterrender');\\n }\",\n \"displayScene() {\\n // entry point for graph rendering\\n //TODO: Render loop starting at root of graph\\n //console.log(this.nodes)\\n this.components[this.idRoot].display();\\n }\",\n \"afterRender() { }\",\n \"afterRender() { }\",\n \"init() {\\n this.render();\\n }\",\n \"init() {\\n this.render();\\n }\",\n \"function render() {\\n if(stopped || scene.contextLost) {\\n return\\n }\\n requestAnimationFrame(render)\\n redraw()\\n }\",\n \"render() {\\n\\n\\t}\",\n \"render() {\\n\\n\\t}\",\n \"function resolve() {\\n\\n // Insert all subViews into the parent at once.\\n _.each(root.views, function(views, selector) {\\n // Fragments aren't used on arrays of subviews.\\n if (_.isArray(views)) {\\n root.htmlBatch(root, views, selector);\\n }\\n });\\n\\n // If there is a parent and we weren't attached to it via the previous\\n // method (single view), attach.\\n if (parent && !manager.insertedViaFragment) {\\n if (!root.contains(parent.el, root.el)) {\\n // Apply the partial using parent's html() method.\\n parent.partial(parent.$el, root.$el, rentManager, manager);\\n }\\n }\\n\\n // Ensure events are always correctly bound after rendering.\\n root.delegateEvents();\\n\\n // Set this View as successfully rendered.\\n root.hasRendered = true;\\n manager.renderInProgress = false;\\n\\n // Clear triggeredByRAF flag.\\n delete manager.triggeredByRAF;\\n\\n // Only process the queue if it exists.\\n if (manager.queue && manager.queue.length) {\\n // Ensure that the next render is only called after all other\\n // `done` handlers have completed. This will prevent `render`\\n // callbacks from firing out of order.\\n (manager.queue.shift())();\\n } else {\\n // Once the queue is depleted, remove it, the render process has\\n // completed.\\n delete manager.queue;\\n }\\n\\n // Reusable function for triggering the afterRender callback and event.\\n function completeRender() {\\n var console = window.console;\\n var afterRender = root.afterRender;\\n\\n if (afterRender) {\\n afterRender.call(root, root);\\n }\\n\\n // Always emit an afterRender event.\\n root.trigger(\\\"afterRender\\\", root);\\n\\n // If there are multiple top level elements and `el: false` is used,\\n // display a warning message and a stack trace.\\n if (manager.noel && root.$el.length > 1) {\\n // Do not display a warning while testing or if warning suppression\\n // is enabled.\\n if (_.isFunction(console.warn) && !root.suppressWarnings) {\\n console.warn(\\\"`el: false` with multiple top level elements is \\\" +\\n \\\"not supported.\\\");\\n\\n // Provide a stack trace if available to aid with debugging.\\n if (_.isFunction(console.trace)) {\\n console.trace();\\n }\\n }\\n }\\n }\\n\\n // If the parent is currently rendering, wait until it has completed\\n // until calling the nested View's `afterRender`.\\n if (rentManager && (rentManager.renderInProgress || rentManager.queue)) {\\n // Wait until the parent View has finished rendering, which could be\\n // asynchronous, and trigger afterRender on this View once it has\\n // completed.\\n parent.once(\\\"afterRender\\\", completeRender);\\n } else {\\n // This View and its parent have both rendered.\\n completeRender();\\n }\\n\\n return def.resolveWith(root, [root]);\\n }\",\n \"_render() {}\",\n \"render() {\\n this.el.innerHTML = this.template();\\n\\n setTimeout(() => {\\n this.bindUIElements();\\n }, 0);\\n }\",\n \"render() {\\n // background box.\\n this.renderBackground();\\n this.renderName();\\n this.renderTimeLine();\\n this.renderWave();\\n }\",\n \"function createRootComponentView(rNode, def, rootView, rendererFactory, renderer, sanitizer) {\\n resetComponentState();\\n var tView = rootView[TVIEW];\\n var componentView = createLView(rootView, getOrCreateTView(def.template, def.consts, def.vars, def.directiveDefs, def.pipeDefs, def.viewQuery), null, def.onPush ? 8 /* Dirty */ : 4 /* CheckAlways */, rendererFactory, renderer, sanitizer);\\n var tNode = createNodeAtIndex(0, 3 /* Element */, rNode, null, null);\\n if (tView.firstTemplatePass) {\\n diPublicInInjector(getOrCreateNodeInjectorForNode(tNode, rootView), rootView, def.type);\\n tNode.flags = 1 /* isComponent */;\\n initNodeFlags(tNode, rootView.length, 1);\\n queueComponentIndexForCheck(tNode);\\n }\\n // Store component view at node index, with node as the HOST\\n componentView[HOST] = rootView[HEADER_OFFSET];\\n componentView[HOST_NODE] = tNode;\\n return rootView[HEADER_OFFSET] = componentView;\\n}\",\n \"function createRootComponentView(rNode, def, rootView, rendererFactory, renderer, sanitizer) {\\n resetComponentState();\\n var tView = rootView[TVIEW];\\n var componentView = createLView(rootView, getOrCreateTView(def.template, def.consts, def.vars, def.directiveDefs, def.pipeDefs, def.viewQuery), null, def.onPush ? 8 /* Dirty */ : 4 /* CheckAlways */, rendererFactory, renderer, sanitizer);\\n var tNode = createNodeAtIndex(0, 3 /* Element */, rNode, null, null);\\n if (tView.firstTemplatePass) {\\n diPublicInInjector(getOrCreateNodeInjectorForNode(tNode, rootView), rootView, def.type);\\n tNode.flags = 1 /* isComponent */;\\n initNodeFlags(tNode, rootView.length, 1);\\n queueComponentIndexForCheck(tNode);\\n }\\n // Store component view at node index, with node as the HOST\\n componentView[HOST] = rootView[HEADER_OFFSET];\\n componentView[HOST_NODE] = tNode;\\n return rootView[HEADER_OFFSET] = componentView;\\n}\",\n \"render() {\\n this.shadowRoot.innerHTML = this.template;\\n }\",\n \"renderMain()\\n {\\n if (this.state.registering)\\n {\\n return this.renderRegistration();\\n }\\n else if(!this.state.loggedin)\\n {\\n return this.renderLogIn();\\n }\\n else\\n {\\n return this.renderBrowser();\\n }\\n }\",\n \"function render() {\\n \\trequestAnimationFrame( render );\\n control.update(0.5);\\n \\trenderer.render( scene, camera );\\n }\",\n \"function render() {\\n \\trequestAnimationFrame( render );\\n control.update(0.5);\\n \\trenderer.render( scene, camera );\\n }\",\n \"draw(modelView) {\\n if (this.root != null && this.renderer != null) {\\n this.renderer.draw(this.root, modelView);\\n }\\n }\",\n \"render() { return super.render(); }\",\n \"function createRootComponentView(rNode, def, rootView, rendererFactory, renderer, sanitizer) {\\n resetComponentState();\\n var tView = rootView[TVIEW];\\n ngDevMode && assertDataInRange(rootView, 0 + HEADER_OFFSET);\\n rootView[0 + HEADER_OFFSET] = rNode;\\n var tNode = getOrCreateTNode(tView, null, 0, 3 /* Element */, null, null);\\n var componentView = createLView(rootView, getOrCreateTView(def), null, def.onPush ? 64 /* Dirty */ : 16 /* CheckAlways */, rootView[HEADER_OFFSET], tNode, rendererFactory, renderer, sanitizer);\\n if (tView.firstTemplatePass) {\\n diPublicInInjector(getOrCreateNodeInjectorForNode(tNode, rootView), rootView, def.type);\\n tNode.flags = 1 /* isComponent */;\\n initNodeFlags(tNode, rootView.length, 1);\\n queueComponentIndexForCheck(tNode);\\n }\\n // Store component view at node index, with node as the HOST\\n return rootView[HEADER_OFFSET] = componentView;\\n}\",\n \"function render() {\\n if (frameBuffers.length > 0) {\\n drawScene(gl, programInfo);\\n }\\n requestAnimationFrame(render);\\n }\",\n \"function render() {\\n\\n\\t\\t\\tisRendered = true;\\n\\n\\t\\t\\trenderSource();\\n\\n\\t\\t}\",\n \"Render(){\\n throw new Error(\\\"Render() method must be implemented in child!\\\");\\n }\",\n \"initialize(){super.initialize(),this.renderRoot=this.createRenderRoot(),window.ShadowRoot&&this.renderRoot instanceof window.ShadowRoot&&this.adoptStyles()}\",\n \"function render() {\\n\\n isRendered = true;\\n\\n renderSource();\\n\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7567403","0.734714","0.7108107","0.7062153","0.6986511","0.69759756","0.6908444","0.6891713","0.6869012","0.6835855","0.67799586","0.6750756","0.67459285","0.6744858","0.66837424","0.6667817","0.6663176","0.66528493","0.6623243","0.6623243","0.6623243","0.6576639","0.6535243","0.6526674","0.6495577","0.6489391","0.64877415","0.6461924","0.64528364","0.6450774","0.644311","0.64226794","0.64129454","0.6403083","0.6375176","0.6363976","0.63609374","0.63590574","0.6345103","0.63057655","0.6304263","0.62916803","0.62916803","0.6288342","0.62837654","0.62760305","0.62760305","0.6269533","0.62620825","0.6251945","0.6224105","0.62147653","0.6209522","0.62084746","0.62027735","0.62027735","0.62027735","0.62027735","0.62027735","0.6193713","0.61882496","0.6187329","0.61836016","0.61836016","0.6181917","0.6181917","0.61765176","0.6175386","0.6172019","0.61513126","0.6144299","0.6133194","0.6133194","0.6132356","0.6130589","0.6126715","0.61228716","0.61228716","0.6119139","0.6119139","0.6118671","0.61077154","0.61077154","0.6106204","0.61047304","0.6096923","0.6095073","0.6089928","0.6089928","0.608835","0.6077871","0.60747325","0.60747325","0.6072696","0.6070982","0.60695255","0.6063285","0.6056833","0.60554343","0.604174","0.60348403"],"string":"[\n \"0.7567403\",\n \"0.734714\",\n \"0.7108107\",\n \"0.7062153\",\n \"0.6986511\",\n \"0.69759756\",\n \"0.6908444\",\n \"0.6891713\",\n \"0.6869012\",\n \"0.6835855\",\n \"0.67799586\",\n \"0.6750756\",\n \"0.67459285\",\n \"0.6744858\",\n \"0.66837424\",\n \"0.6667817\",\n \"0.6663176\",\n \"0.66528493\",\n \"0.6623243\",\n \"0.6623243\",\n \"0.6623243\",\n \"0.6576639\",\n \"0.6535243\",\n \"0.6526674\",\n \"0.6495577\",\n \"0.6489391\",\n \"0.64877415\",\n \"0.6461924\",\n \"0.64528364\",\n \"0.6450774\",\n \"0.644311\",\n \"0.64226794\",\n \"0.64129454\",\n \"0.6403083\",\n \"0.6375176\",\n \"0.6363976\",\n \"0.63609374\",\n \"0.63590574\",\n \"0.6345103\",\n \"0.63057655\",\n \"0.6304263\",\n \"0.62916803\",\n \"0.62916803\",\n \"0.6288342\",\n \"0.62837654\",\n \"0.62760305\",\n \"0.62760305\",\n \"0.6269533\",\n \"0.62620825\",\n \"0.6251945\",\n \"0.6224105\",\n \"0.62147653\",\n \"0.6209522\",\n \"0.62084746\",\n \"0.62027735\",\n \"0.62027735\",\n \"0.62027735\",\n \"0.62027735\",\n \"0.62027735\",\n \"0.6193713\",\n \"0.61882496\",\n \"0.6187329\",\n \"0.61836016\",\n \"0.61836016\",\n \"0.6181917\",\n \"0.6181917\",\n \"0.61765176\",\n \"0.6175386\",\n \"0.6172019\",\n \"0.61513126\",\n \"0.6144299\",\n \"0.6133194\",\n \"0.6133194\",\n \"0.6132356\",\n \"0.6130589\",\n \"0.6126715\",\n \"0.61228716\",\n \"0.61228716\",\n \"0.6119139\",\n \"0.6119139\",\n \"0.6118671\",\n \"0.61077154\",\n \"0.61077154\",\n \"0.6106204\",\n \"0.61047304\",\n \"0.6096923\",\n \"0.6095073\",\n \"0.6089928\",\n \"0.6089928\",\n \"0.608835\",\n \"0.6077871\",\n \"0.60747325\",\n \"0.60747325\",\n \"0.6072696\",\n \"0.6070982\",\n \"0.60695255\",\n \"0.6063285\",\n \"0.6056833\",\n \"0.60554343\",\n \"0.604174\",\n \"0.60348403\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80685,"cells":{"query":{"kind":"string","value":"Don't add it. See `./inlinetyped.js` for an explanation."},"document":{"kind":"string","value":"function createPortal$1(children,containerInfo,// TODO: figure out the API for cross-renderer implementation.\nimplementation){var key=arguments.length>3&&arguments[3]!==undefined?arguments[3]:null;return{// This tag allow us to uniquely identify this as a React Portal\n$$typeof:REACT_PORTAL_TYPE,key:key==null?null:''+key,children:children,containerInfo:containerInfo,implementation:implementation};}// TODO: this is special because it gets imported during build."},"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 ignore() { }","function notInlineUseCase() { console.log('Not an inline use case');}","function IGNORE() {\r\n //Do not delete.\r\n }","get Ignore() {}","function skipHello(){saidHello=true;}","function reserved(){}","function Noop() {}","function Noop() {}","function Noop() {}","function noOP() {\n }","function noOP() {\n }","function noop(){}// No operation performed.","function noop(){}// No operation performed.","function noop(){}// No operation performed.","function noop(){}// No operation performed.","function noop(){}// No operation performed.","function noop(){}// No operation performed.","function noop(){}// No operation performed.","hacky(){\n return\n }","function nonewFun() {}","function nope() {}","function nope() {}","function doNothing() { }","function nop() {\n // What's the deal with airline food?\n}","function dummy(){}","function dummy(){}","function dummy(){}","no_op() {}","function noop(){\n\t// Left intentionally blank. \n}","function Noop(data) {\r\n\r\n}","function acabarPreInversion (){\n \n realizandoInversion = false \n}","function doNothing() {}","function doNothing() {}","function doNothing() {}","function doNothing() {}","function doNothing() {}","set Ignore(value) {}","function _hidden() {}","function ignore() {\n return null\n}","function ignore() {\n return null;\n}","function doNothing() {\n }","function dummy() {}","function dummy() {}","function dummy() {}","function _noop() {}","function _noop() {}","function _noop() {}","function _noop() {}","function _noop() {}","function _noop() {}","function _noop() {}","function _noop(){}","inorder() {\n throw new Error(\"This method hasn't been implemented yet!\");\n }","function inside() {\n return false;\n }","function inside() {\n return false;\n }","function inside() {\n return false;\n }","function inside() {\n return false;\n }","function inside() {\n return false;\n }","function inside() {\n return false;\n }","function inception() {\n \tinception();\n }","function ignore() {\n return null\n }","function nope() {\n\n}","function getYepnope () {\n var y = yepnope;\n y['loader'] = {\n \"load\": load,\n \"i\" : 0\n };\n return y;\n }","function getYepnope () {\n var y = yepnope;\n y['loader'] = {\n \"load\": load,\n \"i\" : 0\n };\n return y;\n }","function noop () { }","function noop () { }","function noop () { }","function noop () { }","function init() {\n //no-op\n}","function init() {\n //no-op\n}","function SkipSelfDecorator() {}","function SkipSelfDecorator() {}","function SkipSelfDecorator() {}","function skipHello() {\n saidHello = true;\n}","function noOp() {\n return;\n}","function nop() {}","function nop() {}","function nop() {}","function skipHello() {\n saidHello = true;\n}","function skipHello() {\n saidHello = true;\n}","function skipHello() {\n saidHello = true;\n}","function skipHello() {\n saidHello = true;\n}","function skipHello() {\n saidHello = true;\n}","function doNothing() { /* empty */ }","preset () { return false }","function no_op () {}","function noop() { } // tslint:disable-line:no-empty","function noop(){\r\n\r\n }","function Dummy() {}","function Dummy() {}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}","function noop(){}"],"string":"[\n \"function ignore() { }\",\n \"function notInlineUseCase() { console.log('Not an inline use case');}\",\n \"function IGNORE() {\\r\\n //Do not delete.\\r\\n }\",\n \"get Ignore() {}\",\n \"function skipHello(){saidHello=true;}\",\n \"function reserved(){}\",\n \"function Noop() {}\",\n \"function Noop() {}\",\n \"function Noop() {}\",\n \"function noOP() {\\n }\",\n \"function noOP() {\\n }\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"hacky(){\\n return\\n }\",\n \"function nonewFun() {}\",\n \"function nope() {}\",\n \"function nope() {}\",\n \"function doNothing() { }\",\n \"function nop() {\\n // What's the deal with airline food?\\n}\",\n \"function dummy(){}\",\n \"function dummy(){}\",\n \"function dummy(){}\",\n \"no_op() {}\",\n \"function noop(){\\n\\t// Left intentionally blank. \\n}\",\n \"function Noop(data) {\\r\\n\\r\\n}\",\n \"function acabarPreInversion (){\\n \\n realizandoInversion = false \\n}\",\n \"function doNothing() {}\",\n \"function doNothing() {}\",\n \"function doNothing() {}\",\n \"function doNothing() {}\",\n \"function doNothing() {}\",\n \"set Ignore(value) {}\",\n \"function _hidden() {}\",\n \"function ignore() {\\n return null\\n}\",\n \"function ignore() {\\n return null;\\n}\",\n \"function doNothing() {\\n }\",\n \"function dummy() {}\",\n \"function dummy() {}\",\n \"function dummy() {}\",\n \"function _noop() {}\",\n \"function _noop() {}\",\n \"function _noop() {}\",\n \"function _noop() {}\",\n \"function _noop() {}\",\n \"function _noop() {}\",\n \"function _noop() {}\",\n \"function _noop(){}\",\n \"inorder() {\\n throw new Error(\\\"This method hasn't been implemented yet!\\\");\\n }\",\n \"function inside() {\\n return false;\\n }\",\n \"function inside() {\\n return false;\\n }\",\n \"function inside() {\\n return false;\\n }\",\n \"function inside() {\\n return false;\\n }\",\n \"function inside() {\\n return false;\\n }\",\n \"function inside() {\\n return false;\\n }\",\n \"function inception() {\\n \\tinception();\\n }\",\n \"function ignore() {\\n return null\\n }\",\n \"function nope() {\\n\\n}\",\n \"function getYepnope () {\\n var y = yepnope;\\n y['loader'] = {\\n \\\"load\\\": load,\\n \\\"i\\\" : 0\\n };\\n return y;\\n }\",\n \"function getYepnope () {\\n var y = yepnope;\\n y['loader'] = {\\n \\\"load\\\": load,\\n \\\"i\\\" : 0\\n };\\n return y;\\n }\",\n \"function noop () { }\",\n \"function noop () { }\",\n \"function noop () { }\",\n \"function noop () { }\",\n \"function init() {\\n //no-op\\n}\",\n \"function init() {\\n //no-op\\n}\",\n \"function SkipSelfDecorator() {}\",\n \"function SkipSelfDecorator() {}\",\n \"function SkipSelfDecorator() {}\",\n \"function skipHello() {\\n saidHello = true;\\n}\",\n \"function noOp() {\\n return;\\n}\",\n \"function nop() {}\",\n \"function nop() {}\",\n \"function nop() {}\",\n \"function skipHello() {\\n saidHello = true;\\n}\",\n \"function skipHello() {\\n saidHello = true;\\n}\",\n \"function skipHello() {\\n saidHello = true;\\n}\",\n \"function skipHello() {\\n saidHello = true;\\n}\",\n \"function skipHello() {\\n saidHello = true;\\n}\",\n \"function doNothing() { /* empty */ }\",\n \"preset () { return false }\",\n \"function no_op () {}\",\n \"function noop() { } // tslint:disable-line:no-empty\",\n \"function noop(){\\r\\n\\r\\n }\",\n \"function Dummy() {}\",\n \"function Dummy() {}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\",\n \"function noop(){}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.68530124","0.62983644","0.61769766","0.6062427","0.60414135","0.5965747","0.59498113","0.59498113","0.59498113","0.59405136","0.59405136","0.5831074","0.5831074","0.5831074","0.5831074","0.5831074","0.5831074","0.5831074","0.580174","0.579486","0.57814693","0.57814693","0.5763879","0.57563245","0.57562125","0.57562125","0.57562125","0.573624","0.5723673","0.5690332","0.568695","0.56852955","0.56852955","0.56852955","0.56852955","0.56852955","0.5680543","0.5678251","0.56697804","0.5667185","0.56661487","0.56412536","0.56412536","0.56412536","0.5621865","0.5621865","0.5621865","0.5621865","0.5621865","0.5621865","0.5621865","0.55894554","0.5567686","0.5555717","0.5555717","0.5555717","0.5555717","0.5555717","0.5555717","0.55539787","0.55429643","0.5542452","0.55369717","0.55369717","0.553614","0.553614","0.553614","0.553614","0.55246043","0.55246043","0.5523508","0.5523508","0.5523508","0.55222106","0.55177313","0.54945","0.54945","0.54945","0.549355","0.549355","0.549355","0.549355","0.549355","0.5483854","0.5483604","0.5475373","0.54628927","0.54611737","0.5451965","0.5451965","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906","0.5447906"],"string":"[\n \"0.68530124\",\n \"0.62983644\",\n \"0.61769766\",\n \"0.6062427\",\n \"0.60414135\",\n \"0.5965747\",\n \"0.59498113\",\n \"0.59498113\",\n \"0.59498113\",\n \"0.59405136\",\n \"0.59405136\",\n \"0.5831074\",\n \"0.5831074\",\n \"0.5831074\",\n \"0.5831074\",\n \"0.5831074\",\n \"0.5831074\",\n \"0.5831074\",\n \"0.580174\",\n \"0.579486\",\n \"0.57814693\",\n \"0.57814693\",\n \"0.5763879\",\n \"0.57563245\",\n \"0.57562125\",\n \"0.57562125\",\n \"0.57562125\",\n \"0.573624\",\n \"0.5723673\",\n \"0.5690332\",\n \"0.568695\",\n \"0.56852955\",\n \"0.56852955\",\n \"0.56852955\",\n \"0.56852955\",\n \"0.56852955\",\n \"0.5680543\",\n \"0.5678251\",\n \"0.56697804\",\n \"0.5667185\",\n \"0.56661487\",\n \"0.56412536\",\n \"0.56412536\",\n \"0.56412536\",\n \"0.5621865\",\n \"0.5621865\",\n \"0.5621865\",\n \"0.5621865\",\n \"0.5621865\",\n \"0.5621865\",\n \"0.5621865\",\n \"0.55894554\",\n \"0.5567686\",\n \"0.5555717\",\n \"0.5555717\",\n \"0.5555717\",\n \"0.5555717\",\n \"0.5555717\",\n \"0.5555717\",\n \"0.55539787\",\n \"0.55429643\",\n \"0.5542452\",\n \"0.55369717\",\n \"0.55369717\",\n \"0.553614\",\n \"0.553614\",\n \"0.553614\",\n \"0.553614\",\n \"0.55246043\",\n \"0.55246043\",\n \"0.5523508\",\n \"0.5523508\",\n \"0.5523508\",\n \"0.55222106\",\n \"0.55177313\",\n \"0.54945\",\n \"0.54945\",\n \"0.54945\",\n \"0.549355\",\n \"0.549355\",\n \"0.549355\",\n \"0.549355\",\n \"0.549355\",\n \"0.5483854\",\n \"0.5483604\",\n \"0.5475373\",\n \"0.54628927\",\n \"0.54611737\",\n \"0.5451965\",\n \"0.5451965\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\",\n \"0.5447906\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80686,"cells":{"query":{"kind":"string","value":"AsyncMode should be deprecated"},"document":{"kind":"string","value":"function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\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":["setAsync(){\n this.async = true;\n }","function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;lowPriorityWarning$1(false,'The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}","function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;lowPriorityWarning$1(false,'The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}","function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;lowPriorityWarning$1(false,'The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}","function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;// Using console['warn'] to evade Babel and ESLint\nconsole['warn']('The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}","enableAsyncRequest() {\n this._asyncRequest = true;\n }","function isAsyncMode(object) {\n\t {\n\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n\t hasWarnedAboutDeprecatedIsAsyncMode = true;\n\t lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n\t }\n\t }\n\n\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n\t}","function isAsyncMode(object) {\n\t {\n\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n\t hasWarnedAboutDeprecatedIsAsyncMode = true;\n\t lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n\t }\n\t }\n\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n\t}","function isAsyncMode(object) {\n\t {\n\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n\t hasWarnedAboutDeprecatedIsAsyncMode = true;\n\t lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n\t }\n\t }\n\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n\t}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, \"The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.\");\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n }","function isAsyncMode(object) {\n\t {\n\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n\t hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\t\n\t console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n\t }\n\t }\n\t\n\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n\t}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n }","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n console['warn'](\n 'The ReactIs.isAsyncMode() alias has been deprecated, ' +\n 'and will be removed in React 17+. Update your code to use ' +\n 'ReactIs.isConcurrentMode() instead. It has the exact same API.',\n );\n }\n }\n\n return (\n isConcurrentMode(object) ||\n typeOf(object) === REACT_ASYNC_MODE_TYPE\n );\n }","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, \"The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.\");\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n }","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n }","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n }","function isAsyncMode(object) {\n\t {\n\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n\t hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n\t console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n\t }\n\t }\n\n\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n\t}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n }\n }\n\n return false;\n }","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}","function isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true;\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n }\n }\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}"],"string":"[\n \"setAsync(){\\n this.async = true;\\n }\",\n \"function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;lowPriorityWarning$1(false,'The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}\",\n \"function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;lowPriorityWarning$1(false,'The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}\",\n \"function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;lowPriorityWarning$1(false,'The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}\",\n \"function isAsyncMode(object){{if(!hasWarnedAboutDeprecatedIsAsyncMode){hasWarnedAboutDeprecatedIsAsyncMode=true;// Using console['warn'] to evade Babel and ESLint\\nconsole['warn']('The ReactIs.isAsyncMode() alias has been deprecated, '+'and will be removed in React 17+. Update your code to use '+'ReactIs.isConcurrentMode() instead. It has the exact same API.');}}return isConcurrentMode(object)||typeOf(object)===REACT_ASYNC_MODE_TYPE;}\",\n \"enableAsyncRequest() {\\n this._asyncRequest = true;\\n }\",\n \"function isAsyncMode(object) {\\n\\t {\\n\\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n\\t hasWarnedAboutDeprecatedIsAsyncMode = true;\\n\\t lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n\\t }\\n\\t }\\n\\n\\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n\\t}\",\n \"function isAsyncMode(object) {\\n\\t {\\n\\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n\\t hasWarnedAboutDeprecatedIsAsyncMode = true;\\n\\t lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n\\t }\\n\\t }\\n\\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n\\t}\",\n \"function isAsyncMode(object) {\\n\\t {\\n\\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n\\t hasWarnedAboutDeprecatedIsAsyncMode = true;\\n\\t lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n\\t }\\n\\t }\\n\\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n\\t}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, \\\"The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.\\\");\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n }\",\n \"function isAsyncMode(object) {\\n\\t {\\n\\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n\\t hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\\n\\t\\n\\t console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n\\t }\\n\\t }\\n\\t\\n\\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n\\t}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n }\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\\n\\n console['warn'](\\n 'The ReactIs.isAsyncMode() alias has been deprecated, ' +\\n 'and will be removed in React 17+. Update your code to use ' +\\n 'ReactIs.isConcurrentMode() instead. It has the exact same API.',\\n );\\n }\\n }\\n\\n return (\\n isConcurrentMode(object) ||\\n typeOf(object) === REACT_ASYNC_MODE_TYPE\\n );\\n }\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, \\\"The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.\\\");\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n }\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n }\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n }\",\n \"function isAsyncMode(object) {\\n\\t {\\n\\t if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n\\t hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\\n\\n\\t console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n\\t }\\n\\t }\\n\\n\\t return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n\\t}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\\n\\n console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\\n }\\n }\\n\\n return false;\\n }\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarningWithoutStack$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\",\n \"function isAsyncMode(object) {\\n {\\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\\n hasWarnedAboutDeprecatedIsAsyncMode = true;\\n lowPriorityWarning$1(false, 'The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\\n }\\n }\\n return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71772456","0.71477026","0.71477026","0.71477026","0.707457","0.6901749","0.6824169","0.6809441","0.6809441","0.6793582","0.6785743","0.67846984","0.6757779","0.6750946","0.6745032","0.6745032","0.67303115","0.6702358","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.6701896","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195","0.66967195"],"string":"[\n \"0.71772456\",\n \"0.71477026\",\n \"0.71477026\",\n \"0.71477026\",\n \"0.707457\",\n \"0.6901749\",\n \"0.6824169\",\n \"0.6809441\",\n \"0.6809441\",\n \"0.6793582\",\n \"0.6785743\",\n \"0.67846984\",\n \"0.6757779\",\n \"0.6750946\",\n \"0.6745032\",\n \"0.6745032\",\n \"0.67303115\",\n \"0.6702358\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.6701896\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\",\n \"0.66967195\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.67276573"},"document_rank":{"kind":"string","value":"22"}}},{"rowIdx":80687,"cells":{"query":{"kind":"string","value":"connect is a facade over connectAdvanced. It turns its args into a compatible selectorFactory, which has the signature: (dispatch, options) => (nextState, nextOwnProps) => nextFinalProps connect passes its args to connectAdvanced as options, which will in turn pass them to selectorFactory each time a Connect component instance is instantiated or hot reloaded. selectorFactory returns a final props selector from its mapStateToProps, mapStateToPropsFactories, mapDispatchToProps, mapDispatchToPropsFactories, mergeProps, mergePropsFactories, and pure args. The resulting final props selector is called by the Connect component instance whenever it receives new props or store state."},"document":{"kind":"string","value":"function match(arg, factories, name) {\n for (var i = factories.length - 1; i >= 0; i--) {\n var result = factories[i](arg);\n if (result) return result;\n }\n\n return function (dispatch, options) {\n throw new Error(\"Invalid value of type \" + (typeof arg === \"undefined\" ? \"undefined\" : _typeof(arg)) + \" for \" + name + \" argument when connecting component \" + options.wrappedComponentName + \".\");\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 createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? connect_mapStateToProps : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? connect_mergeProps : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\n extraOptions = connect_objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, connect_extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? connect_mapStateToProps : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? connect_mergeProps : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\n extraOptions = connect__objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, connect__extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n\n var _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\n extraOptions = objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n\n var _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\n extraOptions = objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties$2(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends$4({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual$1 : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual$1 : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual$1 : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties$3(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends$6({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\t\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\t\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\t\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\t\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\t\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\t\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\t\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\t\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\t\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\t\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\t\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\t\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\t\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\t\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\t\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\t\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\t\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\t\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\t\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\t\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\t\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\t\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n\t _ref2$pure = _ref2.pure,\n\t pure = _ref2$pure === undefined ? true : _ref2$pure,\n\t _ref2$areStatesEqual = _ref2.areStatesEqual,\n\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\t\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\t\n\t return connectHOC(selectorFactory, _extends({\n\t // used in error messages\n\t methodName: 'connect',\n\t\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return 'Connect(' + name + ')';\n\t },\n\t\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\t\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\t\n\t }, extraOptions));\n\t };\n\t}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\"default\"] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? connect_mapStateToProps : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? connect_mergeProps[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? connect_selectorFactory[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect() {\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\"a\" /* default */] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\"a\" /* default */] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\"a\" /* default */] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\"a\" /* default */] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\"a\" /* default */] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n _ref2$pure = _ref2.pure,\n pure = _ref2$pure === undefined ? true : _ref2$pure,\n _ref2$areStatesEqual = _ref2.areStatesEqual,\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areOwnPropsEqua,\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areStatePropsEq,\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\"a\" /* default */] : _ref2$areMergedPropsE,\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return 'Connect(' + name + ')';\n },\n\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n\t var _ref = _temp === void 0 ? {} : _temp,\n\t _ref$connectHOC = _ref.connectHOC,\n\t connectHOC = _ref$connectHOC === void 0 ? _connectAdvanced.default : _ref$connectHOC,\n\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n\t mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps.default : _ref$mapStateToPropsF,\n\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps.default : _ref$mapDispatchToPro,\n\t _ref$mergePropsFactor = _ref.mergePropsFactories,\n\t mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps.default : _ref$mergePropsFactor,\n\t _ref$selectorFactory = _ref.selectorFactory,\n\t selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory.default : _ref$selectorFactory;\n\t\n\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n\t if (_ref2 === void 0) {\n\t _ref2 = {};\n\t }\n\t\n\t var _ref3 = _ref2,\n\t _ref3$pure = _ref3.pure,\n\t pure = _ref3$pure === void 0 ? true : _ref3$pure,\n\t _ref3$areStatesEqual = _ref3.areStatesEqual,\n\t areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n\t _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n\t areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _shallowEqual.default : _ref3$areOwnPropsEqua,\n\t _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n\t areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _shallowEqual.default : _ref3$areStatePropsEq,\n\t _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n\t areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _shallowEqual.default : _ref3$areMergedPropsE,\n\t extraOptions = (0, _objectWithoutPropertiesLoose2.default)(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n\t return connectHOC(selectorFactory, (0, _extends2.default)({\n\t // used in error messages\n\t methodName: 'connect',\n\t // used to compute Connect's displayName from the wrapped component's displayName.\n\t getDisplayName: function getDisplayName(name) {\n\t return \"Connect(\" + name + \")\";\n\t },\n\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n\t shouldHandleStateChanges: Boolean(mapStateToProps),\n\t // passed through to selectorFactory\n\t initMapStateToProps: initMapStateToProps,\n\t initMapDispatchToProps: initMapDispatchToProps,\n\t initMergeProps: initMergeProps,\n\t pure: pure,\n\t areStatesEqual: areStatesEqual,\n\t areOwnPropsEqual: areOwnPropsEqual,\n\t areStatePropsEqual: areStatePropsEqual,\n\t areMergedPropsEqual: areMergedPropsEqual\n\t }, extraOptions));\n\t };\n\t}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? mapStateToProps : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? mapDispatchToProps : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? mergeProps : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\n extraOptions = _objectWithoutPropertiesLoose(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? defaultMergePropsFactories : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\n extraOptions = _objectWithoutPropertiesLoose(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areMergedPropsE,\n extraOptions = (0,_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__.default)(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__.default)({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__.default : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__.default : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__.default : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__.default : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__.default : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areMergedPropsE,\n extraOptions = (0,_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__.default)(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__.default)({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? connect_mapStateToProps : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? connect_mergeProps : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\n extraOptions = Object(objectWithoutPropertiesLoose[\"a\" /* default */])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(esm_extends[\"a\" /* default */])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? connect_mapStateToProps : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? connect_mergeProps : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\n extraOptions = _objectWithoutPropertiesLoose(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, _extends({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}","function createConnect(_temp) {\n var _ref = _temp === void 0 ? {} : _temp,\n _ref$connectHOC = _ref.connectHOC,\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\"default\"] : _ref$connectHOC,\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\"default\"] : _ref$mapStateToPropsF,\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\"default\"] : _ref$mapDispatchToPro,\n _ref$mergePropsFactor = _ref.mergePropsFactories,\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\"default\"] : _ref$mergePropsFactor,\n _ref$selectorFactory = _ref.selectorFactory,\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"] : _ref$selectorFactory;\n\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n if (_ref2 === void 0) {\n _ref2 = {};\n }\n\n var _ref3 = _ref2,\n _ref3$pure = _ref3.pure,\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\n _ref3$areStatesEqual = _ref3.areStatesEqual,\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areOwnPropsEqua,\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areStatePropsEq,\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\"default\"] : _ref3$areMergedPropsE,\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\"default\"])({\n // used in error messages\n methodName: 'connect',\n // used to compute Connect's displayName from the wrapped component's displayName.\n getDisplayName: function getDisplayName(name) {\n return \"Connect(\" + name + \")\";\n },\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n shouldHandleStateChanges: Boolean(mapStateToProps),\n // passed through to selectorFactory\n initMapStateToProps: initMapStateToProps,\n initMapDispatchToProps: initMapDispatchToProps,\n initMergeProps: initMergeProps,\n pure: pure,\n areStatesEqual: areStatesEqual,\n areOwnPropsEqual: areOwnPropsEqual,\n areStatePropsEqual: areStatePropsEqual,\n areMergedPropsEqual: areMergedPropsEqual\n }, extraOptions));\n };\n}"],"string":"[\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? connect_mapStateToProps : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? connect_mergeProps : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\\n extraOptions = connect_objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, connect_extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? connect_mapStateToProps : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? connect_mergeProps : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\\n extraOptions = connect__objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, connect__extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\\n\\n var _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\\n extraOptions = objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\\n\\n var _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\\n extraOptions = objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties$2(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends$4({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? defaultMergePropsFactories : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual$1 : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual$1 : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual$1 : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties$3(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends$6({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\t\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\t\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\t\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\t\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\t\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\t\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\t\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\t\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\t\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\t\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\t\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\t\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\t\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\t\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\t\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\t\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\t\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\t\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\t\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\t\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\t\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n\\t var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\t\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n\\t var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n\\t _ref2$pure = _ref2.pure,\\n\\t pure = _ref2$pure === undefined ? true : _ref2$pure,\\n\\t _ref2$areStatesEqual = _ref2.areStatesEqual,\\n\\t areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n\\t _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n\\t _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n\\t _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n\\t extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\t\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\t\\n\\t return connectHOC(selectorFactory, _extends({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\t\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return 'Connect(' + name + ')';\\n\\t },\\n\\t\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\t\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\t\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? connectAdvanced[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? connect_mapStateToProps : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? connect_mergeProps[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? connect_selectorFactory[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? shallowEqual : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? shallowEqual : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? shallowEqual : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? _connectAdvanced2.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? _mapStateToProps2.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? _mapDispatchToProps2.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? _mergeProps2.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? _selectorFactory2.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? _shallowEqual2.default : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? _shallowEqual2.default : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? _shallowEqual2.default : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect() {\\n var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === undefined ? __WEBPACK_IMPORTED_MODULE_0__components_connectAdvanced__[\\\"a\\\" /* default */] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === undefined ? __WEBPACK_IMPORTED_MODULE_3__mapStateToProps__[\\\"a\\\" /* default */] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === undefined ? __WEBPACK_IMPORTED_MODULE_2__mapDispatchToProps__[\\\"a\\\" /* default */] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === undefined ? __WEBPACK_IMPORTED_MODULE_4__mergeProps__[\\\"a\\\" /* default */] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === undefined ? __WEBPACK_IMPORTED_MODULE_5__selectorFactory__[\\\"a\\\" /* default */] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps) {\\n var _ref2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\\n _ref2$pure = _ref2.pure,\\n pure = _ref2$pure === undefined ? true : _ref2$pure,\\n _ref2$areStatesEqual = _ref2.areStatesEqual,\\n areStatesEqual = _ref2$areStatesEqual === undefined ? strictEqual : _ref2$areStatesEqual,\\n _ref2$areOwnPropsEqua = _ref2.areOwnPropsEqual,\\n areOwnPropsEqual = _ref2$areOwnPropsEqua === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areOwnPropsEqua,\\n _ref2$areStatePropsEq = _ref2.areStatePropsEqual,\\n areStatePropsEqual = _ref2$areStatePropsEq === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areStatePropsEq,\\n _ref2$areMergedPropsE = _ref2.areMergedPropsEqual,\\n areMergedPropsEqual = _ref2$areMergedPropsE === undefined ? __WEBPACK_IMPORTED_MODULE_1__utils_shallowEqual__[\\\"a\\\" /* default */] : _ref2$areMergedPropsE,\\n extraOptions = _objectWithoutProperties(_ref2, ['pure', 'areStatesEqual', 'areOwnPropsEqual', 'areStatePropsEqual', 'areMergedPropsEqual']);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return 'Connect(' + name + ')';\\n },\\n\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n\\t var _ref = _temp === void 0 ? {} : _temp,\\n\\t _ref$connectHOC = _ref.connectHOC,\\n\\t connectHOC = _ref$connectHOC === void 0 ? _connectAdvanced.default : _ref$connectHOC,\\n\\t _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n\\t mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps.default : _ref$mapStateToPropsF,\\n\\t _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n\\t mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps.default : _ref$mapDispatchToPro,\\n\\t _ref$mergePropsFactor = _ref.mergePropsFactories,\\n\\t mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps.default : _ref$mergePropsFactor,\\n\\t _ref$selectorFactory = _ref.selectorFactory,\\n\\t selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory.default : _ref$selectorFactory;\\n\\t\\n\\t return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n\\t if (_ref2 === void 0) {\\n\\t _ref2 = {};\\n\\t }\\n\\t\\n\\t var _ref3 = _ref2,\\n\\t _ref3$pure = _ref3.pure,\\n\\t pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n\\t _ref3$areStatesEqual = _ref3.areStatesEqual,\\n\\t areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n\\t _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n\\t areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _shallowEqual.default : _ref3$areOwnPropsEqua,\\n\\t _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n\\t areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _shallowEqual.default : _ref3$areStatePropsEq,\\n\\t _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n\\t areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _shallowEqual.default : _ref3$areMergedPropsE,\\n\\t extraOptions = (0, _objectWithoutPropertiesLoose2.default)(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\t var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n\\t var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n\\t var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n\\t return connectHOC(selectorFactory, (0, _extends2.default)({\\n\\t // used in error messages\\n\\t methodName: 'connect',\\n\\t // used to compute Connect's displayName from the wrapped component's displayName.\\n\\t getDisplayName: function getDisplayName(name) {\\n\\t return \\\"Connect(\\\" + name + \\\")\\\";\\n\\t },\\n\\t // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n\\t shouldHandleStateChanges: Boolean(mapStateToProps),\\n\\t // passed through to selectorFactory\\n\\t initMapStateToProps: initMapStateToProps,\\n\\t initMapDispatchToProps: initMapDispatchToProps,\\n\\t initMergeProps: initMergeProps,\\n\\t pure: pure,\\n\\t areStatesEqual: areStatesEqual,\\n\\t areOwnPropsEqual: areOwnPropsEqual,\\n\\t areStatePropsEqual: areStatePropsEqual,\\n\\t areMergedPropsEqual: areMergedPropsEqual\\n\\t }, extraOptions));\\n\\t };\\n\\t}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? mapStateToProps : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? mapDispatchToProps : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? mergeProps : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\\n extraOptions = _objectWithoutPropertiesLoose(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? defaultMergePropsFactories : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\\n extraOptions = _objectWithoutPropertiesLoose(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areMergedPropsE,\\n extraOptions = (0,_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__.default)(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__.default)({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__.default : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__.default : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__.default : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__.default : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__.default : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__.default : _ref3$areMergedPropsE,\\n extraOptions = (0,_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__.default)(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__.default)({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? connect_mapStateToProps : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? connect_mergeProps : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\\n extraOptions = Object(objectWithoutPropertiesLoose[\\\"a\\\" /* default */])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(esm_extends[\\\"a\\\" /* default */])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? connect_mapStateToProps : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? connect_mapDispatchToProps : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? connect_mergeProps : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? finalPropsSelectorFactory : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\\n extraOptions = _objectWithoutPropertiesLoose(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, _extends({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"]);\\n\\n var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\\n var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\\n var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\\n return connectHOC(selectorFactory, Object(_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])({\\n // used in error messages\\n methodName: 'connect',\\n // used to compute Connect's displayName from the wrapped component's displayName.\\n getDisplayName: function getDisplayName(name) {\\n return \\\"Connect(\\\" + name + \\\")\\\";\\n },\\n // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\\n shouldHandleStateChanges: Boolean(mapStateToProps),\\n // passed through to selectorFactory\\n initMapStateToProps: initMapStateToProps,\\n initMapDispatchToProps: initMapDispatchToProps,\\n initMergeProps: initMergeProps,\\n pure: pure,\\n areStatesEqual: areStatesEqual,\\n areOwnPropsEqual: areOwnPropsEqual,\\n areStatePropsEqual: areStatePropsEqual,\\n areMergedPropsEqual: areMergedPropsEqual\\n }, extraOptions));\\n };\\n}\",\n \"function createConnect(_temp) {\\n var _ref = _temp === void 0 ? {} : _temp,\\n _ref$connectHOC = _ref.connectHOC,\\n connectHOC = _ref$connectHOC === void 0 ? _components_connectAdvanced__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"] : _ref$connectHOC,\\n _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\\n mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? _mapStateToProps__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"] : _ref$mapStateToPropsF,\\n _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\\n mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? _mapDispatchToProps__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"] : _ref$mapDispatchToPro,\\n _ref$mergePropsFactor = _ref.mergePropsFactories,\\n mergePropsFactories = _ref$mergePropsFactor === void 0 ? _mergeProps__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"] : _ref$mergePropsFactor,\\n _ref$selectorFactory = _ref.selectorFactory,\\n selectorFactory = _ref$selectorFactory === void 0 ? _selectorFactory__WEBPACK_IMPORTED_MODULE_7__[\\\"default\\\"] : _ref$selectorFactory;\\n\\n return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\\n if (_ref2 === void 0) {\\n _ref2 = {};\\n }\\n\\n var _ref3 = _ref2,\\n _ref3$pure = _ref3.pure,\\n pure = _ref3$pure === void 0 ? true : _ref3$pure,\\n _ref3$areStatesEqual = _ref3.areStatesEqual,\\n areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\\n _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\\n areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areOwnPropsEqua,\\n _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\\n areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areStatePropsEq,\\n _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\\n areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? _utils_shallowEqual__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"] : _ref3$areMergedPropsE,\\n extraOptions = Object(_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(_ref3, [\\\"pure\\\", \\\"areStatesEqual\\\", \\\"areOwnPropsEqual\\\", \\\"areStatePropsEqual\\\", \\\"areMergedPropsEqual\\\"