-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 *
If this map permits null values, then a return value of\\n\\t * {@code null} does not necessarily 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 remove\\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 Iterator.remove, Set.remove,\\n * removeAll retainAll, and clear operations.\\n * It does not support the add or addAll 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 k to value v such that\\n\\t * (key==null ? k==null : key.equals(k)), that mapping\\n\\t * is removed. (The map can contain at most one such mapping.)\\n\\t *\\n\\t *
Returns the value to which this map previously associated the key,\\n\\t * or null if the map contained no mapping for the key.\\n\\t *\\n\\t *
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 key, or\\n\\t * null if there was no mapping for key.\\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
\\n
\\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]"},"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]"},"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]"},"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]"},"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 \\n {\\n Object.keys(this.state.keymaps)\\n .map(key =>
\\n