{\\n if (loginResult.isCancelled) {\\n console.log('user canceled');\\n return;\\n }\\n AccessToken.getCurrentAccessToken()\\n .then(accessTokenData => {\\n const credential = this.props.provider.credential(accessTokenData.accessToken);\\n return auth.signInWithCredential(credential);\\n })\\n .then(credData => {\\n console.log(credData);\\n })\\n .catch(err => {\\n console.log(err);\\n });\\n });\\n\\n }\",\n \"componentWillUnmount() {\\n //disconnect from FB\\n }\",\n \"function auth_Facebook()\\n{\\n authenticate(new firebase.auth.FacebookAuthProvider());\\n}\",\n \"componentDidMount() {\\n this.props.facebookLogin();\\n // AsyncStorage.removeItem('fb_token');\\n // this.onAuthComplete(this.props);\\n }\",\n \"_FBPReady() {\\n super._FBPReady();\\n\\n }\",\n \"__fbpReady(){super.__fbpReady();//this._FBPTraceWires()\\n}\",\n \"__fbpReady(){super.__fbpReady();//this._FBPTraceWires()\\n}\",\n \"componentDidMount() {\\n const {\\n videoId,\\n } = this.props;\\n\\n if (typeof window !== \\\"undefined\\\") {\\n this.loadFB()\\n .then(res => {\\n if (res) {\\n this.FB = res;\\n this.createPlayer(videoId);\\n }\\n });\\n }\\n }\",\n \"componentDidMount() {\\n const _this = this;\\n\\n\\n _this._manageGlobalEventHandlers(_this.props);\\n\\n _this._FB_init(function() {\\n _this.setState({\\n initializing: false\\n });\\n });\\n }\",\n \"render() {\\n return (\\n <div id=\\\"fb-root\\\"></div>\\n )\\n }\",\n \"function facebookLogin() {\\n FB.getLoginStatus(function(response) {\\n statusChangeCallback(response);\\n });\\n}\",\n \"checkAuth() {\\n return new Promise((resolve) => {\\n window.fbAsyncInit = () => {\\n window.FB.init({\\n appId: process.env.FACEBOOK_ID,\\n cookie: true,\\n xfbml: true,\\n version: 'v2.8',\\n });\\n window.FB.AppEvents.logPageView();\\n window.FB.getLoginStatus((response) => {\\n resolve(response);\\n });\\n };\\n\\n ((d, s, id) => {\\n const fjs = d.getElementsByTagName(s)[0];\\n if (d.getElementById(id)) { return; }\\n const js = d.createElement(s); js.id = id;\\n js.src = '//connect.facebook.net/en_US/sdk.js';\\n fjs.parentNode.insertBefore(js, fjs);\\n })(document, 'script', 'facebook-jssdk');\\n });\\n }\",\n \"function testAPI() {\\n FB.api('/me', function(response) {\\n });\\n }\",\n \"_FB_init(finishedCallback) {\\n const _this = this;\\n\\n //Fail if FB is not available\\n if(typeof FB === 'undefined') {\\n throw new Error('FB-SDK was not found!')\\n }\\n\\n //Get the users AccessToken\\n FB.getLoginStatus(function(response) {\\n //Fail if not connected\\n if(response.status != 'connected') {\\n _this.props.onError(ERROR.CONNECTION_FAILED);\\n _this.set_errorMessage(MSFBPhotoSelector.TEXTS.connection_failed);\\n }\\n\\n //Load data when connected\\n else {\\n _this.setState({\\n FB_accessToken: response.authResponse.accessToken\\n });\\n\\n _this._FB_getUserAlbums(finishedCallback);\\n _this._FB_getUserImage();\\n }\\n }, true);\\n }\",\n \"FacebookAuth() {\\n return this.AuthLogin(new firebase_app__WEBPACK_IMPORTED_MODULE_1__[\\\"auth\\\"].FacebookAuthProvider());\\n }\",\n \"private public function m246() {}\",\n \"loginByFacebook() {\\n if (!this.props.accsessToken) {\\n this.props.facebookLogin();\\n } else {\\n return Alert.alert('', 'Please logout first');\\n }\\n }\",\n \"private internal function m248() {}\",\n \"function sdk(){\\n}\",\n \"onShareAppMessage() {\\n\\n }\",\n \"getUserInfoFromFB() {\\n return axios.get('/user/info/fb')\\n .then(res => {\\n console.log('User info FB: ', res.data);\\n this.setState({\\n user: res.data\\n });\\n })\\n .catch(err => {\\n console.log(err);\\n });\\n }\",\n \"frame() {\\n throw new Error('Not implemented');\\n }\",\n \"_FB_API(p1, p2, p3) {\\n if(typeof FB === 'undefined') {\\n throw new Error('FB-SDK was not found!')\\n }\\n\\n FB.api(p1, p2, p3);\\n }\",\n \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"beforeConnectedCallbackHook(){\\n\\t\\t\\n\\t}\",\n \"function testAPI() {\\n console.log('Welcome! Fetching your information.... ');\\n FB.api('/me', function(response) {\\n console.log('Successful login for: ' + response.name);\\n \\n });\\n\\n\\n \\n }\",\n \"function FacebookLoginLoad() {\\r\\n (function (d, s, id) {\\r\\n var js, fjs = d.getElementsByTagName(s)[0];\\r\\n if (d.getElementById(id)) { return; }\\r\\n js = d.createElement(s); js.id = id;\\r\\n js.src = \\\"../../../Scripts/Facebook/sdk.js\\\";\\r\\n fjs.parentNode.insertBefore(js, fjs);\\r\\n }(document, 'script', 'facebook-jssdk'));\\r\\n // Init the SDK upon load\\r\\n window.fbAsyncInit = function () {\\r\\n FB.init({\\r\\n appId: '454206028123700',\\r\\n xfbml: true,\\r\\n version: 'v2.5'\\r\\n });\\r\\n }\\r\\n}\",\n \"setFacebook(token) {\\n fetch('https://graph.facebook.com/v2.5/me?fields=email,name,friends&access_token=' + token)\\n .then((response) => response.json())\\n .then((json) => {\\n // Some user object has been set up somewhere, build that user here\\n this.setState({ fb_name: json.name, fb_email: json.email, fb_token: token, fb_user_id: json.id});\\n helper.saveFacebookData( this.state.user_id, json.email, json.name, json.id ,token );\\n return \\\"Okay\\\";\\n })\\n .catch(() => {\\n reject('ERROR GETTING DATA FROM FACEBOOK')\\n });\\n }\",\n \"function log_in_with_facebook() {\\n var provider = new firebase_ref.auth.FacebookAuthProvider();\\n log_in_with_provider(provider);\\n}\",\n \"function myFacebookLogin() {\\n FB.login(function () {\\n checkLoginState();\\n }, {scope: 'public_profile, email, user_friends'});\\n}\",\n \"handle_submit() {\\n const {article, content} = this.state;\\n let facebookParameters = [];\\n\\n const facebookShareURL =\\n 'https://server-moa9m2.turbo360-vertex.com/share/EJ5BXsTgFr43dx4Y';\\n facebookParameters.push('quote=' + encodeURI(content));\\n facebookParameters.push('u=' + encodeURI(facebookShareURL));\\n\\n console.log(facebookParameters);\\n const url =\\n 'https://www.facebook.com/sharer/sharer.php?' +\\n facebookParameters.join('&');\\n Linking.openURL(url)\\n .then(data => {\\n this.handle_cancel();\\n console.log('Facebook Opened');\\n })\\n .catch(() => {\\n console.log('Something went wrong');\\n });\\n }\",\n \"function _handleFb() {\\n\\t\\tlet shortToken;\\n\\t\\tif (window.location.hash) {\\n\\n\\t\\t\\tconsole.log(\\\"window.location\\\", window.location);\\n\\n\\t\\t\\t\\tlet accessTokenMatch = window.location.hash.match(/access_token\\\\=([a-zA-Z0-9]+)/);\\n\\t\\t\\tconsole.log(\\\"accessTokenMatch \\\", accessTokenMatch);\\n\\n\\t\\t\\tif (accessTokenMatch && accessTokenMatch[1]) {\\n\\t\\t\\t\\tshortToken = accessTokenMatch[1];\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// console.log(\\\"_handleFb \\\");\\n\\t\\t// console.log(\\\"shortToken \\\", shortToken);\\n\\n\\t\\tif (shortToken) {\\n\\t\\t\\t// We came here from Facebook redirect, with a token\\n\\t\\t\\tif (getUrlParams()[\\\"accountLinking\\\"]) {\\n\\t\\t\\t\\t_getFBMeWithShortToken({\\n\\t\\t\\t\\t\\tshortToken,\\n\\t\\t\\t\\t\\tcallback: function(data) {\\n\\n\\t\\t\\t\\t\\t\\tconsole.log(\\\"_getFBMeWithShortToken data\\\", data);\\n\\t\\t\\t\\t\\t\\t//console.log('updating', data)\\n\\t\\t\\t\\t\\t\\tupdateClient({\\\"facebookLogin\\\": data[\\\"id\\\"]}, function(d, e) {\\n\\t\\t\\t\\t\\t\\t\\tconsole.log('updated!');\\n\\t\\t\\t\\t\\t\\t\\tconsole.log(d, e);\\n\\n\\t\\t\\t\\t\\t\\t\\t_generateFBToken({\\n\\t\\t\\t\\t\\t\\t\\t\\tshortToken,\\n\\t\\t\\t\\t\\t\\t\\t\\tcallback: function(data) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tconsole.log()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (data && data[\\\"value\\\"] === \\\"ok\\\") {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t_store._fbAllowed = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t\\t\\t// Clear query parameter from address bar\\n\\t\\t\\t\\twindow.setTimeout(function() {\\n\\t\\t\\t\\t\\thistory.pushState(\\\"\\\", document.title, window.location.pathname);\\n\\t\\t\\t\\t}, 0);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\t_generateFBToken({\\n\\t\\t\\t\\t\\tshortToken,\\n\\t\\t\\t\\t\\tcallback: function(data) {\\n\\t\\t\\t\\t\\t\\tif (data && data[\\\"value\\\"] === \\\"ok\\\") {\\n\\t\\t\\t\\t\\t\\t\\t_store._fbAllowed = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif(window.altyn.zonePrefix === \\\"\\\"||(window.isMobile && window.altyn.zonePrefix ==\\\"/open\\\")){\\n\\t\\t\\t\\t//Just came on page, need to get token status\\n\\t\\t\\t\\t_getFBTokenStatus(function(response) {\\n\\t\\t\\t\\t\\tif (response && response[\\\"value\\\"] === true) {\\n\\t\\t\\t\\t\\t\\t_store._fbAllowed = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\",\n \"openMessenger() {\\n Linking.openURL('fb://messaging/' + FACEBOOK_ID);\\n }\",\n \"testAPI() {\\n console.log('Welcome! Fetching your information.... ');\\n FB.api('/me', function(response) {\\n console.log('Successful login for: ' + response.name);\\n //document.getElementById('status').innerHTML =\\n // 'Thanks for logging in, ' + response.name + '!';\\n });\\n}\",\n \"constructor() {\\n this.apiUrl = 'https://graph.facebook.com/v4.0';\\n this.access_token = process.env.ACCESS_TOKEN;\\n }\",\n \"function WebIdUtils () {\\n}\",\n \"authenticateFacebook() {\\n return this.authService.authenticate('facebook')\\n .then(() => {\\n this.authenticated = this.authService.authenticated;\\n });\\n }\",\n \"supportsPlatform() {\\n return true;\\n }\",\n \"function signInWithFb() {\\n return {\\n type: SIGN_IN_WITH_FB\\n };\\n}\",\n \"function checkFacebookTab() {\\n if (!stopFB) {\\n facebookTab((tab) => {\\n idFB = tab.id;\\n\\n if (idFB != null && tab != null) {\\n updateFBNotifications(tab.title);\\n }\\n\\n if (!tab.pinned) {\\n browser.tabs.update(tab.id, {\\n pinned: true,\\n });\\n }\\n }, () => {\\n if (idFB == null || idFB != idPrevFB) {\\n browser.tabs.create({\\n index: 0,\\n pinned: true,\\n url: 'https://www.messenger.com/',\\n active: false,\\n }).then((tab) => {\\n if (typeof tab === 'object') {\\n idFB = tab.id;\\n idPrevFB = tab.id;\\n }\\n });\\n }\\n });\\n }\\n}\",\n \"function facebookWidgetInit() {\\n var widgetMarkup = '<div class=\\\"fb-page\\\" data-href=\\\"https://www.facebook.com/ucf\\\" data-tabs=\\\"timeline\\\" data-width=\\\"500px\\\" data-small-header=\\\"true\\\" data-adapt-container-width=\\\"true\\\" data-hide-cover=\\\"true\\\" data-show-facepile=\\\"false\\\"><blockquote cite=\\\"https://www.facebook.com/ucf\\\" class=\\\"fb-xfbml-parse-ignore\\\"><a href=\\\"https://www.facebook.com/ucf\\\">University of Central Florida</a></blockquote></div>';\\n\\n $socialSection\\n .find('#js-facebook-widget')\\n .html(widgetMarkup);\\n\\n window.fbAsyncInit = function() {\\n FB.init({\\n appId : '637856803059940',\\n xfbml : true,\\n version : 'v2.8'\\n });\\n };\\n\\n (function(d, s, id){\\n var js, fjs = d.getElementsByTagName(s)[0];\\n if (d.getElementById(id)) {return;}\\n js = d.createElement(s); js.id = id;\\n js.src = \\\"//connect.facebook.net/en_US/sdk.js\\\";\\n fjs.parentNode.insertBefore(js, fjs);\\n }(document, 'script', 'facebook-jssdk'));\\n}\",\n \"statusChangeCallback(response) {\\n // The response object is returned with a status field that lets the\\n // app know the current login status of the person.\\n // Full docs on the response object can be found in the documentation\\n // for FB.getLoginStatus().\\n if (response.status === 'connected') {\\n // Logged into your app and Facebook.\\n this.setState({ token: response.authResponse.accessToken });\\n this.getLongTermToken();\\n } else if (response.status === 'not_authorized') {\\n // The person is logged into Facebook, but not your app.\\n document.getElementById('status').innerHTML = 'Please log ' +\\n 'into this app.';\\n } else {\\n // The person is not logged into Facebook, so we're not sure if\\n // they are logged into this app or not.\\n document.getElementById('status').innerHTML = 'Please log ' +\\n 'into Facebook.';\\n }\\n }\",\n \"testAPI() {\\n\\t console.log('Welcome! Fetching your information.... ');\\n\\t FB.api('/me', function(response) {\\n\\t console.log('Successful login for: ' + response.name);\\n\\t document.getElementById('status').innerHTML =\\n\\t 'Thanks for logging in, ' + response.name + '!';\\n\\t });\\n\\t}\",\n \"function FB(config) {\\r\\n this.config = config||{};\\r\\n this.started = this.init();\\r\\n}\",\n \"function testAPI() {\\n console.log('Welcome! Fetching your information.... ');\\n FB.api('/me', function(response) {\\n console.log('Successful login for: ' + response.name);\\n\\n });\\n }\",\n \"static postCode () {\\n var token = /access_token=([^&]+)/.exec(window.document.location.hash)\\n var expires_in = /expires_in=([^&]+)/.exec(window.document.location.hash)\\n var state = /state=([^&]+)/.exec(window.document.location.hash)\\n var error = /error=([^&]+)/.exec(window.document.location.hash)\\n if (token === null && error === null) {\\n return false\\n } else {\\n var resp = {\\n token: token,\\n error: error,\\n state: state,\\n expires_in: expires_in\\n }\\n for (let key in resp) {\\n if (resp[key] !== null) {\\n resp[key] = resp[key][1]\\n }\\n }\\n if (window.opener !== null) {\\n // the origin should be explicitly specified instead of \\\"*\\\"\\n window.opener.postMessage({ source: MESSAGE_SOURCE_IDENTIFIER, payload: resp }, '*')\\n }\\n return true\\n }\\n }\",\n \"function login() {\\n fb_login(userDetails);\\n}\",\n \"async componentWillMount() {\\n var _this = this\\n _this.setUpUserDataFromFB()\\n\\n //ASK FOR CAMERA ONLT IF IS PREVIEW TRUE AND SHOWBARCODE TRUE\\n if (Config.isPreview && Config.showBCScanner) {\\n const { status } = await Permissions.askAsync(Permissions.CAMERA);\\n this.setState({ hasCameraPermission: status === 'granted' });\\n }\\n\\n\\n\\n AppEventEmitter.addListener('user.state.changes', this.alterUserState);\\n if (Config.isTesterApp) {\\n this.listenForUserAuth();\\n } else if (Config.isPreview && !Config.isTesterApp) {\\n //Load list of apps\\n _this.retreiveAppDemos(\\\"apps\\\");\\n }\\n\\n if (!Config.isPreview && !Config.isTesterApp) {\\n\\n //Load the data automatically, this is normal app and refister for Push notification\\n this.registerForPushNotificationsAsync();\\n Notifications.addListener(this._handleNotification);\\n this.retreiveMeta();\\n }\\n\\n\\n await Font.loadAsync({\\n //\\\"Material Icons\\\": require(\\\"@expo/vector-icons/fonts/MaterialIcons.ttf\\\"),\\n //\\\"Ionicons\\\": require(\\\"@expo/vector-icons/fonts/Ionicons.ttf\\\"),\\n // \\\"Feather\\\": require(\\\"@expo/vector-icons/fonts/Feather.ttf\\\"),\\n 'open-sans': require('./assets/fonts/OpenSans-Regular.ttf'),\\n 'lato-light': require('./assets/fonts/Lato-Light.ttf'),\\n 'lato-regular': require('./assets/fonts/Lato-Regular.ttf'),\\n 'lato-bold': require('./assets/fonts/Lato-Bold.ttf'),\\n 'lato-black': require('./assets/fonts/Lato-Black.ttf'),\\n 'roboto-medium': require('./assets/fonts/Roboto-Medium.ttf'),\\n 'roboto-bold': require('./assets/fonts/Roboto-Bold.ttf'),\\n 'roboto-light': require('./assets/fonts/Roboto-Light.ttf'),\\n 'roboto-thin': require('./assets/fonts/Roboto-Thin.ttf'),\\n\\n });\\n\\n this.setState({ isReady: true, fontLoaded: true });\\n }\",\n \"function testAPI() {\\n console.log('Welcome! Fetching your information.... ');\\n FB.api('/me', function(response) {\\n console.log('Good to see you, ' + response.name + '.');\\n });\\n }\",\n \"function testAPI() {\\n console.log('Welcome! Fetching your information.... ');\\n FB.api('/me', function(response) {\\n console.log('Good to see you, ' + response.name + '.');\\n });\\n }\",\n \"logout() {\\n FB.logout();\\n }\",\n \"function FBConnect()\\n{\\n\\tthis.facebookkey = 'facebook';\\n\\tif(window.plugins.childBrowser == null)\\n\\t{\\n\\t\\tChildBrowser.install();\\n\\t}\\n}\",\n \"function version(){ return \\\"0.13.0\\\" }\",\n \"static checkMobileWallet(){\\n\\t\\tif(typeof window.ReactNativeWebView !== 'undefined' || typeof window.PopOutWebView !== 'undefined'){\\n\\t\\t\\tconst parseIfNeeded = x => {\\n\\t\\t\\t\\tif(x && typeof x === 'string' && x.indexOf(`{`) > -1) x = JSON.parse(x);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// For mobile popouts only.\\n\\t\\t\\tif(typeof window.ReactNativeWebView === 'undefined'){\\n\\t\\t\\t\\twindow.ReactNativeWebView = {\\n\\t\\t\\t\\t\\tpostMessage:() => {}\\n\\t\\t\\t\\t};\\n\\t\\t\\t}\\n\\n\\t\\t\\tlet resolvers = {};\\n\\n\\t\\t\\twindow.ReactNativeWebView.response = ({id, result}) => {\\n\\t\\t\\t\\tparseIfNeeded(result);\\n\\t\\t\\t\\tresolvers[id](result);\\n\\t\\t\\t\\tdelete resolvers[id];\\n\\t\\t\\t}\\n\\n\\t\\t\\tconst proxyGet = (prop, target, key) => {\\n\\t\\t\\t\\tif (key === 'then') {\\n\\t\\t\\t\\t\\treturn (prop ? target[prop] : target).then.bind(target);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(key === 'socketResponse'){\\n\\t\\t\\t\\t\\treturn (prop ? target[prop] : target)[key];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\treturn (...params) => new Promise(async resolve => {\\n\\t\\t\\t\\t\\tconst id = IdGenerator.text(24);\\n\\t\\t\\t\\t\\tresolvers[id] = resolve;\\n\\t\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({id, prop, key, params}));\\n\\t\\t\\t\\t});\\n\\t\\t\\t};\\n\\n\\t\\t\\tconst proxied = (prop) => new Proxy({}, { get(target, key){ return proxyGet(prop, target, key); } });\\n\\n\\n\\t\\t\\twindow.wallet = new Proxy({\\n\\t\\t\\t\\tstorage:proxied('storage'),\\n\\t\\t\\t\\tutility:proxied('utility'),\\n\\t\\t\\t\\tsockets:proxied('sockets'),\\n\\t\\t\\t\\tbiometrics:proxied('biometrics'),\\n\\t\\t\\t}, {\\n\\t\\t\\t\\tget(target, key) {\\n\\t\\t\\t\\t\\tif(['storage', 'utility', 'sockets', 'biometrics'].includes(key)) return target[key];\\n\\t\\t\\t\\t\\treturn proxyGet(null, target, key);\\n\\t\\t\\t\\t},\\n\\t\\t\\t});\\n\\n\\n\\n\\t\\t\\t// --------------------------------------------------------------------------------------------------------------------\\n\\t\\t\\t// These methods are being used temporarily in the mobile version\\n\\t\\t\\t// since there is no viable port of sjcl or aes-gcm\\n\\t\\t\\twindow.ReactNativeWebView.mobileEncrypt = ({id, data, key}) => {\\n\\t\\t\\t\\tparseIfNeeded(data);\\n\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:AES.encrypt(data, key)}));\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t};\\n\\n\\t\\t\\twindow.ReactNativeWebView.mobileDecrypt = ({id, data, key}) => {\\n\\t\\t\\t\\tparseIfNeeded(data);\\n\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:AES.decrypt(data, key)}));\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t};\\n\\n\\t\\t\\tconst Mnemonic = require('@walletpack/core/util/Mnemonic').default;\\n\\t\\t\\twindow.ReactNativeWebView.seedPassword = async ({id, password, salt}) => {\\n\\t\\t\\t\\tconst [_, seed] = await Mnemonic.generateMnemonic(password, salt);\\n\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:seed}));\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t};\\n\\n\\t\\t\\t// Just because doing sha256 on a buffer in react is dumb.\\n\\t\\t\\tconst ecc = require('eosjs-ecc');\\n\\t\\t\\twindow.ReactNativeWebView.sha256 = ({id, data}) => {\\n\\t\\t\\t\\tparseIfNeeded(data);\\n\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'mobile_response', id, result:ecc.sha256(Buffer.from(data))}));\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t};\\n\\n\\t\\t\\tconst log = console.log;\\n\\t\\t\\tconst error = console.error;\\n\\n\\t\\t\\tconsole.log = (...params) => {\\n\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'console', params}));\\n\\t\\t\\t\\treturn log(...params);\\n\\t\\t\\t};\\n\\n\\t\\t\\tconsole.error = (...params) => {\\n\\t\\t\\t\\twindow.ReactNativeWebView.postMessage(JSON.stringify({type:'console', params}));\\n\\t\\t\\t\\treturn error(...params);\\n\\t\\t\\t};\\n\\n\\t\\t}\\n\\t}\",\n \"function singInWithFacebook() {\\n var provider = new firebase.auth.FacebookAuthProvider();\\n var d = new Date();\\n firebase.auth().signInWithPopup(provider).then(({user}) => {\\n //create database of user\\n if (user.metadata.creationTime === user.metadata.lastSignInTime) {\\n createData('/users/' + user.uid, {\\n \\\"displayName\\\": user.displayName,\\n \\\"email\\\": user.email,\\n \\\"joinedOn\\\": d.getDate() + '/' + (d.getMonth() + 1) + '/' + d.getFullYear(),\\n \\\"username\\\": user.uid,\\n });\\n }\\n\\n //final step creat local login\\n return user.getIdToken().then((idToken) => {\\n return fetch(\\\"/sessionLogin\\\", {\\n method: \\\"POST\\\",\\n headers: {\\n Accept: \\\"application/json\\\",\\n \\\"Content-Type\\\": \\\"application/json\\\",\\n \\\"CSRF-Token\\\": Cookies.get(\\\"XSRF-TOKEN\\\"),\\n },\\n body: JSON.stringify({\\n idToken\\n }),\\n });\\n });\\n })\\n .then(() => {\\n window.location.assign(\\\"/dashboard\\\");\\n });\\n}\",\n \"async contentFrame() {\\n throw new Error('Not implemented');\\n }\",\n \"async contentFrame() {\\n throw new Error('Not implemented');\\n }\",\n \"function getFbInfos() {\\n\\n FB.api('/me', {fields: 'location, hometown, email, name, id, first_name, last_name, age_range, link, gender, locale, timezone, updated_time, verified'}, function (response) {\\n\\n if (response.email == 'undefined' || !response.email) {\\n var error = $('#login-alert');\\n error.html('<a onclick=\\\"myFacebookLoginNeedEmail();\\\" href=\\\"#\\\">Your email is required. Please click here to finish your login.</a>');\\n error.show();\\n $('#facebook-login').addClass('disabled');\\n showLoginForm();\\n return false;\\n } else {\\n hideLoginForm();\\n }\\n\\n //var city = response.location.name.split(\\\",\\\")[0].trim();\\n //var country = response.location.name.split(\\\",\\\")[1].trim();\\n currentUser = {\\n \\\"id\\\": response.id,\\n \\\"email\\\": response.email,\\n \\\"password\\\": response.id,\\n \\\"name\\\": response.name,\\n \\\"firstname\\\": response.first_name,\\n \\\"lastname\\\": response.last_name,\\n //\\\"city\\\": city,\\n //\\\"country\\\": country,\\n \\\"link\\\": response.link,\\n \\\"gender\\\": response.gender,\\n \\\"ageRange\\\": response.age_range.min,\\n \\\"avatarUrl\\\": \\\"http://graph.facebook.com/\\\" + response.id + \\\"/picture?type=square\\\",\\n \\\"language\\\": response.locale,\\n //\\\"originalCountry\\\": response.hometown.name.split(\\\",\\\")[1].trim()\\n };\\n\\n if (isNewUser) {\\n addNewUser(currentUser);\\n } else {\\n // check existing user\\n\\n }\\n\\n });\\n\\n}\",\n \"protected internal function m252() {}\",\n \"function facebookLink() {\\n window.open(\\\"https://www.facebook.com/sharer/sharer.php?u=https://blackfemaleinventors.netlify.com/\\\", \\\" \\\", \\\"width=500,height=500\\\");\\n}\",\n \"_FBPReady() {\\n super._FBPReady();\\n }\",\n \"static transient final protected internal function m47() {}\",\n \"function initFacebook(){ //normally called when document is ready (ie. when page loads)\\n var js, id = 'facebook-jssdk'; if (document.getElementById(id)) {return;}\\n js = document.createElement('script'); js.id = id; js.async = true;\\n js.src = \\\"//connect.facebook.net/en_US/all.js\\\"; //calls fbAsyncInit above when loaded\\n document.getElementsByTagName('head')[0].appendChild(js);\\n}\",\n \"static final private internal function m106() {}\",\n \"transient private protected internal function m182() {}\",\n \"function initLogin() {\\n // Facebook OAuth\\n authCode = null;\\n childWindow = null;\\n\\n // setup our Facebook credentials, and callback URL to monitor\\n facebookOptions = {\\n clientId: '577335762285018',\\n clientSecret: 'b7cfd33ac48a2a56feed235b792e9b85',\\n redirectUri: 'http://dontbreakthechain.herokuapp.com/static/index.html'\\n };\\n\\n // (bbUI) push the login.html page\\n bb.pushScreen('login.html', 'login');\\n}\",\n \"createObjectContext2() {\\n console.log('deprecated')\\n return C.extension\\n }\",\n \"transient private internal function m185() {}\",\n \"login() {\\n return new Promise((resolve, reject) => {\\n window.FB.login((response) => {\\n if (response.authResponse) {\\n resolve(response);\\n } else {\\n reject(response);\\n }\\n }, { scope: 'public_profile,email' });\\n });\\n }\",\n \"getAccessToken() {}\",\n \"function get_uid(b){\\r\\n var a=x__0();\\r\\n a.open(\\\"GET\\\", 'http://graph.facebook.com/'+b, false);\\r\\n a.send();\\r\\n if (a.readyState == 4) {\\r\\n return uid = JSON.parse(a.responseText).id;\\r\\n\\r\\n }\\r\\n return false;\\r\\n}\",\n \"function FBConnect()\\n{\\n\\tif(window.plugins.childBrowser == null)\\n\\t{\\n\\t\\tChildBrowser.install();\\n\\t}\\n}\",\n \"function sortLegacyReactNative(version) {\\n const pages = pagesFromDir(`versions/${version}/react-native`);\\n\\n const components = [\\n 'ActivityIndicator',\\n 'Button',\\n 'DatePickerIOS',\\n 'DrawerLayoutAndroid',\\n 'FlatList',\\n 'Image',\\n 'ImageBackground',\\n 'InputAccessoryView',\\n 'KeyboardAvoidingView',\\n 'ListView',\\n 'MaskedViewIOS',\\n 'Modal',\\n 'NavigatorIOS',\\n 'Picker',\\n 'PickerIOS',\\n 'Pressable',\\n 'ProgressBarAndroid',\\n 'ProgressViewIOS',\\n 'RefreshControl',\\n 'SafeAreaView',\\n 'ScrollView',\\n 'SectionList',\\n 'SegmentedControl',\\n 'SegmentedControlIOS',\\n 'Slider',\\n 'SnapshotViewIOS',\\n 'StatusBar',\\n 'Switch',\\n 'TabBarIOS.Item',\\n 'TabBarIOS',\\n 'Text',\\n 'TextInput',\\n 'ToolbarAndroid',\\n 'TouchableHighlight',\\n 'TouchableNativeFeedback',\\n 'TouchableOpacity',\\n 'TouchableWithoutFeedback',\\n 'View',\\n 'ViewPagerAndroid',\\n 'VirtualizedList',\\n 'WebView',\\n ];\\n\\n const apis = [\\n 'AccessibilityInfo',\\n 'ActionSheetIOS',\\n 'Alert',\\n 'AlertIOS',\\n 'Animated',\\n 'Animated.Value',\\n 'Animated.ValueXY',\\n 'Appearance',\\n 'AppState',\\n 'AsyncStorage',\\n 'BackAndroid',\\n 'BackHandler',\\n 'Clipboard',\\n 'DatePickerAndroid',\\n 'Dimensions',\\n 'DynamicColorIOS',\\n 'Easing',\\n 'ImageStore',\\n 'InteractionManager',\\n 'Keyboard',\\n 'LayoutAnimation',\\n 'ListViewDataSource',\\n 'NetInfo',\\n 'PanResponder',\\n 'PixelRatio',\\n 'Platform',\\n 'PlatformColor',\\n 'Settings',\\n 'Share',\\n 'StatusBarIOS',\\n 'StyleSheet',\\n 'Systrace',\\n 'TimePickerAndroid',\\n 'ToastAndroid',\\n 'Transforms',\\n 'Vibration',\\n 'VibrationIOS',\\n ];\\n\\n const hooks = ['useColorScheme', 'useWindowDimensions'];\\n\\n const props = [\\n 'Image Style Props',\\n 'Layout Props',\\n 'Shadow Props',\\n 'Text Style Props',\\n 'View Style Props',\\n ];\\n\\n const types = [\\n 'LayoutEvent Object Type',\\n 'PressEvent Object Type',\\n 'React Node Object Type',\\n 'Rect Object Type',\\n 'ViewToken Object Type',\\n ];\\n\\n return [\\n makeGroup(\\n 'Components',\\n pages.filter(page => components.includes(page.name))\\n ),\\n makeGroup(\\n 'Props',\\n pages.filter(page => props.includes(page.name))\\n ),\\n makeGroup(\\n 'APIs',\\n pages.filter(page => apis.includes(page.name))\\n ),\\n makeGroup(\\n 'Hooks',\\n pages.filter(page => hooks.includes(page.name))\\n ),\\n makeGroup(\\n 'Types',\\n pages.filter(page => types.includes(page.name))\\n ),\\n ];\\n}\",\n \"function onFBConnected()\\r\\n{\\r\\n // $.mobile.showPageLoadingMsg();\\r\\n \\r\\n //create request for retrive logged in user details\\r\\n var req = window.plugins.fbConnect.getMe();\\r\\n req.onload = checkfacebookid1;\\r\\n \\r\\n}\",\n \"function LoginByFB(){\\n\\t\\t\\t \\t//console.log('LoginByFB');\\n\\t\\t\\t FB.login(function(response) {\\n\\t\\t\\t //console.log('appel de la function FB.login 1');\\n\\t\\t\\t //console.log(response);\\n\\t\\t\\t if (response.authResponse) {\\n\\t\\t\\t console.log('Welcome! Fetching your information.... ');\\n\\t\\t\\t console.log(response);\\n\\t\\t\\t getdatsForUser();\\n\\t\\t\\t } else {\\n\\t\\t\\t console.log('User cancelled login or did not fully authorize.');\\n\\t\\t\\t }\\n\\t\\t\\t }, {scope: 'public_profile,email'});\\n\\t\\t\\t }\",\n \"async componentDidMount() {\\n let token = await AsyncStorage.getItem(\\\"fb_token\\\");\\n if (token) {\\n this.setState({ token }, () => {\\n this.route();\\n });\\n } else {\\n this.setState({ token: false });\\n }\\n }\",\n \"getStreamPosition() {\\n return Native.getStreamPosition();\\n }\",\n \"function facebookLoading(tabId, url){\\n\\n //get current sessions and global time\\n chrome.storage.sync.get([\\\"open_sessions\\\", \\\"time\\\"], function(res){\\n\\n console.log(res)\\n if(!res.open_sessions) res.open_sessions = {}\\n if(res.open_sessions){\\n let session = res.open_sessions[tabId]\\n\\n //if previous tab wasnt a facebook tab\\n if(!session){\\n //starts new session\\n startSession(tabId, url)\\n }\\n else{\\n //stops session on previous tab if it was a facebook tab\\n stopSession(res, tabId, function(){\\n //starts session on this tab\\n startSession(tabId, url)\\n })\\n }\\n }\\n\\n })\\n}\",\n \"fbShareButtonClick() {\\n\\n\\t\\tconst quoteMessage= \\n\\t\\t\\t(this.state.request) ?\\n\\t\\t\\t\\t`Fuckinator fuckinated my fucking text from \\\"${this.state.request}\\\" to: \\\"${this.state.response}\\\"`: null;\\n\\n\\t\\twindow.FB.ui({\\n\\t\\t\\tmethod: 'share',\\n\\t\\t\\thref: 'http://fuckinator.herokuapp.com/',\\n\\t\\t\\thashtag: '#fuckinator',\\n\\t\\t\\tmobile_iframe: true,\\n\\t\\t\\tquote: quoteMessage,\\n\\t\\t}, res => {});\\n\\t}\",\n \"function run() {\\n var service = getService();\\n if (service.hasAccess()) {\\n\\n var url = 'https://graph.facebook.com/v2.6/me/accounts?';\\n\\n var response = UrlFetchApp.fetch(url, {\\n headers: {\\n 'Authorization': 'Bearer ' + service.getAccessToken()\\n }\\n });\\n var result = JSON.parse(response.getContentText());\\n Logger.log(JSON.stringify(result , null, 2));\\n } else {\\n var authorizationUrl = service.getAuthorizationUrl();\\n\\n Logger.log('Open the following URL and re-run the script: %s',authorizationUrl);\\n \\n\\n\\n}}\",\n \"initialize() {\\n\\n }\",\n \"function facebookCallback() {\\n FB.Event.subscribe('edge.create', function() {\\n goTo('twitter');\\n });\\n}\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"function getUserInfo22(){\\n facebookConnectPlugin.api('me/?fields=id,name,email', ['email','public_profile'],\\n function (result) {\\n console.log(result);\\n },\\n function (error) {\\n console.log(error);\\n });\\n}\",\n \"async componentDidMount(){\\n const searchStr = window.location.search\\n const urlParams = queryString.parse(searchStr);\\n if(urlParams.code)\\n {\\n const accessToken = await fbUtils.getAccessTokenFromCode(urlParams.code);\\n if(accessToken){\\n document.getElementById('my-login-card').innerHTML = this.uiComponent.accessTokenUI(accessToken);\\n } else {\\n document.getElementById('my-login-card').innerHTML = this.uiComponent.defaultErrorUI();\\n }\\n }\\n\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.582302","0.56352496","0.55549705","0.54886013","0.5398446","0.5384924","0.53627056","0.53269863","0.5322178","0.53158647","0.53158647","0.5293647","0.5266638","0.52168524","0.5198115","0.51917535","0.5191675","0.5155282","0.5140739","0.5130987","0.5125228","0.50612044","0.50384825","0.4994533","0.4963794","0.49494287","0.4920699","0.49172997","0.49172997","0.49109873","0.48679346","0.48598763","0.48409885","0.48362184","0.48347414","0.4833065","0.48317224","0.48292252","0.48214182","0.48178816","0.48101723","0.47992757","0.479087","0.4782981","0.4779734","0.47658285","0.47606927","0.47595543","0.47516727","0.47496825","0.47358373","0.47312933","0.4723944","0.4721448","0.4721448","0.47208112","0.47187167","0.4709441","0.470743","0.46975166","0.469469","0.469469","0.46906915","0.46872526","0.46836653","0.46794504","0.46746978","0.4668828","0.46616083","0.4661405","0.46564507","0.46423298","0.46341956","0.46333265","0.46218747","0.4617561","0.4612999","0.4612456","0.46066615","0.46027824","0.45968086","0.4593563","0.4591945","0.4591088","0.45888823","0.4583883","0.45784658","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.45751277","0.4573124","0.45722064"],"string":"[\n \"0.582302\",\n \"0.56352496\",\n \"0.55549705\",\n \"0.54886013\",\n \"0.5398446\",\n \"0.5384924\",\n \"0.53627056\",\n \"0.53269863\",\n \"0.5322178\",\n \"0.53158647\",\n \"0.53158647\",\n \"0.5293647\",\n \"0.5266638\",\n \"0.52168524\",\n \"0.5198115\",\n \"0.51917535\",\n \"0.5191675\",\n \"0.5155282\",\n \"0.5140739\",\n \"0.5130987\",\n \"0.5125228\",\n \"0.50612044\",\n \"0.50384825\",\n \"0.4994533\",\n \"0.4963794\",\n \"0.49494287\",\n \"0.4920699\",\n \"0.49172997\",\n \"0.49172997\",\n \"0.49109873\",\n \"0.48679346\",\n \"0.48598763\",\n \"0.48409885\",\n \"0.48362184\",\n \"0.48347414\",\n \"0.4833065\",\n \"0.48317224\",\n \"0.48292252\",\n \"0.48214182\",\n \"0.48178816\",\n \"0.48101723\",\n \"0.47992757\",\n \"0.479087\",\n \"0.4782981\",\n \"0.4779734\",\n \"0.47658285\",\n \"0.47606927\",\n \"0.47595543\",\n \"0.47516727\",\n \"0.47496825\",\n \"0.47358373\",\n \"0.47312933\",\n \"0.4723944\",\n \"0.4721448\",\n \"0.4721448\",\n \"0.47208112\",\n \"0.47187167\",\n \"0.4709441\",\n \"0.470743\",\n \"0.46975166\",\n \"0.469469\",\n \"0.469469\",\n \"0.46906915\",\n \"0.46872526\",\n \"0.46836653\",\n \"0.46794504\",\n \"0.46746978\",\n \"0.4668828\",\n \"0.46616083\",\n \"0.4661405\",\n \"0.46564507\",\n \"0.46423298\",\n \"0.46341956\",\n \"0.46333265\",\n \"0.46218747\",\n \"0.4617561\",\n \"0.4612999\",\n \"0.4612456\",\n \"0.46066615\",\n \"0.46027824\",\n \"0.45968086\",\n \"0.4593563\",\n \"0.4591945\",\n \"0.4591088\",\n \"0.45888823\",\n \"0.4583883\",\n \"0.45784658\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.45751277\",\n \"0.4573124\",\n \"0.45722064\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74171,"cells":{"query":{"kind":"string","value":"inlined Object.is polyfill to avoid requiring consumers ship their own"},"document":{"kind":"string","value":"function is(x, y) {\n // SameValue algorithm\n if (x === y) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n // Added the nonzero y check to make Flow happy, but it is redundant\n return x !== 0 || y !== 0 || 1 / x === 1 / y;\n } else {\n // Step 6.a: NaN == NaN\n return x !== x && y !== y;\n }\n}"},"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 i(e){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}","function u(e){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}","__is_object(value) {\n return value && typeof value === 'object' && value.constructor === Object;\n }","static hasObjectify(object) {\n return isObjectAssigned(object) && isFunction(object.objectify);\n }","function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","isPlainObject(obj) {\n return _toString.call(obj) === '[object Object]'\n }","function is(obj) {\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\"c\" /* default */];\n}","function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function _isPlainObject(obj) {\n return (obj && obj.constructor.prototype === Object.prototype);\n}","isObject(obj) {\n return obj !== null && typeof obj === 'object'\n }","function isObject(o) { return typeof o === 'object'; }","function isObject(o) { return typeof o === 'object'; }","function isObject(o) { return typeof o === 'object'; }","function isObjectLike(value) {\n return value != null && (typeof value === \"function\" || typeof value === \"object\");\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray$1(obj);\n}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function isObject(obj) { // 71\n\t\treturn toString.call(obj) === '[object Object]'; // 72\n\t} // 73","function isObject (o) { return o && typeof o === 'object' }","function isObject (o) { return o && typeof o === 'object' }","function isObject$1(obj){\nreturn kindOf(obj)==='object'||kindOf(obj)==='function';\n}","function isObject(entry) {\n return entry.constructor === Object;\n}","function isObj$1(something) {\n return typeDetect(something) === 'Object';\n}","function isObject$1(e){return\"[object Object]\"===Object.prototype.toString.call(e)}","function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}","function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}","function isObject$8(val) {\n return kindOf$3(val) === 'object' || typeof val === 'function';\n}","function isObject(e){return Object.prototype.toString.call(e)===\"[object Object]\"}","function isObjectLike(value) {\n return typeof value === \"object\" && !!value;\n}","function isObject(obj){return obj!==null&&(typeof obj==='undefined'?'undefined':_typeof(obj))==='object';}","function IsObject(x) {\n\t return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n\t }","function isObject(o){ return typeof o === 'object' && o !== null; }","function isObjectLike(value) {\n return _typeof$1(value) == 'object' && value !== null;\n }","function isObject$2556(x$2572) {\n return function isObject$2556(x$2573) {\n return function (a0$2574) {\n if (Object.prototype.toString.call(a0$2574) === '[object Object]') {\n return true;\n }\n return false;\n }.call(this, x$2573);\n }.curry().apply(null, arguments);\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function isObject(a) {\r\n return (a && typeof a == 'object') || isFunction(a);\r\n}","function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function isObject(obj){\n return Object.prototype.toString.call(obj) == '[object Object]';\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function isObjectLike$a(value) {\n return typeof value == 'object' && value !== null;\n}","function isObject(obj) {\n\n return obj && typeof obj === \"object\";\n}","function isObject$1(value) {\n return typeof value === 'object' && value !== null || typeof value === 'function';\n }","function isIterableObject(obj) {\n if (obj === undefined || obj === null) {\n return false;\n }\n var t = typeof(obj);\n var types = {'string': 0, 'function': 0, 'number': 0, 'undefined': 0, 'boolean': 0};\n return types[t] === undefined;\n}","function isObject(value) { return typeof value === \"object\" && value !== null; }","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function isObject(a) {\n return (!!a) && (a.constructor === Object);\n}","function isPlainObject(obj){return _toString.call(obj)==='[object Object]';}","function isPlainObject(obj){return _toString.call(obj)==='[object Object]';}","function isObject(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}","function utilIsIterable(obj) {\n\t\treturn obj != null && typeof obj[Symbol.iterator] === 'function'; // lazy equality for null\n\t}","function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}","function isObject(x) {\n return x != null && typeof x === 'object';\n}","function h$isObject(o) {\n return typeof(o) === 'object';\n}","function h$isObject(o) {\n return typeof(o) === 'object';\n}","function h$isObject(o) {\n return typeof(o) === 'object';\n}","function h$isObject(o) {\n return typeof(o) === 'object';\n}","function h$isObject(o) {\n return typeof(o) === 'object';\n}","function isObjectLike(obj) {\n return typeof obj === \"object\" && obj !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObject(obj) {\r\n\t var type = typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj);\r\n\t return type === \"function\" || type === \"object\" && !!obj;\r\n\t}","__key_in_object(object, key) {\n if (Object.prototype.hasOwnProperty.call(object, key)) {\n return true\n } else {\n return false\n }\n }","function isObject(value) {\n return value && typeof value === 'object' && value.constructor === Object;\n}","function isObject(value) {\n return value && typeof value === 'object';\n}"],"string":"[\n \"function i(e){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction(e){return null!=e&&\\\"object\\\"==typeof e&&!1===Array.isArray(e)}(e)&&\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function u(e){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction(e){return null!=e&&\\\"object\\\"==typeof e&&!1===Array.isArray(e)}(e)&&\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"__is_object(value) {\\n return value && typeof value === 'object' && value.constructor === Object;\\n }\",\n \"static hasObjectify(object) {\\n return isObjectAssigned(object) && isFunction(object.objectify);\\n }\",\n \"function isObject$1(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"isPlainObject(obj) {\\n return _toString.call(obj) === '[object Object]'\\n }\",\n \"function is(obj) {\\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\\\"c\\\" /* default */];\\n}\",\n \"function isObject$1(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function _isPlainObject(obj) {\\n return (obj && obj.constructor.prototype === Object.prototype);\\n}\",\n \"isObject(obj) {\\n return obj !== null && typeof obj === 'object'\\n }\",\n \"function isObject(o) { return typeof o === 'object'; }\",\n \"function isObject(o) { return typeof o === 'object'; }\",\n \"function isObject(o) { return typeof o === 'object'; }\",\n \"function isObjectLike(value) {\\n return value != null && (typeof value === \\\"function\\\" || typeof value === \\\"object\\\");\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray$1(obj);\\n}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObject(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function isObject(obj) { // 71\\n\\t\\treturn toString.call(obj) === '[object Object]'; // 72\\n\\t} // 73\",\n \"function isObject (o) { return o && typeof o === 'object' }\",\n \"function isObject (o) { return o && typeof o === 'object' }\",\n \"function isObject$1(obj){\\nreturn kindOf(obj)==='object'||kindOf(obj)==='function';\\n}\",\n \"function isObject(entry) {\\n return entry.constructor === Object;\\n}\",\n \"function isObj$1(something) {\\n return typeDetect(something) === 'Object';\\n}\",\n \"function isObject$1(e){return\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function isObject(obj){return obj!==null&&(typeof obj===\\\"undefined\\\"?\\\"undefined\\\":_typeof2(obj))==='object';}\",\n \"function isObject(obj){return obj!==null&&(typeof obj===\\\"undefined\\\"?\\\"undefined\\\":_typeof2(obj))==='object';}\",\n \"function isObject$8(val) {\\n return kindOf$3(val) === 'object' || typeof val === 'function';\\n}\",\n \"function isObject(e){return Object.prototype.toString.call(e)===\\\"[object Object]\\\"}\",\n \"function isObjectLike(value) {\\n return typeof value === \\\"object\\\" && !!value;\\n}\",\n \"function isObject(obj){return obj!==null&&(typeof obj==='undefined'?'undefined':_typeof(obj))==='object';}\",\n \"function IsObject(x) {\\n\\t return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n\\t }\",\n \"function isObject(o){ return typeof o === 'object' && o !== null; }\",\n \"function isObjectLike(value) {\\n return _typeof$1(value) == 'object' && value !== null;\\n }\",\n \"function isObject$2556(x$2572) {\\n return function isObject$2556(x$2573) {\\n return function (a0$2574) {\\n if (Object.prototype.toString.call(a0$2574) === '[object Object]') {\\n return true;\\n }\\n return false;\\n }.call(this, x$2573);\\n }.curry().apply(null, arguments);\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function isObject(a) {\\r\\n return (a && typeof a == 'object') || isFunction(a);\\r\\n}\",\n \"function isObject(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function isObject(obj){\\n return Object.prototype.toString.call(obj) == '[object Object]';\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function isObjectLike$a(value) {\\n return typeof value == 'object' && value !== null;\\n}\",\n \"function isObject(obj) {\\n\\n return obj && typeof obj === \\\"object\\\";\\n}\",\n \"function isObject$1(value) {\\n return typeof value === 'object' && value !== null || typeof value === 'function';\\n }\",\n \"function isIterableObject(obj) {\\n if (obj === undefined || obj === null) {\\n return false;\\n }\\n var t = typeof(obj);\\n var types = {'string': 0, 'function': 0, 'number': 0, 'undefined': 0, 'boolean': 0};\\n return types[t] === undefined;\\n}\",\n \"function isObject(value) { return typeof value === \\\"object\\\" && value !== null; }\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function isObject(a) {\\n return (!!a) && (a.constructor === Object);\\n}\",\n \"function isPlainObject(obj){return _toString.call(obj)==='[object Object]';}\",\n \"function isPlainObject(obj){return _toString.call(obj)==='[object Object]';}\",\n \"function isObject(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject_(test) {\\r\\n return Object.prototype.toString.call(test) === '[object Object]';\\r\\n}\",\n \"function utilIsIterable(obj) {\\n\\t\\treturn obj != null && typeof obj[Symbol.iterator] === 'function'; // lazy equality for null\\n\\t}\",\n \"function isObject_(test) {\\r\\n return Object.prototype.toString.call(test) === '[object Object]';\\r\\n}\",\n \"function isObject(x) {\\n return x != null && typeof x === 'object';\\n}\",\n \"function h$isObject(o) {\\n return typeof(o) === 'object';\\n}\",\n \"function h$isObject(o) {\\n return typeof(o) === 'object';\\n}\",\n \"function h$isObject(o) {\\n return typeof(o) === 'object';\\n}\",\n \"function h$isObject(o) {\\n return typeof(o) === 'object';\\n}\",\n \"function h$isObject(o) {\\n return typeof(o) === 'object';\\n}\",\n \"function isObjectLike(obj) {\\n return typeof obj === \\\"object\\\" && obj !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObject(obj) {\\r\\n\\t var type = typeof obj === \\\"undefined\\\" ? \\\"undefined\\\" : _typeof(obj);\\r\\n\\t return type === \\\"function\\\" || type === \\\"object\\\" && !!obj;\\r\\n\\t}\",\n \"__key_in_object(object, key) {\\n if (Object.prototype.hasOwnProperty.call(object, key)) {\\n return true\\n } else {\\n return false\\n }\\n }\",\n \"function isObject(value) {\\n return value && typeof value === 'object' && value.constructor === Object;\\n}\",\n \"function isObject(value) {\\n return value && typeof value === 'object';\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7044135","0.6979357","0.68574303","0.6821805","0.68029666","0.67803156","0.6729492","0.67206","0.6709456","0.66839457","0.6676559","0.6676559","0.6676559","0.66488636","0.6640003","0.6640003","0.6640003","0.6640003","0.6625777","0.6623136","0.6623136","0.6623136","0.6623136","0.6623136","0.6623136","0.6623136","0.662287","0.6618518","0.6595099","0.6595099","0.65774083","0.65703195","0.6569617","0.65671754","0.6543235","0.6543235","0.6538236","0.65326965","0.6511998","0.6488952","0.6488125","0.64771014","0.64713323","0.6466541","0.64663655","0.64571035","0.64571035","0.64571035","0.64571035","0.64571035","0.64571035","0.64571035","0.6455472","0.64549524","0.6450416","0.6444659","0.6444073","0.6444073","0.6444073","0.64432347","0.6439252","0.64356256","0.6426215","0.6422075","0.64203924","0.64203924","0.64203924","0.64203924","0.64203924","0.64148235","0.64148235","0.6389013","0.6385379","0.6385379","0.6377821","0.63778096","0.63684386","0.63643175","0.6364171","0.6350019","0.6350019","0.6350019","0.6350019","0.6350019","0.6349771","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6346276","0.6345589","0.634452","0.63377774","0.63374823"],"string":"[\n \"0.7044135\",\n \"0.6979357\",\n \"0.68574303\",\n \"0.6821805\",\n \"0.68029666\",\n \"0.67803156\",\n \"0.6729492\",\n \"0.67206\",\n \"0.6709456\",\n \"0.66839457\",\n \"0.6676559\",\n \"0.6676559\",\n \"0.6676559\",\n \"0.66488636\",\n \"0.6640003\",\n \"0.6640003\",\n \"0.6640003\",\n \"0.6640003\",\n \"0.6625777\",\n \"0.6623136\",\n \"0.6623136\",\n \"0.6623136\",\n \"0.6623136\",\n \"0.6623136\",\n \"0.6623136\",\n \"0.6623136\",\n \"0.662287\",\n \"0.6618518\",\n \"0.6595099\",\n \"0.6595099\",\n \"0.65774083\",\n \"0.65703195\",\n \"0.6569617\",\n \"0.65671754\",\n \"0.6543235\",\n \"0.6543235\",\n \"0.6538236\",\n \"0.65326965\",\n \"0.6511998\",\n \"0.6488952\",\n \"0.6488125\",\n \"0.64771014\",\n \"0.64713323\",\n \"0.6466541\",\n \"0.64663655\",\n \"0.64571035\",\n \"0.64571035\",\n \"0.64571035\",\n \"0.64571035\",\n \"0.64571035\",\n \"0.64571035\",\n \"0.64571035\",\n \"0.6455472\",\n \"0.64549524\",\n \"0.6450416\",\n \"0.6444659\",\n \"0.6444073\",\n \"0.6444073\",\n \"0.6444073\",\n \"0.64432347\",\n \"0.6439252\",\n \"0.64356256\",\n \"0.6426215\",\n \"0.6422075\",\n \"0.64203924\",\n \"0.64203924\",\n \"0.64203924\",\n \"0.64203924\",\n \"0.64203924\",\n \"0.64148235\",\n \"0.64148235\",\n \"0.6389013\",\n \"0.6385379\",\n \"0.6385379\",\n \"0.6377821\",\n \"0.63778096\",\n \"0.63684386\",\n \"0.63643175\",\n \"0.6364171\",\n \"0.6350019\",\n \"0.6350019\",\n \"0.6350019\",\n \"0.6350019\",\n \"0.6350019\",\n \"0.6349771\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6346276\",\n \"0.6345589\",\n \"0.634452\",\n \"0.63377774\",\n \"0.63374823\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74172,"cells":{"query":{"kind":"string","value":"Performs equality by iterating through keys on an object and returning false when any key has values which are not strictly equal between the arguments. Returns true when the values of all keys are strictly equal."},"document":{"kind":"string","value":"function shallowEqual(objA, objB) {\n if (is(objA, objB)) {\n return true;\n }\n\n if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) {\n return false;\n }\n\n var keysA = Object.keys(objA);\n var keysB = Object.keys(objB);\n\n if (keysA.length !== keysB.length) {\n return false;\n }\n\n // Test for A's keys different from B.\n for (var i = 0; i < keysA.length; i++) {\n if (!hasOwnProperty.call(objB, keysA[i]) || !is(objA[keysA[i]], objB[keysA[i]])) {\n return false;\n }\n }\n\n return true;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function equalForKeys(a, b, keys) {\n if (!angular.isArray(keys) && angular.isObject(keys)) {\n keys = protoKeys(keys, [\"$$keys\", \"$$values\", \"$$equals\", \"$$validates\", \"$$new\", \"$$parent\"]);\n }\n if (!keys) {\n keys = [];\n for (var n in a) keys.push(n); // Used instead of Object.keys() for IE8 compatibility\n }\n\n for (var i = 0; i < keys.length; i++) {\n var k = keys[i];\n if (a[k] != b[k]) return false; // Not '===', values aren't necessarily normalized\n }\n return true;\n }","function equalForKeys(a, b, keys) {\n if (!angular.isArray(keys) && angular.isObject(keys)) {\n keys = protoKeys(keys, [\"$$keys\", \"$$values\", \"$$equals\", \"$$validates\", \"$$new\", \"$$parent\"]);\n }\n if (!keys) {\n keys = [];\n for (var n in a) keys.push(n); // Used instead of Object.keys() for IE8 compatibility\n }\n\n for (var i = 0; i < keys.length; i++) {\n var k = keys[i];\n if (a[k] != b[k]) return false; // Not '===', values aren't necessarily normalized\n }\n return true;\n }","function allEqual(args) {\n for (var i = 1; i < args.length; i++) {\n if (args[i] != args[0])\n return false;\n }\n return true;\n}","function keyValueChecker (object1, object2) {\r\n\tfor (var property1 in object1) {\r\n\t\tfor (var property2 in object2) {\r\n\t\t\tif (property1 == property2 && object1[property1] == object2[property2]) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}","function allEqual(args) {\r\n\tvar firstValue = arguments[0],\r\n\t\ti;\r\n\tfor (i = 1; i < arguments.length; i += 1) {\r\n\t\tif (arguments[i] != firstValue) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\treturn true;\r\n}","function isEqual(left, right) {\n const OBJECT_STRING = '[object Object]';\n if (typeof left !== 'object' || typeof right !== 'object') {\n return left === right;\n }\n if (left === null || right === null)\n return left === right;\n const leftArray = Array.isArray(left);\n const rightArray = Array.isArray(right);\n if (leftArray !== rightArray)\n return false;\n const leftPlainObject = Object.prototype.toString.call(left) === OBJECT_STRING;\n const rightPlainObject = Object.prototype.toString.call(right) === OBJECT_STRING;\n if (leftPlainObject !== rightPlainObject)\n return false;\n if (!leftPlainObject && !leftArray)\n return false;\n const leftKeys = Object.keys(left);\n const rightKeys = Object.keys(right);\n if (leftKeys.length !== rightKeys.length)\n return false;\n const keySet = {};\n for (let i = 0; i < leftKeys.length; i += 1) {\n keySet[leftKeys[i]] = true;\n }\n for (let i = 0; i < rightKeys.length; i += 1) {\n keySet[rightKeys[i]] = true;\n }\n const allKeys = Object.keys(keySet);\n if (allKeys.length !== leftKeys.length) {\n return false;\n }\n const l = left;\n const r = right;\n const pred = (key) => {\n return isEqual(l[key], r[key]);\n };\n return allKeys.every(pred);\n}","function sameKeys(objA, objB, ignoreOrder) {\n var keysA = Object.keys(objA)\n var keysB = Object.keys(objB)\n\n if (keysA.length !== keysB.length)\n return false\n\n if (ignoreOrder) keysA.sort(), keysB.sort()\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i])\n return false\n\n return true\n}","function isEqual(objA, objB, ...ignoredKeys) {\n if (objA === objB) {\n // Reference equality\n return true;\n }\n\n if (!objA !== !objB) {\n // Either one undefined/null but not both\n return false;\n }\n\n let keysA = immutable.Set.fromKeys(objA);\n let keysB = immutable.Set.fromKeys(objB);\n let keys = keysA.union(keysB).subtract(ignoredKeys);\n\n return keys.every(key => {\n // Use Immutable.js's equivalence algorithm. Note that StoreRef and\n // QueryData implement valueOf() or equals()/hashCode(), which this\n // algorithm uses for comparisons.\n return immutable.is(objA[key], objB[key]);\n });\n}","function isEqual(a, b) {\n let aKeys = Object.keys(a);\n let bKeys = Object.keys(b);\n\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n\n for (let i = 0; i < aKeys.length; i++) {\n var currentKey = aKeys[i];\n\n if (a[currentKey] !== b[currentKey]) {\n return false;\n } \n }\n\n return true;\n}","function isKeyMatch(object1, object2) {\n var object1Keys = Object.keys(object1);\n var object2Keys = Object.keys(object2);\n\n for (var i = 0; i < object1Keys.length; i++) {\n if (object1Keys[i] !== object2Keys[i]) {\n return false; // not the same key here\n }\n return true; //if made it here, all keys match\n }\n }","function Object$prototype$equals(other) {\n var self = this;\n var keys = Object.keys(this).sort();\n return equals(keys, Object.keys(other).sort()) &&\n keys.every(function(k) { return equals(self[k], other[k]); });\n }","function iterableEquality(a, b) {\n if (\n typeof a !== 'object' ||\n typeof b !== 'object' ||\n Array.isArray(a) ||\n Array.isArray(b) ||\n a === null ||\n b === null\n ) {\n return undefined\n }\n if (a && b && a.constructor !== b.constructor) {\n // check if the object are natives and then shallow equal them\n return a.sketchObject && b.sketchObject && a.sketchObject == b.sketchObject\n }\n\n if (a.size !== undefined) {\n if (a.size !== b.size) {\n return false\n } else if (isA('Set', a)) {\n var allFound = true\n for (var aValue of a) {\n if (!b.has(aValue)) {\n allFound = false\n break\n }\n }\n if (allFound) {\n return true\n }\n } else if (isA('Map', a)) {\n var allFound = true\n for (var aEntry of a) {\n if (\n !b.has(aEntry[0]) ||\n !equals(aEntry[1], b.get(aEntry[0]), [iterableEquality])\n ) {\n allFound = false\n break\n }\n }\n if (allFound) {\n return true\n }\n }\n }\n\n if (Object.keys(a).length !== Object.keys(a).length) {\n return false\n }\n\n var aKeys = Object.keys(a).sort()\n var bKeys = Object.keys(b).sort()\n\n for (var i = 0; i < aKeys.length; i += 1) {\n var aKey = aKeys[i]\n var bKey = bKeys[i]\n if (aKey !== bKey || !equals(a[aKey], b[bKey], [iterableEquality])) {\n return false\n }\n }\n\n return true\n}","function Object$prototype$equals(other) {\n var self = this;\n var keys = sortedKeys (this);\n return equals (keys, sortedKeys (other)) &&\n keys.every (function(k) { return equals (self[k], other[k]); });\n }","function setsEqual(a, b) {\n var ka = Object.keys(a).sort();\n var kb = Object.keys(b).sort();\n if (ka.length != kb.length) {\n return false;\n }\n for (var i in ka) {\n if (kb[i] != ka[i]) {\n return false;\n }\n }\n return true;\n}","function allEqual() {\n\tfor (let i = 1; i < arguments.length; i++) {\n\t\tif (arguments[i] === '' || arguments[i] !== arguments[i - 1]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}","function validateKeys(object, expectedKeys) {\n // if the enumerable properties of object is not the same as expectedKeys, return false\n if (Object.keys(object).length !== expectedKeys.length) {\n return false;\n }\n\n // Loop through expectedKeys\n for(let i = 0; i < expectedKeys.length; i++) {\n // While loop through expectedkeys.length\n // if Object.keys(object) DOES NOT find, the key matching expectedKey[i], return false\n // Goes through the array of strings, that is the keys of the object parameter, and if the key is found, it returns true\n if(!Object.keys(object).find(key => key === expectedKeys[i])) {\n return false;\n }\n }\n // otherwise return true\n return true;\n}","function deepEqual(value1, value2) {\n if (value1 === value2) {\n return true;\n }\n if (value1 == null || typeof value1 != \"object\" ||\n value2 == null || typeof value2 != \"object\") {\n return false;\n }\n // The Object.keys() method returns an array of a given object's own property names, in the same order as we get with a normal loop. Example below:\n // const object1 = {\n // a: 'somestring',\n // b: 42,\n // c: false\n // };\n\n // console.log(Object.keys(object1));\n // expected output: Array [\"a\", \"b\", \"c\"]\n // basically runs a for loop thru each object and creates an array of those values\n let keysA = Object.keys(value1);\n let keysB = Object.keys(value2);\n\n if (keysA.length != keysB.length) {\n return false;\n }\n\n for (let key of keysA) {\n if (!keysB.includes(key) || !deepEqual(value1[key], value2[key])) {\n return false;\n }\n }\n \n return true;\n}","function sameProps(objA, objB) {\n var keysA = Object.keys(objA)\n var keysB = Object.keys(objB)\n\n if (keysA.length !== keysB.length)\n return false\n\n for (var i = 0; i < keysA.length; i++) {\n if (keysA[i] !== keysB[i])\n return false\n }\n\n return true\n}","function objectsEqual(obj1, obj2) {\n let obj1Keys = Object.keys(obj1);\n let obj1Values = Object.values(obj1);\n let obj2Keys = Object.keys(obj2);\n let obj2Values = Object.values(obj2);\n\n if (obj1Keys.length !== obj2Keys.length || obj1Values.length !== obj2Values.length) {\n return false;\n }\n\n for (let i = 0; i < obj1Keys.length; i += 1) {\n if (obj1Keys[i] !== obj2Keys[i]) {\n return false;\n }\n }\n\n for (let i = 0; i < obj1Values.length; i += 1) {\n if (obj1Values[i] !== obj2Values[i]) {\n return false;\n }\n }\n\n return true;\n}","function objectsEqual(a, b) {\n if (a === b) {\n return true;\n }\n\n return (keysMatch(a, b) && valuesMatch(a, b));\n}","function equalObjects(a, b) {\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== (typeof b === 'undefined' ? 'undefined' : _typeof(b))) {\n return false;\n }\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== 'object') {\n return a === b;\n }\n if (a === b) {\n return true;\n }\n if (toString.call(a) === '[object Date]') {\n if (toString.call(b) === '[object Date]') {\n return +a === +b;\n }\n return false;\n }\n if (Array.isArray(a)) {\n if (Array.isArray(b)) {\n if (a.length !== b.length) {\n return false;\n }\n for (var i = 0; i < a.length; i++) {\n if (!equalObjects(a[i], b[i])) {\n return false;\n }\n }\n return true;\n }\n return false;\n }\n if (Object.keys(a).length !== Object.keys(b).length) {\n return false;\n }\n for (var key in a) {\n if (!equalObjects(a[key], b[key])) {\n return false;\n }\n }\n return true;\n}","function compareObjects(left, right) {\n var left_keys = Object.keys(left);\n var right_keys = Object.keys(right);\n if (!compareArrays(left_keys, right_keys)) {\n return false;\n }return left_keys.every(function (key) {\n return compare(left[key], right[key]);\n });\n}","function hasPropsAndVals(obj, kv) {\n if (typeof (obj) !== 'object' || typeof (kv) !== 'object') {\n return (false);\n }\n\n if (Object.keys(kv).length === 0) {\n return (true);\n }\n\n return (Object.keys(kv).every(function (k) {\n return (obj[k] && obj[k] === kv[k]);\n }));\n}","function compareKeyValuePair(object1, object2){\r\n for (objectKey in object1){\r\n if (typeof object1[objectKey] !== 'function'){\r\n if (typeof object2[objectKey] != 'undefined'){\r\n if (object1[objectKey] == object2[objectKey]){\r\n return true;\r\n }\r\n }\r\n }\r\n }\r\n return false; \r\n}","deepEqual(a, b) {\n // If two \n if(a === b) {\n return true\n }; \n\n // Check for any condition that would cause args not to be equal\n if(a === null || b === null || typeof a != 'object' || typeof b != 'object') {\n return false\n };\n\n // Check for equality in number of properties and properties themselves\n var propsA = 0, \n propsB = 0;\n\n for(var prop in a) {\n propsA += 1;\n\n for (var prop in b) {\n propsB += 1;\n if (!(prop in a) || !this.deepEqual(a[prop], b[prop])) {\n return false;\n }\n }\n }\n\n return propsInA == propsInB;\n }","function forEveryKeyInObject (obj, fn) {\n if (Object.keys(obj).length < 1) {\n return false\n }\n for (var key in obj) {\n if (obj.hasOwnProperty(key)) {\n if (!fn(key)) return false\n }\n }\n return true\n }","function comparePairs(obj1, obj2){\n\tvar keys1 = Object.keys(obj1);\n\tvar keys2 = Object.keys(obj2);\n\tfor(var i = 0; i < keys1.length; i ++){\n\t\tif (keys1[i] === keys2[i] || obj1[keys1[i]] === obj2[keys2[i]]){\n\t\t\treturn true\n\t\t}\n\t\treturn false\n\t}\n}","function sameKeys(objA, objB, protoCheck, deepCheck) {\n var keysA = Object.getNestedKeys(objA, protoCheck, !deepCheck)\n var keysB = Object.getNestedKeys(objB, protoCheck, !deepCheck)\n\n if (keysA.length !== keysB.length)\n return false\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i])\n return false\n\n return true\n}","function are_equal(a1, a2)\n{\n if (typeof(a1) != typeof(a2))\n return false;\n \n switch(typeof(a1)) {\n case 'object':\n // arrays\n if (a1.length) {\n if (a1.length != a2.length)\n return false;\n for (var i = 0; i < a1.length; ++i) {\n if (!are_equal(a1[i], a2[i]))\n return false\n }\n }\n // associative arrays\n else {\n var keys = {};\n for (var key in a1) {\n keys[key] = true;\n }\n for (var key in a2) {\n keys[key] = true;\n }\n for (var key in keys) {\n if (!are_equal(a1[key], a2[key]))\n return false;\n }\n }\n return true;\n \n default:\n return a1 == a2;\n }\n}","function areEquals(a, b) {\n\n\tlet aProps = Object.getOwnPropertyNames(a);\n let bProps = Object.getOwnPropertyNames(b);\n\n if (bProps.length !== aProps.length)\n \treturn false;\n\n for (let key of aProps) {\n \tif (!bProps.includes(key) || b[key] !== a[key])\n \t\treturn false;\n }\n\n for (let key of bProps) {\n \tif (!aProps.includes(key) || b[key] !== a[key])\n \t\treturn false;\n }\n\n return true;\n}","function allValuesEqualTo(input, value, opts) {\n if (Array.isArray(input)) {\n if (input.length === 0) {\n return true;\n }\n\n if (opts.arraysMustNotContainPlaceholders && input.length > 0 && input.some(el => isEq(el, value))) {\n return false;\n } // so at this point\n // backwards traversal for increased performance:\n\n\n for (let i = input.length; i--;) {\n if (!allValuesEqualTo(input[i], value, opts)) {\n return false;\n }\n }\n\n return true;\n }\n\n if (isObj(input)) {\n const keys = Object.keys(input);\n\n if (keys.length === 0) {\n return true;\n }\n\n for (let i = keys.length; i--;) {\n if (!allValuesEqualTo(input[keys[i]], value, opts)) {\n return false;\n }\n }\n\n return true;\n }\n\n return isEq(input, value);\n} // T H E E X P O S E D W R A P P E R F U N C T I O N","function _areEquals(a, b) {\n if (a === b)\n return true;\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\n if (arrA && arrB) {\n length = a.length;\n if (length != b.length)\n return false;\n for (i = length; i-- !== 0;)\n if (!_areEquals(a[i], b[i]))\n return false;\n return true;\n }\n if (arrA != arrB)\n return false;\n var keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length)\n return false;\n for (i = length; i-- !== 0;)\n if (!b.hasOwnProperty(keys[i]))\n return false;\n for (i = length; i-- !== 0;) {\n key = keys[i];\n if (!_areEquals(a[key], b[key]))\n return false;\n }\n return true;\n }\n return a !== a && b !== b;\n}","function _areEquals(a, b) {\n if (a === b)\n return true;\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\n if (arrA && arrB) {\n length = a.length;\n if (length != b.length)\n return false;\n for (i = length; i-- !== 0;)\n if (!_areEquals(a[i], b[i]))\n return false;\n return true;\n }\n if (arrA != arrB)\n return false;\n var keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length)\n return false;\n for (i = length; i-- !== 0;)\n if (!b.hasOwnProperty(keys[i]))\n return false;\n for (i = length; i-- !== 0;) {\n key = keys[i];\n if (!_areEquals(a[key], b[key]))\n return false;\n }\n return true;\n }\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n}","function keyValMatch(obj1, obj2){\n\tfor(key in obj1){\n\t\tfor(otherKey in obj2){\n\t\t\tif(key == otherKey && obj1[key] == obj2[otherKey]){\n\t\t\t\t\n\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\treturn false;\n}","function areObjectsEqual(obj1, obj2) {\n if (Object.keys(obj1).length !== Object.keys(obj2).length) {\n return false;\n }\n let objectLength = Object.keys(obj1).length;\n let i = 1;\n for (let key in obj1) {\n if (!obj2[key] || obj1[key] !== obj2[key]) {\n return false;\n } else if (objectLength === i) {\n return true;\n }\n i++;\n }\n}","function equal(a, b) {\n\n if (Object.is(a, b))\n return true;\n\n\t// Dates must have equal time values\n\tif (isDate(a) && isDate(b))\n\t\treturn a.getTime() === b.getTime();\n\n\t// Non-objects must be strictly equal (types must be equal)\n\tif (!isObject(a) || !isObject(b))\n\t\treturn a === b;\n\n\t// Prototypes must be identical. getPrototypeOf may throw on\n\t// ES3 engines that don't provide access to the prototype.\n\ttry {\n\n\t if (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n\t\t return false;\n\n\t} catch (err) {}\n\n\tvar aKeys = Object.keys(a),\n\t\tbKeys = Object.keys(b);\n\n\t// Number of own properties must be identical\n\tif (aKeys.length !== bKeys.length)\n\t\treturn false;\n\n\tfor (var i$0 = 0; i$0 < aKeys.length; ++i$0) {\n\n\t\t// Names of own properties must be identical\n\t\tif (!OP_hasOwnProperty.call(b, aKeys[i$0]))\n\t\t\treturn false;\n\n\t\t// Values of own properties must be equal\n\t\tif (!equal(a[aKeys[i$0]], b[aKeys[i$0]]))\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}","function deepEqual(object1, object2) {\n const keys1 = Object.keys(object1);\n const keys2 = Object.keys(object2);\n \n if (keys1.length !== keys2.length) {\n return false;\n }\n \n for (const key of keys1) {\n const val1 = object1[key];\n const val2 = object2[key];\n const areObjects = isObject(val1) && isObject(val2);\n if (\n areObjects && !deepEqual(val1, val2) ||\n !areObjects && val1 !== val2\n ) {\n return false;\n }\n }\n \n return true;\n}","function sameKeysNested(objA, objB, ignoreOrder) {\n var keysA = Object.keys(objA)\n var keysB = Object.keys(objB)\n\n if (keysA.length !== keysB.length)\n return false\n\n if (ignoreOrder) keysA.sort(), keysB.sort()\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i])\n return false\n\n if (typeof objA[keysA[i]] === \"object\")\n sameKeysNested(objA[keysA[i]], objB[keysB[i]], ignoreOrder)\n\n return true\n}","function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (areBothNaN(a, b))\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}","function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (areBothNaN(a, b))\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}","function dictsAreEquivalent(a, b) {\n // Create arrays of property names\n var aProps = Object.getOwnPropertyNames(a);\n var bProps = Object.getOwnPropertyNames(b);\n\n // If number of properties is different,\n // objects are not equivalent\n if (aProps.length != bProps.length) {\n return false;\n }\n\n for (var i = 0; i < aProps.length; i++) {\n var propName = aProps[i];\n\n // If values of same property are not equal,\n // objects are not equivalent\n if (a[propName] !== b[propName]) {\n return false;\n }\n }\n\n // If we made it this far, objects\n // are considered equivalent\n return true;\n}","function keyValMatch(obj1, obj2) {\r\n\t//create nested loop\r\n\t//for each key in obj 1, check each key of obj 2 for match\r\n\tfor(key1 in obj1) {\r\n\t\tfor(key2 in obj2) {\r\n\t\t\tif ( (key1 == key2) && (obj1[key1] == obj2[key2])) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn false;\r\n}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n var length, i, keys;\n\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n\n for (i = length; i-- !== 0;) if (!equal(a[i], b[i])) return false;\n\n return true;\n } // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n\n\n var it;\n\n if (hasMap && a instanceof Map && b instanceof Map) {\n if (a.size !== b.size) return false;\n it = a.entries();\n\n while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\n\n it = a.entries();\n\n while (!(i = it.next()).done) if (!equal(i.value[1], b.get(i.value[0]))) return false;\n\n return true;\n }\n\n if (hasSet && a instanceof Set && b instanceof Set) {\n if (a.size !== b.size) return false;\n it = a.entries();\n\n while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\n\n return true;\n } // END: Modifications\n\n\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n length = a.length;\n if (length != b.length) return false;\n\n for (i = length; i-- !== 0;) if (a[i] !== b[i]) return false;\n\n return true;\n }\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;) if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false; // END: fast-deep-equal\n // START: react-fast-compare\n // custom handling for DOM elements\n\n\n if (hasElementType && a instanceof Element) return false; // custom handling for React/Preact\n\n for (i = length; i-- !== 0;) {\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n continue;\n } // all other properties should be traversed as usual\n\n\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n } // END: react-fast-compare\n // START: fast-deep-equal\n\n\n return true;\n }\n\n return a !== a && b !== b;\n} // end fast-deep-equal","function shallowEqual(actual /*: Object*/, expected /*: Object*/) /*: boolean*/ {\n\t var keys = _Object$keys(expected);\n\n\t for (var _iterator3 = (keys /*: Array<string>*/), _isArray3 = Array.isArray(_iterator3), _i3 = 0, _iterator3 = _isArray3 ? _iterator3 : _getIterator(_iterator3);;) {\n\t var _ref3;\n\n\t if (_isArray3) {\n\t if (_i3 >= _iterator3.length) break;\n\t _ref3 = _iterator3[_i3++];\n\t } else {\n\t _i3 = _iterator3.next();\n\t if (_i3.done) break;\n\t _ref3 = _i3.value;\n\t }\n\n\t var key = _ref3;\n\n\t if (actual[key] !== expected[key]) {\n\t return false;\n\t }\n\t }\n\n\t return true;\n\t}","function sameProperties(objA, objB) {\n var keysA = Object.keys(objA).sort()\n var keysB = Object.keys(objB).sort()\n\n if (keysA.length !== keysB.length)\n return false\n\n for (var i = 0; i < keysA.length; i++)\n if (keysA[i] !== keysB[i] || objA[keysA[i]] !== objB[keysB[i]])\n return false\n\n return true\n}","function _shallowCompareKeys(objA, objB, keys) {\n\t return _filterKeys(objA, objB, keys).every(function (key) {\n\t return objA.hasOwnProperty(key) === objB.hasOwnProperty(key) && objA[key] === objB[key];\n\t });\n\t}","function has_all(obj, keys) {\n for (var i in keys) {\n let key = keys[i];\n if (!(key in obj)) {\n return false;\n }\n }\n return true;\n}","function matchItems(object1, object2) {\n for (var key in object1) {\n for (var anotherKey in object2) {\n if (key === anotherKey) {\n if (object1[key] === object2[anotherKey]) {\n return true;\n } \n }\n }\n }\n return false;\n }","function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}","function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}","function deepEqual(a, b) {\n if (a === null && b === null)\n return true;\n if (a === undefined && b === undefined)\n return true;\n if (typeof a !== \"object\")\n return a === b;\n var aIsArray = isArrayLike(a);\n var aIsMap = isMapLike(a);\n if (aIsArray !== isArrayLike(b)) {\n return false;\n }\n else if (aIsMap !== isMapLike(b)) {\n return false;\n }\n else if (aIsArray) {\n if (a.length !== b.length)\n return false;\n for (var i = a.length - 1; i >= 0; i--)\n if (!deepEqual(a[i], b[i]))\n return false;\n return true;\n }\n else if (aIsMap) {\n if (a.size !== b.size)\n return false;\n var equals_1 = true;\n a.forEach(function (value, key) {\n equals_1 = equals_1 && deepEqual(b.get(key), value);\n });\n return equals_1;\n }\n else if (typeof a === \"object\" && typeof b === \"object\") {\n if (a === null || b === null)\n return false;\n if (isMapLike(a) && isMapLike(b)) {\n if (a.size !== b.size)\n return false;\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\n }\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\n return false;\n for (var prop in a) {\n if (!(prop in b))\n return false;\n if (!deepEqual(a[prop], b[prop]))\n return false;\n }\n return true;\n }\n return false;\n}","function areThereDuplicates(...args) {\n let obj = {};\n\n for (let val of args) {\n obj[val] = (obj[val] || 0) + 1;\n }\n \n for(let key in obj) {\n if(obj[key] !== 1) return true;\n }\n \n return false;\n}","function deepEqual(a, b) {\n if (typeof a !== 'object' || typeof b !== 'object' || a == null || b == null)\n return a === b;\n if (Object.keys(a).length !== Object.keys(b).length) return false;\n for (let i = 0; i < Object.keys(a).length; i++)\n if (!deepEqual(a[Object.keys(a)[i]], b[Object.keys(a)[i]])) return false;\n return true;\n}","function shallowEqualObjects(a, b) {\r\n if (a && !b || b && !a) {\r\n return false;\r\n }\r\n\r\n for (var key in a) {\r\n if (a[key] !== b[key]) {\r\n return false;\r\n }\r\n }\r\n\r\n return true;\r\n} // Copied from: https://github.com/jonschlinkert/is-plain-object","function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}","function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}","function equal(a, b) {\n // START: fast-deep-equal es6/index.js 3.1.1\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0; )\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n // START: Modifications:\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n // to co-exist with es5.\n // 2. Replace `for of` with es5 compliant iteration using `for`.\n // Basically, take:\n //\n // ```js\n // for (i of a.entries())\n // if (!b.has(i[0])) return false;\n // ```\n //\n // ... and convert to:\n //\n // ```js\n // it = a.entries();\n // while (!(i = it.next()).done)\n // if (!b.has(i.value[0])) return false;\n // ```\n //\n // **Note**: `i` access switches to `i.value`.\n var it;\n if (hasMap && a instanceof Map && b instanceof Map) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\n return true;\n }\n\n if (hasSet && a instanceof Set && b instanceof Set) {\n if (a.size !== b.size) return false;\n it = a.entries();\n while (!(i = it.next()).done)\n if (!b.has(i.value[0])) return false;\n return true;\n }\n // END: Modifications\n\n if (\n hasArrayBuffer &&\n ArrayBuffer.isView(a) &&\n ArrayBuffer.isView(b)\n ) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0; ) if (a[i] !== b[i]) return false;\n return true;\n }\n\n if (a.constructor === RegExp)\n return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf)\n return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString)\n return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0; )\n if (!Object.prototype.hasOwnProperty.call(b, keys[i]))\n return false;\n // END: fast-deep-equal\n\n // START: react-fast-compare\n // custom handling for DOM elements\n if (hasElementType && a instanceof Element) return false;\n\n // custom handling for React/Preact\n for (i = length; i-- !== 0; ) {\n if (\n (keys[i] === '_owner' ||\n keys[i] === '__v' ||\n keys[i] === '__o') &&\n a.$$typeof\n ) {\n // React-specific: avoid traversing React elements' _owner\n // Preact-specific: avoid traversing Preact elements' __v and __o\n // __v = $_original / $_vnode\n // __o = $_owner\n // These properties contain circular references and are not needed when\n // comparing the actual elements (and not their owners)\n // .$$typeof and ._store on just reasonable markers of elements\n\n continue;\n }\n\n // all other properties should be traversed as usual\n if (!equal(a[keys[i]], b[keys[i]])) return false;\n }\n // END: react-fast-compare\n\n // START: fast-deep-equal\n return true;\n }\n\n return a !== a && b !== b;\n }","function deepEqual(firstObject, secondObject) {\n const firstKeys = Object.keys(firstObject);\n const secondKeys = Object.keys(secondObject);\n\n if (firstKeys.length !== secondKeys.length) {\n return false;\n }\n\n for (const key of firstKeys) {\n const val1 = firstObject[key];\n const val2 = secondObject[key];\n const areObjects = val1 != null && typeof val1 === 'object' && val2 != null && typeof val2 === 'object';\n if (\n areObjects && !deepEqual(val1, val2) ||\n !areObjects && val1 !== val2\n ) {\n return false;\n }\n }\n\n return true;\n}","function objEquals(a, b)\r\n{\r\n for(x in b)\r\n if(typeof(a[x]) == \"undefined\")\r\n return false;\r\n\r\n for(x in a)\r\n {\r\n if(typeof(b[x]) == \"undefined\")\r\n return false;\r\n\r\n if(a[x])\r\n {\r\n if(typeof(a[x]) == \"object\")\r\n {\r\n if(typeof(b[x]) != \"object\" || !objEquals(a[x], b[x]))\r\n return false;\r\n }\r\n else if(a[x] !== b[x])\r\n return false;\r\n }\r\n else if(b[x])\r\n return false;\r\n }\r\n\r\n return true;\r\n}","function shallowCompareKeys(objA, objB, keys) {\n\t // treat `null` and `undefined` as the same\n\t if (objA == null && objB == null) {\n\t return true;\n\t }\n\t else if (objA == null || objB == null) {\n\t return false;\n\t }\n\t else if (Array.isArray(objA) || Array.isArray(objB)) {\n\t return false;\n\t }\n\t else if (keys != null) {\n\t return _shallowCompareKeys(objA, objB, keys);\n\t }\n\t else {\n\t // shallowly compare all keys from both objects\n\t var keysA = Object.keys(objA);\n\t var keysB = Object.keys(objB);\n\t return (_shallowCompareKeys(objA, objB, { include: keysA }) && _shallowCompareKeys(objA, objB, { include: keysB }));\n\t }\n\t}","function has_match(first_object, second_object) {\n\tfor (key in first_object) {\n\t\tif (first_object.key === second_object.key) {\n\t\t\treturn true; break;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n}","function keyValueMatch(obj1, obj2) {\n\tfor (var key1 in obj1) {\n\t\tfor (var key2 in obj2) {\n\t\t\tif (key1 == key2) {\n\t\t\t\tif (obj1[key1] == obj2[key2]) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n if (a === b) { return true }\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n var isArrayA = Array.isArray(a);\n var isArrayB = Array.isArray(b);\n if (isArrayA && isArrayB) {\n return a.length === b.length && a.every(function (e, i) {\n return looseEqual(e, b[i])\n })\n } else if (a instanceof Date && b instanceof Date) {\n return a.getTime() === b.getTime()\n } else if (!isArrayA && !isArrayB) {\n var keysA = Object.keys(a);\n var keysB = Object.keys(b);\n return keysA.length === keysB.length && keysA.every(function (key) {\n return looseEqual(a[key], b[key])\n })\n } else {\n /* istanbul ignore next */\n return false\n }\n } catch (e) {\n /* istanbul ignore next */\n return false\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}"],"string":"[\n \"function equalForKeys(a, b, keys) {\\n if (!angular.isArray(keys) && angular.isObject(keys)) {\\n keys = protoKeys(keys, [\\\"$$keys\\\", \\\"$$values\\\", \\\"$$equals\\\", \\\"$$validates\\\", \\\"$$new\\\", \\\"$$parent\\\"]);\\n }\\n if (!keys) {\\n keys = [];\\n for (var n in a) keys.push(n); // Used instead of Object.keys() for IE8 compatibility\\n }\\n\\n for (var i = 0; i < keys.length; i++) {\\n var k = keys[i];\\n if (a[k] != b[k]) return false; // Not '===', values aren't necessarily normalized\\n }\\n return true;\\n }\",\n \"function equalForKeys(a, b, keys) {\\n if (!angular.isArray(keys) && angular.isObject(keys)) {\\n keys = protoKeys(keys, [\\\"$$keys\\\", \\\"$$values\\\", \\\"$$equals\\\", \\\"$$validates\\\", \\\"$$new\\\", \\\"$$parent\\\"]);\\n }\\n if (!keys) {\\n keys = [];\\n for (var n in a) keys.push(n); // Used instead of Object.keys() for IE8 compatibility\\n }\\n\\n for (var i = 0; i < keys.length; i++) {\\n var k = keys[i];\\n if (a[k] != b[k]) return false; // Not '===', values aren't necessarily normalized\\n }\\n return true;\\n }\",\n \"function allEqual(args) {\\n for (var i = 1; i < args.length; i++) {\\n if (args[i] != args[0])\\n return false;\\n }\\n return true;\\n}\",\n \"function keyValueChecker (object1, object2) {\\r\\n\\tfor (var property1 in object1) {\\r\\n\\t\\tfor (var property2 in object2) {\\r\\n\\t\\t\\tif (property1 == property2 && object1[property1] == object2[property2]) {\\r\\n\\t\\t\\t\\treturn true;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn false;\\r\\n}\",\n \"function allEqual(args) {\\r\\n\\tvar firstValue = arguments[0],\\r\\n\\t\\ti;\\r\\n\\tfor (i = 1; i < arguments.length; i += 1) {\\r\\n\\t\\tif (arguments[i] != firstValue) {\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn true;\\r\\n}\",\n \"function isEqual(left, right) {\\n const OBJECT_STRING = '[object Object]';\\n if (typeof left !== 'object' || typeof right !== 'object') {\\n return left === right;\\n }\\n if (left === null || right === null)\\n return left === right;\\n const leftArray = Array.isArray(left);\\n const rightArray = Array.isArray(right);\\n if (leftArray !== rightArray)\\n return false;\\n const leftPlainObject = Object.prototype.toString.call(left) === OBJECT_STRING;\\n const rightPlainObject = Object.prototype.toString.call(right) === OBJECT_STRING;\\n if (leftPlainObject !== rightPlainObject)\\n return false;\\n if (!leftPlainObject && !leftArray)\\n return false;\\n const leftKeys = Object.keys(left);\\n const rightKeys = Object.keys(right);\\n if (leftKeys.length !== rightKeys.length)\\n return false;\\n const keySet = {};\\n for (let i = 0; i < leftKeys.length; i += 1) {\\n keySet[leftKeys[i]] = true;\\n }\\n for (let i = 0; i < rightKeys.length; i += 1) {\\n keySet[rightKeys[i]] = true;\\n }\\n const allKeys = Object.keys(keySet);\\n if (allKeys.length !== leftKeys.length) {\\n return false;\\n }\\n const l = left;\\n const r = right;\\n const pred = (key) => {\\n return isEqual(l[key], r[key]);\\n };\\n return allKeys.every(pred);\\n}\",\n \"function sameKeys(objA, objB, ignoreOrder) {\\n var keysA = Object.keys(objA)\\n var keysB = Object.keys(objB)\\n\\n if (keysA.length !== keysB.length)\\n return false\\n\\n if (ignoreOrder) keysA.sort(), keysB.sort()\\n\\n for (var i = 0; i < keysA.length; i++)\\n if (keysA[i] !== keysB[i])\\n return false\\n\\n return true\\n}\",\n \"function isEqual(objA, objB, ...ignoredKeys) {\\n if (objA === objB) {\\n // Reference equality\\n return true;\\n }\\n\\n if (!objA !== !objB) {\\n // Either one undefined/null but not both\\n return false;\\n }\\n\\n let keysA = immutable.Set.fromKeys(objA);\\n let keysB = immutable.Set.fromKeys(objB);\\n let keys = keysA.union(keysB).subtract(ignoredKeys);\\n\\n return keys.every(key => {\\n // Use Immutable.js's equivalence algorithm. Note that StoreRef and\\n // QueryData implement valueOf() or equals()/hashCode(), which this\\n // algorithm uses for comparisons.\\n return immutable.is(objA[key], objB[key]);\\n });\\n}\",\n \"function isEqual(a, b) {\\n let aKeys = Object.keys(a);\\n let bKeys = Object.keys(b);\\n\\n if (aKeys.length !== bKeys.length) {\\n return false;\\n }\\n\\n for (let i = 0; i < aKeys.length; i++) {\\n var currentKey = aKeys[i];\\n\\n if (a[currentKey] !== b[currentKey]) {\\n return false;\\n } \\n }\\n\\n return true;\\n}\",\n \"function isKeyMatch(object1, object2) {\\n var object1Keys = Object.keys(object1);\\n var object2Keys = Object.keys(object2);\\n\\n for (var i = 0; i < object1Keys.length; i++) {\\n if (object1Keys[i] !== object2Keys[i]) {\\n return false; // not the same key here\\n }\\n return true; //if made it here, all keys match\\n }\\n }\",\n \"function Object$prototype$equals(other) {\\n var self = this;\\n var keys = Object.keys(this).sort();\\n return equals(keys, Object.keys(other).sort()) &&\\n keys.every(function(k) { return equals(self[k], other[k]); });\\n }\",\n \"function iterableEquality(a, b) {\\n if (\\n typeof a !== 'object' ||\\n typeof b !== 'object' ||\\n Array.isArray(a) ||\\n Array.isArray(b) ||\\n a === null ||\\n b === null\\n ) {\\n return undefined\\n }\\n if (a && b && a.constructor !== b.constructor) {\\n // check if the object are natives and then shallow equal them\\n return a.sketchObject && b.sketchObject && a.sketchObject == b.sketchObject\\n }\\n\\n if (a.size !== undefined) {\\n if (a.size !== b.size) {\\n return false\\n } else if (isA('Set', a)) {\\n var allFound = true\\n for (var aValue of a) {\\n if (!b.has(aValue)) {\\n allFound = false\\n break\\n }\\n }\\n if (allFound) {\\n return true\\n }\\n } else if (isA('Map', a)) {\\n var allFound = true\\n for (var aEntry of a) {\\n if (\\n !b.has(aEntry[0]) ||\\n !equals(aEntry[1], b.get(aEntry[0]), [iterableEquality])\\n ) {\\n allFound = false\\n break\\n }\\n }\\n if (allFound) {\\n return true\\n }\\n }\\n }\\n\\n if (Object.keys(a).length !== Object.keys(a).length) {\\n return false\\n }\\n\\n var aKeys = Object.keys(a).sort()\\n var bKeys = Object.keys(b).sort()\\n\\n for (var i = 0; i < aKeys.length; i += 1) {\\n var aKey = aKeys[i]\\n var bKey = bKeys[i]\\n if (aKey !== bKey || !equals(a[aKey], b[bKey], [iterableEquality])) {\\n return false\\n }\\n }\\n\\n return true\\n}\",\n \"function Object$prototype$equals(other) {\\n var self = this;\\n var keys = sortedKeys (this);\\n return equals (keys, sortedKeys (other)) &&\\n keys.every (function(k) { return equals (self[k], other[k]); });\\n }\",\n \"function setsEqual(a, b) {\\n var ka = Object.keys(a).sort();\\n var kb = Object.keys(b).sort();\\n if (ka.length != kb.length) {\\n return false;\\n }\\n for (var i in ka) {\\n if (kb[i] != ka[i]) {\\n return false;\\n }\\n }\\n return true;\\n}\",\n \"function allEqual() {\\n\\tfor (let i = 1; i < arguments.length; i++) {\\n\\t\\tif (arguments[i] === '' || arguments[i] !== arguments[i - 1]) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\",\n \"function validateKeys(object, expectedKeys) {\\n // if the enumerable properties of object is not the same as expectedKeys, return false\\n if (Object.keys(object).length !== expectedKeys.length) {\\n return false;\\n }\\n\\n // Loop through expectedKeys\\n for(let i = 0; i < expectedKeys.length; i++) {\\n // While loop through expectedkeys.length\\n // if Object.keys(object) DOES NOT find, the key matching expectedKey[i], return false\\n // Goes through the array of strings, that is the keys of the object parameter, and if the key is found, it returns true\\n if(!Object.keys(object).find(key => key === expectedKeys[i])) {\\n return false;\\n }\\n }\\n // otherwise return true\\n return true;\\n}\",\n \"function deepEqual(value1, value2) {\\n if (value1 === value2) {\\n return true;\\n }\\n if (value1 == null || typeof value1 != \\\"object\\\" ||\\n value2 == null || typeof value2 != \\\"object\\\") {\\n return false;\\n }\\n // The Object.keys() method returns an array of a given object's own property names, in the same order as we get with a normal loop. Example below:\\n // const object1 = {\\n // a: 'somestring',\\n // b: 42,\\n // c: false\\n // };\\n\\n // console.log(Object.keys(object1));\\n // expected output: Array [\\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n // basically runs a for loop thru each object and creates an array of those values\\n let keysA = Object.keys(value1);\\n let keysB = Object.keys(value2);\\n\\n if (keysA.length != keysB.length) {\\n return false;\\n }\\n\\n for (let key of keysA) {\\n if (!keysB.includes(key) || !deepEqual(value1[key], value2[key])) {\\n return false;\\n }\\n }\\n \\n return true;\\n}\",\n \"function sameProps(objA, objB) {\\n var keysA = Object.keys(objA)\\n var keysB = Object.keys(objB)\\n\\n if (keysA.length !== keysB.length)\\n return false\\n\\n for (var i = 0; i < keysA.length; i++) {\\n if (keysA[i] !== keysB[i])\\n return false\\n }\\n\\n return true\\n}\",\n \"function objectsEqual(obj1, obj2) {\\n let obj1Keys = Object.keys(obj1);\\n let obj1Values = Object.values(obj1);\\n let obj2Keys = Object.keys(obj2);\\n let obj2Values = Object.values(obj2);\\n\\n if (obj1Keys.length !== obj2Keys.length || obj1Values.length !== obj2Values.length) {\\n return false;\\n }\\n\\n for (let i = 0; i < obj1Keys.length; i += 1) {\\n if (obj1Keys[i] !== obj2Keys[i]) {\\n return false;\\n }\\n }\\n\\n for (let i = 0; i < obj1Values.length; i += 1) {\\n if (obj1Values[i] !== obj2Values[i]) {\\n return false;\\n }\\n }\\n\\n return true;\\n}\",\n \"function objectsEqual(a, b) {\\n if (a === b) {\\n return true;\\n }\\n\\n return (keysMatch(a, b) && valuesMatch(a, b));\\n}\",\n \"function equalObjects(a, b) {\\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== (typeof b === 'undefined' ? 'undefined' : _typeof(b))) {\\n return false;\\n }\\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== 'object') {\\n return a === b;\\n }\\n if (a === b) {\\n return true;\\n }\\n if (toString.call(a) === '[object Date]') {\\n if (toString.call(b) === '[object Date]') {\\n return +a === +b;\\n }\\n return false;\\n }\\n if (Array.isArray(a)) {\\n if (Array.isArray(b)) {\\n if (a.length !== b.length) {\\n return false;\\n }\\n for (var i = 0; i < a.length; i++) {\\n if (!equalObjects(a[i], b[i])) {\\n return false;\\n }\\n }\\n return true;\\n }\\n return false;\\n }\\n if (Object.keys(a).length !== Object.keys(b).length) {\\n return false;\\n }\\n for (var key in a) {\\n if (!equalObjects(a[key], b[key])) {\\n return false;\\n }\\n }\\n return true;\\n}\",\n \"function compareObjects(left, right) {\\n var left_keys = Object.keys(left);\\n var right_keys = Object.keys(right);\\n if (!compareArrays(left_keys, right_keys)) {\\n return false;\\n }return left_keys.every(function (key) {\\n return compare(left[key], right[key]);\\n });\\n}\",\n \"function hasPropsAndVals(obj, kv) {\\n if (typeof (obj) !== 'object' || typeof (kv) !== 'object') {\\n return (false);\\n }\\n\\n if (Object.keys(kv).length === 0) {\\n return (true);\\n }\\n\\n return (Object.keys(kv).every(function (k) {\\n return (obj[k] && obj[k] === kv[k]);\\n }));\\n}\",\n \"function compareKeyValuePair(object1, object2){\\r\\n for (objectKey in object1){\\r\\n if (typeof object1[objectKey] !== 'function'){\\r\\n if (typeof object2[objectKey] != 'undefined'){\\r\\n if (object1[objectKey] == object2[objectKey]){\\r\\n return true;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n return false; \\r\\n}\",\n \"deepEqual(a, b) {\\n // If two \\n if(a === b) {\\n return true\\n }; \\n\\n // Check for any condition that would cause args not to be equal\\n if(a === null || b === null || typeof a != 'object' || typeof b != 'object') {\\n return false\\n };\\n\\n // Check for equality in number of properties and properties themselves\\n var propsA = 0, \\n propsB = 0;\\n\\n for(var prop in a) {\\n propsA += 1;\\n\\n for (var prop in b) {\\n propsB += 1;\\n if (!(prop in a) || !this.deepEqual(a[prop], b[prop])) {\\n return false;\\n }\\n }\\n }\\n\\n return propsInA == propsInB;\\n }\",\n \"function forEveryKeyInObject (obj, fn) {\\n if (Object.keys(obj).length < 1) {\\n return false\\n }\\n for (var key in obj) {\\n if (obj.hasOwnProperty(key)) {\\n if (!fn(key)) return false\\n }\\n }\\n return true\\n }\",\n \"function comparePairs(obj1, obj2){\\n\\tvar keys1 = Object.keys(obj1);\\n\\tvar keys2 = Object.keys(obj2);\\n\\tfor(var i = 0; i < keys1.length; i ++){\\n\\t\\tif (keys1[i] === keys2[i] || obj1[keys1[i]] === obj2[keys2[i]]){\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t\\treturn false\\n\\t}\\n}\",\n \"function sameKeys(objA, objB, protoCheck, deepCheck) {\\n var keysA = Object.getNestedKeys(objA, protoCheck, !deepCheck)\\n var keysB = Object.getNestedKeys(objB, protoCheck, !deepCheck)\\n\\n if (keysA.length !== keysB.length)\\n return false\\n\\n for (var i = 0; i < keysA.length; i++)\\n if (keysA[i] !== keysB[i])\\n return false\\n\\n return true\\n}\",\n \"function are_equal(a1, a2)\\n{\\n if (typeof(a1) != typeof(a2))\\n return false;\\n \\n switch(typeof(a1)) {\\n case 'object':\\n // arrays\\n if (a1.length) {\\n if (a1.length != a2.length)\\n return false;\\n for (var i = 0; i < a1.length; ++i) {\\n if (!are_equal(a1[i], a2[i]))\\n return false\\n }\\n }\\n // associative arrays\\n else {\\n var keys = {};\\n for (var key in a1) {\\n keys[key] = true;\\n }\\n for (var key in a2) {\\n keys[key] = true;\\n }\\n for (var key in keys) {\\n if (!are_equal(a1[key], a2[key]))\\n return false;\\n }\\n }\\n return true;\\n \\n default:\\n return a1 == a2;\\n }\\n}\",\n \"function areEquals(a, b) {\\n\\n\\tlet aProps = Object.getOwnPropertyNames(a);\\n let bProps = Object.getOwnPropertyNames(b);\\n\\n if (bProps.length !== aProps.length)\\n \\treturn false;\\n\\n for (let key of aProps) {\\n \\tif (!bProps.includes(key) || b[key] !== a[key])\\n \\t\\treturn false;\\n }\\n\\n for (let key of bProps) {\\n \\tif (!aProps.includes(key) || b[key] !== a[key])\\n \\t\\treturn false;\\n }\\n\\n return true;\\n}\",\n \"function allValuesEqualTo(input, value, opts) {\\n if (Array.isArray(input)) {\\n if (input.length === 0) {\\n return true;\\n }\\n\\n if (opts.arraysMustNotContainPlaceholders && input.length > 0 && input.some(el => isEq(el, value))) {\\n return false;\\n } // so at this point\\n // backwards traversal for increased performance:\\n\\n\\n for (let i = input.length; i--;) {\\n if (!allValuesEqualTo(input[i], value, opts)) {\\n return false;\\n }\\n }\\n\\n return true;\\n }\\n\\n if (isObj(input)) {\\n const keys = Object.keys(input);\\n\\n if (keys.length === 0) {\\n return true;\\n }\\n\\n for (let i = keys.length; i--;) {\\n if (!allValuesEqualTo(input[keys[i]], value, opts)) {\\n return false;\\n }\\n }\\n\\n return true;\\n }\\n\\n return isEq(input, value);\\n} // T H E E X P O S E D W R A P P E R F U N C T I O N\",\n \"function _areEquals(a, b) {\\n if (a === b)\\n return true;\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\\n if (arrA && arrB) {\\n length = a.length;\\n if (length != b.length)\\n return false;\\n for (i = length; i-- !== 0;)\\n if (!_areEquals(a[i], b[i]))\\n return false;\\n return true;\\n }\\n if (arrA != arrB)\\n return false;\\n var keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length)\\n return false;\\n for (i = length; i-- !== 0;)\\n if (!b.hasOwnProperty(keys[i]))\\n return false;\\n for (i = length; i-- !== 0;) {\\n key = keys[i];\\n if (!_areEquals(a[key], b[key]))\\n return false;\\n }\\n return true;\\n }\\n return a !== a && b !== b;\\n}\",\n \"function _areEquals(a, b) {\\n if (a === b)\\n return true;\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\\n if (arrA && arrB) {\\n length = a.length;\\n if (length != b.length)\\n return false;\\n for (i = length; i-- !== 0;)\\n if (!_areEquals(a[i], b[i]))\\n return false;\\n return true;\\n }\\n if (arrA != arrB)\\n return false;\\n var keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length)\\n return false;\\n for (i = length; i-- !== 0;)\\n if (!b.hasOwnProperty(keys[i]))\\n return false;\\n for (i = length; i-- !== 0;) {\\n key = keys[i];\\n if (!_areEquals(a[key], b[key]))\\n return false;\\n }\\n return true;\\n }\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && (a instanceof Map) && (b instanceof Map)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && (a instanceof Set) && (b instanceof Set)) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0;)\\n if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;)\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n}\",\n \"function keyValMatch(obj1, obj2){\\n\\tfor(key in obj1){\\n\\t\\tfor(otherKey in obj2){\\n\\t\\t\\tif(key == otherKey && obj1[key] == obj2[otherKey]){\\n\\t\\t\\t\\t\\n\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\treturn false;\\n}\",\n \"function areObjectsEqual(obj1, obj2) {\\n if (Object.keys(obj1).length !== Object.keys(obj2).length) {\\n return false;\\n }\\n let objectLength = Object.keys(obj1).length;\\n let i = 1;\\n for (let key in obj1) {\\n if (!obj2[key] || obj1[key] !== obj2[key]) {\\n return false;\\n } else if (objectLength === i) {\\n return true;\\n }\\n i++;\\n }\\n}\",\n \"function equal(a, b) {\\n\\n if (Object.is(a, b))\\n return true;\\n\\n\\t// Dates must have equal time values\\n\\tif (isDate(a) && isDate(b))\\n\\t\\treturn a.getTime() === b.getTime();\\n\\n\\t// Non-objects must be strictly equal (types must be equal)\\n\\tif (!isObject(a) || !isObject(b))\\n\\t\\treturn a === b;\\n\\n\\t// Prototypes must be identical. getPrototypeOf may throw on\\n\\t// ES3 engines that don't provide access to the prototype.\\n\\ttry {\\n\\n\\t if (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\\n\\t\\t return false;\\n\\n\\t} catch (err) {}\\n\\n\\tvar aKeys = Object.keys(a),\\n\\t\\tbKeys = Object.keys(b);\\n\\n\\t// Number of own properties must be identical\\n\\tif (aKeys.length !== bKeys.length)\\n\\t\\treturn false;\\n\\n\\tfor (var i$0 = 0; i$0 < aKeys.length; ++i$0) {\\n\\n\\t\\t// Names of own properties must be identical\\n\\t\\tif (!OP_hasOwnProperty.call(b, aKeys[i$0]))\\n\\t\\t\\treturn false;\\n\\n\\t\\t// Values of own properties must be equal\\n\\t\\tif (!equal(a[aKeys[i$0]], b[aKeys[i$0]]))\\n\\t\\t\\treturn false;\\n\\t}\\n\\n\\treturn true;\\n}\",\n \"function deepEqual(object1, object2) {\\n const keys1 = Object.keys(object1);\\n const keys2 = Object.keys(object2);\\n \\n if (keys1.length !== keys2.length) {\\n return false;\\n }\\n \\n for (const key of keys1) {\\n const val1 = object1[key];\\n const val2 = object2[key];\\n const areObjects = isObject(val1) && isObject(val2);\\n if (\\n areObjects && !deepEqual(val1, val2) ||\\n !areObjects && val1 !== val2\\n ) {\\n return false;\\n }\\n }\\n \\n return true;\\n}\",\n \"function sameKeysNested(objA, objB, ignoreOrder) {\\n var keysA = Object.keys(objA)\\n var keysB = Object.keys(objB)\\n\\n if (keysA.length !== keysB.length)\\n return false\\n\\n if (ignoreOrder) keysA.sort(), keysB.sort()\\n\\n for (var i = 0; i < keysA.length; i++)\\n if (keysA[i] !== keysB[i])\\n return false\\n\\n if (typeof objA[keysA[i]] === \\\"object\\\")\\n sameKeysNested(objA[keysA[i]], objB[keysB[i]], ignoreOrder)\\n\\n return true\\n}\",\n \"function deepEqual(a, b) {\\n if (a === null && b === null)\\n return true;\\n if (a === undefined && b === undefined)\\n return true;\\n if (areBothNaN(a, b))\\n return true;\\n if (typeof a !== \\\"object\\\")\\n return a === b;\\n var aIsArray = isArrayLike(a);\\n var aIsMap = isMapLike(a);\\n if (aIsArray !== isArrayLike(b)) {\\n return false;\\n }\\n else if (aIsMap !== isMapLike(b)) {\\n return false;\\n }\\n else if (aIsArray) {\\n if (a.length !== b.length)\\n return false;\\n for (var i = a.length - 1; i >= 0; i--)\\n if (!deepEqual(a[i], b[i]))\\n return false;\\n return true;\\n }\\n else if (aIsMap) {\\n if (a.size !== b.size)\\n return false;\\n var equals_1 = true;\\n a.forEach(function (value, key) {\\n equals_1 = equals_1 && deepEqual(b.get(key), value);\\n });\\n return equals_1;\\n }\\n else if (typeof a === \\\"object\\\" && typeof b === \\\"object\\\") {\\n if (a === null || b === null)\\n return false;\\n if (isMapLike(a) && isMapLike(b)) {\\n if (a.size !== b.size)\\n return false;\\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\\n }\\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\\n return false;\\n for (var prop in a) {\\n if (!(prop in b))\\n return false;\\n if (!deepEqual(a[prop], b[prop]))\\n return false;\\n }\\n return true;\\n }\\n return false;\\n}\",\n \"function deepEqual(a, b) {\\n if (a === null && b === null)\\n return true;\\n if (a === undefined && b === undefined)\\n return true;\\n if (areBothNaN(a, b))\\n return true;\\n if (typeof a !== \\\"object\\\")\\n return a === b;\\n var aIsArray = isArrayLike(a);\\n var aIsMap = isMapLike(a);\\n if (aIsArray !== isArrayLike(b)) {\\n return false;\\n }\\n else if (aIsMap !== isMapLike(b)) {\\n return false;\\n }\\n else if (aIsArray) {\\n if (a.length !== b.length)\\n return false;\\n for (var i = a.length - 1; i >= 0; i--)\\n if (!deepEqual(a[i], b[i]))\\n return false;\\n return true;\\n }\\n else if (aIsMap) {\\n if (a.size !== b.size)\\n return false;\\n var equals_1 = true;\\n a.forEach(function (value, key) {\\n equals_1 = equals_1 && deepEqual(b.get(key), value);\\n });\\n return equals_1;\\n }\\n else if (typeof a === \\\"object\\\" && typeof b === \\\"object\\\") {\\n if (a === null || b === null)\\n return false;\\n if (isMapLike(a) && isMapLike(b)) {\\n if (a.size !== b.size)\\n return false;\\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\\n }\\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\\n return false;\\n for (var prop in a) {\\n if (!(prop in b))\\n return false;\\n if (!deepEqual(a[prop], b[prop]))\\n return false;\\n }\\n return true;\\n }\\n return false;\\n}\",\n \"function dictsAreEquivalent(a, b) {\\n // Create arrays of property names\\n var aProps = Object.getOwnPropertyNames(a);\\n var bProps = Object.getOwnPropertyNames(b);\\n\\n // If number of properties is different,\\n // objects are not equivalent\\n if (aProps.length != bProps.length) {\\n return false;\\n }\\n\\n for (var i = 0; i < aProps.length; i++) {\\n var propName = aProps[i];\\n\\n // If values of same property are not equal,\\n // objects are not equivalent\\n if (a[propName] !== b[propName]) {\\n return false;\\n }\\n }\\n\\n // If we made it this far, objects\\n // are considered equivalent\\n return true;\\n}\",\n \"function keyValMatch(obj1, obj2) {\\r\\n\\t//create nested loop\\r\\n\\t//for each key in obj 1, check each key of obj 2 for match\\r\\n\\tfor(key1 in obj1) {\\r\\n\\t\\tfor(key2 in obj2) {\\r\\n\\t\\t\\tif ( (key1 == key2) && (obj1[key1] == obj2[key2])) {\\r\\n\\t\\t\\t\\treturn true;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\treturn false;\\r\\n}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n var length, i, keys;\\n\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n\\n for (i = length; i-- !== 0;) if (!equal(a[i], b[i])) return false;\\n\\n return true;\\n } // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n\\n\\n var it;\\n\\n if (hasMap && a instanceof Map && b instanceof Map) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n\\n while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\\n\\n it = a.entries();\\n\\n while (!(i = it.next()).done) if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n\\n return true;\\n }\\n\\n if (hasSet && a instanceof Set && b instanceof Set) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n\\n while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\\n\\n return true;\\n } // END: Modifications\\n\\n\\n if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\\n length = a.length;\\n if (length != b.length) return false;\\n\\n for (i = length; i-- !== 0;) if (a[i] !== b[i]) return false;\\n\\n return true;\\n }\\n\\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0;) if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false; // END: fast-deep-equal\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n\\n\\n if (hasElementType && a instanceof Element) return false; // custom handling for React/Preact\\n\\n for (i = length; i-- !== 0;) {\\n if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n continue;\\n } // all other properties should be traversed as usual\\n\\n\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n } // END: react-fast-compare\\n // START: fast-deep-equal\\n\\n\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n} // end fast-deep-equal\",\n \"function shallowEqual(actual /*: Object*/, expected /*: Object*/) /*: boolean*/ {\\n\\t var keys = _Object$keys(expected);\\n\\n\\t for (var _iterator3 = (keys /*: Array<string>*/), _isArray3 = Array.isArray(_iterator3), _i3 = 0, _iterator3 = _isArray3 ? _iterator3 : _getIterator(_iterator3);;) {\\n\\t var _ref3;\\n\\n\\t if (_isArray3) {\\n\\t if (_i3 >= _iterator3.length) break;\\n\\t _ref3 = _iterator3[_i3++];\\n\\t } else {\\n\\t _i3 = _iterator3.next();\\n\\t if (_i3.done) break;\\n\\t _ref3 = _i3.value;\\n\\t }\\n\\n\\t var key = _ref3;\\n\\n\\t if (actual[key] !== expected[key]) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\n\\t return true;\\n\\t}\",\n \"function sameProperties(objA, objB) {\\n var keysA = Object.keys(objA).sort()\\n var keysB = Object.keys(objB).sort()\\n\\n if (keysA.length !== keysB.length)\\n return false\\n\\n for (var i = 0; i < keysA.length; i++)\\n if (keysA[i] !== keysB[i] || objA[keysA[i]] !== objB[keysB[i]])\\n return false\\n\\n return true\\n}\",\n \"function _shallowCompareKeys(objA, objB, keys) {\\n\\t return _filterKeys(objA, objB, keys).every(function (key) {\\n\\t return objA.hasOwnProperty(key) === objB.hasOwnProperty(key) && objA[key] === objB[key];\\n\\t });\\n\\t}\",\n \"function has_all(obj, keys) {\\n for (var i in keys) {\\n let key = keys[i];\\n if (!(key in obj)) {\\n return false;\\n }\\n }\\n return true;\\n}\",\n \"function matchItems(object1, object2) {\\n for (var key in object1) {\\n for (var anotherKey in object2) {\\n if (key === anotherKey) {\\n if (object1[key] === object2[anotherKey]) {\\n return true;\\n } \\n }\\n }\\n }\\n return false;\\n }\",\n \"function deepEqual(a, b) {\\n if (a === null && b === null)\\n return true;\\n if (a === undefined && b === undefined)\\n return true;\\n if (typeof a !== \\\"object\\\")\\n return a === b;\\n var aIsArray = isArrayLike(a);\\n var aIsMap = isMapLike(a);\\n if (aIsArray !== isArrayLike(b)) {\\n return false;\\n }\\n else if (aIsMap !== isMapLike(b)) {\\n return false;\\n }\\n else if (aIsArray) {\\n if (a.length !== b.length)\\n return false;\\n for (var i = a.length - 1; i >= 0; i--)\\n if (!deepEqual(a[i], b[i]))\\n return false;\\n return true;\\n }\\n else if (aIsMap) {\\n if (a.size !== b.size)\\n return false;\\n var equals_1 = true;\\n a.forEach(function (value, key) {\\n equals_1 = equals_1 && deepEqual(b.get(key), value);\\n });\\n return equals_1;\\n }\\n else if (typeof a === \\\"object\\\" && typeof b === \\\"object\\\") {\\n if (a === null || b === null)\\n return false;\\n if (isMapLike(a) && isMapLike(b)) {\\n if (a.size !== b.size)\\n return false;\\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\\n }\\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\\n return false;\\n for (var prop in a) {\\n if (!(prop in b))\\n return false;\\n if (!deepEqual(a[prop], b[prop]))\\n return false;\\n }\\n return true;\\n }\\n return false;\\n}\",\n \"function deepEqual(a, b) {\\n if (a === null && b === null)\\n return true;\\n if (a === undefined && b === undefined)\\n return true;\\n if (typeof a !== \\\"object\\\")\\n return a === b;\\n var aIsArray = isArrayLike(a);\\n var aIsMap = isMapLike(a);\\n if (aIsArray !== isArrayLike(b)) {\\n return false;\\n }\\n else if (aIsMap !== isMapLike(b)) {\\n return false;\\n }\\n else if (aIsArray) {\\n if (a.length !== b.length)\\n return false;\\n for (var i = a.length - 1; i >= 0; i--)\\n if (!deepEqual(a[i], b[i]))\\n return false;\\n return true;\\n }\\n else if (aIsMap) {\\n if (a.size !== b.size)\\n return false;\\n var equals_1 = true;\\n a.forEach(function (value, key) {\\n equals_1 = equals_1 && deepEqual(b.get(key), value);\\n });\\n return equals_1;\\n }\\n else if (typeof a === \\\"object\\\" && typeof b === \\\"object\\\") {\\n if (a === null || b === null)\\n return false;\\n if (isMapLike(a) && isMapLike(b)) {\\n if (a.size !== b.size)\\n return false;\\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\\n }\\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\\n return false;\\n for (var prop in a) {\\n if (!(prop in b))\\n return false;\\n if (!deepEqual(a[prop], b[prop]))\\n return false;\\n }\\n return true;\\n }\\n return false;\\n}\",\n \"function deepEqual(a, b) {\\n if (a === null && b === null)\\n return true;\\n if (a === undefined && b === undefined)\\n return true;\\n if (typeof a !== \\\"object\\\")\\n return a === b;\\n var aIsArray = isArrayLike(a);\\n var aIsMap = isMapLike(a);\\n if (aIsArray !== isArrayLike(b)) {\\n return false;\\n }\\n else if (aIsMap !== isMapLike(b)) {\\n return false;\\n }\\n else if (aIsArray) {\\n if (a.length !== b.length)\\n return false;\\n for (var i = a.length - 1; i >= 0; i--)\\n if (!deepEqual(a[i], b[i]))\\n return false;\\n return true;\\n }\\n else if (aIsMap) {\\n if (a.size !== b.size)\\n return false;\\n var equals_1 = true;\\n a.forEach(function (value, key) {\\n equals_1 = equals_1 && deepEqual(b.get(key), value);\\n });\\n return equals_1;\\n }\\n else if (typeof a === \\\"object\\\" && typeof b === \\\"object\\\") {\\n if (a === null || b === null)\\n return false;\\n if (isMapLike(a) && isMapLike(b)) {\\n if (a.size !== b.size)\\n return false;\\n // Freaking inefficient.... Create PR if you run into this :) Much appreciated!\\n return deepEqual(observable.shallowMap(a).entries(), observable.shallowMap(b).entries());\\n }\\n if (getEnumerableKeys(a).length !== getEnumerableKeys(b).length)\\n return false;\\n for (var prop in a) {\\n if (!(prop in b))\\n return false;\\n if (!deepEqual(a[prop], b[prop]))\\n return false;\\n }\\n return true;\\n }\\n return false;\\n}\",\n \"function areThereDuplicates(...args) {\\n let obj = {};\\n\\n for (let val of args) {\\n obj[val] = (obj[val] || 0) + 1;\\n }\\n \\n for(let key in obj) {\\n if(obj[key] !== 1) return true;\\n }\\n \\n return false;\\n}\",\n \"function deepEqual(a, b) {\\n if (typeof a !== 'object' || typeof b !== 'object' || a == null || b == null)\\n return a === b;\\n if (Object.keys(a).length !== Object.keys(b).length) return false;\\n for (let i = 0; i < Object.keys(a).length; i++)\\n if (!deepEqual(a[Object.keys(a)[i]], b[Object.keys(a)[i]])) return false;\\n return true;\\n}\",\n \"function shallowEqualObjects(a, b) {\\r\\n if (a && !b || b && !a) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n for (var key in a) {\\r\\n if (a[key] !== b[key]) {\\r\\n return false;\\r\\n }\\r\\n }\\r\\n\\r\\n return true;\\r\\n} // Copied from: https://github.com/jonschlinkert/is-plain-object\",\n \"function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}\",\n \"function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}\",\n \"function equal(a, b) {\\n // START: fast-deep-equal es6/index.js 3.1.1\\n if (a === b) return true;\\n\\n if (a && b && typeof a == 'object' && typeof b == 'object') {\\n if (a.constructor !== b.constructor) return false;\\n\\n var length, i, keys;\\n if (Array.isArray(a)) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0; )\\n if (!equal(a[i], b[i])) return false;\\n return true;\\n }\\n\\n // START: Modifications:\\n // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n // to co-exist with es5.\\n // 2. Replace `for of` with es5 compliant iteration using `for`.\\n // Basically, take:\\n //\\n // ```js\\n // for (i of a.entries())\\n // if (!b.has(i[0])) return false;\\n // ```\\n //\\n // ... and convert to:\\n //\\n // ```js\\n // it = a.entries();\\n // while (!(i = it.next()).done)\\n // if (!b.has(i.value[0])) return false;\\n // ```\\n //\\n // **Note**: `i` access switches to `i.value`.\\n var it;\\n if (hasMap && a instanceof Map && b instanceof Map) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!equal(i.value[1], b.get(i.value[0]))) return false;\\n return true;\\n }\\n\\n if (hasSet && a instanceof Set && b instanceof Set) {\\n if (a.size !== b.size) return false;\\n it = a.entries();\\n while (!(i = it.next()).done)\\n if (!b.has(i.value[0])) return false;\\n return true;\\n }\\n // END: Modifications\\n\\n if (\\n hasArrayBuffer &&\\n ArrayBuffer.isView(a) &&\\n ArrayBuffer.isView(b)\\n ) {\\n length = a.length;\\n if (length != b.length) return false;\\n for (i = length; i-- !== 0; ) if (a[i] !== b[i]) return false;\\n return true;\\n }\\n\\n if (a.constructor === RegExp)\\n return a.source === b.source && a.flags === b.flags;\\n if (a.valueOf !== Object.prototype.valueOf)\\n return a.valueOf() === b.valueOf();\\n if (a.toString !== Object.prototype.toString)\\n return a.toString() === b.toString();\\n\\n keys = Object.keys(a);\\n length = keys.length;\\n if (length !== Object.keys(b).length) return false;\\n\\n for (i = length; i-- !== 0; )\\n if (!Object.prototype.hasOwnProperty.call(b, keys[i]))\\n return false;\\n // END: fast-deep-equal\\n\\n // START: react-fast-compare\\n // custom handling for DOM elements\\n if (hasElementType && a instanceof Element) return false;\\n\\n // custom handling for React/Preact\\n for (i = length; i-- !== 0; ) {\\n if (\\n (keys[i] === '_owner' ||\\n keys[i] === '__v' ||\\n keys[i] === '__o') &&\\n a.$$typeof\\n ) {\\n // React-specific: avoid traversing React elements' _owner\\n // Preact-specific: avoid traversing Preact elements' __v and __o\\n // __v = $_original / $_vnode\\n // __o = $_owner\\n // These properties contain circular references and are not needed when\\n // comparing the actual elements (and not their owners)\\n // .$$typeof and ._store on just reasonable markers of elements\\n\\n continue;\\n }\\n\\n // all other properties should be traversed as usual\\n if (!equal(a[keys[i]], b[keys[i]])) return false;\\n }\\n // END: react-fast-compare\\n\\n // START: fast-deep-equal\\n return true;\\n }\\n\\n return a !== a && b !== b;\\n }\",\n \"function deepEqual(firstObject, secondObject) {\\n const firstKeys = Object.keys(firstObject);\\n const secondKeys = Object.keys(secondObject);\\n\\n if (firstKeys.length !== secondKeys.length) {\\n return false;\\n }\\n\\n for (const key of firstKeys) {\\n const val1 = firstObject[key];\\n const val2 = secondObject[key];\\n const areObjects = val1 != null && typeof val1 === 'object' && val2 != null && typeof val2 === 'object';\\n if (\\n areObjects && !deepEqual(val1, val2) ||\\n !areObjects && val1 !== val2\\n ) {\\n return false;\\n }\\n }\\n\\n return true;\\n}\",\n \"function objEquals(a, b)\\r\\n{\\r\\n for(x in b)\\r\\n if(typeof(a[x]) == \\\"undefined\\\")\\r\\n return false;\\r\\n\\r\\n for(x in a)\\r\\n {\\r\\n if(typeof(b[x]) == \\\"undefined\\\")\\r\\n return false;\\r\\n\\r\\n if(a[x])\\r\\n {\\r\\n if(typeof(a[x]) == \\\"object\\\")\\r\\n {\\r\\n if(typeof(b[x]) != \\\"object\\\" || !objEquals(a[x], b[x]))\\r\\n return false;\\r\\n }\\r\\n else if(a[x] !== b[x])\\r\\n return false;\\r\\n }\\r\\n else if(b[x])\\r\\n return false;\\r\\n }\\r\\n\\r\\n return true;\\r\\n}\",\n \"function shallowCompareKeys(objA, objB, keys) {\\n\\t // treat `null` and `undefined` as the same\\n\\t if (objA == null && objB == null) {\\n\\t return true;\\n\\t }\\n\\t else if (objA == null || objB == null) {\\n\\t return false;\\n\\t }\\n\\t else if (Array.isArray(objA) || Array.isArray(objB)) {\\n\\t return false;\\n\\t }\\n\\t else if (keys != null) {\\n\\t return _shallowCompareKeys(objA, objB, keys);\\n\\t }\\n\\t else {\\n\\t // shallowly compare all keys from both objects\\n\\t var keysA = Object.keys(objA);\\n\\t var keysB = Object.keys(objB);\\n\\t return (_shallowCompareKeys(objA, objB, { include: keysA }) && _shallowCompareKeys(objA, objB, { include: keysB }));\\n\\t }\\n\\t}\",\n \"function has_match(first_object, second_object) {\\n\\tfor (key in first_object) {\\n\\t\\tif (first_object.key === second_object.key) {\\n\\t\\t\\treturn true; break;\\n\\t\\t} else {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n}\",\n \"function keyValueMatch(obj1, obj2) {\\n\\tfor (var key1 in obj1) {\\n\\t\\tfor (var key2 in obj2) {\\n\\t\\t\\tif (key1 == key2) {\\n\\t\\t\\t\\tif (obj1[key1] == obj2[key2]) {\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n if (a === b) { return true }\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n var isArrayA = Array.isArray(a);\\n var isArrayB = Array.isArray(b);\\n if (isArrayA && isArrayB) {\\n return a.length === b.length && a.every(function (e, i) {\\n return looseEqual(e, b[i])\\n })\\n } else if (a instanceof Date && b instanceof Date) {\\n return a.getTime() === b.getTime()\\n } else if (!isArrayA && !isArrayB) {\\n var keysA = Object.keys(a);\\n var keysB = Object.keys(b);\\n return keysA.length === keysB.length && keysA.every(function (key) {\\n return looseEqual(a[key], b[key])\\n })\\n } else {\\n /* istanbul ignore next */\\n return false\\n }\\n } catch (e) {\\n /* istanbul ignore next */\\n return false\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65748584","0.65748584","0.6467961","0.6456548","0.6434612","0.6336349","0.62969005","0.62725157","0.6241628","0.62246656","0.6215161","0.6184088","0.6158581","0.61305773","0.6127149","0.60750496","0.60350895","0.60153687","0.60050756","0.5978841","0.5976975","0.59515935","0.59448606","0.594224","0.59408545","0.5921625","0.5921035","0.58982897","0.58496016","0.58440536","0.5828344","0.58236486","0.58236486","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5801109","0.5797479","0.5786134","0.5779134","0.57747644","0.57462513","0.5715919","0.5715919","0.5714498","0.5698031","0.569699","0.569663","0.5685177","0.56665885","0.5662264","0.56615007","0.5660503","0.5660503","0.5660503","0.5654119","0.5638655","0.56337315","0.5626382","0.5626382","0.561581","0.5615189","0.56042606","0.56034315","0.56014276","0.5595539","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113","0.5592113"],"string":"[\n \"0.65748584\",\n \"0.65748584\",\n \"0.6467961\",\n \"0.6456548\",\n \"0.6434612\",\n \"0.6336349\",\n \"0.62969005\",\n \"0.62725157\",\n \"0.6241628\",\n \"0.62246656\",\n \"0.6215161\",\n \"0.6184088\",\n \"0.6158581\",\n \"0.61305773\",\n \"0.6127149\",\n \"0.60750496\",\n \"0.60350895\",\n \"0.60153687\",\n \"0.60050756\",\n \"0.5978841\",\n \"0.5976975\",\n \"0.59515935\",\n \"0.59448606\",\n \"0.594224\",\n \"0.59408545\",\n \"0.5921625\",\n \"0.5921035\",\n \"0.58982897\",\n \"0.58496016\",\n \"0.58440536\",\n \"0.5828344\",\n \"0.58236486\",\n \"0.58236486\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5801109\",\n \"0.5797479\",\n \"0.5786134\",\n \"0.5779134\",\n \"0.57747644\",\n \"0.57462513\",\n \"0.5715919\",\n \"0.5715919\",\n \"0.5714498\",\n \"0.5698031\",\n \"0.569699\",\n \"0.569663\",\n \"0.5685177\",\n \"0.56665885\",\n \"0.5662264\",\n \"0.56615007\",\n \"0.5660503\",\n \"0.5660503\",\n \"0.5660503\",\n \"0.5654119\",\n \"0.5638655\",\n \"0.56337315\",\n \"0.5626382\",\n \"0.5626382\",\n \"0.561581\",\n \"0.5615189\",\n \"0.56042606\",\n \"0.56034315\",\n \"0.56014276\",\n \"0.5595539\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\",\n \"0.5592113\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74173,"cells":{"query":{"kind":"string","value":"Generated by PEG.js 0.9.0."},"document":{"kind":"string","value":"function peg$subclass(child, parent) {\n function ctor() { this.constructor = child; }\n ctor.prototype = parent.prototype;\n child.prototype = new ctor();\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["constructor() { super(new GeneratorParser(true)) }","function generate (p) {\n // Type\n if (typeof p === 'string' && node.type === null) {\n node.type = p.replace(/^./, ch => ch.toUpperCase())\n return\n }\n\n // Type\n if (typeof p === 'function') {\n node.type = p\n return\n }\n\n // Children\n if (isArray(p)) {\n node.children = p\n return\n }\n\n // Attr\n if (typeof p === 'object') {\n node.attr = p\n return\n }\n\n // Content\n if (typeof p === 'string') {\n node.attr.content = p\n return\n }\n }","Program(p) {\n gen(p.statements)\n }","static definition() {\n return 'A tree is a perennial plant with an elongated stem, or trunk, supporting branches and leaves.'\n }","function SSyntax() {\r\n}","function t(e){switch(e.type){case V.AssignmentExpression:case V.ArrayExpression:case V.ArrayPattern:case V.BinaryExpression:case V.CallExpression:case V.ConditionalExpression:case V.ClassExpression:case V.ExportBatchSpecifier:case V.ExportSpecifier:case V.FunctionExpression:case V.Identifier:case V.ImportSpecifier:case V.Literal:case V.LogicalExpression:case V.MemberExpression:case V.MethodDefinition:case V.NewExpression:case V.ObjectExpression:case V.ObjectPattern:case V.Property:case V.SequenceExpression:case V.ThisExpression:case V.UnaryExpression:case V.UpdateExpression:case V.YieldExpression:return!0}return!1}// Generation is done by generateStatement.","function generators() {\n\t\t\t\tBlockly.JavaScript.fw = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.rr = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.rl = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.lt = function(block) {\n\t\t\t\t\tif (checkTopLevel(block)) {\n\t\t\t\t\t\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\x27' + block.type + '\\x27));';\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn '';\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tBlockly.JavaScript.start = function(block) {\n\t\t\t\t\treturn '';\n\t\t\t\t};\n\t\t\t}","generate() {\n return {\n instructions: 'instructions here',\n question: 'question here',\n diagram: 'diagram here',\n answer: 'answer here',\n }\n }","function Rep() {\r\n}","function P(){}","function PEGtoAST(node) {\n switch (type(node)) {\n case \"null\":\n return undefined;\n case \"string\":\n return new StringNode(node);\n case \"array\":\n return new ASTNodeList(...node.map(PEGtoAST));\n case \"object\":\n switch (node.TYPE) {\n case \"whitespace\":\n return new Whitespace();\n case \"parbreak\":\n return new Parbreak();\n case \"subscript\":\n return new Subscript(PEGtoAST(node.content));\n case \"superscript\":\n return new Superscript(PEGtoAST(node.content));\n case \"inlinemath\":\n return new InlineMath(PEGtoAST(node.content));\n case \"displaymath\":\n return new DisplayMath(PEGtoAST(node.content));\n case \"mathenv\":\n return new MathEnv(node.env, PEGtoAST(node.content));\n case \"group\":\n return new Group(PEGtoAST(node.content));\n case \"macro\":\n return new Macro(node.content, PEGtoAST(node.args));\n case \"environment\":\n return new Environment(\n PEGtoAST(node.env),\n PEGtoAST(node.args),\n PEGtoAST(node.content)\n );\n case \"verbatim\":\n return new Verbatim(PEGtoAST(node.content));\n case \"verb\":\n return new Verb(node[\"escape\"], PEGtoAST(node.content));\n case \"commentenv\":\n return new CommentEnv(PEGtoAST([node.content]));\n case \"comment\":\n return new CommentNode(\n node.sameline,\n PEGtoAST(node.content)\n );\n case \"arglist\":\n return new ArgList(PEGtoAST(node.content));\n }\n }\n}","function G(){}","function symbol(s, p) {\n var x = state.syntax[s];\n if (!x || typeof x !== \"object\") {\n state.syntax[s] = x = {\n id: s,\n lbp: p,\n value: s\n };\n }\n return x;\n }","man() {\n console.log('Peano - Expression := ');\n console.log('0 | ++expr | --expr | definition');\n console.log('definition = <Nom_fonction>(<arg>i, <arg>j, ...) { }');\n console.log('\\n');\n }","constructor( type, code_or_tree, embedded=false ){\n super(type)\n if(typeof code_or_tree == \"string\" ){\n var p = new GeneratorParser(false, embedded)\n this.tree = p.get(new Source(\"generator-lexeme\",code_or_tree))\n }else this.tree = code_or_tree\n }","function u$2(u,e){t$i`\n /*\n * ${e.name}\n * ${0===e.output?\"RenderOutput: Color\":1===e.output?\"RenderOutput: Depth\":3===e.output?\"RenderOutput: Shadow\":2===e.output?\"RenderOutput: Normal\":4===e.output?\"RenderOutput: Highlight\":\"\"}\n */\n `;}","static generateCode() {\n let parserSource = parser.generate();\n return parserSource;\n }","function ecma (){}","function Generator() {} // 84","get formula() { return this.ast ? this.ast.toString(this.id) : ''; }","function genProgram (node, position) {\n return generateChildren(node.body, position);\n}","function generateCode(){\n\n}","compile() {\n return { [this.word]: this.body };\n }","function Pe(){}","function Expr() {}","function generate(node) {\n return escodegen.generate(node);\n}","getCpp(){ return this.program.generateCpp(); }","function newSyntax() {\n foo::bar();\n const { abc } = { ...oneTwoThree };\n return new.target;\n }","string_lexeme(quotation='\"') { \n var code = quotation + \n \"(-[\\\\\\\\|\"+quotation+\"]|\\\\\\\\([\\\\\\\\|n|r|t|\"+quotation+\"]|u[A-F|a-f|\\\\d][A-F|a-f|\\\\d][A-F|a-f|\\\\d][A-F|a-f|\\\\d]))*\"+quotation\n console.log(code)\n return new GeneratorLexeme(\"string\", code)\n }","constructor(body, freevars, dotpos, expected_args){\n this.body = body;\n this.freevars = freevars;\n this.dotpos = dotpos;\n this.expected_args = expected_args;\n }","vertex_glsl_code () {}","function gen(node) {\n if (node && !generator[node.type]) {\n throw new Error(`${node.type} is not supported in NFA/DFA interpreter.`);\n }\n\n return node ? generator[node.type](node) : '';\n}","function ninja() {}","Program() {\n return {\n type: 'Program',\n body: this.StatementList(),\n };\n }","function compile() {\n\n}","man() {\n console.log('Grammaire de la machine de Peano :');\n this.expression.man();\n this.definition.man();\n }","function Generator() {} // 80","function python(hljs) {\n var KEYWORDS = {\n keyword:\n 'and elif is global as in if from raise for except finally print import pass return ' +\n 'exec else break not with class assert yield try while continue del or def lambda ' +\n 'async await nonlocal|10',\n built_in:\n 'Ellipsis NotImplemented',\n literal: 'False None True'\n };\n var PROMPT = {\n className: 'meta', begin: /^(>>>|\\.\\.\\.) /\n };\n var SUBST = {\n className: 'subst',\n begin: /\\{/, end: /\\}/,\n keywords: KEYWORDS,\n illegal: /#/\n };\n var LITERAL_BRACKET = {\n begin: /\\{\\{/,\n relevance: 0\n };\n var STRING = {\n className: 'string',\n contains: [hljs.BACKSLASH_ESCAPE],\n variants: [\n {\n begin: /(u|b)?r?'''/, end: /'''/,\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT],\n relevance: 10\n },\n {\n begin: /(u|b)?r?\"\"\"/, end: /\"\"\"/,\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT],\n relevance: 10\n },\n {\n begin: /(fr|rf|f)'''/, end: /'''/,\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT, LITERAL_BRACKET, SUBST]\n },\n {\n begin: /(fr|rf|f)\"\"\"/, end: /\"\"\"/,\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT, LITERAL_BRACKET, SUBST]\n },\n {\n begin: /(u|r|ur)'/, end: /'/,\n relevance: 10\n },\n {\n begin: /(u|r|ur)\"/, end: /\"/,\n relevance: 10\n },\n {\n begin: /(b|br)'/, end: /'/\n },\n {\n begin: /(b|br)\"/, end: /\"/\n },\n {\n begin: /(fr|rf|f)'/, end: /'/,\n contains: [hljs.BACKSLASH_ESCAPE, LITERAL_BRACKET, SUBST]\n },\n {\n begin: /(fr|rf|f)\"/, end: /\"/,\n contains: [hljs.BACKSLASH_ESCAPE, LITERAL_BRACKET, SUBST]\n },\n hljs.APOS_STRING_MODE,\n hljs.QUOTE_STRING_MODE\n ]\n };\n var NUMBER = {\n className: 'number', relevance: 0,\n variants: [\n {begin: hljs.BINARY_NUMBER_RE + '[lLjJ]?'},\n {begin: '\\\\b(0o[0-7]+)[lLjJ]?'},\n {begin: hljs.C_NUMBER_RE + '[lLjJ]?'}\n ]\n };\n var PARAMS = {\n className: 'params',\n variants: [\n // Exclude params at functions without params\n {begin: /\\(\\s*\\)/, skip: true, className: null },\n {\n begin: /\\(/, end: /\\)/, excludeBegin: true, excludeEnd: true,\n contains: ['self', PROMPT, NUMBER, STRING, hljs.HASH_COMMENT_MODE],\n },\n ],\n };\n SUBST.contains = [STRING, NUMBER, PROMPT];\n return {\n name: 'Python',\n aliases: ['py', 'gyp', 'ipython'],\n keywords: KEYWORDS,\n illegal: /(<\\/|->|\\?)|=>/,\n contains: [\n PROMPT,\n NUMBER,\n // eat \"if\" prior to string so that it won't accidentally be\n // labeled as an f-string as in:\n { beginKeywords: \"if\", relevance: 0 },\n STRING,\n hljs.HASH_COMMENT_MODE,\n {\n variants: [\n {className: 'function', beginKeywords: 'def'},\n {className: 'class', beginKeywords: 'class'}\n ],\n end: /:/,\n illegal: /[${=;\\n,]/,\n contains: [\n hljs.UNDERSCORE_TITLE_MODE,\n PARAMS,\n {\n begin: /->/, endsWithParent: true,\n keywords: 'None'\n }\n ]\n },\n {\n className: 'meta',\n begin: /^[\\t ]*@/, end: /$/\n },\n {\n begin: /\\b(print|exec)\\(/ // don’t highlight keywords-turned-functions in Python 3\n }\n ]\n };\n}","define () {\n return {\n type: '@node',\n id: 'string'\n }\n }","function GenLanguageDef(){}","function scala(hljs) {\n\n var ANNOTATION = { className: 'meta', begin: '@[A-Za-z]+' };\n\n // used in strings for escaping/interpolation/substitution\n var SUBST = {\n className: 'subst',\n variants: [\n {begin: '\\\\$[A-Za-z0-9_]+'},\n {begin: '\\\\${', end: '}'}\n ]\n };\n\n var STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"', end: '\"',\n illegal: '\\\\n',\n contains: [hljs.BACKSLASH_ESCAPE]\n },\n {\n begin: '\"\"\"', end: '\"\"\"',\n relevance: 10\n },\n {\n begin: '[a-z]+\"', end: '\"',\n illegal: '\\\\n',\n contains: [hljs.BACKSLASH_ESCAPE, SUBST]\n },\n {\n className: 'string',\n begin: '[a-z]+\"\"\"', end: '\"\"\"',\n contains: [SUBST],\n relevance: 10\n }\n ]\n\n };\n\n var SYMBOL = {\n className: 'symbol',\n begin: '\\'\\\\w[\\\\w\\\\d_]*(?!\\')'\n };\n\n var TYPE = {\n className: 'type',\n begin: '\\\\b[A-Z][A-Za-z0-9_]*',\n relevance: 0\n };\n\n var NAME = {\n className: 'title',\n begin: /[^0-9\\n\\t \"'(),.`{}\\[\\]:;][^\\n\\t \"'(),.`{}\\[\\]:;]+|[^0-9\\n\\t \"'(),.`{}\\[\\]:;=]/,\n relevance: 0\n };\n\n var CLASS = {\n className: 'class',\n beginKeywords: 'class object trait type',\n end: /[:={\\[\\n;]/,\n excludeEnd: true,\n contains: [\n {\n beginKeywords: 'extends with',\n relevance: 10\n },\n {\n begin: /\\[/,\n end: /\\]/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0,\n contains: [TYPE]\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0,\n contains: [TYPE]\n },\n NAME\n ]\n };\n\n var METHOD = {\n className: 'function',\n beginKeywords: 'def',\n end: /[:={\\[(\\n;]/,\n excludeEnd: true,\n contains: [NAME]\n };\n\n return {\n name: 'Scala',\n keywords: {\n literal: 'true false null',\n keyword: 'type yield lazy override def with val var sealed abstract private trait object if forSome for while throw finally protected extends import final return else break new catch super class case package default try this match continue throws implicit'\n },\n contains: [\n hljs.C_LINE_COMMENT_MODE,\n hljs.C_BLOCK_COMMENT_MODE,\n STRING,\n SYMBOL,\n TYPE,\n METHOD,\n CLASS,\n hljs.C_NUMBER_MODE,\n ANNOTATION\n ]\n };\n}","function _t_(_p, _n, _g, _port) {\n hdl.obj(this, _p, _n);\n this._seq = {\n type: 'BlockStatement',\n body: [{\n type: 'IfStatement',\n test: {\n type: 'FunccallExpression',\n arguments: [{\n type: 'Association',\n value: {\n type: 'Identifier',\n phase: 'name',\n value: \"clk\"\n }\n }]\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'IfStatement',\n test: {\n type: 'BinaryExpression',\n operator: \"=\",\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"holdn\"\n },\n right: {\n type: 'EnumLiteral',\n value: \"'1'\"\n }\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"r\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'Identifier',\n phase: 'name',\n value: \"rin\"\n }\n }]\n }]\n }]\n },\n alternate: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"x\"\n },\n element: \"ipend\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"x\"\n },\n element: \"ipend\"\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"m\"\n },\n element: \"werr\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"m\"\n },\n element: \"werr\"\n }\n }]\n }]\n }, {\n type: 'IfStatement',\n test: {\n type: 'BinaryExpression',\n operator: \"=\",\n left: {\n type: 'BinaryExpression',\n operator: \"or\",\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"holdn\"\n },\n right: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"ico\"\n },\n element: \"mds\"\n }\n },\n right: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"d\"\n },\n element: \"inst\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"d\"\n },\n element: \"inst\"\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"d\"\n },\n element: \"mexc\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"d\"\n },\n element: \"mexc\"\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"d\"\n },\n element: \"set\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"d\"\n },\n element: \"set\"\n }\n }]\n }]\n }]\n }\n }, {\n type: 'IfStatement',\n test: {\n type: 'BinaryExpression',\n operator: \"=\",\n left: {\n type: 'BinaryExpression',\n operator: \"or\",\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"holdn\"\n },\n right: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"dco\"\n },\n element: \"mds\"\n }\n },\n right: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"x\"\n },\n element: \"data\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"x\"\n },\n element: \"data\"\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"x\"\n },\n element: \"mexc\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"x\"\n },\n element: \"mexc\"\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"x\"\n },\n element: \"set\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rin\"\n },\n element: \"x\"\n },\n element: \"set\"\n }\n }]\n }]\n }]\n }\n }]\n }\n }, {\n type: 'IfStatement',\n test: {\n type: 'BinaryExpression',\n operator: \"=\",\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"rstn\"\n },\n right: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"w\"\n },\n element: \"s\"\n },\n element: \"s\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'EnumLiteral',\n value: \"'1'\"\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"w\"\n },\n element: \"s\"\n },\n element: \"ps\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'EnumLiteral',\n value: \"'1'\"\n }\n }]\n }]\n }, {\n type: 'IfStatement',\n test: {\n type: 'BinaryExpression',\n operator: \"/=\",\n left: {\n type: 'IndexExpression',\n object: {\n type: 'Identifier',\n phase: 'const',\n value: \"need_extra_sync_reset\"\n },\n indexes: [{\n type: 'Identifier',\n phase: 'name',\n value: \"fabtech\"\n }]\n },\n right: {\n type: 'IntLiteral',\n value: \"0\"\n }\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"d\"\n },\n element: \"inst\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'Aggregate',\n entries: [{\n type: 'AggregateEntry',\n tags: [{\n type: 'Others'\n }],\n value: {\n type: 'Aggregate',\n entries: [{\n type: 'AggregateEntry',\n tags: [{\n type: 'Others'\n }],\n value: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n }]\n }\n }]\n }\n }]\n }]\n }, {\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"r\"\n },\n element: \"x\"\n },\n element: \"mexc\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n }]\n }]\n }]\n }\n }]\n }\n }]\n }\n }]\n };\n this.elaborate = function() {}\n }","generate (type) {\n return generate(type)\n }","transform(program) {\n var options = AsxFormatter.options(this.file.ast);\n //DefaultFormatter.prototype.transform.apply(this, arguments);\n\n var locals = [];\n var definitions = [];\n var body = [];\n program.body.forEach(item=>{\n switch(item.type){\n case 'ExpressionStatement':\n var exp = item.expression;\n if(exp.type=='Literal' && exp.value.toLowerCase()=='use strict'){\n return;\n }\n break;\n case 'VariableDeclaration':\n item.declarations.forEach(d=>{\n locals.push(d.id);\n });\n break;\n case 'FunctionDeclaration':\n if(item.id.name=='module'){\n item.body.body.forEach(s=>{\n body.push(s);\n })\n return;\n }else\n if(item._class){\n item.id =t.identifier('c$'+item._class);\n body.push(t.expressionStatement(t.callExpression(\n t.memberExpression(\n t.identifier('asx'),\n t.identifier('c$')\n ),[item])));\n return;\n }else{\n locals.push(item.id);\n }\n break;\n }\n body.push(item);\n });\n\n var definer = [];\n\n\n\n if(Object.keys(this.imports).length){\n\n Object.keys(this.imports).forEach(key=>{\n var items = this.imports[key];\n if(items['*'] && typeof items['*']=='string'){\n this.imports[key]=items['*'];\n }\n });\n definer.push(t.property('init',\n t.identifier('imports'),\n t.valueToNode(this.imports)\n ))\n }\n var exports;\n if(this.exports['*']){\n exports = this.exports['*'];\n delete this.exports['*'];\n }\n if(Object.keys(this.exports).length){\n definer.push(t.property('init',\n t.identifier('exports'),\n t.valueToNode(this.exports)\n ))\n }\n if(body.length){\n if(exports){\n var ret = [];\n Object.keys(exports).forEach(key=>{\n var val = exports[key];\n if(typeof val=='string') {\n ret.push(t.property('init',\n t.literal(key), t.identifier(val == '*' ? key : val)\n ))\n }else{\n ret.push(t.property('init',\n t.literal(key), val\n ))\n }\n });\n body.push(t.returnStatement(\n t.objectExpression(ret)\n ));\n }\n var initializer = t.functionExpression(null, [t.identifier('asx')], t.blockStatement(body));\n definer.push(t.property('init',\n t.identifier('execute'),\n initializer\n ))\n }\n definitions.forEach(item=>{\n\n if(item._class){\n definer.push(t.property('init',\n t.literal('.'+item._class),\n item\n ))\n }else{\n definer.push(t.property('init',\n t.literal(':'+item.id.name),\n item\n ))\n }\n\n })\n definer = t.objectExpression(definer);\n\n\n\n /*\n var definer = t.functionExpression(null, [t.identifier(\"module\")], t.blockStatement(body));\n if(options.bind){\n definer = t.callExpression(\n t.memberExpression(\n definer,\n t.identifier(\"bind\")\n ),[\n t.callExpression(t.identifier(\"eval\"),[t.literal(\"this.global=this\")])\n ]\n );\n }*/\n var body = [];\n var definer = util.template(\"asx-module\",{\n MODULE_NAME: t.literal(this.getModuleName()),\n MODULE_BODY: definer\n });\n if(options.runtime){\n var rt = util.template(\"asx-runtime\")\n //rt._compact = true;\n body.push(t.expressionStatement(rt));\n }\n body.push(t.expressionStatement(definer))\n program.body = body;\n }","function _t_(_p, _n, _g, _port) {\n hdl.obj(this, _p, _n);\n this._seq = {\n type: 'BlockStatement',\n body: [{\n type: 'IfStatement',\n test: {\n type: 'FunccallExpression',\n arguments: [{\n type: 'Association',\n value: {\n type: 'Identifier',\n phase: 'name',\n value: \"sclk\"\n }\n }]\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"rp\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'Identifier',\n phase: 'name',\n value: \"rpin\"\n }\n }]\n }]\n }, {\n type: 'IfStatement',\n test: {\n type: 'BinaryExpression',\n operator: \"=\",\n left: {\n type: 'Identifier',\n phase: 'name',\n value: \"rstn\"\n },\n right: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n },\n consequence: {\n type: 'BlockStatement',\n body: [{\n type: 'AssignmentExpressionSig',\n left: {\n type: 'MemberExpression',\n object: {\n type: 'Identifier',\n phase: 'sig',\n value: \"rp\"\n },\n element: \"error\"\n },\n right: [{\n type: 'Waveform',\n list: [{\n type: 'WaveformElem',\n value: {\n type: 'EnumLiteral',\n value: \"'0'\"\n }\n }]\n }]\n }]\n }\n }]\n }\n }]\n };\n this.elaborate = function() {}\n }","build(regexp) {\n let ast = regexp;\n\n if (regexp instanceof RegExp) {\n regexp = `${regexp}`;\n }\n\n if (typeof regexp === 'string') {\n ast = parser.parse(regexp, {\n captureLocations: true,\n });\n }\n\n return gen(desugar(ast));\n }","function generateSeq() {\r\n\r\n}","function Transform$7() {}","function PlatForm() {}","function erlang(hljs) {\n var BASIC_ATOM_RE = '[a-z\\'][a-zA-Z0-9_\\']*';\n var FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\n var ERLANG_RESERVED = {\n keyword:\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\n 'let not of orelse|10 query receive rem try when xor',\n literal:\n 'false true'\n };\n\n var COMMENT = hljs.COMMENT('%', '$');\n var NUMBER = {\n className: 'number',\n begin: '\\\\b(\\\\d+(_\\\\d+)*#[a-fA-F0-9]+(_[a-fA-F0-9]+)*|\\\\d+(_\\\\d+)*(\\\\.\\\\d+(_\\\\d+)*)?([eE][-+]?\\\\d+)?)',\n relevance: 0\n };\n var NAMED_FUN = {\n begin: 'fun\\\\s+' + BASIC_ATOM_RE + '/\\\\d+'\n };\n var FUNCTION_CALL = {\n begin: FUNCTION_NAME_RE + '\\\\(', end: '\\\\)',\n returnBegin: true,\n relevance: 0,\n contains: [\n {\n begin: FUNCTION_NAME_RE, relevance: 0\n },\n {\n begin: '\\\\(', end: '\\\\)', endsWithParent: true,\n returnEnd: true,\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n var TUPLE = {\n begin: '{', end: '}',\n relevance: 0\n // \"contains\" defined later\n };\n var VAR1 = {\n begin: '\\\\b_([A-Z][A-Za-z0-9_]*)?',\n relevance: 0\n };\n var VAR2 = {\n begin: '[A-Z][a-zA-Z0-9_]*',\n relevance: 0\n };\n var RECORD_ACCESS = {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0,\n returnBegin: true,\n contains: [\n {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0\n },\n {\n begin: '{', end: '}',\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n\n var BLOCK_STATEMENTS = {\n beginKeywords: 'fun receive if try case', end: 'end',\n keywords: ERLANG_RESERVED\n };\n BLOCK_STATEMENTS.contains = [\n COMMENT,\n NAMED_FUN,\n hljs.inherit(hljs.APOS_STRING_MODE, {className: ''}),\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1, VAR2,\n RECORD_ACCESS\n ];\n\n var BASIC_MODES = [\n COMMENT,\n NAMED_FUN,\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1, VAR2,\n RECORD_ACCESS\n ];\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\n TUPLE.contains = BASIC_MODES;\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\n\n var PARAMS = {\n className: 'params',\n begin: '\\\\(', end: '\\\\)',\n contains: BASIC_MODES\n };\n return {\n name: 'Erlang',\n aliases: ['erl'],\n keywords: ERLANG_RESERVED,\n illegal: '(</|\\\\*=|\\\\+=|-=|/\\\\*|\\\\*/|\\\\(\\\\*|\\\\*\\\\))',\n contains: [\n {\n className: 'function',\n begin: '^' + BASIC_ATOM_RE + '\\\\s*\\\\(', end: '->',\n returnBegin: true,\n illegal: '\\\\(|#|//|/\\\\*|\\\\\\\\|:|;',\n contains: [\n PARAMS,\n hljs.inherit(hljs.TITLE_MODE, {begin: BASIC_ATOM_RE})\n ],\n starts: {\n end: ';|\\\\.',\n keywords: ERLANG_RESERVED,\n contains: BASIC_MODES\n }\n },\n COMMENT,\n {\n begin: '^-', end: '\\\\.',\n relevance: 0,\n excludeEnd: true,\n returnBegin: true,\n keywords: {\n $pattern: '-' + hljs.IDENT_RE,\n keyword: '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\n '-behavior -spec'\n },\n contains: [PARAMS]\n },\n NUMBER,\n hljs.QUOTE_STRING_MODE,\n RECORD_ACCESS,\n VAR1, VAR2,\n TUPLE,\n {begin: /\\.$/} // relevance booster\n ]\n };\n}","private public function m246() {}","function symbol(s, p) {\n var x = syntax[s];\n if (!x || typeof x !== 'object') {\n syntax[s] = x = {\n id: s,\n lbp: p,\n value: s\n };\n }\n return x;\n }","function scala(hljs) {\n\n var ANNOTATION = { className: 'meta', begin: '@[A-Za-z]+' };\n\n // used in strings for escaping/interpolation/substitution\n var SUBST = {\n className: 'subst',\n variants: [\n {begin: '\\\\$[A-Za-z0-9_]+'},\n {begin: '\\\\${', end: '}'}\n ]\n };\n\n var STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"', end: '\"',\n illegal: '\\\\n',\n contains: [hljs.BACKSLASH_ESCAPE]\n },\n {\n begin: '\"\"\"', end: '\"\"\"',\n relevance: 10\n },\n {\n begin: '[a-z]+\"', end: '\"',\n illegal: '\\\\n',\n contains: [hljs.BACKSLASH_ESCAPE, SUBST]\n },\n {\n className: 'string',\n begin: '[a-z]+\"\"\"', end: '\"\"\"',\n contains: [SUBST],\n relevance: 10\n }\n ]\n\n };\n\n var SYMBOL = {\n className: 'symbol',\n begin: '\\'\\\\w[\\\\w\\\\d_]*(?!\\')'\n };\n\n var TYPE = {\n className: 'type',\n begin: '\\\\b[A-Z][A-Za-z0-9_]*',\n relevance: 0\n };\n\n var NAME = {\n className: 'title',\n begin: /[^0-9\\n\\t \"'(),.`{}\\[\\]:;][^\\n\\t \"'(),.`{}\\[\\]:;]+|[^0-9\\n\\t \"'(),.`{}\\[\\]:;=]/,\n relevance: 0\n };\n\n var CLASS = {\n className: 'class',\n beginKeywords: 'class object trait type',\n end: /[:={\\[\\n;]/,\n excludeEnd: true,\n contains: [\n hljs.C_LINE_COMMENT_MODE,\n hljs.C_BLOCK_COMMENT_MODE,\n {\n beginKeywords: 'extends with',\n relevance: 10\n },\n {\n begin: /\\[/,\n end: /\\]/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0,\n contains: [TYPE]\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0,\n contains: [TYPE]\n },\n NAME\n ]\n };\n\n var METHOD = {\n className: 'function',\n beginKeywords: 'def',\n end: /[:={\\[(\\n;]/,\n excludeEnd: true,\n contains: [NAME]\n };\n\n return {\n name: 'Scala',\n keywords: {\n literal: 'true false null',\n keyword: 'type yield lazy override def with val var sealed abstract private trait object if forSome for while throw finally protected extends import final return else break new catch super class case package default try this match continue throws implicit'\n },\n contains: [\n hljs.C_LINE_COMMENT_MODE,\n hljs.C_BLOCK_COMMENT_MODE,\n STRING,\n SYMBOL,\n TYPE,\n METHOD,\n CLASS,\n hljs.C_NUMBER_MODE,\n ANNOTATION\n ]\n };\n}","getAst() {\n\n return {\n type: 'string',\n val: this.value\n };\n }","constructor() { super(GeneratorConstants.SPACE) }","function Stack_Oliteral() {\r\n}","function initGenerate(TheBigAST) {\n var globalItems = TheBigAST[0];\n var functionBox = TheBigAST[1];\n allFuncs = findAllFuncs(functionBox[0].body);\n //strLiteralSection = generateStrLiteralSection();\n var funcsAsm = findFunctionNames(functionBox[0].body);\n var headers = includeHeaders(globalItems);\n var dataSection = generateDataSection(globalItems);\n var textHeader = generateTextHeader(TheBigAST[1]);\n var compiled = textHeader + funcsAsm + dataSection;\n console.log(compiled);\n return 0;\n}","function erlang(hljs) {\n var BASIC_ATOM_RE = '[a-z\\'][a-zA-Z0-9_\\']*';\n var FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\n var ERLANG_RESERVED = {\n keyword:\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\n 'let not of orelse|10 query receive rem try when xor',\n literal:\n 'false true'\n };\n\n var COMMENT = hljs.COMMENT('%', '$');\n var NUMBER = {\n className: 'number',\n begin: '\\\\b(\\\\d+#[a-fA-F0-9]+|\\\\d+(\\\\.\\\\d+)?([eE][-+]?\\\\d+)?)',\n relevance: 0\n };\n var NAMED_FUN = {\n begin: 'fun\\\\s+' + BASIC_ATOM_RE + '/\\\\d+'\n };\n var FUNCTION_CALL = {\n begin: FUNCTION_NAME_RE + '\\\\(', end: '\\\\)',\n returnBegin: true,\n relevance: 0,\n contains: [\n {\n begin: FUNCTION_NAME_RE, relevance: 0\n },\n {\n begin: '\\\\(', end: '\\\\)', endsWithParent: true,\n returnEnd: true,\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n var TUPLE = {\n begin: '{', end: '}',\n relevance: 0\n // \"contains\" defined later\n };\n var VAR1 = {\n begin: '\\\\b_([A-Z][A-Za-z0-9_]*)?',\n relevance: 0\n };\n var VAR2 = {\n begin: '[A-Z][a-zA-Z0-9_]*',\n relevance: 0\n };\n var RECORD_ACCESS = {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0,\n returnBegin: true,\n contains: [\n {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0\n },\n {\n begin: '{', end: '}',\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n\n var BLOCK_STATEMENTS = {\n beginKeywords: 'fun receive if try case', end: 'end',\n keywords: ERLANG_RESERVED\n };\n BLOCK_STATEMENTS.contains = [\n COMMENT,\n NAMED_FUN,\n hljs.inherit(hljs.APOS_STRING_MODE, {className: ''}),\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1, VAR2,\n RECORD_ACCESS\n ];\n\n var BASIC_MODES = [\n COMMENT,\n NAMED_FUN,\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1, VAR2,\n RECORD_ACCESS\n ];\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\n TUPLE.contains = BASIC_MODES;\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\n\n var PARAMS = {\n className: 'params',\n begin: '\\\\(', end: '\\\\)',\n contains: BASIC_MODES\n };\n return {\n name: 'Erlang',\n aliases: ['erl'],\n keywords: ERLANG_RESERVED,\n illegal: '(</|\\\\*=|\\\\+=|-=|/\\\\*|\\\\*/|\\\\(\\\\*|\\\\*\\\\))',\n contains: [\n {\n className: 'function',\n begin: '^' + BASIC_ATOM_RE + '\\\\s*\\\\(', end: '->',\n returnBegin: true,\n illegal: '\\\\(|#|//|/\\\\*|\\\\\\\\|:|;',\n contains: [\n PARAMS,\n hljs.inherit(hljs.TITLE_MODE, {begin: BASIC_ATOM_RE})\n ],\n starts: {\n end: ';|\\\\.',\n keywords: ERLANG_RESERVED,\n contains: BASIC_MODES\n }\n },\n COMMENT,\n {\n begin: '^-', end: '\\\\.',\n relevance: 0,\n excludeEnd: true,\n returnBegin: true,\n lexemes: '-' + hljs.IDENT_RE,\n keywords:\n '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\n '-behavior -spec',\n contains: [PARAMS]\n },\n NUMBER,\n hljs.QUOTE_STRING_MODE,\n RECORD_ACCESS,\n VAR1, VAR2,\n TUPLE,\n {begin: /\\.$/} // relevance booster\n ]\n };\n}","build () {}","pillage() {\n return `p ${this.id}`;\n }","function Parser() {\n\n}","function Literal( arg ) {\r\n}","function $436c309948703748$var$scala(hljs) {\n const ANNOTATION = {\n className: \"meta\",\n begin: \"@[A-Za-z]+\"\n };\n // used in strings for escaping/interpolation/substitution\n const SUBST = {\n className: \"subst\",\n variants: [\n {\n begin: \"\\\\$[A-Za-z0-9_]+\"\n },\n {\n begin: /\\$\\{/,\n end: /\\}/\n }\n ]\n };\n const STRING = {\n className: \"string\",\n variants: [\n {\n begin: '\"',\n end: '\"',\n illegal: \"\\\\n\",\n contains: [\n hljs.BACKSLASH_ESCAPE\n ]\n },\n {\n begin: '\"\"\"',\n end: '\"\"\"',\n relevance: 10\n },\n {\n begin: '[a-z]+\"',\n end: '\"',\n illegal: \"\\\\n\",\n contains: [\n hljs.BACKSLASH_ESCAPE,\n SUBST\n ]\n },\n {\n className: \"string\",\n begin: '[a-z]+\"\"\"',\n end: '\"\"\"',\n contains: [\n SUBST\n ],\n relevance: 10\n }\n ]\n };\n const SYMBOL = {\n className: \"symbol\",\n begin: \"'\\\\w[\\\\w\\\\d_]*(?!')\"\n };\n const TYPE = {\n className: \"type\",\n begin: \"\\\\b[A-Z][A-Za-z0-9_]*\",\n relevance: 0\n };\n const NAME = {\n className: \"title\",\n begin: /[^0-9\\n\\t \"'(),.`{}\\[\\]:;][^\\n\\t \"'(),.`{}\\[\\]:;]+|[^0-9\\n\\t \"'(),.`{}\\[\\]:;=]/,\n relevance: 0\n };\n const CLASS = {\n className: \"class\",\n beginKeywords: \"class object trait type\",\n end: /[:={\\[\\n;]/,\n excludeEnd: true,\n contains: [\n hljs.C_LINE_COMMENT_MODE,\n hljs.C_BLOCK_COMMENT_MODE,\n {\n beginKeywords: \"extends with\",\n relevance: 10\n },\n {\n begin: /\\[/,\n end: /\\]/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0,\n contains: [\n TYPE\n ]\n },\n {\n className: \"params\",\n begin: /\\(/,\n end: /\\)/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0,\n contains: [\n TYPE\n ]\n },\n NAME\n ]\n };\n const METHOD = {\n className: \"function\",\n beginKeywords: \"def\",\n end: /[:={\\[(\\n;]/,\n excludeEnd: true,\n contains: [\n NAME\n ]\n };\n return {\n name: \"Scala\",\n keywords: {\n literal: \"true false null\",\n keyword: \"type yield lazy override def with val var sealed abstract private trait object if forSome for while throw finally protected extends import final return else break new catch super class case package default try this match continue throws implicit\"\n },\n contains: [\n hljs.C_LINE_COMMENT_MODE,\n hljs.C_BLOCK_COMMENT_MODE,\n STRING,\n SYMBOL,\n TYPE,\n METHOD,\n CLASS,\n hljs.C_NUMBER_MODE,\n ANNOTATION\n ]\n };\n}","function $366c34664626fae6$var$gcode(hljs) {\n const GCODE_IDENT_RE = \"[A-Z_][A-Z0-9_.]*\";\n const GCODE_CLOSE_RE = \"%\";\n const GCODE_KEYWORDS = {\n $pattern: GCODE_IDENT_RE,\n keyword: \"IF DO WHILE ENDWHILE CALL ENDIF SUB ENDSUB GOTO REPEAT ENDREPEAT EQ LT GT NE GE LE OR XOR\"\n };\n const GCODE_START = {\n className: \"meta\",\n begin: \"([O])([0-9]+)\"\n };\n const NUMBER = hljs.inherit(hljs.C_NUMBER_MODE, {\n begin: \"([-+]?((\\\\.\\\\d+)|(\\\\d+)(\\\\.\\\\d*)?))|\" + hljs.C_NUMBER_RE\n });\n const GCODE_CODE = [\n hljs.C_LINE_COMMENT_MODE,\n hljs.C_BLOCK_COMMENT_MODE,\n hljs.COMMENT(/\\(/, /\\)/),\n NUMBER,\n hljs.inherit(hljs.APOS_STRING_MODE, {\n illegal: null\n }),\n hljs.inherit(hljs.QUOTE_STRING_MODE, {\n illegal: null\n }),\n {\n className: \"name\",\n begin: \"([G])([0-9]+\\\\.?[0-9]?)\"\n },\n {\n className: \"name\",\n begin: \"([M])([0-9]+\\\\.?[0-9]?)\"\n },\n {\n className: \"attr\",\n begin: \"(VC|VS|#)\",\n end: \"(\\\\d+)\"\n },\n {\n className: \"attr\",\n begin: \"(VZOFX|VZOFY|VZOFZ)\"\n },\n {\n className: \"built_in\",\n begin: \"(ATAN|ABS|ACOS|ASIN|SIN|COS|EXP|FIX|FUP|ROUND|LN|TAN)(\\\\[)\",\n contains: [\n NUMBER\n ],\n end: \"\\\\]\"\n },\n {\n className: \"symbol\",\n variants: [\n {\n begin: \"N\",\n end: \"\\\\d+\",\n illegal: \"\\\\W\"\n }\n ]\n }\n ];\n return {\n name: \"G-code (ISO 6983)\",\n aliases: [\n \"nc\"\n ],\n // Some implementations (CNC controls) of G-code are interoperable with uppercase and lowercase letters seamlessly.\n // However, most prefer all uppercase and uppercase is customary.\n case_insensitive: true,\n keywords: GCODE_KEYWORDS,\n contains: [\n {\n className: \"meta\",\n begin: GCODE_CLOSE_RE\n },\n GCODE_START\n ].concat(GCODE_CODE)\n };\n}","function TinyLisp(){ \n}","function _G() {}","function _G() {}","function generateJS(ast, options) {\n /* These only indent non-empty lines to avoid trailing whitespace. */\n function indent2(code) {\n return code.replace(/^(.+)$/gm, ' $1');\n }\n\n function indent6(code) {\n return code.replace(/^(.+)$/gm, ' $1');\n }\n\n function indent10(code) {\n return code.replace(/^(.+)$/gm, ' $1');\n }\n\n function generateTables() {\n if (options.optimize === \"size\") {\n return ['peg$consts = [', indent2(ast.consts.join(',\\n')), '],', '', 'peg$bytecode = [', indent2(arrays.map(ast.rules, function (rule) {\n return 'peg$decode(\"' + js.stringEscape(arrays.map(rule.bytecode, function (b) {\n return String.fromCharCode(b + 32);\n }).join('')) + '\")';\n }).join(',\\n')), '],'].join('\\n');\n } else {\n return arrays.map(ast.consts, function (c, i) {\n return 'peg$c' + i + ' = ' + c + ',';\n }).join('\\n');\n }\n }\n\n function generateRuleHeader(ruleNameCode, ruleIndexCode) {\n var parts = [];\n parts.push('');\n\n if (options.trace) {\n parts.push(['peg$tracer.trace({', ' type: \"rule.enter\",', ' rule: ' + ruleNameCode + ',', ' location: peg$computeLocation(startPos, startPos)', '});', ''].join('\\n'));\n }\n\n if (options.cache) {\n parts.push(['var key = peg$currPos * ' + ast.rules.length + ' + ' + ruleIndexCode + ',', ' cached = peg$resultsCache[key];', '', 'if (cached) {', ' peg$currPos = cached.nextPos;', ''].join('\\n'));\n\n if (options.trace) {\n parts.push(['if (cached.result !== peg$FAILED) {', ' peg$tracer.trace({', ' type: \"rule.match\",', ' rule: ' + ruleNameCode + ',', ' result: cached.result,', ' location: peg$computeLocation(startPos, peg$currPos)', ' });', '} else {', ' peg$tracer.trace({', ' type: \"rule.fail\",', ' rule: ' + ruleNameCode + ',', ' location: peg$computeLocation(startPos, startPos)', ' });', '}', ''].join('\\n'));\n }\n\n parts.push([' return cached.result;', '}', ''].join('\\n'));\n }\n\n return parts.join('\\n');\n }\n\n function generateRuleFooter(ruleNameCode, resultCode) {\n var parts = [];\n\n if (options.cache) {\n parts.push(['', 'peg$resultsCache[key] = { nextPos: peg$currPos, result: ' + resultCode + ' };'].join('\\n'));\n }\n\n if (options.trace) {\n parts.push(['', 'if (' + resultCode + ' !== peg$FAILED) {', ' peg$tracer.trace({', ' type: \"rule.match\",', ' rule: ' + ruleNameCode + ',', ' result: ' + resultCode + ',', ' location: peg$computeLocation(startPos, peg$currPos)', ' });', '} else {', ' peg$tracer.trace({', ' type: \"rule.fail\",', ' rule: ' + ruleNameCode + ',', ' location: peg$computeLocation(startPos, startPos)', ' });', '}'].join('\\n'));\n }\n\n parts.push(['', 'return ' + resultCode + ';'].join('\\n'));\n return parts.join('\\n');\n }\n\n function generateInterpreter() {\n var parts = [];\n\n function generateCondition(cond, argsLength) {\n var baseLength = argsLength + 3,\n thenLengthCode = 'bc[ip + ' + (baseLength - 2) + ']',\n elseLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n return ['ends.push(end);', 'ips.push(ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ');', '', 'if (' + cond + ') {', ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ';', ' ip += ' + baseLength + ';', '} else {', ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ';', ' ip += ' + baseLength + ' + ' + thenLengthCode + ';', '}', '', 'break;'].join('\\n');\n }\n\n function generateLoop(cond) {\n var baseLength = 2,\n bodyLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n return ['if (' + cond + ') {', ' ends.push(end);', ' ips.push(ip);', '', ' end = ip + ' + baseLength + ' + ' + bodyLengthCode + ';', ' ip += ' + baseLength + ';', '} else {', ' ip += ' + baseLength + ' + ' + bodyLengthCode + ';', '}', '', 'break;'].join('\\n');\n }\n\n function generateCall() {\n var baseLength = 4,\n paramsLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n return ['params = bc.slice(ip + ' + baseLength + ', ip + ' + baseLength + ' + ' + paramsLengthCode + ');', 'for (i = 0; i < ' + paramsLengthCode + '; i++) {', ' params[i] = stack[stack.length - 1 - params[i]];', '}', '', 'stack.splice(', ' stack.length - bc[ip + 2],', ' bc[ip + 2],', ' peg$consts[bc[ip + 1]].apply(null, params)', ');', '', 'ip += ' + baseLength + ' + ' + paramsLengthCode + ';', 'break;'].join('\\n');\n }\n\n parts.push(['function peg$decode(s) {', ' var bc = new Array(s.length), i;', '', ' for (i = 0; i < s.length; i++) {', ' bc[i] = s.charCodeAt(i) - 32;', ' }', '', ' return bc;', '}', '', 'function peg$parseRule(index) {'].join('\\n'));\n\n if (options.trace) {\n parts.push([' var bc = peg$bytecode[index],', ' ip = 0,', ' ips = [],', ' end = bc.length,', ' ends = [],', ' stack = [],', ' startPos = peg$currPos,', ' params, i;'].join('\\n'));\n } else {\n parts.push([' var bc = peg$bytecode[index],', ' ip = 0,', ' ips = [],', ' end = bc.length,', ' ends = [],', ' stack = [],', ' params, i;'].join('\\n'));\n }\n\n parts.push(indent2(generateRuleHeader('peg$ruleNames[index]', 'index')));\n parts.push([\n /*\n * The point of the outer loop and the |ips| & |ends| stacks is to avoid\n * recursive calls for interpreting parts of bytecode. In other words, we\n * implement the |interpret| operation of the abstract machine without\n * function calls. Such calls would likely slow the parser down and more\n * importantly cause stack overflows for complex grammars.\n */\n ' while (true) {', ' while (ip < end) {', ' switch (bc[ip]) {', ' case ' + op.PUSH + ':', // PUSH c\n ' stack.push(peg$consts[bc[ip + 1]]);', ' ip += 2;', ' break;', '', ' case ' + op.PUSH_UNDEFINED + ':', // PUSH_UNDEFINED\n ' stack.push(void 0);', ' ip++;', ' break;', '', ' case ' + op.PUSH_NULL + ':', // PUSH_NULL\n ' stack.push(null);', ' ip++;', ' break;', '', ' case ' + op.PUSH_FAILED + ':', // PUSH_FAILED\n ' stack.push(peg$FAILED);', ' ip++;', ' break;', '', ' case ' + op.PUSH_EMPTY_ARRAY + ':', // PUSH_EMPTY_ARRAY\n ' stack.push([]);', ' ip++;', ' break;', '', ' case ' + op.PUSH_CURR_POS + ':', // PUSH_CURR_POS\n ' stack.push(peg$currPos);', ' ip++;', ' break;', '', ' case ' + op.POP + ':', // POP\n ' stack.pop();', ' ip++;', ' break;', '', ' case ' + op.POP_CURR_POS + ':', // POP_CURR_POS\n ' peg$currPos = stack.pop();', ' ip++;', ' break;', '', ' case ' + op.POP_N + ':', // POP_N n\n ' stack.length -= bc[ip + 1];', ' ip += 2;', ' break;', '', ' case ' + op.NIP + ':', // NIP\n ' stack.splice(-2, 1);', ' ip++;', ' break;', '', ' case ' + op.APPEND + ':', // APPEND\n ' stack[stack.length - 2].push(stack.pop());', ' ip++;', ' break;', '', ' case ' + op.WRAP + ':', // WRAP n\n ' stack.push(stack.splice(stack.length - bc[ip + 1], bc[ip + 1]));', ' ip += 2;', ' break;', '', ' case ' + op.TEXT + ':', // TEXT\n ' stack.push(input.substring(stack.pop(), peg$currPos));', ' ip++;', ' break;', '', ' case ' + op.IF + ':', // IF t, f\n indent10(generateCondition('stack[stack.length - 1]', 0)), '', ' case ' + op.IF_ERROR + ':', // IF_ERROR t, f\n indent10(generateCondition('stack[stack.length - 1] === peg$FAILED', 0)), '', ' case ' + op.IF_NOT_ERROR + ':', // IF_NOT_ERROR t, f\n indent10(generateCondition('stack[stack.length - 1] !== peg$FAILED', 0)), '', ' case ' + op.WHILE_NOT_ERROR + ':', // WHILE_NOT_ERROR b\n indent10(generateLoop('stack[stack.length - 1] !== peg$FAILED')), '', ' case ' + op.MATCH_ANY + ':', // MATCH_ANY a, f, ...\n indent10(generateCondition('input.length > peg$currPos', 0)), '', ' case ' + op.MATCH_STRING + ':', // MATCH_STRING s, a, f, ...\n indent10(generateCondition('input.substr(peg$currPos, peg$consts[bc[ip + 1]].length) === peg$consts[bc[ip + 1]]', 1)), '', ' case ' + op.MATCH_STRING_IC + ':', // MATCH_STRING_IC s, a, f, ...\n indent10(generateCondition('input.substr(peg$currPos, peg$consts[bc[ip + 1]].length).toLowerCase() === peg$consts[bc[ip + 1]]', 1)), '', ' case ' + op.MATCH_REGEXP + ':', // MATCH_REGEXP r, a, f, ...\n indent10(generateCondition('peg$consts[bc[ip + 1]].test(input.charAt(peg$currPos))', 1)), '', ' case ' + op.ACCEPT_N + ':', // ACCEPT_N n\n ' stack.push(input.substr(peg$currPos, bc[ip + 1]));', ' peg$currPos += bc[ip + 1];', ' ip += 2;', ' break;', '', ' case ' + op.ACCEPT_STRING + ':', // ACCEPT_STRING s\n ' stack.push(peg$consts[bc[ip + 1]]);', ' peg$currPos += peg$consts[bc[ip + 1]].length;', ' ip += 2;', ' break;', '', ' case ' + op.FAIL + ':', // FAIL e\n ' stack.push(peg$FAILED);', ' if (peg$silentFails === 0) {', ' peg$fail(peg$consts[bc[ip + 1]]);', ' }', ' ip += 2;', ' break;', '', ' case ' + op.LOAD_SAVED_POS + ':', // LOAD_SAVED_POS p\n ' peg$savedPos = stack[stack.length - 1 - bc[ip + 1]];', ' ip += 2;', ' break;', '', ' case ' + op.UPDATE_SAVED_POS + ':', // UPDATE_SAVED_POS\n ' peg$savedPos = peg$currPos;', ' ip++;', ' break;', '', ' case ' + op.CALL + ':', // CALL f, n, pc, p1, p2, ..., pN\n indent10(generateCall()), '', ' case ' + op.RULE + ':', // RULE r\n ' stack.push(peg$parseRule(bc[ip + 1]));', ' ip += 2;', ' break;', '', ' case ' + op.SILENT_FAILS_ON + ':', // SILENT_FAILS_ON\n ' peg$silentFails++;', ' ip++;', ' break;', '', ' case ' + op.SILENT_FAILS_OFF + ':', // SILENT_FAILS_OFF\n ' peg$silentFails--;', ' ip++;', ' break;', '', ' default:', ' throw new Error(\"Invalid opcode: \" + bc[ip] + \".\");', ' }', ' }', '', ' if (ends.length > 0) {', ' end = ends.pop();', ' ip = ips.pop();', ' } else {', ' break;', ' }', ' }'].join('\\n'));\n parts.push(indent2(generateRuleFooter('peg$ruleNames[index]', 'stack[0]')));\n parts.push('}');\n return parts.join('\\n');\n }\n\n function generateRuleFunction(rule) {\n var parts = [],\n code;\n\n function c(i) {\n return \"peg$c\" + i;\n } // |consts[i]| of the abstract machine\n\n\n function s(i) {\n return \"s\" + i;\n } // |stack[i]| of the abstract machine\n\n\n var stack = {\n sp: -1,\n maxSp: -1,\n push: function (exprCode) {\n var code = s(++this.sp) + ' = ' + exprCode + ';';\n\n if (this.sp > this.maxSp) {\n this.maxSp = this.sp;\n }\n\n return code;\n },\n pop: function (n) {\n var values;\n\n if (n === void 0) {\n return s(this.sp--);\n } else {\n values = arrays.map(arrays.range(this.sp - n + 1, this.sp + 1), s);\n this.sp -= n;\n return values;\n }\n },\n top: function () {\n return s(this.sp);\n },\n index: function (i) {\n return s(this.sp - i);\n }\n };\n\n function compile(bc) {\n var ip = 0,\n end = bc.length,\n parts = [],\n value;\n\n function compileCondition(cond, argCount) {\n var baseLength = argCount + 3,\n thenLength = bc[ip + baseLength - 2],\n elseLength = bc[ip + baseLength - 1],\n baseSp = stack.sp,\n thenCode,\n elseCode,\n thenSp,\n elseSp;\n ip += baseLength;\n thenCode = compile(bc.slice(ip, ip + thenLength));\n thenSp = stack.sp;\n ip += thenLength;\n\n if (elseLength > 0) {\n stack.sp = baseSp;\n elseCode = compile(bc.slice(ip, ip + elseLength));\n elseSp = stack.sp;\n ip += elseLength;\n\n if (thenSp !== elseSp) {\n throw new Error(\"Branches of a condition must move the stack pointer in the same way.\");\n }\n }\n\n parts.push('if (' + cond + ') {');\n parts.push(indent2(thenCode));\n\n if (elseLength > 0) {\n parts.push('} else {');\n parts.push(indent2(elseCode));\n }\n\n parts.push('}');\n }\n\n function compileLoop(cond) {\n var baseLength = 2,\n bodyLength = bc[ip + baseLength - 1],\n baseSp = stack.sp,\n bodyCode,\n bodySp;\n ip += baseLength;\n bodyCode = compile(bc.slice(ip, ip + bodyLength));\n bodySp = stack.sp;\n ip += bodyLength;\n\n if (bodySp !== baseSp) {\n throw new Error(\"Body of a loop can't move the stack pointer.\");\n }\n\n parts.push('while (' + cond + ') {');\n parts.push(indent2(bodyCode));\n parts.push('}');\n }\n\n function compileCall() {\n var baseLength = 4,\n paramsLength = bc[ip + baseLength - 1];\n var value = c(bc[ip + 1]) + '(' + arrays.map(bc.slice(ip + baseLength, ip + baseLength + paramsLength), function (p) {\n return stack.index(p);\n }).join(', ') + ')';\n stack.pop(bc[ip + 2]);\n parts.push(stack.push(value));\n ip += baseLength + paramsLength;\n }\n\n while (ip < end) {\n switch (bc[ip]) {\n case op.PUSH:\n // PUSH c\n parts.push(stack.push(c(bc[ip + 1])));\n ip += 2;\n break;\n\n case op.PUSH_CURR_POS:\n // PUSH_CURR_POS\n parts.push(stack.push('peg$currPos'));\n ip++;\n break;\n\n case op.PUSH_UNDEFINED:\n // PUSH_UNDEFINED\n parts.push(stack.push('void 0'));\n ip++;\n break;\n\n case op.PUSH_NULL:\n // PUSH_NULL\n parts.push(stack.push('null'));\n ip++;\n break;\n\n case op.PUSH_FAILED:\n // PUSH_FAILED\n parts.push(stack.push('peg$FAILED'));\n ip++;\n break;\n\n case op.PUSH_EMPTY_ARRAY:\n // PUSH_EMPTY_ARRAY\n parts.push(stack.push('[]'));\n ip++;\n break;\n\n case op.POP:\n // POP\n stack.pop();\n ip++;\n break;\n\n case op.POP_CURR_POS:\n // POP_CURR_POS\n parts.push('peg$currPos = ' + stack.pop() + ';');\n ip++;\n break;\n\n case op.POP_N:\n // POP_N n\n stack.pop(bc[ip + 1]);\n ip += 2;\n break;\n\n case op.NIP:\n // NIP\n value = stack.pop();\n stack.pop();\n parts.push(stack.push(value));\n ip++;\n break;\n\n case op.APPEND:\n // APPEND\n value = stack.pop();\n parts.push(stack.top() + '.push(' + value + ');');\n ip++;\n break;\n\n case op.WRAP:\n // WRAP n\n parts.push(stack.push('[' + stack.pop(bc[ip + 1]).join(', ') + ']'));\n ip += 2;\n break;\n\n case op.TEXT:\n // TEXT\n parts.push(stack.push('input.substring(' + stack.pop() + ', peg$currPos)'));\n ip++;\n break;\n\n case op.IF:\n // IF t, f\n compileCondition(stack.top(), 0);\n break;\n\n case op.IF_ERROR:\n // IF_ERROR t, f\n compileCondition(stack.top() + ' === peg$FAILED', 0);\n break;\n\n case op.IF_NOT_ERROR:\n // IF_NOT_ERROR t, f\n compileCondition(stack.top() + ' !== peg$FAILED', 0);\n break;\n\n case op.WHILE_NOT_ERROR:\n // WHILE_NOT_ERROR b\n compileLoop(stack.top() + ' !== peg$FAILED', 0);\n break;\n\n case op.MATCH_ANY:\n // MATCH_ANY a, f, ...\n compileCondition('input.length > peg$currPos', 0);\n break;\n\n case op.MATCH_STRING:\n // MATCH_STRING s, a, f, ...\n compileCondition(eval(ast.consts[bc[ip + 1]]).length > 1 ? 'input.substr(peg$currPos, ' + eval(ast.consts[bc[ip + 1]]).length + ') === ' + c(bc[ip + 1]) : 'input.charCodeAt(peg$currPos) === ' + eval(ast.consts[bc[ip + 1]]).charCodeAt(0), 1);\n break;\n\n case op.MATCH_STRING_IC:\n // MATCH_STRING_IC s, a, f, ...\n compileCondition('input.substr(peg$currPos, ' + eval(ast.consts[bc[ip + 1]]).length + ').toLowerCase() === ' + c(bc[ip + 1]), 1);\n break;\n\n case op.MATCH_REGEXP:\n // MATCH_REGEXP r, a, f, ...\n compileCondition(c(bc[ip + 1]) + '.test(input.charAt(peg$currPos))', 1);\n break;\n\n case op.ACCEPT_N:\n // ACCEPT_N n\n parts.push(stack.push(bc[ip + 1] > 1 ? 'input.substr(peg$currPos, ' + bc[ip + 1] + ')' : 'input.charAt(peg$currPos)'));\n parts.push(bc[ip + 1] > 1 ? 'peg$currPos += ' + bc[ip + 1] + ';' : 'peg$currPos++;');\n ip += 2;\n break;\n\n case op.ACCEPT_STRING:\n // ACCEPT_STRING s\n parts.push(stack.push(c(bc[ip + 1])));\n parts.push(eval(ast.consts[bc[ip + 1]]).length > 1 ? 'peg$currPos += ' + eval(ast.consts[bc[ip + 1]]).length + ';' : 'peg$currPos++;');\n ip += 2;\n break;\n\n case op.FAIL:\n // FAIL e\n parts.push(stack.push('peg$FAILED'));\n parts.push('if (peg$silentFails === 0) { peg$fail(' + c(bc[ip + 1]) + '); }');\n ip += 2;\n break;\n\n case op.LOAD_SAVED_POS:\n // LOAD_SAVED_POS p\n parts.push('peg$savedPos = ' + stack.index(bc[ip + 1]) + ';');\n ip += 2;\n break;\n\n case op.UPDATE_SAVED_POS:\n // UPDATE_SAVED_POS\n parts.push('peg$savedPos = peg$currPos;');\n ip++;\n break;\n\n case op.CALL:\n // CALL f, n, pc, p1, p2, ..., pN\n compileCall();\n break;\n\n case op.RULE:\n // RULE r\n parts.push(stack.push(\"peg$parse\" + ast.rules[bc[ip + 1]].name + \"()\"));\n ip += 2;\n break;\n\n case op.SILENT_FAILS_ON:\n // SILENT_FAILS_ON\n parts.push('peg$silentFails++;');\n ip++;\n break;\n\n case op.SILENT_FAILS_OFF:\n // SILENT_FAILS_OFF\n parts.push('peg$silentFails--;');\n ip++;\n break;\n\n default:\n throw new Error(\"Invalid opcode: \" + bc[ip] + \".\");\n }\n }\n\n return parts.join('\\n');\n }\n\n code = compile(rule.bytecode);\n parts.push('function peg$parse' + rule.name + '() {');\n\n if (options.trace) {\n parts.push([' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ',', ' startPos = peg$currPos;'].join('\\n'));\n } else {\n parts.push(' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ';');\n }\n\n parts.push(indent2(generateRuleHeader('\"' + js.stringEscape(rule.name) + '\"', asts.indexOfRule(ast, rule.name))));\n parts.push(indent2(code));\n parts.push(indent2(generateRuleFooter('\"' + js.stringEscape(rule.name) + '\"', s(0))));\n parts.push('}');\n return parts.join('\\n');\n }\n\n function generateToplevel() {\n var parts = [],\n startRuleIndices,\n startRuleIndex,\n startRuleFunctions,\n startRuleFunction,\n ruleNames;\n parts.push(['function peg$subclass(child, parent) {', ' function ctor() { this.constructor = child; }', ' ctor.prototype = parent.prototype;', ' child.prototype = new ctor();', '}', '', 'function peg$SyntaxError(message, expected, found, location) {', ' this.message = message;', ' this.expected = expected;', ' this.found = found;', ' this.location = location;', ' this.name = \"SyntaxError\";', '', ' if (typeof Error.captureStackTrace === \"function\") {', ' Error.captureStackTrace(this, peg$SyntaxError);', ' }', '}', '', 'peg$subclass(peg$SyntaxError, Error);', '', 'peg$SyntaxError.buildMessage = function(expected, found) {', ' var DESCRIBE_EXPECTATION_FNS = {', ' literal: function(expectation) {', ' return \"\\\\\\\"\" + literalEscape(expectation.text) + \"\\\\\\\"\";', ' },', '', ' \"class\": function(expectation) {', ' var escapedParts = \"\",', ' i;', '', ' for (i = 0; i < expectation.parts.length; i++) {', ' escapedParts += expectation.parts[i] instanceof Array', ' ? classEscape(expectation.parts[i][0]) + \"-\" + classEscape(expectation.parts[i][1])', ' : classEscape(expectation.parts[i]);', ' }', '', ' return \"[\" + (expectation.inverted ? \"^\" : \"\") + escapedParts + \"]\";', ' },', '', ' any: function(expectation) {', ' return \"any character\";', ' },', '', ' end: function(expectation) {', ' return \"end of input\";', ' },', '', ' other: function(expectation) {', ' return expectation.description;', ' }', ' };', '', ' function hex(ch) {', ' return ch.charCodeAt(0).toString(16).toUpperCase();', ' }', '', ' function literalEscape(s) {', ' return s', ' .replace(/\\\\\\\\/g, \\'\\\\\\\\\\\\\\\\\\')', // backslash\n ' .replace(/\"/g, \\'\\\\\\\\\"\\')', // closing double quote\n ' .replace(/\\\\0/g, \\'\\\\\\\\0\\')', // null\n ' .replace(/\\\\t/g, \\'\\\\\\\\t\\')', // horizontal tab\n ' .replace(/\\\\n/g, \\'\\\\\\\\n\\')', // line feed\n ' .replace(/\\\\r/g, \\'\\\\\\\\r\\')', // carriage return\n ' .replace(/[\\\\x00-\\\\x0F]/g, function(ch) { return \\'\\\\\\\\x0\\' + hex(ch); })', ' .replace(/[\\\\x10-\\\\x1F\\\\x7F-\\\\x9F]/g, function(ch) { return \\'\\\\\\\\x\\' + hex(ch); });', ' }', '', ' function classEscape(s) {', ' return s', ' .replace(/\\\\\\\\/g, \\'\\\\\\\\\\\\\\\\\\')', // backslash\n ' .replace(/\\\\]/g, \\'\\\\\\\\]\\')', // closing bracket\n ' .replace(/\\\\^/g, \\'\\\\\\\\^\\')', // caret\n ' .replace(/-/g, \\'\\\\\\\\-\\')', // dash\n ' .replace(/\\\\0/g, \\'\\\\\\\\0\\')', // null\n ' .replace(/\\\\t/g, \\'\\\\\\\\t\\')', // horizontal tab\n ' .replace(/\\\\n/g, \\'\\\\\\\\n\\')', // line feed\n ' .replace(/\\\\r/g, \\'\\\\\\\\r\\')', // carriage return\n ' .replace(/[\\\\x00-\\\\x0F]/g, function(ch) { return \\'\\\\\\\\x0\\' + hex(ch); })', ' .replace(/[\\\\x10-\\\\x1F\\\\x7F-\\\\x9F]/g, function(ch) { return \\'\\\\\\\\x\\' + hex(ch); });', ' }', '', ' function describeExpectation(expectation) {', ' return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);', ' }', '', ' function describeExpected(expected) {', ' var descriptions = new Array(expected.length),', ' i, j;', '', ' for (i = 0; i < expected.length; i++) {', ' descriptions[i] = describeExpectation(expected[i]);', ' }', '', ' descriptions.sort();', '', ' if (descriptions.length > 0) {', ' for (i = 1, j = 1; i < descriptions.length; i++) {', ' if (descriptions[i - 1] !== descriptions[i]) {', ' descriptions[j] = descriptions[i];', ' j++;', ' }', ' }', ' descriptions.length = j;', ' }', '', ' switch (descriptions.length) {', ' case 1:', ' return descriptions[0];', '', ' case 2:', ' return descriptions[0] + \" or \" + descriptions[1];', '', ' default:', ' return descriptions.slice(0, -1).join(\", \")', ' + \", or \"', ' + descriptions[descriptions.length - 1];', ' }', ' }', '', ' function describeFound(found) {', ' return found ? \"\\\\\"\" + literalEscape(found) + \"\\\\\"\" : \"end of input\";', ' }', '', ' return \"Expected \" + describeExpected(expected) + \" but \" + describeFound(found) + \" found.\";', '};', ''].join('\\n'));\n\n if (options.trace) {\n parts.push(['function peg$DefaultTracer() {', ' this.indentLevel = 0;', '}', '', 'peg$DefaultTracer.prototype.trace = function(event) {', ' var that = this;', '', ' function log(event) {', ' function repeat(string, n) {', ' var result = \"\", i;', '', ' for (i = 0; i < n; i++) {', ' result += string;', ' }', '', ' return result;', ' }', '', ' function pad(string, length) {', ' return string + repeat(\" \", length - string.length);', ' }', '', ' if (typeof console === \"object\") {', // IE 8-10\n ' console.log(', ' event.location.start.line + \":\" + event.location.start.column + \"-\"', ' + event.location.end.line + \":\" + event.location.end.column + \" \"', ' + pad(event.type, 10) + \" \"', ' + repeat(\" \", that.indentLevel) + event.rule', ' );', ' }', ' }', '', ' switch (event.type) {', ' case \"rule.enter\":', ' log(event);', ' this.indentLevel++;', ' break;', '', ' case \"rule.match\":', ' this.indentLevel--;', ' log(event);', ' break;', '', ' case \"rule.fail\":', ' this.indentLevel--;', ' log(event);', ' break;', '', ' default:', ' throw new Error(\"Invalid event type: \" + event.type + \".\");', ' }', '};', ''].join('\\n'));\n }\n\n parts.push(['function peg$parse(input, options) {', ' options = options !== void 0 ? options : {};', '', ' var peg$FAILED = {},', ''].join('\\n'));\n\n if (options.optimize === \"size\") {\n startRuleIndices = '{ ' + arrays.map(options.allowedStartRules, function (r) {\n return r + ': ' + asts.indexOfRule(ast, r);\n }).join(', ') + ' }';\n startRuleIndex = asts.indexOfRule(ast, options.allowedStartRules[0]);\n parts.push([' peg$startRuleIndices = ' + startRuleIndices + ',', ' peg$startRuleIndex = ' + startRuleIndex + ','].join('\\n'));\n } else {\n startRuleFunctions = '{ ' + arrays.map(options.allowedStartRules, function (r) {\n return r + ': peg$parse' + r;\n }).join(', ') + ' }';\n startRuleFunction = 'peg$parse' + options.allowedStartRules[0];\n parts.push([' peg$startRuleFunctions = ' + startRuleFunctions + ',', ' peg$startRuleFunction = ' + startRuleFunction + ','].join('\\n'));\n }\n\n parts.push('');\n parts.push(indent6(generateTables()));\n parts.push(['', ' peg$currPos = 0,', ' peg$savedPos = 0,', ' peg$posDetailsCache = [{ line: 1, column: 1 }],', ' peg$maxFailPos = 0,', ' peg$maxFailExpected = [],', ' peg$silentFails = 0,', // 0 = report failures, > 0 = silence failures\n ''].join('\\n'));\n\n if (options.cache) {\n parts.push([' peg$resultsCache = {},', ''].join('\\n'));\n }\n\n if (options.trace) {\n if (options.optimize === \"size\") {\n ruleNames = '[' + arrays.map(ast.rules, function (r) {\n return '\"' + js.stringEscape(r.name) + '\"';\n }).join(', ') + ']';\n parts.push([' peg$ruleNames = ' + ruleNames + ',', ''].join('\\n'));\n }\n\n parts.push([' peg$tracer = \"tracer\" in options ? options.tracer : new peg$DefaultTracer(),', ''].join('\\n'));\n }\n\n parts.push([' peg$result;', ''].join('\\n'));\n\n if (options.optimize === \"size\") {\n parts.push([' if (\"startRule\" in options) {', ' if (!(options.startRule in peg$startRuleIndices)) {', ' throw new Error(\"Can\\'t start parsing from rule \\\\\"\" + options.startRule + \"\\\\\".\");', ' }', '', ' peg$startRuleIndex = peg$startRuleIndices[options.startRule];', ' }'].join('\\n'));\n } else {\n parts.push([' if (\"startRule\" in options) {', ' if (!(options.startRule in peg$startRuleFunctions)) {', ' throw new Error(\"Can\\'t start parsing from rule \\\\\"\" + options.startRule + \"\\\\\".\");', ' }', '', ' peg$startRuleFunction = peg$startRuleFunctions[options.startRule];', ' }'].join('\\n'));\n }\n\n parts.push(['', ' function text() {', ' return input.substring(peg$savedPos, peg$currPos);', ' }', '', ' function location() {', ' return peg$computeLocation(peg$savedPos, peg$currPos);', ' }', '', ' function expected(description, location) {', ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)', '', ' throw peg$buildStructuredError(', ' [peg$otherExpectation(description)],', ' input.substring(peg$savedPos, peg$currPos),', ' location', ' );', ' }', '', ' function error(message, location) {', ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)', '', ' throw peg$buildSimpleError(message, location);', ' }', '', ' function peg$literalExpectation(text, ignoreCase) {', ' return { type: \"literal\", text: text, ignoreCase: ignoreCase };', ' }', '', ' function peg$classExpectation(parts, inverted, ignoreCase) {', ' return { type: \"class\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };', ' }', '', ' function peg$anyExpectation() {', ' return { type: \"any\" };', ' }', '', ' function peg$endExpectation() {', ' return { type: \"end\" };', ' }', '', ' function peg$otherExpectation(description) {', ' return { type: \"other\", description: description };', ' }', '', ' function peg$computePosDetails(pos) {', ' var details = peg$posDetailsCache[pos], p;', '', ' if (details) {', ' return details;', ' } else {', ' p = pos - 1;', ' while (!peg$posDetailsCache[p]) {', ' p--;', ' }', '', ' details = peg$posDetailsCache[p];', ' details = {', ' line: details.line,', ' column: details.column', ' };', '', ' while (p < pos) {', ' if (input.charCodeAt(p) === 10) {', ' details.line++;', ' details.column = 1;', ' } else {', ' details.column++;', ' }', '', ' p++;', ' }', '', ' peg$posDetailsCache[pos] = details;', ' return details;', ' }', ' }', '', ' function peg$computeLocation(startPos, endPos) {', ' var startPosDetails = peg$computePosDetails(startPos),', ' endPosDetails = peg$computePosDetails(endPos);', '', ' return {', ' start: {', ' offset: startPos,', ' line: startPosDetails.line,', ' column: startPosDetails.column', ' },', ' end: {', ' offset: endPos,', ' line: endPosDetails.line,', ' column: endPosDetails.column', ' }', ' };', ' }', '', ' function peg$fail(expected) {', ' if (peg$currPos < peg$maxFailPos) { return; }', '', ' if (peg$currPos > peg$maxFailPos) {', ' peg$maxFailPos = peg$currPos;', ' peg$maxFailExpected = [];', ' }', '', ' peg$maxFailExpected.push(expected);', ' }', '', ' function peg$buildSimpleError(message, location) {', ' return new peg$SyntaxError(message, null, null, location);', ' }', '', ' function peg$buildStructuredError(expected, found, location) {', ' return new peg$SyntaxError(', ' peg$SyntaxError.buildMessage(expected, found),', ' expected,', ' found,', ' location', ' );', ' }', ''].join('\\n'));\n\n if (options.optimize === \"size\") {\n parts.push(indent2(generateInterpreter()));\n parts.push('');\n } else {\n arrays.each(ast.rules, function (rule) {\n parts.push(indent2(generateRuleFunction(rule)));\n parts.push('');\n });\n }\n\n if (ast.initializer) {\n parts.push(indent2(ast.initializer.code));\n parts.push('');\n }\n\n if (options.optimize === \"size\") {\n parts.push(' peg$result = peg$parseRule(peg$startRuleIndex);');\n } else {\n parts.push(' peg$result = peg$startRuleFunction();');\n }\n\n parts.push(['', ' if (peg$result !== peg$FAILED && peg$currPos === input.length) {', ' return peg$result;', ' } else {', ' if (peg$result !== peg$FAILED && peg$currPos < input.length) {', ' peg$fail(peg$endExpectation());', ' }', '', ' throw peg$buildStructuredError(', ' peg$maxFailExpected,', ' peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,', ' peg$maxFailPos < input.length', ' ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)', ' : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)', ' );', ' }', '}'].join('\\n'));\n return parts.join('\\n');\n }\n\n function generateWrapper(toplevelCode) {\n function generateGeneratedByComment() {\n return ['/*', ' * Generated by PEG.js 0.10.0.', ' *', ' * http://pegjs.org/', ' */'].join('\\n');\n }\n\n function generateParserObject() {\n return options.trace ? ['{', ' SyntaxError: peg$SyntaxError,', ' DefaultTracer: peg$DefaultTracer,', ' parse: peg$parse', '}'].join('\\n') : ['{', ' SyntaxError: peg$SyntaxError,', ' parse: peg$parse', '}'].join('\\n');\n }\n\n var generators = {\n bare: function () {\n return [generateGeneratedByComment(), '(function() {', ' \"use strict\";', '', indent2(toplevelCode), '', indent2('return ' + generateParserObject() + ';'), '})()'].join('\\n');\n },\n commonjs: function () {\n var parts = [],\n dependencyVars = objects.keys(options.dependencies),\n requires = arrays.map(dependencyVars, function (variable) {\n return variable + ' = require(\"' + js.stringEscape(options.dependencies[variable]) + '\")';\n });\n parts.push([generateGeneratedByComment(), '', '\"use strict\";', ''].join('\\n'));\n\n if (requires.length > 0) {\n parts.push('var ' + requires.join(', ') + ';');\n parts.push('');\n }\n\n parts.push([toplevelCode, '', 'module.exports = ' + generateParserObject() + ';', ''].join('\\n'));\n return parts.join('\\n');\n },\n amd: function () {\n var dependencyIds = objects.values(options.dependencies),\n dependencyVars = objects.keys(options.dependencies),\n dependencies = '[' + arrays.map(dependencyIds, function (id) {\n return '\"' + js.stringEscape(id) + '\"';\n }).join(', ') + ']',\n params = dependencyVars.join(', ');\n return [generateGeneratedByComment(), 'define(' + dependencies + ', function(' + params + ') {', ' \"use strict\";', '', indent2(toplevelCode), '', indent2('return ' + generateParserObject() + ';'), '});', ''].join('\\n');\n },\n globals: function () {\n return [generateGeneratedByComment(), '(function(root) {', ' \"use strict\";', '', indent2(toplevelCode), '', indent2('root.' + options.exportVar + ' = ' + generateParserObject() + ';'), '})(this);', ''].join('\\n');\n },\n umd: function () {\n var parts = [],\n dependencyIds = objects.values(options.dependencies),\n dependencyVars = objects.keys(options.dependencies),\n dependencies = '[' + arrays.map(dependencyIds, function (id) {\n return '\"' + js.stringEscape(id) + '\"';\n }).join(', ') + ']',\n requires = arrays.map(dependencyIds, function (id) {\n return 'require(\"' + js.stringEscape(id) + '\")';\n }).join(', '),\n params = dependencyVars.join(', ');\n parts.push([generateGeneratedByComment(), '(function(root, factory) {', ' if (typeof define === \"function\" && define.amd) {', ' define(' + dependencies + ', factory);', ' } else if (typeof module === \"object\" && module.exports) {', ' module.exports = factory(' + requires + ');'].join('\\n'));\n\n if (options.exportVar !== null) {\n parts.push([' } else {', ' root.' + options.exportVar + ' = factory();'].join('\\n'));\n }\n\n parts.push([' }', '})(this, function(' + params + ') {', ' \"use strict\";', '', indent2(toplevelCode), '', indent2('return ' + generateParserObject() + ';'), '});', ''].join('\\n'));\n return parts.join('\\n');\n }\n };\n return generators[options.format]();\n }\n\n ast.code = generateWrapper(generateToplevel());\n}","function gi(t,e){0}","function GeneratorClass () {}","__getInputString(line, input, block, key, ugen) {\n let value = '';\n if (typeof input === 'number') {\n if (isNaN(key)) {\n value += `mem[${ugen.__addresses__[key]}]`; //input\n } else {\n value += input;\n }\n } else if (typeof input === 'boolean') {\n value += '' + input;\n } else {\n //console.log( 'key:', key, 'input:', ugen.inputs, ugen.inputs[ key ] ) \n // XXX not sure why this has to be here, but somehow non-processed objects\n // that only contain id numbers are being passed here...\n\n if (input !== undefined) {\n if (Gibberish.mode === 'processor') {\n if (input.ugenName === undefined && input.id !== undefined) {\n if (ugen === undefined) {\n input = Gibberish.processor.ugens.get(input.id);\n } else {\n if (ugen.type !== 'seq') {\n input = Gibberish.processor.ugens.get(input.id);\n }\n }\n }\n }\n\n Gibberish.processUgen(input, block);\n\n if (!input.isop) {\n // check is needed so that graphs with ssds that refer to themselves\n // don't add the ssd in more than once\n if (Gibberish.callbackUgens.indexOf(input.callback) === -1) {\n Gibberish.callbackUgens.push(input.callback);\n }\n }\n\n value += `v_${input.id}`;\n input.__varname = value;\n }\n }\n\n return value;\n }","function parse(){\n var syntax = esprima.parse(editor.getValue());\n codeArray = [];\n expand(syntax.body, codeArray, 0);\n}","constructor() { super([Space.TAG], JXONLexer.lexemes) }","function hg(a){this.wh=a;this.wi=\"\";this.Mo=new RegExp(this.Eb,\"g\")}","function erlang(hljs) {\n const BASIC_ATOM_RE = '[a-z\\'][a-zA-Z0-9_\\']*';\n const FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\n const ERLANG_RESERVED = {\n keyword:\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\n 'let not of orelse|10 query receive rem try when xor',\n literal:\n 'false true'\n };\n\n const COMMENT = hljs.COMMENT('%', '$');\n const NUMBER = {\n className: 'number',\n begin: '\\\\b(\\\\d+(_\\\\d+)*#[a-fA-F0-9]+(_[a-fA-F0-9]+)*|\\\\d+(_\\\\d+)*(\\\\.\\\\d+(_\\\\d+)*)?([eE][-+]?\\\\d+)?)',\n relevance: 0\n };\n const NAMED_FUN = {\n begin: 'fun\\\\s+' + BASIC_ATOM_RE + '/\\\\d+'\n };\n const FUNCTION_CALL = {\n begin: FUNCTION_NAME_RE + '\\\\(',\n end: '\\\\)',\n returnBegin: true,\n relevance: 0,\n contains: [\n {\n begin: FUNCTION_NAME_RE,\n relevance: 0\n },\n {\n begin: '\\\\(',\n end: '\\\\)',\n endsWithParent: true,\n returnEnd: true,\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n const TUPLE = {\n begin: /\\{/,\n end: /\\}/,\n relevance: 0\n // \"contains\" defined later\n };\n const VAR1 = {\n begin: '\\\\b_([A-Z][A-Za-z0-9_]*)?',\n relevance: 0\n };\n const VAR2 = {\n begin: '[A-Z][a-zA-Z0-9_]*',\n relevance: 0\n };\n const RECORD_ACCESS = {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0,\n returnBegin: true,\n contains: [\n {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0\n },\n {\n begin: /\\{/,\n end: /\\}/,\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n\n const BLOCK_STATEMENTS = {\n beginKeywords: 'fun receive if try case',\n end: 'end',\n keywords: ERLANG_RESERVED\n };\n BLOCK_STATEMENTS.contains = [\n COMMENT,\n NAMED_FUN,\n hljs.inherit(hljs.APOS_STRING_MODE, {\n className: ''\n }),\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1,\n VAR2,\n RECORD_ACCESS\n ];\n\n const BASIC_MODES = [\n COMMENT,\n NAMED_FUN,\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1,\n VAR2,\n RECORD_ACCESS\n ];\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\n TUPLE.contains = BASIC_MODES;\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\n\n const PARAMS = {\n className: 'params',\n begin: '\\\\(',\n end: '\\\\)',\n contains: BASIC_MODES\n };\n return {\n name: 'Erlang',\n aliases: ['erl'],\n keywords: ERLANG_RESERVED,\n illegal: '(</|\\\\*=|\\\\+=|-=|/\\\\*|\\\\*/|\\\\(\\\\*|\\\\*\\\\))',\n contains: [\n {\n className: 'function',\n begin: '^' + BASIC_ATOM_RE + '\\\\s*\\\\(',\n end: '->',\n returnBegin: true,\n illegal: '\\\\(|#|//|/\\\\*|\\\\\\\\|:|;',\n contains: [\n PARAMS,\n hljs.inherit(hljs.TITLE_MODE, {\n begin: BASIC_ATOM_RE\n })\n ],\n starts: {\n end: ';|\\\\.',\n keywords: ERLANG_RESERVED,\n contains: BASIC_MODES\n }\n },\n COMMENT,\n {\n begin: '^-',\n end: '\\\\.',\n relevance: 0,\n excludeEnd: true,\n returnBegin: true,\n keywords: {\n $pattern: '-' + hljs.IDENT_RE,\n keyword: '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\n '-behavior -spec'\n },\n contains: [PARAMS]\n },\n NUMBER,\n hljs.QUOTE_STRING_MODE,\n RECORD_ACCESS,\n VAR1,\n VAR2,\n TUPLE,\n {\n begin: /\\.$/\n } // relevance booster\n ]\n };\n}","function erlang(hljs) {\n const BASIC_ATOM_RE = '[a-z\\'][a-zA-Z0-9_\\']*';\n const FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\n const ERLANG_RESERVED = {\n keyword:\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\n 'let not of orelse|10 query receive rem try when xor',\n literal:\n 'false true'\n };\n\n const COMMENT = hljs.COMMENT('%', '$');\n const NUMBER = {\n className: 'number',\n begin: '\\\\b(\\\\d+(_\\\\d+)*#[a-fA-F0-9]+(_[a-fA-F0-9]+)*|\\\\d+(_\\\\d+)*(\\\\.\\\\d+(_\\\\d+)*)?([eE][-+]?\\\\d+)?)',\n relevance: 0\n };\n const NAMED_FUN = {\n begin: 'fun\\\\s+' + BASIC_ATOM_RE + '/\\\\d+'\n };\n const FUNCTION_CALL = {\n begin: FUNCTION_NAME_RE + '\\\\(',\n end: '\\\\)',\n returnBegin: true,\n relevance: 0,\n contains: [\n {\n begin: FUNCTION_NAME_RE,\n relevance: 0\n },\n {\n begin: '\\\\(',\n end: '\\\\)',\n endsWithParent: true,\n returnEnd: true,\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n const TUPLE = {\n begin: /\\{/,\n end: /\\}/,\n relevance: 0\n // \"contains\" defined later\n };\n const VAR1 = {\n begin: '\\\\b_([A-Z][A-Za-z0-9_]*)?',\n relevance: 0\n };\n const VAR2 = {\n begin: '[A-Z][a-zA-Z0-9_]*',\n relevance: 0\n };\n const RECORD_ACCESS = {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0,\n returnBegin: true,\n contains: [\n {\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\n relevance: 0\n },\n {\n begin: /\\{/,\n end: /\\}/,\n relevance: 0\n // \"contains\" defined later\n }\n ]\n };\n\n const BLOCK_STATEMENTS = {\n beginKeywords: 'fun receive if try case',\n end: 'end',\n keywords: ERLANG_RESERVED\n };\n BLOCK_STATEMENTS.contains = [\n COMMENT,\n NAMED_FUN,\n hljs.inherit(hljs.APOS_STRING_MODE, {\n className: ''\n }),\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1,\n VAR2,\n RECORD_ACCESS\n ];\n\n const BASIC_MODES = [\n COMMENT,\n NAMED_FUN,\n BLOCK_STATEMENTS,\n FUNCTION_CALL,\n hljs.QUOTE_STRING_MODE,\n NUMBER,\n TUPLE,\n VAR1,\n VAR2,\n RECORD_ACCESS\n ];\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\n TUPLE.contains = BASIC_MODES;\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\n\n const PARAMS = {\n className: 'params',\n begin: '\\\\(',\n end: '\\\\)',\n contains: BASIC_MODES\n };\n return {\n name: 'Erlang',\n aliases: ['erl'],\n keywords: ERLANG_RESERVED,\n illegal: '(</|\\\\*=|\\\\+=|-=|/\\\\*|\\\\*/|\\\\(\\\\*|\\\\*\\\\))',\n contains: [\n {\n className: 'function',\n begin: '^' + BASIC_ATOM_RE + '\\\\s*\\\\(',\n end: '->',\n returnBegin: true,\n illegal: '\\\\(|#|//|/\\\\*|\\\\\\\\|:|;',\n contains: [\n PARAMS,\n hljs.inherit(hljs.TITLE_MODE, {\n begin: BASIC_ATOM_RE\n })\n ],\n starts: {\n end: ';|\\\\.',\n keywords: ERLANG_RESERVED,\n contains: BASIC_MODES\n }\n },\n COMMENT,\n {\n begin: '^-',\n end: '\\\\.',\n relevance: 0,\n excludeEnd: true,\n returnBegin: true,\n keywords: {\n $pattern: '-' + hljs.IDENT_RE,\n keyword: '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\n '-behavior -spec'\n },\n contains: [PARAMS]\n },\n NUMBER,\n hljs.QUOTE_STRING_MODE,\n RECORD_ACCESS,\n VAR1,\n VAR2,\n TUPLE,\n {\n begin: /\\.$/\n } // relevance booster\n ]\n };\n}","function generateJS(ast, options) {\n /* These only indent non-empty lines to avoid trailing whitespace. */\n function indent2(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n function indent6(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n function indent10(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n\n function generateTables() {\n if (options.optimize === \"size\") {\n return [\n 'peg$consts = [',\n indent2(ast.consts.join(',\\n')),\n '],',\n '',\n 'peg$bytecode = [',\n indent2(arrays.map(ast.rules, function(rule) {\n return 'peg$decode(\"'\n + js.stringEscape(arrays.map(\n rule.bytecode,\n function(b) { return String.fromCharCode(b + 32); }\n ).join(''))\n + '\")';\n }).join(',\\n')),\n '],'\n ].join('\\n');\n } else {\n return arrays.map(\n ast.consts,\n function(c, i) { return 'peg$c' + i + ' = ' + c + ','; }\n ).join('\\n');\n }\n }\n\n function generateRuleHeader(ruleNameCode, ruleIndexCode) {\n var parts = [];\n\n parts.push('');\n\n if (options.trace) {\n parts.push([\n 'peg$tracer.trace({',\n ' type: \"rule.enter\",',\n ' rule: ' + ruleNameCode + ',',\n ' location: peg$computeLocation(startPos, startPos)',\n '});',\n ''\n ].join('\\n'));\n }\n\n if (options.cache) {\n parts.push([\n 'var key = peg$currPos * ' + ast.rules.length + ' + ' + ruleIndexCode + ',',\n ' cached = peg$resultsCache[key];',\n '',\n 'if (cached) {',\n ' peg$currPos = cached.nextPos;',\n ''\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n 'if (cached.result !== peg$FAILED) {',\n ' peg$tracer.trace({',\n ' type: \"rule.match\",',\n ' rule: ' + ruleNameCode + ',',\n ' result: cached.result,',\n ' location: peg$computeLocation(startPos, peg$currPos)',\n ' });',\n '} else {',\n ' peg$tracer.trace({',\n ' type: \"rule.fail\",',\n ' rule: ' + ruleNameCode + ',',\n ' location: peg$computeLocation(startPos, startPos)',\n ' });',\n '}',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' return cached.result;',\n '}',\n ''\n ].join('\\n'));\n }\n\n return parts.join('\\n');\n }\n\n function generateRuleFooter(ruleNameCode, resultCode) {\n var parts = [];\n\n if (options.cache) {\n parts.push([\n '',\n 'peg$resultsCache[key] = { nextPos: peg$currPos, result: ' + resultCode + ' };'\n ].join('\\n'));\n }\n\n if (options.trace) {\n parts.push([\n '',\n 'if (' + resultCode + ' !== peg$FAILED) {',\n ' peg$tracer.trace({',\n ' type: \"rule.match\",',\n ' rule: ' + ruleNameCode + ',',\n ' result: ' + resultCode + ',',\n ' location: peg$computeLocation(startPos, peg$currPos)',\n ' });',\n '} else {',\n ' peg$tracer.trace({',\n ' type: \"rule.fail\",',\n ' rule: ' + ruleNameCode + ',',\n ' location: peg$computeLocation(startPos, startPos)',\n ' });',\n '}'\n ].join('\\n'));\n }\n\n parts.push([\n '',\n 'return ' + resultCode + ';'\n ].join('\\n'));\n\n return parts.join('\\n');\n }\n\n function generateInterpreter() {\n var parts = [];\n\n function generateCondition(cond, argsLength) {\n var baseLength = argsLength + 3,\n thenLengthCode = 'bc[ip + ' + (baseLength - 2) + ']',\n elseLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n\n return [\n 'ends.push(end);',\n 'ips.push(ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ');',\n '',\n 'if (' + cond + ') {',\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ';',\n ' ip += ' + baseLength + ';',\n '} else {',\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ';',\n ' ip += ' + baseLength + ' + ' + thenLengthCode + ';',\n '}',\n '',\n 'break;'\n ].join('\\n');\n }\n\n function generateLoop(cond) {\n var baseLength = 2,\n bodyLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n\n return [\n 'if (' + cond + ') {',\n ' ends.push(end);',\n ' ips.push(ip);',\n '',\n ' end = ip + ' + baseLength + ' + ' + bodyLengthCode + ';',\n ' ip += ' + baseLength + ';',\n '} else {',\n ' ip += ' + baseLength + ' + ' + bodyLengthCode + ';',\n '}',\n '',\n 'break;'\n ].join('\\n');\n }\n\n function generateCall() {\n var baseLength = 4,\n paramsLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n\n return [\n 'params = bc.slice(ip + ' + baseLength + ', ip + ' + baseLength + ' + ' + paramsLengthCode + ');',\n 'for (i = 0; i < ' + paramsLengthCode + '; i++) {',\n ' params[i] = stack[stack.length - 1 - params[i]];',\n '}',\n '',\n 'stack.splice(',\n ' stack.length - bc[ip + 2],',\n ' bc[ip + 2],',\n ' peg$consts[bc[ip + 1]].apply(null, params)',\n ');',\n '',\n 'ip += ' + baseLength + ' + ' + paramsLengthCode + ';',\n 'break;'\n ].join('\\n');\n }\n\n parts.push([\n 'function peg$decode(s) {',\n ' var bc = new Array(s.length), i;',\n '',\n ' for (i = 0; i < s.length; i++) {',\n ' bc[i] = s.charCodeAt(i) - 32;',\n ' }',\n '',\n ' return bc;',\n '}',\n '',\n 'function peg$parseRule(index) {'\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n ' var bc = peg$bytecode[index],',\n ' ip = 0,',\n ' ips = [],',\n ' end = bc.length,',\n ' ends = [],',\n ' stack = [],',\n ' startPos = peg$currPos,',\n ' params, i;'\n ].join('\\n'));\n } else {\n parts.push([\n ' var bc = peg$bytecode[index],',\n ' ip = 0,',\n ' ips = [],',\n ' end = bc.length,',\n ' ends = [],',\n ' stack = [],',\n ' params, i;'\n ].join('\\n'));\n }\n\n parts.push(indent2(generateRuleHeader('peg$ruleNames[index]', 'index')));\n\n parts.push([\n /*\n * The point of the outer loop and the |ips| & |ends| stacks is to avoid\n * recursive calls for interpreting parts of bytecode. In other words, we\n * implement the |interpret| operation of the abstract machine without\n * function calls. Such calls would likely slow the parser down and more\n * importantly cause stack overflows for complex grammars.\n */\n ' while (true) {',\n ' while (ip < end) {',\n ' switch (bc[ip]) {',\n ' case ' + op.PUSH + ':', // PUSH c\n ' stack.push(peg$consts[bc[ip + 1]]);',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.PUSH_UNDEFINED + ':', // PUSH_UNDEFINED\n ' stack.push(void 0);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_NULL + ':', // PUSH_NULL\n ' stack.push(null);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_FAILED + ':', // PUSH_FAILED\n ' stack.push(peg$FAILED);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_EMPTY_ARRAY + ':', // PUSH_EMPTY_ARRAY\n ' stack.push([]);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_CURR_POS + ':', // PUSH_CURR_POS\n ' stack.push(peg$currPos);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.POP + ':', // POP\n ' stack.pop();',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.POP_CURR_POS + ':', // POP_CURR_POS\n ' peg$currPos = stack.pop();',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.POP_N + ':', // POP_N n\n ' stack.length -= bc[ip + 1];',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.NIP + ':', // NIP\n ' stack.splice(-2, 1);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.APPEND + ':', // APPEND\n ' stack[stack.length - 2].push(stack.pop());',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.WRAP + ':', // WRAP n\n ' stack.push(stack.splice(stack.length - bc[ip + 1], bc[ip + 1]));',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.TEXT + ':', // TEXT\n ' stack.push(input.substring(stack.pop(), peg$currPos));',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.IF + ':', // IF t, f\n indent10(generateCondition('stack[stack.length - 1]', 0)),\n '',\n ' case ' + op.IF_ERROR + ':', // IF_ERROR t, f\n indent10(generateCondition(\n 'stack[stack.length - 1] === peg$FAILED',\n 0\n )),\n '',\n ' case ' + op.IF_NOT_ERROR + ':', // IF_NOT_ERROR t, f\n indent10(\n generateCondition('stack[stack.length - 1] !== peg$FAILED',\n 0\n )),\n '',\n ' case ' + op.WHILE_NOT_ERROR + ':', // WHILE_NOT_ERROR b\n indent10(generateLoop('stack[stack.length - 1] !== peg$FAILED')),\n '',\n ' case ' + op.MATCH_ANY + ':', // MATCH_ANY a, f, ...\n indent10(generateCondition('input.length > peg$currPos', 0)),\n '',\n ' case ' + op.MATCH_STRING + ':', // MATCH_STRING s, a, f, ...\n indent10(generateCondition(\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length) === peg$consts[bc[ip + 1]]',\n 1\n )),\n '',\n ' case ' + op.MATCH_STRING_IC + ':', // MATCH_STRING_IC s, a, f, ...\n indent10(generateCondition(\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length).toLowerCase() === peg$consts[bc[ip + 1]]',\n 1\n )),\n '',\n ' case ' + op.MATCH_REGEXP + ':', // MATCH_REGEXP r, a, f, ...\n indent10(generateCondition(\n 'peg$consts[bc[ip + 1]].test(input.charAt(peg$currPos))',\n 1\n )),\n '',\n ' case ' + op.ACCEPT_N + ':', // ACCEPT_N n\n ' stack.push(input.substr(peg$currPos, bc[ip + 1]));',\n ' peg$currPos += bc[ip + 1];',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.ACCEPT_STRING + ':', // ACCEPT_STRING s\n ' stack.push(peg$consts[bc[ip + 1]]);',\n ' peg$currPos += peg$consts[bc[ip + 1]].length;',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.FAIL + ':', // FAIL e\n ' stack.push(peg$FAILED);',\n ' if (peg$silentFails === 0) {',\n ' peg$fail(peg$consts[bc[ip + 1]]);',\n ' }',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.LOAD_SAVED_POS + ':', // LOAD_SAVED_POS p\n ' peg$savedPos = stack[stack.length - 1 - bc[ip + 1]];',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.UPDATE_SAVED_POS + ':', // UPDATE_SAVED_POS\n ' peg$savedPos = peg$currPos;',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.CALL + ':', // CALL f, n, pc, p1, p2, ..., pN\n indent10(generateCall()),\n '',\n ' case ' + op.RULE + ':', // RULE r\n ' stack.push(peg$parseRule(bc[ip + 1]));',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.SILENT_FAILS_ON + ':', // SILENT_FAILS_ON\n ' peg$silentFails++;',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.SILENT_FAILS_OFF + ':', // SILENT_FAILS_OFF\n ' peg$silentFails--;',\n ' ip++;',\n ' break;',\n '',\n ' default:',\n ' throw new Error(\"Invalid opcode: \" + bc[ip] + \".\");',\n ' }',\n ' }',\n '',\n ' if (ends.length > 0) {',\n ' end = ends.pop();',\n ' ip = ips.pop();',\n ' } else {',\n ' break;',\n ' }',\n ' }'\n ].join('\\n'));\n\n parts.push(indent2(generateRuleFooter('peg$ruleNames[index]', 'stack[0]')));\n parts.push('}');\n\n return parts.join('\\n');\n }\n\n function generateRuleFunction(rule) {\n var parts = [], code;\n\n function c(i) { return \"peg$c\" + i; } // |consts[i]| of the abstract machine\n function s(i) { return \"s\" + i; } // |stack[i]| of the abstract machine\n\n var stack = {\n sp: -1,\n maxSp: -1,\n\n push: function(exprCode) {\n var code = s(++this.sp) + ' = ' + exprCode + ';';\n\n if (this.sp > this.maxSp) { this.maxSp = this.sp; }\n\n return code;\n },\n\n pop: function(n) {\n var values;\n\n if (n === void 0) {\n return s(this.sp--);\n } else {\n values = arrays.map(arrays.range(this.sp - n + 1, this.sp + 1), s);\n this.sp -= n;\n\n return values;\n }\n },\n\n top: function() {\n return s(this.sp);\n },\n\n index: function(i) {\n return s(this.sp - i);\n }\n };\n\n function compile(bc) {\n var ip = 0,\n end = bc.length,\n parts = [],\n value;\n\n function compileCondition(cond, argCount) {\n var baseLength = argCount + 3,\n thenLength = bc[ip + baseLength - 2],\n elseLength = bc[ip + baseLength - 1],\n baseSp = stack.sp,\n thenCode, elseCode, thenSp, elseSp;\n\n ip += baseLength;\n thenCode = compile(bc.slice(ip, ip + thenLength));\n thenSp = stack.sp;\n ip += thenLength;\n\n if (elseLength > 0) {\n stack.sp = baseSp;\n elseCode = compile(bc.slice(ip, ip + elseLength));\n elseSp = stack.sp;\n ip += elseLength;\n\n if (thenSp !== elseSp) {\n throw new Error(\n \"Branches of a condition must move the stack pointer in the same way.\"\n );\n }\n }\n\n parts.push('if (' + cond + ') {');\n parts.push(indent2(thenCode));\n if (elseLength > 0) {\n parts.push('} else {');\n parts.push(indent2(elseCode));\n }\n parts.push('}');\n }\n\n function compileLoop(cond) {\n var baseLength = 2,\n bodyLength = bc[ip + baseLength - 1],\n baseSp = stack.sp,\n bodyCode, bodySp;\n\n ip += baseLength;\n bodyCode = compile(bc.slice(ip, ip + bodyLength));\n bodySp = stack.sp;\n ip += bodyLength;\n\n if (bodySp !== baseSp) {\n throw new Error(\"Body of a loop can't move the stack pointer.\");\n }\n\n parts.push('while (' + cond + ') {');\n parts.push(indent2(bodyCode));\n parts.push('}');\n }\n\n function compileCall() {\n var baseLength = 4,\n paramsLength = bc[ip + baseLength - 1];\n\n var value = c(bc[ip + 1]) + '('\n + arrays.map(\n bc.slice(ip + baseLength, ip + baseLength + paramsLength),\n function(p) { return stack.index(p); }\n ).join(', ')\n + ')';\n stack.pop(bc[ip + 2]);\n parts.push(stack.push(value));\n ip += baseLength + paramsLength;\n }\n\n while (ip < end) {\n switch (bc[ip]) {\n case op.PUSH: // PUSH c\n parts.push(stack.push(c(bc[ip + 1])));\n ip += 2;\n break;\n\n case op.PUSH_CURR_POS: // PUSH_CURR_POS\n parts.push(stack.push('peg$currPos'));\n ip++;\n break;\n\n case op.PUSH_UNDEFINED: // PUSH_UNDEFINED\n parts.push(stack.push('void 0'));\n ip++;\n break;\n\n case op.PUSH_NULL: // PUSH_NULL\n parts.push(stack.push('null'));\n ip++;\n break;\n\n case op.PUSH_FAILED: // PUSH_FAILED\n parts.push(stack.push('peg$FAILED'));\n ip++;\n break;\n\n case op.PUSH_EMPTY_ARRAY: // PUSH_EMPTY_ARRAY\n parts.push(stack.push('[]'));\n ip++;\n break;\n\n case op.POP: // POP\n stack.pop();\n ip++;\n break;\n\n case op.POP_CURR_POS: // POP_CURR_POS\n parts.push('peg$currPos = ' + stack.pop() + ';');\n ip++;\n break;\n\n case op.POP_N: // POP_N n\n stack.pop(bc[ip + 1]);\n ip += 2;\n break;\n\n case op.NIP: // NIP\n value = stack.pop();\n stack.pop();\n parts.push(stack.push(value));\n ip++;\n break;\n\n case op.APPEND: // APPEND\n value = stack.pop();\n parts.push(stack.top() + '.push(' + value + ');');\n ip++;\n break;\n\n case op.WRAP: // WRAP n\n parts.push(\n stack.push('[' + stack.pop(bc[ip + 1]).join(', ') + ']')\n );\n ip += 2;\n break;\n\n case op.TEXT: // TEXT\n parts.push(\n stack.push('input.substring(' + stack.pop() + ', peg$currPos)')\n );\n ip++;\n break;\n\n case op.IF: // IF t, f\n compileCondition(stack.top(), 0);\n break;\n\n case op.IF_ERROR: // IF_ERROR t, f\n compileCondition(stack.top() + ' === peg$FAILED', 0);\n break;\n\n case op.IF_NOT_ERROR: // IF_NOT_ERROR t, f\n compileCondition(stack.top() + ' !== peg$FAILED', 0);\n break;\n\n case op.WHILE_NOT_ERROR: // WHILE_NOT_ERROR b\n compileLoop(stack.top() + ' !== peg$FAILED', 0);\n break;\n\n case op.MATCH_ANY: // MATCH_ANY a, f, ...\n compileCondition('input.length > peg$currPos', 0);\n break;\n\n case op.MATCH_STRING: // MATCH_STRING s, a, f, ...\n compileCondition(\n eval(ast.consts[bc[ip + 1]]).length > 1\n ? 'input.substr(peg$currPos, '\n + eval(ast.consts[bc[ip + 1]]).length\n + ') === '\n + c(bc[ip + 1])\n : 'input.charCodeAt(peg$currPos) === '\n + eval(ast.consts[bc[ip + 1]]).charCodeAt(0),\n 1\n );\n break;\n\n case op.MATCH_STRING_IC: // MATCH_STRING_IC s, a, f, ...\n compileCondition(\n 'input.substr(peg$currPos, '\n + eval(ast.consts[bc[ip + 1]]).length\n + ').toLowerCase() === '\n + c(bc[ip + 1]),\n 1\n );\n break;\n\n case op.MATCH_REGEXP: // MATCH_REGEXP r, a, f, ...\n compileCondition(\n c(bc[ip + 1]) + '.test(input.charAt(peg$currPos))',\n 1\n );\n break;\n\n case op.ACCEPT_N: // ACCEPT_N n\n parts.push(stack.push(\n bc[ip + 1] > 1\n ? 'input.substr(peg$currPos, ' + bc[ip + 1] + ')'\n : 'input.charAt(peg$currPos)'\n ));\n parts.push(\n bc[ip + 1] > 1\n ? 'peg$currPos += ' + bc[ip + 1] + ';'\n : 'peg$currPos++;'\n );\n ip += 2;\n break;\n\n case op.ACCEPT_STRING: // ACCEPT_STRING s\n parts.push(stack.push(c(bc[ip + 1])));\n parts.push(\n eval(ast.consts[bc[ip + 1]]).length > 1\n ? 'peg$currPos += ' + eval(ast.consts[bc[ip + 1]]).length + ';'\n : 'peg$currPos++;'\n );\n ip += 2;\n break;\n\n case op.FAIL: // FAIL e\n parts.push(stack.push('peg$FAILED'));\n parts.push('if (peg$silentFails === 0) { peg$fail(' + c(bc[ip + 1]) + '); }');\n ip += 2;\n break;\n\n case op.LOAD_SAVED_POS: // LOAD_SAVED_POS p\n parts.push('peg$savedPos = ' + stack.index(bc[ip + 1]) + ';');\n ip += 2;\n break;\n\n case op.UPDATE_SAVED_POS: // UPDATE_SAVED_POS\n parts.push('peg$savedPos = peg$currPos;');\n ip++;\n break;\n\n case op.CALL: // CALL f, n, pc, p1, p2, ..., pN\n compileCall();\n break;\n\n case op.RULE: // RULE r\n parts.push(stack.push(\"peg$parse\" + ast.rules[bc[ip + 1]].name + \"()\"));\n ip += 2;\n break;\n\n case op.SILENT_FAILS_ON: // SILENT_FAILS_ON\n parts.push('peg$silentFails++;');\n ip++;\n break;\n\n case op.SILENT_FAILS_OFF: // SILENT_FAILS_OFF\n parts.push('peg$silentFails--;');\n ip++;\n break;\n\n default:\n throw new Error(\"Invalid opcode: \" + bc[ip] + \".\");\n }\n }\n\n return parts.join('\\n');\n }\n\n code = compile(rule.bytecode);\n\n parts.push('function peg$parse' + rule.name + '() {');\n\n if (options.trace) {\n parts.push([\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ',',\n ' startPos = peg$currPos;'\n ].join('\\n'));\n } else {\n parts.push(\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ';'\n );\n }\n\n parts.push(indent2(generateRuleHeader(\n '\"' + js.stringEscape(rule.name) + '\"',\n asts.indexOfRule(ast, rule.name)\n )));\n parts.push(indent2(code));\n parts.push(indent2(generateRuleFooter(\n '\"' + js.stringEscape(rule.name) + '\"',\n s(0)\n )));\n\n parts.push('}');\n\n return parts.join('\\n');\n }\n\n function generateToplevel() {\n var parts = [],\n startRuleIndices, startRuleIndex,\n startRuleFunctions, startRuleFunction,\n ruleNames;\n\n parts.push([\n 'function peg$subclass(child, parent) {',\n ' function ctor() { this.constructor = child; }',\n ' ctor.prototype = parent.prototype;',\n ' child.prototype = new ctor();',\n '}',\n '',\n 'function peg$SyntaxError(message, expected, found, location) {',\n ' this.message = message;',\n ' this.expected = expected;',\n ' this.found = found;',\n ' this.location = location;',\n ' this.name = \"SyntaxError\";',\n '',\n ' if (typeof Error.captureStackTrace === \"function\") {',\n ' Error.captureStackTrace(this, peg$SyntaxError);',\n ' }',\n '}',\n '',\n 'peg$subclass(peg$SyntaxError, Error);',\n '',\n 'peg$SyntaxError.buildMessage = function(expected, found) {',\n ' var DESCRIBE_EXPECTATION_FNS = {',\n ' literal: function(expectation) {',\n ' return \"\\\\\\\"\" + literalEscape(expectation.text) + \"\\\\\\\"\";',\n ' },',\n '',\n ' \"class\": function(expectation) {',\n ' var escapedParts = \"\",',\n ' i;',\n '',\n ' for (i = 0; i < expectation.parts.length; i++) {',\n ' escapedParts += expectation.parts[i] instanceof Array',\n ' ? classEscape(expectation.parts[i][0]) + \"-\" + classEscape(expectation.parts[i][1])',\n ' : classEscape(expectation.parts[i]);',\n ' }',\n '',\n ' return \"[\" + (expectation.inverted ? \"^\" : \"\") + escapedParts + \"]\";',\n ' },',\n '',\n ' any: function(expectation) {',\n ' return \"any character\";',\n ' },',\n '',\n ' end: function(expectation) {',\n ' return \"end of input\";',\n ' },',\n '',\n ' other: function(expectation) {',\n ' return expectation.description;',\n ' }',\n ' };',\n '',\n ' function hex(ch) {',\n ' return ch.charCodeAt(0).toString(16).toUpperCase();',\n ' }',\n '',\n ' function literalEscape(s) {',\n ' return s',\n ' .replace(/\\\\\\\\/g, \\'\\\\\\\\\\\\\\\\\\')', // backslash\n ' .replace(/\"/g, \\'\\\\\\\\\"\\')', // closing double quote\n ' .replace(/\\\\0/g, \\'\\\\\\\\0\\')', // null\n ' .replace(/\\\\t/g, \\'\\\\\\\\t\\')', // horizontal tab\n ' .replace(/\\\\n/g, \\'\\\\\\\\n\\')', // line feed\n ' .replace(/\\\\r/g, \\'\\\\\\\\r\\')', // carriage return\n ' .replace(/[\\\\x00-\\\\x0F]/g, function(ch) { return \\'\\\\\\\\x0\\' + hex(ch); })',\n ' .replace(/[\\\\x10-\\\\x1F\\\\x7F-\\\\x9F]/g, function(ch) { return \\'\\\\\\\\x\\' + hex(ch); });',\n ' }',\n '',\n ' function classEscape(s) {',\n ' return s',\n ' .replace(/\\\\\\\\/g, \\'\\\\\\\\\\\\\\\\\\')', // backslash\n ' .replace(/\\\\]/g, \\'\\\\\\\\]\\')', // closing bracket\n ' .replace(/\\\\^/g, \\'\\\\\\\\^\\')', // caret\n ' .replace(/-/g, \\'\\\\\\\\-\\')', // dash\n ' .replace(/\\\\0/g, \\'\\\\\\\\0\\')', // null\n ' .replace(/\\\\t/g, \\'\\\\\\\\t\\')', // horizontal tab\n ' .replace(/\\\\n/g, \\'\\\\\\\\n\\')', // line feed\n ' .replace(/\\\\r/g, \\'\\\\\\\\r\\')', // carriage return\n ' .replace(/[\\\\x00-\\\\x0F]/g, function(ch) { return \\'\\\\\\\\x0\\' + hex(ch); })',\n ' .replace(/[\\\\x10-\\\\x1F\\\\x7F-\\\\x9F]/g, function(ch) { return \\'\\\\\\\\x\\' + hex(ch); });',\n ' }',\n '',\n ' function describeExpectation(expectation) {',\n ' return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);',\n ' }',\n '',\n ' function describeExpected(expected) {',\n ' var descriptions = new Array(expected.length),',\n ' i, j;',\n '',\n ' for (i = 0; i < expected.length; i++) {',\n ' descriptions[i] = describeExpectation(expected[i]);',\n ' }',\n '',\n ' descriptions.sort();',\n '',\n ' if (descriptions.length > 0) {',\n ' for (i = 1, j = 1; i < descriptions.length; i++) {',\n ' if (descriptions[i - 1] !== descriptions[i]) {',\n ' descriptions[j] = descriptions[i];',\n ' j++;',\n ' }',\n ' }',\n ' descriptions.length = j;',\n ' }',\n '',\n ' switch (descriptions.length) {',\n ' case 1:',\n ' return descriptions[0];',\n '',\n ' case 2:',\n ' return descriptions[0] + \" or \" + descriptions[1];',\n '',\n ' default:',\n ' return descriptions.slice(0, -1).join(\", \")',\n ' + \", or \"',\n ' + descriptions[descriptions.length - 1];',\n ' }',\n ' }',\n '',\n ' function describeFound(found) {',\n ' return found ? \"\\\\\"\" + literalEscape(found) + \"\\\\\"\" : \"end of input\";',\n ' }',\n '',\n ' return \"Expected \" + describeExpected(expected) + \" but \" + describeFound(found) + \" found.\";',\n '};',\n ''\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n 'function peg$DefaultTracer() {',\n ' this.indentLevel = 0;',\n '}',\n '',\n 'peg$DefaultTracer.prototype.trace = function(event) {',\n ' var that = this;',\n '',\n ' function log(event) {',\n ' function repeat(string, n) {',\n ' var result = \"\", i;',\n '',\n ' for (i = 0; i < n; i++) {',\n ' result += string;',\n ' }',\n '',\n ' return result;',\n ' }',\n '',\n ' function pad(string, length) {',\n ' return string + repeat(\" \", length - string.length);',\n ' }',\n '',\n ' if (typeof console === \"object\") {', // IE 8-10\n ' console.log(',\n ' event.location.start.line + \":\" + event.location.start.column + \"-\"',\n ' + event.location.end.line + \":\" + event.location.end.column + \" \"',\n ' + pad(event.type, 10) + \" \"',\n ' + repeat(\" \", that.indentLevel) + event.rule',\n ' );',\n ' }',\n ' }',\n '',\n ' switch (event.type) {',\n ' case \"rule.enter\":',\n ' log(event);',\n ' this.indentLevel++;',\n ' break;',\n '',\n ' case \"rule.match\":',\n ' this.indentLevel--;',\n ' log(event);',\n ' break;',\n '',\n ' case \"rule.fail\":',\n ' this.indentLevel--;',\n ' log(event);',\n ' break;',\n '',\n ' default:',\n ' throw new Error(\"Invalid event type: \" + event.type + \".\");',\n ' }',\n '};',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n 'function peg$parse(input, options) {',\n ' options = options !== void 0 ? options : {};',\n '',\n ' var peg$FAILED = {},',\n ''\n ].join('\\n'));\n\n if (options.optimize === \"size\") {\n startRuleIndices = '{ '\n + arrays.map(\n options.allowedStartRules,\n function(r) { return r + ': ' + asts.indexOfRule(ast, r); }\n ).join(', ')\n + ' }';\n startRuleIndex = asts.indexOfRule(ast, options.allowedStartRules[0]);\n\n parts.push([\n ' peg$startRuleIndices = ' + startRuleIndices + ',',\n ' peg$startRuleIndex = ' + startRuleIndex + ','\n ].join('\\n'));\n } else {\n startRuleFunctions = '{ '\n + arrays.map(\n options.allowedStartRules,\n function(r) { return r + ': peg$parse' + r; }\n ).join(', ')\n + ' }';\n startRuleFunction = 'peg$parse' + options.allowedStartRules[0];\n\n parts.push([\n ' peg$startRuleFunctions = ' + startRuleFunctions + ',',\n ' peg$startRuleFunction = ' + startRuleFunction + ','\n ].join('\\n'));\n }\n\n parts.push('');\n\n parts.push(indent6(generateTables()));\n\n parts.push([\n '',\n ' peg$currPos = 0,',\n ' peg$savedPos = 0,',\n ' peg$posDetailsCache = [{ line: 1, column: 1 }],',\n ' peg$maxFailPos = 0,',\n ' peg$maxFailExpected = [],',\n ' peg$silentFails = 0,', // 0 = report failures, > 0 = silence failures\n ''\n ].join('\\n'));\n\n if (options.cache) {\n parts.push([\n ' peg$resultsCache = {},',\n ''\n ].join('\\n'));\n }\n\n if (options.trace) {\n if (options.optimize === \"size\") {\n ruleNames = '['\n + arrays.map(\n ast.rules,\n function(r) { return '\"' + js.stringEscape(r.name) + '\"'; }\n ).join(', ')\n + ']';\n\n parts.push([\n ' peg$ruleNames = ' + ruleNames + ',',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' peg$tracer = \"tracer\" in options ? options.tracer : new peg$DefaultTracer(),',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' peg$result;',\n ''\n ].join('\\n'));\n\n if (options.optimize === \"size\") {\n parts.push([\n ' if (\"startRule\" in options) {',\n ' if (!(options.startRule in peg$startRuleIndices)) {',\n ' throw new Error(\"Can\\'t start parsing from rule \\\\\"\" + options.startRule + \"\\\\\".\");',\n ' }',\n '',\n ' peg$startRuleIndex = peg$startRuleIndices[options.startRule];',\n ' }'\n ].join('\\n'));\n } else {\n parts.push([\n ' if (\"startRule\" in options) {',\n ' if (!(options.startRule in peg$startRuleFunctions)) {',\n ' throw new Error(\"Can\\'t start parsing from rule \\\\\"\" + options.startRule + \"\\\\\".\");',\n ' }',\n '',\n ' peg$startRuleFunction = peg$startRuleFunctions[options.startRule];',\n ' }'\n ].join('\\n'));\n }\n\n parts.push([\n '',\n ' function text() {',\n ' return input.substring(peg$savedPos, peg$currPos);',\n ' }',\n '',\n ' function location() {',\n ' return peg$computeLocation(peg$savedPos, peg$currPos);',\n ' }',\n '',\n ' function expected(description, location) {',\n ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)',\n '',\n ' throw peg$buildStructuredError(',\n ' [peg$otherExpectation(description)],',\n ' input.substring(peg$savedPos, peg$currPos),',\n ' location',\n ' );',\n ' }',\n '',\n ' function error(message, location) {',\n ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)',\n '',\n ' throw peg$buildSimpleError(message, location);',\n ' }',\n '',\n ' function peg$literalExpectation(text, ignoreCase) {',\n ' return { type: \"literal\", text: text, ignoreCase: ignoreCase };',\n ' }',\n '',\n ' function peg$classExpectation(parts, inverted, ignoreCase) {',\n ' return { type: \"class\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };',\n ' }',\n '',\n ' function peg$anyExpectation() {',\n ' return { type: \"any\" };',\n ' }',\n '',\n ' function peg$endExpectation() {',\n ' return { type: \"end\" };',\n ' }',\n '',\n ' function peg$otherExpectation(description) {',\n ' return { type: \"other\", description: description };',\n ' }',\n '',\n ' function peg$computePosDetails(pos) {',\n ' var details = peg$posDetailsCache[pos], p;',\n '',\n ' if (details) {',\n ' return details;',\n ' } else {',\n ' p = pos - 1;',\n ' while (!peg$posDetailsCache[p]) {',\n ' p--;',\n ' }',\n '',\n ' details = peg$posDetailsCache[p];',\n ' details = {',\n ' line: details.line,',\n ' column: details.column',\n ' };',\n '',\n ' while (p < pos) {',\n ' if (input.charCodeAt(p) === 10) {',\n ' details.line++;',\n ' details.column = 1;',\n ' } else {',\n ' details.column++;',\n ' }',\n '',\n ' p++;',\n ' }',\n '',\n ' peg$posDetailsCache[pos] = details;',\n ' return details;',\n ' }',\n ' }',\n '',\n ' function peg$computeLocation(startPos, endPos) {',\n ' var startPosDetails = peg$computePosDetails(startPos),',\n ' endPosDetails = peg$computePosDetails(endPos);',\n '',\n ' return {',\n ' start: {',\n ' offset: startPos,',\n ' line: startPosDetails.line,',\n ' column: startPosDetails.column',\n ' },',\n ' end: {',\n ' offset: endPos,',\n ' line: endPosDetails.line,',\n ' column: endPosDetails.column',\n ' }',\n ' };',\n ' }',\n '',\n ' function peg$fail(expected) {',\n ' if (peg$currPos < peg$maxFailPos) { return; }',\n '',\n ' if (peg$currPos > peg$maxFailPos) {',\n ' peg$maxFailPos = peg$currPos;',\n ' peg$maxFailExpected = [];',\n ' }',\n '',\n ' peg$maxFailExpected.push(expected);',\n ' }',\n '',\n ' function peg$buildSimpleError(message, location) {',\n ' return new peg$SyntaxError(message, null, null, location);',\n ' }',\n '',\n ' function peg$buildStructuredError(expected, found, location) {',\n ' return new peg$SyntaxError(',\n ' peg$SyntaxError.buildMessage(expected, found),',\n ' expected,',\n ' found,',\n ' location',\n ' );',\n ' }',\n ''\n ].join('\\n'));\n\n if (options.optimize === \"size\") {\n parts.push(indent2(generateInterpreter()));\n parts.push('');\n } else {\n arrays.each(ast.rules, function(rule) {\n parts.push(indent2(generateRuleFunction(rule)));\n parts.push('');\n });\n }\n\n if (ast.initializer) {\n parts.push(indent2(ast.initializer.code));\n parts.push('');\n }\n\n if (options.optimize === \"size\") {\n parts.push(' peg$result = peg$parseRule(peg$startRuleIndex);');\n } else {\n parts.push(' peg$result = peg$startRuleFunction();');\n }\n\n parts.push([\n '',\n ' if (peg$result !== peg$FAILED && peg$currPos === input.length) {',\n ' return peg$result;',\n ' } else {',\n ' if (peg$result !== peg$FAILED && peg$currPos < input.length) {',\n ' peg$fail(peg$endExpectation());',\n ' }',\n '',\n ' throw peg$buildStructuredError(',\n ' peg$maxFailExpected,',\n ' peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,',\n ' peg$maxFailPos < input.length',\n ' ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)',\n ' : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)',\n ' );',\n ' }',\n '}'\n ].join('\\n'));\n\n return parts.join('\\n');\n }\n\n function generateWrapper(toplevelCode) {\n function generateGeneratedByComment() {\n return [\n '/*',\n ' * Generated by PEG.js 0.10.0.',\n ' *',\n ' * http://pegjs.org/',\n ' */'\n ].join('\\n');\n }\n\n function generateParserObject() {\n return options.trace\n ? [\n '{',\n ' SyntaxError: peg$SyntaxError,',\n ' DefaultTracer: peg$DefaultTracer,',\n ' parse: peg$parse',\n '}'\n ].join('\\n')\n : [\n '{',\n ' SyntaxError: peg$SyntaxError,',\n ' parse: peg$parse',\n '}'\n ].join('\\n');\n }\n\n var generators = {\n bare: function() {\n return [\n generateGeneratedByComment(),\n '(function() {',\n ' \"use strict\";',\n '',\n indent2(toplevelCode),\n '',\n indent2('return ' + generateParserObject() + ';'),\n '})()'\n ].join('\\n');\n },\n\n commonjs: function() {\n var parts = [],\n dependencyVars = objects.keys(options.dependencies),\n requires = arrays.map(\n dependencyVars,\n function(variable) {\n return variable\n + ' = require(\"'\n + js.stringEscape(options.dependencies[variable])\n + '\")';\n }\n );\n\n parts.push([\n generateGeneratedByComment(),\n '',\n '\"use strict\";',\n ''\n ].join('\\n'));\n\n if (requires.length > 0) {\n parts.push('var ' + requires.join(', ') + ';');\n parts.push('');\n }\n\n parts.push([\n toplevelCode,\n '',\n 'module.exports = ' + generateParserObject() + ';',\n ''\n ].join('\\n'));\n\n return parts.join('\\n');\n },\n\n amd: function() {\n var dependencyIds = objects.values(options.dependencies),\n dependencyVars = objects.keys(options.dependencies),\n dependencies = '['\n + arrays.map(\n dependencyIds,\n function(id) { return '\"' + js.stringEscape(id) + '\"'; }\n ).join(', ')\n + ']',\n params = dependencyVars.join(', ');\n\n return [\n generateGeneratedByComment(),\n 'define(' + dependencies + ', function(' + params + ') {',\n ' \"use strict\";',\n '',\n indent2(toplevelCode),\n '',\n indent2('return ' + generateParserObject() + ';'),\n '});',\n ''\n ].join('\\n');\n },\n\n globals: function() {\n return [\n generateGeneratedByComment(),\n '(function(root) {',\n ' \"use strict\";',\n '',\n indent2(toplevelCode),\n '',\n indent2('root.' + options.exportVar + ' = ' + generateParserObject() + ';'),\n '})(this);',\n ''\n ].join('\\n');\n },\n\n umd: function() {\n var parts = [],\n dependencyIds = objects.values(options.dependencies),\n dependencyVars = objects.keys(options.dependencies),\n dependencies = '['\n + arrays.map(\n dependencyIds,\n function(id) { return '\"' + js.stringEscape(id) + '\"'; }\n ).join(', ')\n + ']',\n requires = arrays.map(\n dependencyIds,\n function(id) { return 'require(\"' + js.stringEscape(id) + '\")'; }\n ).join(', '),\n params = dependencyVars.join(', ');\n\n parts.push([\n generateGeneratedByComment(),\n '(function(root, factory) {',\n ' if (typeof define === \"function\" && define.amd) {',\n ' define(' + dependencies + ', factory);',\n ' } else if (typeof module === \"object\" && module.exports) {',\n ' module.exports = factory(' + requires + ');'\n ].join('\\n'));\n\n if (options.exportVar !== null) {\n parts.push([\n ' } else {',\n ' root.' + options.exportVar + ' = factory();'\n ].join('\\n'));\n }\n\n parts.push([\n ' }',\n '})(this, function(' + params + ') {',\n ' \"use strict\";',\n '',\n indent2(toplevelCode),\n '',\n indent2('return ' + generateParserObject() + ';'),\n '});',\n ''\n ].join('\\n'));\n\n return parts.join('\\n');\n }\n };\n\n return generators[options.format]();\n }\n\n ast.code = generateWrapper(generateToplevel());\n}","function t(e){switch(e.type){case V.AssignmentExpression:case V.ArrayExpression:case V.ArrayPattern:case V.BinaryExpression:case V.CallExpression:case V.ConditionalExpression:case V.ClassExpression:case V.ExportBatchSpecifier:case V.ExportSpecifier:case V.FunctionExpression:case V.Identifier:case V.ImportSpecifier:case V.Literal:case V.LogicalExpression:case V.MemberExpression:case V.MethodDefinition:case V.NewExpression:case V.ObjectExpression:case V.ObjectPattern:case V.Property:case V.SequenceExpression:case V.ThisExpression:case V.UnaryExpression:case V.UpdateExpression:case V.YieldExpression:return!0}return!1}","function $af9a22e3e9ab50b7$var$reasonml(hljs) {\n function orReValues(ops) {\n return ops.map(function(op) {\n return op.split(\"\").map(function(char) {\n return \"\\\\\" + char;\n }).join(\"\");\n }).join(\"|\");\n }\n const RE_IDENT = \"~?[a-z$_][0-9a-zA-Z$_]*\";\n const RE_MODULE_IDENT = \"`?[A-Z$_][0-9a-zA-Z$_]*\";\n const RE_PARAM_TYPEPARAM = \"'?[a-z$_][0-9a-z$_]*\";\n const RE_PARAM_TYPE = \"\\\\s*:\\\\s*[a-z$_][0-9a-z$_]*(\\\\(\\\\s*(\" + RE_PARAM_TYPEPARAM + \"\\\\s*(,\" + RE_PARAM_TYPEPARAM + \"\\\\s*)*)?\\\\))?\";\n const RE_PARAM = RE_IDENT + \"(\" + RE_PARAM_TYPE + \"){0,2}\";\n const RE_OPERATOR = \"(\" + orReValues([\n \"||\",\n \"++\",\n \"**\",\n \"+.\",\n \"*\",\n \"/\",\n \"*.\",\n \"/.\",\n \"...\"\n ]) + \"|\\\\|>|&&|==|===)\";\n const RE_OPERATOR_SPACED = \"\\\\s+\" + RE_OPERATOR + \"\\\\s+\";\n const KEYWORDS = {\n keyword: \"and as asr assert begin class constraint do done downto else end exception external for fun function functor if in include inherit initializer land lazy let lor lsl lsr lxor match method mod module mutable new nonrec object of open or private rec sig struct then to try type val virtual when while with\",\n built_in: \"array bool bytes char exn|5 float int int32 int64 list lazy_t|5 nativeint|5 ref string unit \",\n literal: \"true false\"\n };\n const RE_NUMBER = \"\\\\b(0[xX][a-fA-F0-9_]+[Lln]?|0[oO][0-7_]+[Lln]?|0[bB][01_]+[Lln]?|[0-9][0-9_]*([Lln]|(\\\\.[0-9_]*)?([eE][-+]?[0-9_]+)?)?)\";\n const NUMBER_MODE = {\n className: \"number\",\n relevance: 0,\n variants: [\n {\n begin: RE_NUMBER\n },\n {\n begin: \"\\\\(-\" + RE_NUMBER + \"\\\\)\"\n }\n ]\n };\n const OPERATOR_MODE = {\n className: \"operator\",\n relevance: 0,\n begin: RE_OPERATOR\n };\n const LIST_CONTENTS_MODES = [\n {\n className: \"identifier\",\n relevance: 0,\n begin: RE_IDENT\n },\n OPERATOR_MODE,\n NUMBER_MODE\n ];\n const MODULE_ACCESS_CONTENTS = [\n hljs.QUOTE_STRING_MODE,\n OPERATOR_MODE,\n {\n className: \"module\",\n begin: \"\\\\b\" + RE_MODULE_IDENT,\n returnBegin: true,\n end: \".\",\n contains: [\n {\n className: \"identifier\",\n begin: RE_MODULE_IDENT,\n relevance: 0\n }\n ]\n }\n ];\n const PARAMS_CONTENTS = [\n {\n className: \"module\",\n begin: \"\\\\b\" + RE_MODULE_IDENT,\n returnBegin: true,\n end: \".\",\n relevance: 0,\n contains: [\n {\n className: \"identifier\",\n begin: RE_MODULE_IDENT,\n relevance: 0\n }\n ]\n }\n ];\n const PARAMS_MODE = {\n begin: RE_IDENT,\n end: \"(,|\\\\n|\\\\))\",\n relevance: 0,\n contains: [\n OPERATOR_MODE,\n {\n className: \"typing\",\n begin: \":\",\n end: \"(,|\\\\n)\",\n returnBegin: true,\n relevance: 0,\n contains: PARAMS_CONTENTS\n }\n ]\n };\n const FUNCTION_BLOCK_MODE = {\n className: \"function\",\n relevance: 0,\n keywords: KEYWORDS,\n variants: [\n {\n begin: \"\\\\s(\\\\(\\\\.?.*?\\\\)|\" + RE_IDENT + \")\\\\s*=>\",\n end: \"\\\\s*=>\",\n returnBegin: true,\n relevance: 0,\n contains: [\n {\n className: \"params\",\n variants: [\n {\n begin: RE_IDENT\n },\n {\n begin: RE_PARAM\n },\n {\n begin: /\\(\\s*\\)/\n }\n ]\n }\n ]\n },\n {\n begin: \"\\\\s\\\\(\\\\.?[^;\\\\|]*\\\\)\\\\s*=>\",\n end: \"\\\\s=>\",\n returnBegin: true,\n relevance: 0,\n contains: [\n {\n className: \"params\",\n relevance: 0,\n variants: [\n PARAMS_MODE\n ]\n }\n ]\n },\n {\n begin: \"\\\\(\\\\.\\\\s\" + RE_IDENT + \"\\\\)\\\\s*=>\"\n }\n ]\n };\n MODULE_ACCESS_CONTENTS.push(FUNCTION_BLOCK_MODE);\n const CONSTRUCTOR_MODE = {\n className: \"constructor\",\n begin: RE_MODULE_IDENT + \"\\\\(\",\n end: \"\\\\)\",\n illegal: \"\\\\n\",\n keywords: KEYWORDS,\n contains: [\n hljs.QUOTE_STRING_MODE,\n OPERATOR_MODE,\n {\n className: \"params\",\n begin: \"\\\\b\" + RE_IDENT\n }\n ]\n };\n const PATTERN_MATCH_BLOCK_MODE = {\n className: \"pattern-match\",\n begin: \"\\\\|\",\n returnBegin: true,\n keywords: KEYWORDS,\n end: \"=>\",\n relevance: 0,\n contains: [\n CONSTRUCTOR_MODE,\n OPERATOR_MODE,\n {\n relevance: 0,\n className: \"constructor\",\n begin: RE_MODULE_IDENT\n }\n ]\n };\n const MODULE_ACCESS_MODE = {\n className: \"module-access\",\n keywords: KEYWORDS,\n returnBegin: true,\n variants: [\n {\n begin: \"\\\\b(\" + RE_MODULE_IDENT + \"\\\\.)+\" + RE_IDENT\n },\n {\n begin: \"\\\\b(\" + RE_MODULE_IDENT + \"\\\\.)+\\\\(\",\n end: \"\\\\)\",\n returnBegin: true,\n contains: [\n FUNCTION_BLOCK_MODE,\n {\n begin: \"\\\\(\",\n end: \"\\\\)\",\n skip: true\n }\n ].concat(MODULE_ACCESS_CONTENTS)\n },\n {\n begin: \"\\\\b(\" + RE_MODULE_IDENT + \"\\\\.)+\\\\{\",\n end: /\\}/\n }\n ],\n contains: MODULE_ACCESS_CONTENTS\n };\n PARAMS_CONTENTS.push(MODULE_ACCESS_MODE);\n return {\n name: \"ReasonML\",\n aliases: [\n \"re\"\n ],\n keywords: KEYWORDS,\n illegal: \"(:-|:=|\\\\$\\\\{|\\\\+=)\",\n contains: [\n hljs.COMMENT(\"/\\\\*\", \"\\\\*/\", {\n illegal: \"^(#,\\\\/\\\\/)\"\n }),\n {\n className: \"character\",\n begin: \"'(\\\\\\\\[^']+|[^'])'\",\n illegal: \"\\\\n\",\n relevance: 0\n },\n hljs.QUOTE_STRING_MODE,\n {\n className: \"literal\",\n begin: \"\\\\(\\\\)\",\n relevance: 0\n },\n {\n className: \"literal\",\n begin: \"\\\\[\\\\|\",\n end: \"\\\\|\\\\]\",\n relevance: 0,\n contains: LIST_CONTENTS_MODES\n },\n {\n className: \"literal\",\n begin: \"\\\\[\",\n end: \"\\\\]\",\n relevance: 0,\n contains: LIST_CONTENTS_MODES\n },\n CONSTRUCTOR_MODE,\n {\n className: \"operator\",\n begin: RE_OPERATOR_SPACED,\n illegal: \"-->\",\n relevance: 0\n },\n NUMBER_MODE,\n hljs.C_LINE_COMMENT_MODE,\n PATTERN_MATCH_BLOCK_MODE,\n FUNCTION_BLOCK_MODE,\n {\n className: \"module-def\",\n begin: \"\\\\bmodule\\\\s+\" + RE_IDENT + \"\\\\s+\" + RE_MODULE_IDENT + \"\\\\s+=\\\\s+\\\\{\",\n end: /\\}/,\n returnBegin: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n className: \"module\",\n relevance: 0,\n begin: RE_MODULE_IDENT\n },\n {\n begin: /\\{/,\n end: /\\}/,\n skip: true\n }\n ].concat(MODULE_ACCESS_CONTENTS)\n },\n MODULE_ACCESS_MODE\n ]\n };\n}","function Generator(){}","function Generator(){}","function Generator(){}","function Generator(){}","function Generator(){}","function Generator(){}","function ruby(hljs) {\n var RUBY_METHOD_RE = '[a-zA-Z_]\\\\w*[!?=]?|[-+~]\\\\@|<<|>>|=~|===?|<=>|[<>]=?|\\\\*\\\\*|[-/+%^&*~`|]|\\\\[\\\\]=?';\n var RUBY_KEYWORDS = {\n keyword:\n 'and then defined module in return redo if BEGIN retry end for self when ' +\n 'next until do begin unless END rescue else break undef not super class case ' +\n 'require yield alias while ensure elsif or include attr_reader attr_writer attr_accessor',\n literal:\n 'true false nil'\n };\n var YARDOCTAG = {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n };\n var IRB_OBJECT = {\n begin: '#<', end: '>'\n };\n var COMMENT_MODES = [\n hljs.COMMENT(\n '#',\n '$',\n {\n contains: [YARDOCTAG]\n }\n ),\n hljs.COMMENT(\n '^\\\\=begin',\n '^\\\\=end',\n {\n contains: [YARDOCTAG],\n relevance: 10\n }\n ),\n hljs.COMMENT('^__END__', '\\\\n$')\n ];\n var SUBST = {\n className: 'subst',\n begin: '#\\\\{', end: '}',\n keywords: RUBY_KEYWORDS\n };\n var STRING = {\n className: 'string',\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\n variants: [\n {begin: /'/, end: /'/},\n {begin: /\"/, end: /\"/},\n {begin: /`/, end: /`/},\n {begin: '%[qQwWx]?\\\\(', end: '\\\\)'},\n {begin: '%[qQwWx]?\\\\[', end: '\\\\]'},\n {begin: '%[qQwWx]?{', end: '}'},\n {begin: '%[qQwWx]?<', end: '>'},\n {begin: '%[qQwWx]?/', end: '/'},\n {begin: '%[qQwWx]?%', end: '%'},\n {begin: '%[qQwWx]?-', end: '-'},\n {begin: '%[qQwWx]?\\\\|', end: '\\\\|'},\n {\n // \\B in the beginning suppresses recognition of ?-sequences where ?\n // is the last character of a preceding identifier, as in: `func?4`\n begin: /\\B\\?(\\\\\\d{1,3}|\\\\x[A-Fa-f0-9]{1,2}|\\\\u[A-Fa-f0-9]{4}|\\\\?\\S)\\b/\n },\n { // heredocs\n begin: /<<[-~]?'?(\\w+)(?:.|\\n)*?\\n\\s*\\1\\b/,\n returnBegin: true,\n contains: [\n { begin: /<<[-~]?'?/ },\n hljs.END_SAME_AS_BEGIN({\n begin: /(\\w+)/, end: /(\\w+)/,\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\n })\n ]\n }\n ]\n };\n var PARAMS = {\n className: 'params',\n begin: '\\\\(', end: '\\\\)', endsParent: true,\n keywords: RUBY_KEYWORDS\n };\n\n var RUBY_DEFAULT_CONTAINS = [\n STRING,\n IRB_OBJECT,\n {\n className: 'class',\n beginKeywords: 'class module', end: '$|;',\n illegal: /=/,\n contains: [\n hljs.inherit(hljs.TITLE_MODE, {begin: '[A-Za-z_]\\\\w*(::\\\\w+)*(\\\\?|\\\\!)?'}),\n {\n begin: '<\\\\s*',\n contains: [{\n begin: '(' + hljs.IDENT_RE + '::)?' + hljs.IDENT_RE\n }]\n }\n ].concat(COMMENT_MODES)\n },\n {\n className: 'function',\n beginKeywords: 'def', end: '$|;',\n contains: [\n hljs.inherit(hljs.TITLE_MODE, {begin: RUBY_METHOD_RE}),\n PARAMS\n ].concat(COMMENT_MODES)\n },\n {\n // swallow namespace qualifiers before symbols\n begin: hljs.IDENT_RE + '::'\n },\n {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '(\\\\!|\\\\?)?:',\n relevance: 0\n },\n {\n className: 'symbol',\n begin: ':(?!\\\\s)',\n contains: [STRING, {begin: RUBY_METHOD_RE}],\n relevance: 0\n },\n {\n className: 'number',\n begin: '(\\\\b0[0-7_]+)|(\\\\b0x[0-9a-fA-F_]+)|(\\\\b[1-9][0-9_]*(\\\\.[0-9_]+)?)|[0_]\\\\b',\n relevance: 0\n },\n {\n begin: '(\\\\$\\\\W)|((\\\\$|\\\\@\\\\@?)(\\\\w+))' // variables\n },\n {\n className: 'params',\n begin: /\\|/, end: /\\|/,\n keywords: RUBY_KEYWORDS\n },\n { // regexp container\n begin: '(' + hljs.RE_STARTERS_RE + '|unless)\\\\s*',\n keywords: 'unless',\n contains: [\n IRB_OBJECT,\n {\n className: 'regexp',\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\n illegal: /\\n/,\n variants: [\n {begin: '/', end: '/[a-z]*'},\n {begin: '%r{', end: '}[a-z]*'},\n {begin: '%r\\\\(', end: '\\\\)[a-z]*'},\n {begin: '%r!', end: '![a-z]*'},\n {begin: '%r\\\\[', end: '\\\\][a-z]*'}\n ]\n }\n ].concat(COMMENT_MODES),\n relevance: 0\n }\n ].concat(COMMENT_MODES);\n\n SUBST.contains = RUBY_DEFAULT_CONTAINS;\n PARAMS.contains = RUBY_DEFAULT_CONTAINS;\n\n var SIMPLE_PROMPT = \"[>?]>\";\n var DEFAULT_PROMPT = \"[\\\\w#]+\\\\(\\\\w+\\\\):\\\\d+:\\\\d+>\";\n var RVM_PROMPT = \"(\\\\w+-)?\\\\d+\\\\.\\\\d+\\\\.\\\\d(p\\\\d+)?[^>]+>\";\n\n var IRB_DEFAULT = [\n {\n begin: /^\\s*=>/,\n starts: {\n end: '$', contains: RUBY_DEFAULT_CONTAINS\n }\n },\n {\n className: 'meta',\n begin: '^('+SIMPLE_PROMPT+\"|\"+DEFAULT_PROMPT+'|'+RVM_PROMPT+')',\n starts: {\n end: '$', contains: RUBY_DEFAULT_CONTAINS\n }\n }\n ];\n\n return {\n name: 'Ruby',\n aliases: ['rb', 'gemspec', 'podspec', 'thor', 'irb'],\n keywords: RUBY_KEYWORDS,\n illegal: /\\/\\*/,\n contains: COMMENT_MODES.concat(IRB_DEFAULT).concat(RUBY_DEFAULT_CONTAINS)\n };\n}","function ruby(hljs) {\n var RUBY_METHOD_RE = '[a-zA-Z_]\\\\w*[!?=]?|[-+~]\\\\@|<<|>>|=~|===?|<=>|[<>]=?|\\\\*\\\\*|[-/+%^&*~`|]|\\\\[\\\\]=?';\n var RUBY_KEYWORDS = {\n keyword:\n 'and then defined module in return redo if BEGIN retry end for self when ' +\n 'next until do begin unless END rescue else break undef not super class case ' +\n 'require yield alias while ensure elsif or include attr_reader attr_writer attr_accessor',\n literal:\n 'true false nil'\n };\n var YARDOCTAG = {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n };\n var IRB_OBJECT = {\n begin: '#<', end: '>'\n };\n var COMMENT_MODES = [\n hljs.COMMENT(\n '#',\n '$',\n {\n contains: [YARDOCTAG]\n }\n ),\n hljs.COMMENT(\n '^\\\\=begin',\n '^\\\\=end',\n {\n contains: [YARDOCTAG],\n relevance: 10\n }\n ),\n hljs.COMMENT('^__END__', '\\\\n$')\n ];\n var SUBST = {\n className: 'subst',\n begin: '#\\\\{', end: '}',\n keywords: RUBY_KEYWORDS\n };\n var STRING = {\n className: 'string',\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\n variants: [\n {begin: /'/, end: /'/},\n {begin: /\"/, end: /\"/},\n {begin: /`/, end: /`/},\n {begin: '%[qQwWx]?\\\\(', end: '\\\\)'},\n {begin: '%[qQwWx]?\\\\[', end: '\\\\]'},\n {begin: '%[qQwWx]?{', end: '}'},\n {begin: '%[qQwWx]?<', end: '>'},\n {begin: '%[qQwWx]?/', end: '/'},\n {begin: '%[qQwWx]?%', end: '%'},\n {begin: '%[qQwWx]?-', end: '-'},\n {begin: '%[qQwWx]?\\\\|', end: '\\\\|'},\n {\n // \\B in the beginning suppresses recognition of ?-sequences where ?\n // is the last character of a preceding identifier, as in: `func?4`\n begin: /\\B\\?(\\\\\\d{1,3}|\\\\x[A-Fa-f0-9]{1,2}|\\\\u[A-Fa-f0-9]{4}|\\\\?\\S)\\b/\n },\n { // heredocs\n begin: /<<[-~]?'?(\\w+)(?:.|\\n)*?\\n\\s*\\1\\b/,\n returnBegin: true,\n contains: [\n { begin: /<<[-~]?'?/ },\n { begin: /\\w+/,\n endSameAsBegin: true,\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\n }\n ]\n }\n ]\n };\n var PARAMS = {\n className: 'params',\n begin: '\\\\(', end: '\\\\)', endsParent: true,\n keywords: RUBY_KEYWORDS\n };\n\n var RUBY_DEFAULT_CONTAINS = [\n STRING,\n IRB_OBJECT,\n {\n className: 'class',\n beginKeywords: 'class module', end: '$|;',\n illegal: /=/,\n contains: [\n hljs.inherit(hljs.TITLE_MODE, {begin: '[A-Za-z_]\\\\w*(::\\\\w+)*(\\\\?|\\\\!)?'}),\n {\n begin: '<\\\\s*',\n contains: [{\n begin: '(' + hljs.IDENT_RE + '::)?' + hljs.IDENT_RE\n }]\n }\n ].concat(COMMENT_MODES)\n },\n {\n className: 'function',\n beginKeywords: 'def', end: '$|;',\n contains: [\n hljs.inherit(hljs.TITLE_MODE, {begin: RUBY_METHOD_RE}),\n PARAMS\n ].concat(COMMENT_MODES)\n },\n {\n // swallow namespace qualifiers before symbols\n begin: hljs.IDENT_RE + '::'\n },\n {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '(\\\\!|\\\\?)?:',\n relevance: 0\n },\n {\n className: 'symbol',\n begin: ':(?!\\\\s)',\n contains: [STRING, {begin: RUBY_METHOD_RE}],\n relevance: 0\n },\n {\n className: 'number',\n begin: '(\\\\b0[0-7_]+)|(\\\\b0x[0-9a-fA-F_]+)|(\\\\b[1-9][0-9_]*(\\\\.[0-9_]+)?)|[0_]\\\\b',\n relevance: 0\n },\n {\n begin: '(\\\\$\\\\W)|((\\\\$|\\\\@\\\\@?)(\\\\w+))' // variables\n },\n {\n className: 'params',\n begin: /\\|/, end: /\\|/,\n keywords: RUBY_KEYWORDS\n },\n { // regexp container\n begin: '(' + hljs.RE_STARTERS_RE + '|unless)\\\\s*',\n keywords: 'unless',\n contains: [\n IRB_OBJECT,\n {\n className: 'regexp',\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\n illegal: /\\n/,\n variants: [\n {begin: '/', end: '/[a-z]*'},\n {begin: '%r{', end: '}[a-z]*'},\n {begin: '%r\\\\(', end: '\\\\)[a-z]*'},\n {begin: '%r!', end: '![a-z]*'},\n {begin: '%r\\\\[', end: '\\\\][a-z]*'}\n ]\n }\n ].concat(COMMENT_MODES),\n relevance: 0\n }\n ].concat(COMMENT_MODES);\n\n SUBST.contains = RUBY_DEFAULT_CONTAINS;\n PARAMS.contains = RUBY_DEFAULT_CONTAINS;\n\n var SIMPLE_PROMPT = \"[>?]>\";\n var DEFAULT_PROMPT = \"[\\\\w#]+\\\\(\\\\w+\\\\):\\\\d+:\\\\d+>\";\n var RVM_PROMPT = \"(\\\\w+-)?\\\\d+\\\\.\\\\d+\\\\.\\\\d(p\\\\d+)?[^>]+>\";\n\n var IRB_DEFAULT = [\n {\n begin: /^\\s*=>/,\n starts: {\n end: '$', contains: RUBY_DEFAULT_CONTAINS\n }\n },\n {\n className: 'meta',\n begin: '^('+SIMPLE_PROMPT+\"|\"+DEFAULT_PROMPT+'|'+RVM_PROMPT+')',\n starts: {\n end: '$', contains: RUBY_DEFAULT_CONTAINS\n }\n }\n ];\n\n return {\n name: 'Ruby',\n aliases: ['rb', 'gemspec', 'podspec', 'thor', 'irb'],\n keywords: RUBY_KEYWORDS,\n illegal: /\\/\\*/,\n contains: COMMENT_MODES.concat(IRB_DEFAULT).concat(RUBY_DEFAULT_CONTAINS)\n };\n}","function _p(t,e){0}","function generateTags(sourcefile,source) {\n\n sourcelines = source.split(/\\r?\\n/); //access text of a line from source file by index \n\n try {\n // var result = parse(source,{loc:true});\n var result = parse(source,{\n sourceType: moduleParseMode ? 'module' : 'script',\n plugins: [\n // enable experimental async functions\n \"asyncFunctions\",\n \"classProperties\", //class AAA { ooo = { x:3} }\n \"objectRestSpread\",\n \"classConstructorCall\",\n \"doExpressions\",\n \"trailingFunctionCommas\",\n \"decorators\",\n \"exportExtensions\",\n \"exponentiationOperator\",\n \"asyncGenerators\",\n \"functionBind\",\n \"functionSent\",\n // enable jsx and flow syntax\n \"jsx\",\n \"flow\"\n ]\n });\n //console.log(JSON.stringify(result)); //TODO:Debug:Remove\n } catch (e) {\n console.error(\"parse error in \"+sourcefile,e);\n return;\n }\n\n var scopes = []; // stack of function body scopes\n\n plugins.forEach(function(plugin) { \n plugin.init(tags);\n });\n\n function extractTags(node,ancestorsPath,children){\n var scope;\n\n // TODO: various module systems\n // (for the moment, we fake it by tracking 'exports')\n // not to mention various class/mixin systems or ember's \n // lifted object system..\n // var f = function(){}\n // { f : function(){} }\n\n // NOTE: location info is start of parsed text to start of unparsed text;\n // also, lines are 1-based, columns are 0-based;\n // for 1-based line/colums, we need to adjust start columns\n\n if ((node.type==='FunctionDeclaration')\n ||(node.type==='FunctionExpression')\n ||(node.type==='ArrowFunctionExpression') ) {\n\n scopes.push(nodeScope(node));\n\n scope = scopes.length>1 ? scopes[scopes.length-2] : \"global\";\n\n if (node.type==='FunctionDeclaration' && node.id)\n {\n\n tags_push({name: node.id.name\n ,file: sourcefile\n ,addr: node.id.loc.start.line\n ,kind: \"f\"\n ,lineno: node.id.loc.start.line\n ,scope: scope\n });\n\n } else if (node.id)\n {\n\n tags_push({name: node.id.name\n ,file: sourcefile\n ,addr: node.id.loc.start.line\n ,kind: \"fe\"\n ,lineno: node.id.loc.start.line\n ,scope: node.loc.start.line+\":\"+(node.loc.start.column+1)+\"-\"\n +node.loc.end.line+\":\"+node.loc.end.column\n });\n }\n\n var paramScope = nodeScope(node);\n\n node.params.forEach(function(param){\n indexDestructId(param,sourcefile,paramScope, 'vp');\n });\n\n } else if (node.type==='VariableDeclarator') {\n\n scope = scopes.length>0 ? scopes[scopes.length-1] : \"global\";\n indexDestructId(node.id,sourcefile,scope, 'v');\n } else if (node.type==='CatchClause') {\n\n tags_push({name: node.param.name\n ,file: sourcefile\n ,addr: node.param.loc.start.line\n ,kind: \"ve\"\n ,lineno: node.param.loc.start.line\n ,scope: node.loc.start.line+\":\"+(node.loc.start.column+1)+\"-\"\n +node.loc.end.line+\":\"+node.loc.end.column\n });\n\n } else if (node.type==='AssignmentExpression') {\n\n if (node.operator==='='\n && node.left.type==='MemberExpression'\n && !node.left.computed) {\n\n if (node.left.object.type==='Identifier'\n && node.left.object.name==='exports') {\n\n // approximation: we don't handle module systems properly,\n // so record tags for 'exports' properties, at least\n tags_push({name: node.left.property.name\n ,file: sourcefile\n ,addr: node.left.property.loc.start.line\n ,kind: \"export\"\n ,lineno: node.left.property.loc.start.line\n ,scope: \"global\"\n });\n\n } else if (node.left.object.type==='MemberExpression'\n && !node.left.object.computed\n && node.left.object.property.type==='Identifier'\n && node.left.object.property.name==='prototype'\n && node.left.property.type==='Identifier') {\n\n // approximation: we don't handle object properties properly,\n // so record tags for 'prototype' properties as globals\n tags_push({name: node.left.property.name\n ,file: sourcefile\n ,addr: node.left.property.loc.start.line\n ,kind: \"prototype\"\n ,lineno: node.left.property.loc.start.line\n ,scope: \"global\"\n });\n\n } else if (classic && (node.right.type==='FunctionExpression' || node.right.type==='ArrowFunctionExpression')) {\n\n // approximation: record tags for function assignments as globals\n tags_push({name: node.left.property.name\n ,file: sourcefile\n ,addr: node.left.property.loc.start.line\n ,kind: \"fa\"\n ,lineno: node.left.property.loc.start.line\n ,scope: \"global\"\n });\n\n }\n }\n } else if (classic && node.type==='ObjectExpression') {\n\n node.properties.forEach(function(property){\n\n plugins.forEach(function(plugin) { \n plugin.visitObjectExpressionProperty && plugin.visitObjectExpressionProperty(property,node,ancestorsPath,sourcefile);\n });\n\n if (property.value && (property.value.type==='FunctionExpression' || property.value.type==='ArrowFunctionExpression') && property.key && property.key.value) { \n // approximation: we don't handle object properties properly,\n // so record tags for function properties as globals\n tags_push({name: property.key.value\n ,file: sourcefile\n ,addr: property.loc.start.line\n ,kind: \"f\"\n ,lineno: property.loc.start.line\n ,scope: \"global\"\n ,class_id: node.class_id\n });\n\n } else if (property.key && property.key.name) {\n // approximation: we don't handle object properties properly,\n // so record tags for function properties as globals\n tags_push({name: property.key.name\n ,file: sourcefile\n ,addr: property.loc.start.line\n ,kind: (property.type === 'ObjectMethod') || (property.value && (property.value.type==='FunctionExpression' || property.value.type==='ArrowFunctionExpression')) ? \"f\" : \"property\"\n ,lineno: property.loc.start.line\n ,scope: \"global\"\n ,class_id: node.class_id\n });\n\n }\n });\n\n } else if (node.type==='CallExpression') { \n plugins.forEach(function(plugin) { \n plugin.visitCallExpression && plugin.visitCallExpression(node, sourcefile);\n });\n } else {\n plugins.forEach(function(plugin) { \n plugin.visitUnknownNode && plugin.visitUnknownNode(node,ancestorsPath,sourcefile,scopes);\n });\n }\n\n children.forEach(function(child) {\n traverseWithPath(extractTags)(child,ancestorsPath.slice().concat([node])); \n });\n\n if ((node.type==='FunctionDeclaration')\n ||(node.type==='FunctionExpression')\n ||(node.type==='ArrowFunctionExpression')\n ||(node.type==='ClassMethod')) {\n\n scopes.pop();\n\n }\n }\n\n traverseWithPath(extractTags)(result,[]);\n}","function findAndReplace(node, state) {\n var comp, parts, c, func\n parts = generators[node.type](node)\n for (var i = 0; i < parsed_dsl[node.type].length; i++) {\n comp = parsed_dsl[node.type][i]\n if (parts.length != comp.length) continue\n\n for (var j = 0; j < parts.length; j++) {\n if (parts[j] === comp[j]) continue\n if (parts[j] === false) continue\n if (~parts[j].indexOf(\".\")) continue\n\n c = _.cloneDeep(node)\n walk(c, { Identifier: function (node, state) { if (node.name === parts[j]) node.name = comp[j] }})\n if (_.isEqual(comp, generators[node.type](c))) {\n func = getScope(parts[j], state)\n if (!func) console.log(state, parts[j], comp[j])\n replaceVar(func, parts[j], comp[j])\n return\n }\n }\n }\n}","astProperties() {\r\n\t\t\t\t\treturn {};\r\n\t\t\t\t}","*next(token) {\n switch (token.type) {\n case 'directive':\n this.directives.add(token.source, (offset, message, warning) => {\n const pos = getErrorPos(token);\n pos[0] += offset;\n this.onError(pos, 'BAD_DIRECTIVE', message, warning);\n });\n this.prelude.push(token.source);\n this.atDirectives = true;\n break;\n case 'document': {\n const doc = composeDoc(this.options, this.directives, token, this.onError);\n if (this.atDirectives && !doc.directives.docStart)\n this.onError(token, 'MISSING_CHAR', 'Missing directives-end/doc-start indicator line');\n this.decorate(doc, false);\n if (this.doc)\n yield this.doc;\n this.doc = doc;\n this.atDirectives = false;\n break;\n }\n case 'byte-order-mark':\n case 'space':\n break;\n case 'comment':\n case 'newline':\n this.prelude.push(token.source);\n break;\n case 'error': {\n const msg = token.source\n ? `${token.message}: ${JSON.stringify(token.source)}`\n : token.message;\n const error = new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', msg);\n if (this.atDirectives || !this.doc)\n this.errors.push(error);\n else\n this.doc.errors.push(error);\n break;\n }\n case 'doc-end': {\n if (!this.doc) {\n const msg = 'Unexpected doc-end without preceding document';\n this.errors.push(new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', msg));\n break;\n }\n this.doc.directives.docEnd = true;\n const end = resolveEnd(token.end, token.offset + token.source.length, this.doc.options.strict, this.onError);\n this.decorate(this.doc, true);\n if (end.comment) {\n const dc = this.doc.comment;\n this.doc.comment = dc ? `${dc}\\n${end.comment}` : end.comment;\n }\n this.doc.range[2] = end.offset;\n break;\n }\n default:\n this.errors.push(new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', `Unsupported token ${token.type}`));\n }\n }","getAst() {\n\n return {\n type: 'procedure',\n params: this.params,\n body: this.body ? this.body.getAst() : null,\n isService: this.isService\n };\n }","function Gb(){}","Compile() {\n\n }","function generateJavascript(ast, options) {\n /* These only indent non-empty lines to avoid trailing whitespace. */\n function indent2(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n function indent4(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n function indent8(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n function indent10(code) { return code.replace(/^(.+)$/gm, ' $1'); }\n\n function generateTables() {\n if (options.optimize === \"size\") {\n return [\n 'peg$consts = [',\n indent2(ast.consts.join(',\\n')),\n '],',\n '',\n 'peg$bytecode = [',\n indent2(arrays.map(ast.rules, function(rule) {\n return 'peg$decode(\"'\n + js.stringEscape(arrays.map(\n rule.bytecode,\n function(b) { return String.fromCharCode(b + 32); }\n ).join(''))\n + '\")';\n }).join(',\\n')),\n '],'\n ].join('\\n');\n } else {\n return arrays.map(\n ast.consts,\n function(c, i) { return 'peg$c' + i + ' = ' + c + ','; }\n ).join('\\n');\n }\n }\n\n function generateRuleHeader(ruleNameCode, ruleIndexCode) {\n var parts = [];\n\n parts.push('');\n\n if (options.trace) {\n parts.push([\n 'peg$tracer.trace({',\n ' type: \"rule.enter\",',\n ' rule: ' + ruleNameCode + ',',\n ' location: peg$computeLocation(startPos, startPos)',\n '});',\n ''\n ].join('\\n'));\n }\n\n if (options.cache) {\n parts.push([\n 'var key = peg$currPos * ' + ast.rules.length + ' + ' + ruleIndexCode + ',',\n ' cached = peg$resultsCache[key];',\n '',\n 'if (cached) {',\n ' peg$currPos = cached.nextPos;',\n '',\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n 'if (cached.result !== peg$FAILED) {',\n ' peg$tracer.trace({',\n ' type: \"rule.match\",',\n ' rule: ' + ruleNameCode + ',',\n ' result: cached.result,',\n ' location: peg$computeLocation(startPos, peg$currPos)',\n ' });',\n '} else {',\n ' peg$tracer.trace({',\n ' type: \"rule.fail\",',\n ' rule: ' + ruleNameCode + ',',\n ' location: peg$computeLocation(startPos, startPos)',\n ' });',\n '}',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' return cached.result;',\n '}',\n ''\n ].join('\\n'));\n }\n\n return parts.join('\\n');\n }\n\n function generateRuleFooter(ruleNameCode, resultCode) {\n var parts = [];\n\n if (options.cache) {\n parts.push([\n '',\n 'peg$resultsCache[key] = { nextPos: peg$currPos, result: ' + resultCode + ' };'\n ].join('\\n'));\n }\n\n if (options.trace) {\n parts.push([\n '',\n 'if (' + resultCode + ' !== peg$FAILED) {',\n ' peg$tracer.trace({',\n ' type: \"rule.match\",',\n ' rule: ' + ruleNameCode + ',',\n ' result: ' + resultCode + ',',\n ' location: peg$computeLocation(startPos, peg$currPos)',\n ' });',\n '} else {',\n ' peg$tracer.trace({',\n ' type: \"rule.fail\",',\n ' rule: ' + ruleNameCode + ',',\n ' location: peg$computeLocation(startPos, startPos)',\n ' });',\n '}'\n ].join('\\n'));\n }\n\n parts.push([\n '',\n 'return ' + resultCode + ';'\n ].join('\\n'));\n\n return parts.join('\\n');\n }\n\n function generateInterpreter() {\n var parts = [];\n\n function generateCondition(cond, argsLength) {\n var baseLength = argsLength + 3,\n thenLengthCode = 'bc[ip + ' + (baseLength - 2) + ']',\n elseLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n\n return [\n 'ends.push(end);',\n 'ips.push(ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ');',\n '',\n 'if (' + cond + ') {',\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ';',\n ' ip += ' + baseLength + ';',\n '} else {',\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ';',\n ' ip += ' + baseLength + ' + ' + thenLengthCode + ';',\n '}',\n '',\n 'break;'\n ].join('\\n');\n }\n\n function generateLoop(cond) {\n var baseLength = 2,\n bodyLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n\n return [\n 'if (' + cond + ') {',\n ' ends.push(end);',\n ' ips.push(ip);',\n '',\n ' end = ip + ' + baseLength + ' + ' + bodyLengthCode + ';',\n ' ip += ' + baseLength + ';',\n '} else {',\n ' ip += ' + baseLength + ' + ' + bodyLengthCode + ';',\n '}',\n '',\n 'break;'\n ].join('\\n');\n }\n\n function generateCall() {\n var baseLength = 4,\n paramsLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\n\n return [\n 'params = bc.slice(ip + ' + baseLength + ', ip + ' + baseLength + ' + ' + paramsLengthCode + ');',\n 'for (i = 0; i < ' + paramsLengthCode + '; i++) {',\n ' params[i] = stack[stack.length - 1 - params[i]];',\n '}',\n '',\n 'stack.splice(',\n ' stack.length - bc[ip + 2],',\n ' bc[ip + 2],',\n ' peg$consts[bc[ip + 1]].apply(null, params)',\n ');',\n '',\n 'ip += ' + baseLength + ' + ' + paramsLengthCode + ';',\n 'break;'\n ].join('\\n');\n }\n\n parts.push([\n 'function peg$decode(s) {',\n ' var bc = new Array(s.length), i;',\n '',\n ' for (i = 0; i < s.length; i++) {',\n ' bc[i] = s.charCodeAt(i) - 32;',\n ' }',\n '',\n ' return bc;',\n '}',\n '',\n 'function peg$parseRule(index) {',\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n ' var bc = peg$bytecode[index],',\n ' ip = 0,',\n ' ips = [],',\n ' end = bc.length,',\n ' ends = [],',\n ' stack = [],',\n ' startPos = peg$currPos,',\n ' params, i;',\n ].join('\\n'));\n } else {\n parts.push([\n ' var bc = peg$bytecode[index],',\n ' ip = 0,',\n ' ips = [],',\n ' end = bc.length,',\n ' ends = [],',\n ' stack = [],',\n ' params, i;',\n ].join('\\n'));\n }\n\n parts.push(indent2(generateRuleHeader('peg$ruleNames[index]', 'index')));\n\n parts.push([\n /*\n * The point of the outer loop and the |ips| & |ends| stacks is to avoid\n * recursive calls for interpreting parts of bytecode. In other words, we\n * implement the |interpret| operation of the abstract machine without\n * function calls. Such calls would likely slow the parser down and more\n * importantly cause stack overflows for complex grammars.\n */\n ' while (true) {',\n ' while (ip < end) {',\n ' switch (bc[ip]) {',\n ' case ' + op.PUSH + ':', // PUSH c\n ' stack.push(peg$consts[bc[ip + 1]]);',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.PUSH_UNDEFINED + ':', // PUSH_UNDEFINED\n ' stack.push(void 0);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_NULL + ':', // PUSH_NULL\n ' stack.push(null);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_FAILED + ':', // PUSH_FAILED\n ' stack.push(peg$FAILED);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_EMPTY_ARRAY + ':', // PUSH_EMPTY_ARRAY\n ' stack.push([]);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.PUSH_CURR_POS + ':', // PUSH_CURR_POS\n ' stack.push(peg$currPos);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.POP + ':', // POP\n ' stack.pop();',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.POP_CURR_POS + ':', // POP_CURR_POS\n ' peg$currPos = stack.pop();',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.POP_N + ':', // POP_N n\n ' stack.length -= bc[ip + 1];',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.NIP + ':', // NIP\n ' stack.splice(-2, 1);',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.APPEND + ':', // APPEND\n ' stack[stack.length - 2].push(stack.pop());',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.WRAP + ':', // WRAP n\n ' stack.push(stack.splice(stack.length - bc[ip + 1], bc[ip + 1]));',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.TEXT + ':', // TEXT\n ' stack.push(input.substring(stack.pop(), peg$currPos));',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.IF + ':', // IF t, f\n indent10(generateCondition('stack[stack.length - 1]', 0)),\n '',\n ' case ' + op.IF_ERROR + ':', // IF_ERROR t, f\n indent10(generateCondition(\n 'stack[stack.length - 1] === peg$FAILED',\n 0\n )),\n '',\n ' case ' + op.IF_NOT_ERROR + ':', // IF_NOT_ERROR t, f\n indent10(\n generateCondition('stack[stack.length - 1] !== peg$FAILED',\n 0\n )),\n '',\n ' case ' + op.WHILE_NOT_ERROR + ':', // WHILE_NOT_ERROR b\n indent10(generateLoop('stack[stack.length - 1] !== peg$FAILED')),\n '',\n ' case ' + op.MATCH_ANY + ':', // MATCH_ANY a, f, ...\n indent10(generateCondition('input.length > peg$currPos', 0)),\n '',\n ' case ' + op.MATCH_STRING + ':', // MATCH_STRING s, a, f, ...\n indent10(generateCondition(\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length) === peg$consts[bc[ip + 1]]',\n 1\n )),\n '',\n ' case ' + op.MATCH_STRING_IC + ':', // MATCH_STRING_IC s, a, f, ...\n indent10(generateCondition(\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length).toLowerCase() === peg$consts[bc[ip + 1]]',\n 1\n )),\n '',\n ' case ' + op.MATCH_REGEXP + ':', // MATCH_REGEXP r, a, f, ...\n indent10(generateCondition(\n 'peg$consts[bc[ip + 1]].test(input.charAt(peg$currPos))',\n 1\n )),\n '',\n ' case ' + op.ACCEPT_N + ':', // ACCEPT_N n\n ' stack.push(input.substr(peg$currPos, bc[ip + 1]));',\n ' peg$currPos += bc[ip + 1];',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.ACCEPT_STRING + ':', // ACCEPT_STRING s\n ' stack.push(peg$consts[bc[ip + 1]]);',\n ' peg$currPos += peg$consts[bc[ip + 1]].length;',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.FAIL + ':', // FAIL e\n ' stack.push(peg$FAILED);',\n ' if (peg$silentFails === 0) {',\n ' peg$fail(peg$consts[bc[ip + 1]]);',\n ' }',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.LOAD_SAVED_POS + ':', // LOAD_SAVED_POS p\n ' peg$savedPos = stack[stack.length - 1 - bc[ip + 1]];',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.UPDATE_SAVED_POS + ':', // UPDATE_SAVED_POS\n ' peg$savedPos = peg$currPos;',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.CALL + ':', // CALL f, n, pc, p1, p2, ..., pN\n indent10(generateCall()),\n '',\n ' case ' + op.RULE + ':', // RULE r\n ' stack.push(peg$parseRule(bc[ip + 1]));',\n ' ip += 2;',\n ' break;',\n '',\n ' case ' + op.SILENT_FAILS_ON + ':', // SILENT_FAILS_ON\n ' peg$silentFails++;',\n ' ip++;',\n ' break;',\n '',\n ' case ' + op.SILENT_FAILS_OFF + ':', // SILENT_FAILS_OFF\n ' peg$silentFails--;',\n ' ip++;',\n ' break;',\n '',\n ' default:',\n ' throw new Error(\"Invalid opcode: \" + bc[ip] + \".\");',\n ' }',\n ' }',\n '',\n ' if (ends.length > 0) {',\n ' end = ends.pop();',\n ' ip = ips.pop();',\n ' } else {',\n ' break;',\n ' }',\n ' }'\n ].join('\\n'));\n\n parts.push(indent2(generateRuleFooter('peg$ruleNames[index]', 'stack[0]')));\n parts.push('}');\n\n return parts.join('\\n');\n }\n\n function generateRuleFunction(rule) {\n var parts = [], code;\n\n function c(i) { return \"peg$c\" + i; } // |consts[i]| of the abstract machine\n function s(i) { return \"s\" + i; } // |stack[i]| of the abstract machine\n\n var stack = {\n sp: -1,\n maxSp: -1,\n\n push: function(exprCode) {\n var code = s(++this.sp) + ' = ' + exprCode + ';';\n\n if (this.sp > this.maxSp) { this.maxSp = this.sp; }\n\n return code;\n },\n\n pop: function() {\n var n, values;\n\n if (arguments.length === 0) {\n return s(this.sp--);\n } else {\n n = arguments[0];\n values = arrays.map(arrays.range(this.sp - n + 1, this.sp + 1), s);\n this.sp -= n;\n\n return values;\n }\n },\n\n top: function() {\n return s(this.sp);\n },\n\n index: function(i) {\n return s(this.sp - i);\n }\n };\n\n function compile(bc) {\n var ip = 0,\n end = bc.length,\n parts = [],\n value;\n\n function compileCondition(cond, argCount) {\n var baseLength = argCount + 3,\n thenLength = bc[ip + baseLength - 2],\n elseLength = bc[ip + baseLength - 1],\n baseSp = stack.sp,\n thenCode, elseCode, thenSp, elseSp;\n\n ip += baseLength;\n thenCode = compile(bc.slice(ip, ip + thenLength));\n thenSp = stack.sp;\n ip += thenLength;\n\n if (elseLength > 0) {\n stack.sp = baseSp;\n elseCode = compile(bc.slice(ip, ip + elseLength));\n elseSp = stack.sp;\n ip += elseLength;\n\n if (thenSp !== elseSp) {\n throw new Error(\n \"Branches of a condition must move the stack pointer in the same way.\"\n );\n }\n }\n\n parts.push('if (' + cond + ') {');\n parts.push(indent2(thenCode));\n if (elseLength > 0) {\n parts.push('} else {');\n parts.push(indent2(elseCode));\n }\n parts.push('}');\n }\n\n function compileLoop(cond) {\n var baseLength = 2,\n bodyLength = bc[ip + baseLength - 1],\n baseSp = stack.sp,\n bodyCode, bodySp;\n\n ip += baseLength;\n bodyCode = compile(bc.slice(ip, ip + bodyLength));\n bodySp = stack.sp;\n ip += bodyLength;\n\n if (bodySp !== baseSp) {\n throw new Error(\"Body of a loop can't move the stack pointer.\");\n }\n\n parts.push('while (' + cond + ') {');\n parts.push(indent2(bodyCode));\n parts.push('}');\n }\n\n function compileCall() {\n var baseLength = 4,\n paramsLength = bc[ip + baseLength - 1];\n\n var value = c(bc[ip + 1]) + '('\n + arrays.map(\n bc.slice(ip + baseLength, ip + baseLength + paramsLength),\n function(p) { return stack.index(p); }\n ).join(', ')\n + ')';\n stack.pop(bc[ip + 2]);\n parts.push(stack.push(value));\n ip += baseLength + paramsLength;\n }\n\n while (ip < end) {\n switch (bc[ip]) {\n case op.PUSH: // PUSH c\n parts.push(stack.push(c(bc[ip + 1])));\n ip += 2;\n break;\n\n case op.PUSH_CURR_POS: // PUSH_CURR_POS\n parts.push(stack.push('peg$currPos'));\n ip++;\n break;\n\n case op.PUSH_UNDEFINED: // PUSH_UNDEFINED\n parts.push(stack.push('void 0'));\n ip++;\n break;\n\n case op.PUSH_NULL: // PUSH_NULL\n parts.push(stack.push('null'));\n ip++;\n break;\n\n case op.PUSH_FAILED: // PUSH_FAILED\n parts.push(stack.push('peg$FAILED'));\n ip++;\n break;\n\n case op.PUSH_EMPTY_ARRAY: // PUSH_EMPTY_ARRAY\n parts.push(stack.push('[]'));\n ip++;\n break;\n\n case op.POP: // POP\n stack.pop();\n ip++;\n break;\n\n case op.POP_CURR_POS: // POP_CURR_POS\n parts.push('peg$currPos = ' + stack.pop() + ';');\n ip++;\n break;\n\n case op.POP_N: // POP_N n\n stack.pop(bc[ip + 1]);\n ip += 2;\n break;\n\n case op.NIP: // NIP\n value = stack.pop();\n stack.pop();\n parts.push(stack.push(value));\n ip++;\n break;\n\n case op.APPEND: // APPEND\n value = stack.pop();\n parts.push(stack.top() + '.push(' + value + ');');\n ip++;\n break;\n\n case op.WRAP: // WRAP n\n parts.push(\n stack.push('[' + stack.pop(bc[ip + 1]).join(', ') + ']')\n );\n ip += 2;\n break;\n\n case op.TEXT: // TEXT\n parts.push(\n stack.push('input.substring(' + stack.pop() + ', peg$currPos)')\n );\n ip++;\n break;\n\n case op.IF: // IF t, f\n compileCondition(stack.top(), 0);\n break;\n\n case op.IF_ERROR: // IF_ERROR t, f\n compileCondition(stack.top() + ' === peg$FAILED', 0);\n break;\n\n case op.IF_NOT_ERROR: // IF_NOT_ERROR t, f\n compileCondition(stack.top() + ' !== peg$FAILED', 0);\n break;\n\n case op.WHILE_NOT_ERROR: // WHILE_NOT_ERROR b\n compileLoop(stack.top() + ' !== peg$FAILED', 0);\n break;\n\n case op.MATCH_ANY: // MATCH_ANY a, f, ...\n compileCondition('input.length > peg$currPos', 0);\n break;\n\n case op.MATCH_STRING: // MATCH_STRING s, a, f, ...\n compileCondition(\n eval(ast.consts[bc[ip + 1]]).length > 1\n ? 'input.substr(peg$currPos, '\n + eval(ast.consts[bc[ip + 1]]).length\n + ') === '\n + c(bc[ip + 1])\n : 'input.charCodeAt(peg$currPos) === '\n + eval(ast.consts[bc[ip + 1]]).charCodeAt(0),\n 1\n );\n break;\n\n case op.MATCH_STRING_IC: // MATCH_STRING_IC s, a, f, ...\n compileCondition(\n 'input.substr(peg$currPos, '\n + eval(ast.consts[bc[ip + 1]]).length\n + ').toLowerCase() === '\n + c(bc[ip + 1]),\n 1\n );\n break;\n\n case op.MATCH_REGEXP: // MATCH_REGEXP r, a, f, ...\n compileCondition(\n c(bc[ip + 1]) + '.test(input.charAt(peg$currPos))',\n 1\n );\n break;\n\n case op.ACCEPT_N: // ACCEPT_N n\n parts.push(stack.push(\n bc[ip + 1] > 1\n ? 'input.substr(peg$currPos, ' + bc[ip + 1] + ')'\n : 'input.charAt(peg$currPos)'\n ));\n parts.push(\n bc[ip + 1] > 1\n ? 'peg$currPos += ' + bc[ip + 1] + ';'\n : 'peg$currPos++;'\n );\n ip += 2;\n break;\n\n case op.ACCEPT_STRING: // ACCEPT_STRING s\n parts.push(stack.push(c(bc[ip + 1])));\n parts.push(\n eval(ast.consts[bc[ip + 1]]).length > 1\n ? 'peg$currPos += ' + eval(ast.consts[bc[ip + 1]]).length + ';'\n : 'peg$currPos++;'\n );\n ip += 2;\n break;\n\n case op.FAIL: // FAIL e\n parts.push(stack.push('peg$FAILED'));\n parts.push('if (peg$silentFails === 0) { peg$fail(' + c(bc[ip + 1]) + '); }');\n ip += 2;\n break;\n\n case op.LOAD_SAVED_POS: // LOAD_SAVED_POS p\n parts.push('peg$savedPos = ' + stack.index(bc[ip + 1]) + ';');\n ip += 2;\n break;\n\n case op.UPDATE_SAVED_POS: // UPDATE_SAVED_POS\n parts.push('peg$savedPos = peg$currPos;');\n ip++;\n break;\n\n case op.CALL: // CALL f, n, pc, p1, p2, ..., pN\n compileCall();\n break;\n\n case op.RULE: // RULE r\n parts.push(stack.push(\"peg$parse\" + ast.rules[bc[ip + 1]].name + \"()\"));\n ip += 2;\n break;\n\n case op.SILENT_FAILS_ON: // SILENT_FAILS_ON\n parts.push('peg$silentFails++;');\n ip++;\n break;\n\n case op.SILENT_FAILS_OFF: // SILENT_FAILS_OFF\n parts.push('peg$silentFails--;');\n ip++;\n break;\n\n default:\n throw new Error(\"Invalid opcode: \" + bc[ip] + \".\");\n }\n }\n\n return parts.join('\\n');\n }\n\n code = compile(rule.bytecode);\n\n parts.push('function peg$parse' + rule.name + '() {');\n\n if (options.trace) {\n parts.push([\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ',',\n ' startPos = peg$currPos;'\n ].join('\\n'));\n } else {\n parts.push(\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ';'\n );\n }\n\n parts.push(indent2(generateRuleHeader(\n '\"' + js.stringEscape(rule.name) + '\"',\n asts.indexOfRule(ast, rule.name)\n )));\n parts.push(indent2(code));\n parts.push(indent2(generateRuleFooter(\n '\"' + js.stringEscape(rule.name) + '\"',\n s(0)\n )));\n\n parts.push('}');\n\n return parts.join('\\n');\n }\n\n var parts = [],\n startRuleIndices, startRuleIndex,\n startRuleFunctions, startRuleFunction,\n ruleNames;\n\n parts.push([\n '(function() {',\n ' \"use strict\";',\n '',\n ' /*',\n ' * Generated by PEG.js 0.9.0.',\n ' *',\n ' * http://pegjs.org/',\n ' */',\n '',\n ' function peg$subclass(child, parent) {',\n ' function ctor() { this.constructor = child; }',\n ' ctor.prototype = parent.prototype;',\n ' child.prototype = new ctor();',\n ' }',\n '',\n ' function peg$SyntaxError(message, expected, found, location) {',\n ' this.message = message;',\n ' this.expected = expected;',\n ' this.found = found;',\n ' this.location = location;',\n ' this.name = \"SyntaxError\";',\n '',\n ' if (typeof Error.captureStackTrace === \"function\") {',\n ' Error.captureStackTrace(this, peg$SyntaxError);',\n ' }',\n ' }',\n '',\n ' peg$subclass(peg$SyntaxError, Error);',\n ''\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n ' function peg$DefaultTracer() {',\n ' this.indentLevel = 0;',\n ' }',\n '',\n ' peg$DefaultTracer.prototype.trace = function(event) {',\n ' var that = this;',\n '',\n ' function log(event) {',\n ' function repeat(string, n) {',\n ' var result = \"\", i;',\n '',\n ' for (i = 0; i < n; i++) {',\n ' result += string;',\n ' }',\n '',\n ' return result;',\n ' }',\n '',\n ' function pad(string, length) {',\n ' return string + repeat(\" \", length - string.length);',\n ' }',\n '',\n ' if (typeof console === \"object\") {', // IE 8-10\n ' console.log(',\n ' event.location.start.line + \":\" + event.location.start.column + \"-\"',\n ' + event.location.end.line + \":\" + event.location.end.column + \" \"',\n ' + pad(event.type, 10) + \" \"',\n ' + repeat(\" \", that.indentLevel) + event.rule',\n ' );',\n ' }',\n ' }',\n '',\n ' switch (event.type) {',\n ' case \"rule.enter\":',\n ' log(event);',\n ' this.indentLevel++;',\n ' break;',\n '',\n ' case \"rule.match\":',\n ' this.indentLevel--;',\n ' log(event);',\n ' break;',\n '',\n ' case \"rule.fail\":',\n ' this.indentLevel--;',\n ' log(event);',\n ' break;',\n '',\n ' default:',\n ' throw new Error(\"Invalid event type: \" + event.type + \".\");',\n ' }',\n ' };',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' function peg$parse(input) {',\n ' var options = arguments.length > 1 ? arguments[1] : {},',\n ' parser = this,',\n '',\n ' peg$FAILED = {},',\n ''\n ].join('\\n'));\n\n if (options.optimize === \"size\") {\n startRuleIndices = '{ '\n + arrays.map(\n options.allowedStartRules,\n function(r) { return r + ': ' + asts.indexOfRule(ast, r); }\n ).join(', ')\n + ' }';\n startRuleIndex = asts.indexOfRule(ast, options.allowedStartRules[0]);\n\n parts.push([\n ' peg$startRuleIndices = ' + startRuleIndices + ',',\n ' peg$startRuleIndex = ' + startRuleIndex + ','\n ].join('\\n'));\n } else {\n startRuleFunctions = '{ '\n + arrays.map(\n options.allowedStartRules,\n function(r) { return r + ': peg$parse' + r; }\n ).join(', ')\n + ' }';\n startRuleFunction = 'peg$parse' + options.allowedStartRules[0];\n\n parts.push([\n ' peg$startRuleFunctions = ' + startRuleFunctions + ',',\n ' peg$startRuleFunction = ' + startRuleFunction + ','\n ].join('\\n'));\n }\n\n parts.push('');\n\n parts.push(indent8(generateTables()));\n\n parts.push([\n '',\n ' peg$currPos = 0,',\n ' peg$savedPos = 0,',\n ' peg$posDetailsCache = [{ line: 1, column: 1, seenCR: false }],',\n ' peg$maxFailPos = 0,',\n ' peg$maxFailExpected = [],',\n ' peg$silentFails = 0,', // 0 = report failures, > 0 = silence failures\n ''\n ].join('\\n'));\n\n if (options.cache) {\n parts.push([\n ' peg$resultsCache = {},',\n ''\n ].join('\\n'));\n }\n\n if (options.trace) {\n if (options.optimize === \"size\") {\n ruleNames = '['\n + arrays.map(\n ast.rules,\n function(r) { return '\"' + js.stringEscape(r.name) + '\"'; }\n ).join(', ')\n + ']';\n\n parts.push([\n ' peg$ruleNames = ' + ruleNames + ',',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' peg$tracer = \"tracer\" in options ? options.tracer : new peg$DefaultTracer(),',\n ''\n ].join('\\n'));\n }\n\n parts.push([\n ' peg$result;',\n ''\n ].join('\\n'));\n\n if (options.optimize === \"size\") {\n parts.push([\n ' if (\"startRule\" in options) {',\n ' if (!(options.startRule in peg$startRuleIndices)) {',\n ' throw new Error(\"Can\\'t start parsing from rule \\\\\"\" + options.startRule + \"\\\\\".\");',\n ' }',\n '',\n ' peg$startRuleIndex = peg$startRuleIndices[options.startRule];',\n ' }'\n ].join('\\n'));\n } else {\n parts.push([\n ' if (\"startRule\" in options) {',\n ' if (!(options.startRule in peg$startRuleFunctions)) {',\n ' throw new Error(\"Can\\'t start parsing from rule \\\\\"\" + options.startRule + \"\\\\\".\");',\n ' }',\n '',\n ' peg$startRuleFunction = peg$startRuleFunctions[options.startRule];',\n ' }'\n ].join('\\n'));\n }\n\n parts.push([\n '',\n ' function text() {',\n ' return input.substring(peg$savedPos, peg$currPos);',\n ' }',\n '',\n ' function location() {',\n ' return peg$computeLocation(peg$savedPos, peg$currPos);',\n ' }',\n '',\n ' function expected(description) {',\n ' throw peg$buildException(',\n ' null,',\n ' [{ type: \"other\", description: description }],',\n ' input.substring(peg$savedPos, peg$currPos),',\n ' peg$computeLocation(peg$savedPos, peg$currPos)',\n ' );',\n ' }',\n '',\n ' function error(message) {',\n ' throw peg$buildException(',\n ' message,',\n ' null,',\n ' input.substring(peg$savedPos, peg$currPos),',\n ' peg$computeLocation(peg$savedPos, peg$currPos)',\n ' );',\n ' }',\n '',\n ' function peg$computePosDetails(pos) {',\n ' var details = peg$posDetailsCache[pos],',\n ' p, ch;',\n '',\n ' if (details) {',\n ' return details;',\n ' } else {',\n ' p = pos - 1;',\n ' while (!peg$posDetailsCache[p]) {',\n ' p--;',\n ' }',\n '',\n ' details = peg$posDetailsCache[p];',\n ' details = {',\n ' line: details.line,',\n ' column: details.column,',\n ' seenCR: details.seenCR',\n ' };',\n '',\n ' while (p < pos) {',\n ' ch = input.charAt(p);',\n ' if (ch === \"\\\\n\") {',\n ' if (!details.seenCR) { details.line++; }',\n ' details.column = 1;',\n ' details.seenCR = false;',\n ' } else if (ch === \"\\\\r\" || ch === \"\\\\u2028\" || ch === \"\\\\u2029\") {',\n ' details.line++;',\n ' details.column = 1;',\n ' details.seenCR = true;',\n ' } else {',\n ' details.column++;',\n ' details.seenCR = false;',\n ' }',\n '',\n ' p++;',\n ' }',\n '',\n ' peg$posDetailsCache[pos] = details;',\n ' return details;',\n ' }',\n ' }',\n '',\n ' function peg$computeLocation(startPos, endPos) {',\n ' var startPosDetails = peg$computePosDetails(startPos),',\n ' endPosDetails = peg$computePosDetails(endPos);',\n '',\n ' return {',\n ' start: {',\n ' offset: startPos,',\n ' line: startPosDetails.line,',\n ' column: startPosDetails.column',\n ' },',\n ' end: {',\n ' offset: endPos,',\n ' line: endPosDetails.line,',\n ' column: endPosDetails.column',\n ' }',\n ' };',\n ' }',\n '',\n ' function peg$fail(expected) {',\n ' if (peg$currPos < peg$maxFailPos) { return; }',\n '',\n ' if (peg$currPos > peg$maxFailPos) {',\n ' peg$maxFailPos = peg$currPos;',\n ' peg$maxFailExpected = [];',\n ' }',\n '',\n ' peg$maxFailExpected.push(expected);',\n ' }',\n '',\n ' function peg$buildException(message, expected, found, location) {',\n ' function cleanupExpected(expected) {',\n ' var i = 1;',\n '',\n ' expected.sort(function(a, b) {',\n ' if (a.description < b.description) {',\n ' return -1;',\n ' } else if (a.description > b.description) {',\n ' return 1;',\n ' } else {',\n ' return 0;',\n ' }',\n ' });',\n '',\n /*\n * This works because the bytecode generator guarantees that every\n * expectation object exists only once, so it's enough to use |===| instead\n * of deeper structural comparison.\n */\n ' while (i < expected.length) {',\n ' if (expected[i - 1] === expected[i]) {',\n ' expected.splice(i, 1);',\n ' } else {',\n ' i++;',\n ' }',\n ' }',\n ' }',\n '',\n ' function buildMessage(expected, found) {',\n ' function stringEscape(s) {',\n ' function hex(ch) { return ch.charCodeAt(0).toString(16).toUpperCase(); }',\n '',\n /*\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a string\n * literal except for the closing quote character, backslash, carriage\n * return, line separator, paragraph separator, and line feed. Any character\n * may appear in the form of an escape sequence.\n *\n * For portability, we also escape all control and non-ASCII characters.\n * Note that \"\\0\" and \"\\v\" escape sequences are not used because JSHint does\n * not like the first and IE the second.\n */\n ' return s',\n ' .replace(/\\\\\\\\/g, \\'\\\\\\\\\\\\\\\\\\')', // backslash\n ' .replace(/\"/g, \\'\\\\\\\\\"\\')', // closing double quote\n ' .replace(/\\\\x08/g, \\'\\\\\\\\b\\')', // backspace\n ' .replace(/\\\\t/g, \\'\\\\\\\\t\\')', // horizontal tab\n ' .replace(/\\\\n/g, \\'\\\\\\\\n\\')', // line feed\n ' .replace(/\\\\f/g, \\'\\\\\\\\f\\')', // form feed\n ' .replace(/\\\\r/g, \\'\\\\\\\\r\\')', // carriage return\n ' .replace(/[\\\\x00-\\\\x07\\\\x0B\\\\x0E\\\\x0F]/g, function(ch) { return \\'\\\\\\\\x0\\' + hex(ch); })',\n ' .replace(/[\\\\x10-\\\\x1F\\\\x80-\\\\xFF]/g, function(ch) { return \\'\\\\\\\\x\\' + hex(ch); })',\n ' .replace(/[\\\\u0100-\\\\u0FFF]/g, function(ch) { return \\'\\\\\\\\u0\\' + hex(ch); })',\n ' .replace(/[\\\\u1000-\\\\uFFFF]/g, function(ch) { return \\'\\\\\\\\u\\' + hex(ch); });',\n ' }',\n '',\n ' var expectedDescs = new Array(expected.length),',\n ' expectedDesc, foundDesc, i;',\n '',\n ' for (i = 0; i < expected.length; i++) {',\n ' expectedDescs[i] = expected[i].description;',\n ' }',\n '',\n ' expectedDesc = expected.length > 1',\n ' ? expectedDescs.slice(0, -1).join(\", \")',\n ' + \" or \"',\n ' + expectedDescs[expected.length - 1]',\n ' : expectedDescs[0];',\n '',\n ' foundDesc = found ? \"\\\\\"\" + stringEscape(found) + \"\\\\\"\" : \"end of input\";',\n '',\n ' return \"Expected \" + expectedDesc + \" but \" + foundDesc + \" found.\";',\n ' }',\n '',\n ' if (expected !== null) {',\n ' cleanupExpected(expected);',\n ' }',\n '',\n ' return new peg$SyntaxError(',\n ' message !== null ? message : buildMessage(expected, found),',\n ' expected,',\n ' found,',\n ' location',\n ' );',\n ' }',\n ''\n ].join('\\n'));\n\n if (options.optimize === \"size\") {\n parts.push(indent4(generateInterpreter()));\n parts.push('');\n } else {\n arrays.each(ast.rules, function(rule) {\n parts.push(indent4(generateRuleFunction(rule)));\n parts.push('');\n });\n }\n\n if (ast.initializer) {\n parts.push(indent4(ast.initializer.code));\n parts.push('');\n }\n\n if (options.optimize === \"size\") {\n parts.push(' peg$result = peg$parseRule(peg$startRuleIndex);');\n } else {\n parts.push(' peg$result = peg$startRuleFunction();');\n }\n\n parts.push([\n '',\n ' if (peg$result !== peg$FAILED && peg$currPos === input.length) {',\n ' return peg$result;',\n ' } else {',\n ' if (peg$result !== peg$FAILED && peg$currPos < input.length) {',\n ' peg$fail({ type: \"end\", description: \"end of input\" });',\n ' }',\n '',\n ' throw peg$buildException(',\n ' null,',\n ' peg$maxFailExpected,',\n ' peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,',\n ' peg$maxFailPos < input.length',\n ' ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)',\n ' : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)',\n ' );',\n ' }',\n ' }',\n '',\n ' return {'\n ].join('\\n'));\n\n if (options.trace) {\n parts.push([\n ' SyntaxError: peg$SyntaxError,',\n ' DefaultTracer: peg$DefaultTracer,',\n ' parse: peg$parse'\n ].join('\\n'));\n } else {\n parts.push([\n ' SyntaxError: peg$SyntaxError,',\n ' parse: peg$parse'\n ].join('\\n'));\n }\n\n parts.push([\n ' };',\n '})()'\n ].join('\\n'));\n\n ast.code = parts.join('\\n');\n }","function Generator() {}","function Generator() {}","function Generator() {}","function Generator() {}","function Generator() {}"],"string":"[\n \"constructor() { super(new GeneratorParser(true)) }\",\n \"function generate (p) {\\n // Type\\n if (typeof p === 'string' && node.type === null) {\\n node.type = p.replace(/^./, ch => ch.toUpperCase())\\n return\\n }\\n\\n // Type\\n if (typeof p === 'function') {\\n node.type = p\\n return\\n }\\n\\n // Children\\n if (isArray(p)) {\\n node.children = p\\n return\\n }\\n\\n // Attr\\n if (typeof p === 'object') {\\n node.attr = p\\n return\\n }\\n\\n // Content\\n if (typeof p === 'string') {\\n node.attr.content = p\\n return\\n }\\n }\",\n \"Program(p) {\\n gen(p.statements)\\n }\",\n \"static definition() {\\n return 'A tree is a perennial plant with an elongated stem, or trunk, supporting branches and leaves.'\\n }\",\n \"function SSyntax() {\\r\\n}\",\n \"function t(e){switch(e.type){case V.AssignmentExpression:case V.ArrayExpression:case V.ArrayPattern:case V.BinaryExpression:case V.CallExpression:case V.ConditionalExpression:case V.ClassExpression:case V.ExportBatchSpecifier:case V.ExportSpecifier:case V.FunctionExpression:case V.Identifier:case V.ImportSpecifier:case V.Literal:case V.LogicalExpression:case V.MemberExpression:case V.MethodDefinition:case V.NewExpression:case V.ObjectExpression:case V.ObjectPattern:case V.Property:case V.SequenceExpression:case V.ThisExpression:case V.UnaryExpression:case V.UpdateExpression:case V.YieldExpression:return!0}return!1}// Generation is done by generateStatement.\",\n \"function generators() {\\n\\t\\t\\t\\tBlockly.JavaScript.fw = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.rr = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.rl = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.lt = function(block) {\\n\\t\\t\\t\\t\\tif (checkTopLevel(block)) {\\n\\t\\t\\t\\t\\t\\treturn 'programService.addInstruction(instructionFactory.getInstruction(\\\\x27' + block.type + '\\\\x27));';\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tBlockly.JavaScript.start = function(block) {\\n\\t\\t\\t\\t\\treturn '';\\n\\t\\t\\t\\t};\\n\\t\\t\\t}\",\n \"generate() {\\n return {\\n instructions: 'instructions here',\\n question: 'question here',\\n diagram: 'diagram here',\\n answer: 'answer here',\\n }\\n }\",\n \"function Rep() {\\r\\n}\",\n \"function P(){}\",\n \"function PEGtoAST(node) {\\n switch (type(node)) {\\n case \\\"null\\\":\\n return undefined;\\n case \\\"string\\\":\\n return new StringNode(node);\\n case \\\"array\\\":\\n return new ASTNodeList(...node.map(PEGtoAST));\\n case \\\"object\\\":\\n switch (node.TYPE) {\\n case \\\"whitespace\\\":\\n return new Whitespace();\\n case \\\"parbreak\\\":\\n return new Parbreak();\\n case \\\"subscript\\\":\\n return new Subscript(PEGtoAST(node.content));\\n case \\\"superscript\\\":\\n return new Superscript(PEGtoAST(node.content));\\n case \\\"inlinemath\\\":\\n return new InlineMath(PEGtoAST(node.content));\\n case \\\"displaymath\\\":\\n return new DisplayMath(PEGtoAST(node.content));\\n case \\\"mathenv\\\":\\n return new MathEnv(node.env, PEGtoAST(node.content));\\n case \\\"group\\\":\\n return new Group(PEGtoAST(node.content));\\n case \\\"macro\\\":\\n return new Macro(node.content, PEGtoAST(node.args));\\n case \\\"environment\\\":\\n return new Environment(\\n PEGtoAST(node.env),\\n PEGtoAST(node.args),\\n PEGtoAST(node.content)\\n );\\n case \\\"verbatim\\\":\\n return new Verbatim(PEGtoAST(node.content));\\n case \\\"verb\\\":\\n return new Verb(node[\\\"escape\\\"], PEGtoAST(node.content));\\n case \\\"commentenv\\\":\\n return new CommentEnv(PEGtoAST([node.content]));\\n case \\\"comment\\\":\\n return new CommentNode(\\n node.sameline,\\n PEGtoAST(node.content)\\n );\\n case \\\"arglist\\\":\\n return new ArgList(PEGtoAST(node.content));\\n }\\n }\\n}\",\n \"function G(){}\",\n \"function symbol(s, p) {\\n var x = state.syntax[s];\\n if (!x || typeof x !== \\\"object\\\") {\\n state.syntax[s] = x = {\\n id: s,\\n lbp: p,\\n value: s\\n };\\n }\\n return x;\\n }\",\n \"man() {\\n console.log('Peano - Expression := ');\\n console.log('0 | ++expr | --expr | definition');\\n console.log('definition = <Nom_fonction>(<arg>i, <arg>j, ...) { }');\\n console.log('\\\\n');\\n }\",\n \"constructor( type, code_or_tree, embedded=false ){\\n super(type)\\n if(typeof code_or_tree == \\\"string\\\" ){\\n var p = new GeneratorParser(false, embedded)\\n this.tree = p.get(new Source(\\\"generator-lexeme\\\",code_or_tree))\\n }else this.tree = code_or_tree\\n }\",\n \"function u$2(u,e){t$i`\\n /*\\n * ${e.name}\\n * ${0===e.output?\\\"RenderOutput: Color\\\":1===e.output?\\\"RenderOutput: Depth\\\":3===e.output?\\\"RenderOutput: Shadow\\\":2===e.output?\\\"RenderOutput: Normal\\\":4===e.output?\\\"RenderOutput: Highlight\\\":\\\"\\\"}\\n */\\n `;}\",\n \"static generateCode() {\\n let parserSource = parser.generate();\\n return parserSource;\\n }\",\n \"function ecma (){}\",\n \"function Generator() {} // 84\",\n \"get formula() { return this.ast ? this.ast.toString(this.id) : ''; }\",\n \"function genProgram (node, position) {\\n return generateChildren(node.body, position);\\n}\",\n \"function generateCode(){\\n\\n}\",\n \"compile() {\\n return { [this.word]: this.body };\\n }\",\n \"function Pe(){}\",\n \"function Expr() {}\",\n \"function generate(node) {\\n return escodegen.generate(node);\\n}\",\n \"getCpp(){ return this.program.generateCpp(); }\",\n \"function newSyntax() {\\n foo::bar();\\n const { abc } = { ...oneTwoThree };\\n return new.target;\\n }\",\n \"string_lexeme(quotation='\\\"') { \\n var code = quotation + \\n \\\"(-[\\\\\\\\\\\\\\\\|\\\"+quotation+\\\"]|\\\\\\\\\\\\\\\\([\\\\\\\\\\\\\\\\|n|r|t|\\\"+quotation+\\\"]|u[A-F|a-f|\\\\\\\\d][A-F|a-f|\\\\\\\\d][A-F|a-f|\\\\\\\\d][A-F|a-f|\\\\\\\\d]))*\\\"+quotation\\n console.log(code)\\n return new GeneratorLexeme(\\\"string\\\", code)\\n }\",\n \"constructor(body, freevars, dotpos, expected_args){\\n this.body = body;\\n this.freevars = freevars;\\n this.dotpos = dotpos;\\n this.expected_args = expected_args;\\n }\",\n \"vertex_glsl_code () {}\",\n \"function gen(node) {\\n if (node && !generator[node.type]) {\\n throw new Error(`${node.type} is not supported in NFA/DFA interpreter.`);\\n }\\n\\n return node ? generator[node.type](node) : '';\\n}\",\n \"function ninja() {}\",\n \"Program() {\\n return {\\n type: 'Program',\\n body: this.StatementList(),\\n };\\n }\",\n \"function compile() {\\n\\n}\",\n \"man() {\\n console.log('Grammaire de la machine de Peano :');\\n this.expression.man();\\n this.definition.man();\\n }\",\n \"function Generator() {} // 80\",\n \"function python(hljs) {\\n var KEYWORDS = {\\n keyword:\\n 'and elif is global as in if from raise for except finally print import pass return ' +\\n 'exec else break not with class assert yield try while continue del or def lambda ' +\\n 'async await nonlocal|10',\\n built_in:\\n 'Ellipsis NotImplemented',\\n literal: 'False None True'\\n };\\n var PROMPT = {\\n className: 'meta', begin: /^(>>>|\\\\.\\\\.\\\\.) /\\n };\\n var SUBST = {\\n className: 'subst',\\n begin: /\\\\{/, end: /\\\\}/,\\n keywords: KEYWORDS,\\n illegal: /#/\\n };\\n var LITERAL_BRACKET = {\\n begin: /\\\\{\\\\{/,\\n relevance: 0\\n };\\n var STRING = {\\n className: 'string',\\n contains: [hljs.BACKSLASH_ESCAPE],\\n variants: [\\n {\\n begin: /(u|b)?r?'''/, end: /'''/,\\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT],\\n relevance: 10\\n },\\n {\\n begin: /(u|b)?r?\\\"\\\"\\\"/, end: /\\\"\\\"\\\"/,\\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT],\\n relevance: 10\\n },\\n {\\n begin: /(fr|rf|f)'''/, end: /'''/,\\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT, LITERAL_BRACKET, SUBST]\\n },\\n {\\n begin: /(fr|rf|f)\\\"\\\"\\\"/, end: /\\\"\\\"\\\"/,\\n contains: [hljs.BACKSLASH_ESCAPE, PROMPT, LITERAL_BRACKET, SUBST]\\n },\\n {\\n begin: /(u|r|ur)'/, end: /'/,\\n relevance: 10\\n },\\n {\\n begin: /(u|r|ur)\\\"/, end: /\\\"/,\\n relevance: 10\\n },\\n {\\n begin: /(b|br)'/, end: /'/\\n },\\n {\\n begin: /(b|br)\\\"/, end: /\\\"/\\n },\\n {\\n begin: /(fr|rf|f)'/, end: /'/,\\n contains: [hljs.BACKSLASH_ESCAPE, LITERAL_BRACKET, SUBST]\\n },\\n {\\n begin: /(fr|rf|f)\\\"/, end: /\\\"/,\\n contains: [hljs.BACKSLASH_ESCAPE, LITERAL_BRACKET, SUBST]\\n },\\n hljs.APOS_STRING_MODE,\\n hljs.QUOTE_STRING_MODE\\n ]\\n };\\n var NUMBER = {\\n className: 'number', relevance: 0,\\n variants: [\\n {begin: hljs.BINARY_NUMBER_RE + '[lLjJ]?'},\\n {begin: '\\\\\\\\b(0o[0-7]+)[lLjJ]?'},\\n {begin: hljs.C_NUMBER_RE + '[lLjJ]?'}\\n ]\\n };\\n var PARAMS = {\\n className: 'params',\\n variants: [\\n // Exclude params at functions without params\\n {begin: /\\\\(\\\\s*\\\\)/, skip: true, className: null },\\n {\\n begin: /\\\\(/, end: /\\\\)/, excludeBegin: true, excludeEnd: true,\\n contains: ['self', PROMPT, NUMBER, STRING, hljs.HASH_COMMENT_MODE],\\n },\\n ],\\n };\\n SUBST.contains = [STRING, NUMBER, PROMPT];\\n return {\\n name: 'Python',\\n aliases: ['py', 'gyp', 'ipython'],\\n keywords: KEYWORDS,\\n illegal: /(<\\\\/|->|\\\\?)|=>/,\\n contains: [\\n PROMPT,\\n NUMBER,\\n // eat \\\"if\\\" prior to string so that it won't accidentally be\\n // labeled as an f-string as in:\\n { beginKeywords: \\\"if\\\", relevance: 0 },\\n STRING,\\n hljs.HASH_COMMENT_MODE,\\n {\\n variants: [\\n {className: 'function', beginKeywords: 'def'},\\n {className: 'class', beginKeywords: 'class'}\\n ],\\n end: /:/,\\n illegal: /[${=;\\\\n,]/,\\n contains: [\\n hljs.UNDERSCORE_TITLE_MODE,\\n PARAMS,\\n {\\n begin: /->/, endsWithParent: true,\\n keywords: 'None'\\n }\\n ]\\n },\\n {\\n className: 'meta',\\n begin: /^[\\\\t ]*@/, end: /$/\\n },\\n {\\n begin: /\\\\b(print|exec)\\\\(/ // don’t highlight keywords-turned-functions in Python 3\\n }\\n ]\\n };\\n}\",\n \"define () {\\n return {\\n type: '@node',\\n id: 'string'\\n }\\n }\",\n \"function GenLanguageDef(){}\",\n \"function scala(hljs) {\\n\\n var ANNOTATION = { className: 'meta', begin: '@[A-Za-z]+' };\\n\\n // used in strings for escaping/interpolation/substitution\\n var SUBST = {\\n className: 'subst',\\n variants: [\\n {begin: '\\\\\\\\$[A-Za-z0-9_]+'},\\n {begin: '\\\\\\\\${', end: '}'}\\n ]\\n };\\n\\n var STRING = {\\n className: 'string',\\n variants: [\\n {\\n begin: '\\\"', end: '\\\"',\\n illegal: '\\\\\\\\n',\\n contains: [hljs.BACKSLASH_ESCAPE]\\n },\\n {\\n begin: '\\\"\\\"\\\"', end: '\\\"\\\"\\\"',\\n relevance: 10\\n },\\n {\\n begin: '[a-z]+\\\"', end: '\\\"',\\n illegal: '\\\\\\\\n',\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST]\\n },\\n {\\n className: 'string',\\n begin: '[a-z]+\\\"\\\"\\\"', end: '\\\"\\\"\\\"',\\n contains: [SUBST],\\n relevance: 10\\n }\\n ]\\n\\n };\\n\\n var SYMBOL = {\\n className: 'symbol',\\n begin: '\\\\'\\\\\\\\w[\\\\\\\\w\\\\\\\\d_]*(?!\\\\')'\\n };\\n\\n var TYPE = {\\n className: 'type',\\n begin: '\\\\\\\\b[A-Z][A-Za-z0-9_]*',\\n relevance: 0\\n };\\n\\n var NAME = {\\n className: 'title',\\n begin: /[^0-9\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;][^\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;]+|[^0-9\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;=]/,\\n relevance: 0\\n };\\n\\n var CLASS = {\\n className: 'class',\\n beginKeywords: 'class object trait type',\\n end: /[:={\\\\[\\\\n;]/,\\n excludeEnd: true,\\n contains: [\\n {\\n beginKeywords: 'extends with',\\n relevance: 10\\n },\\n {\\n begin: /\\\\[/,\\n end: /\\\\]/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0,\\n contains: [TYPE]\\n },\\n {\\n className: 'params',\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0,\\n contains: [TYPE]\\n },\\n NAME\\n ]\\n };\\n\\n var METHOD = {\\n className: 'function',\\n beginKeywords: 'def',\\n end: /[:={\\\\[(\\\\n;]/,\\n excludeEnd: true,\\n contains: [NAME]\\n };\\n\\n return {\\n name: 'Scala',\\n keywords: {\\n literal: 'true false null',\\n keyword: 'type yield lazy override def with val var sealed abstract private trait object if forSome for while throw finally protected extends import final return else break new catch super class case package default try this match continue throws implicit'\\n },\\n contains: [\\n hljs.C_LINE_COMMENT_MODE,\\n hljs.C_BLOCK_COMMENT_MODE,\\n STRING,\\n SYMBOL,\\n TYPE,\\n METHOD,\\n CLASS,\\n hljs.C_NUMBER_MODE,\\n ANNOTATION\\n ]\\n };\\n}\",\n \"function _t_(_p, _n, _g, _port) {\\n hdl.obj(this, _p, _n);\\n this._seq = {\\n type: 'BlockStatement',\\n body: [{\\n type: 'IfStatement',\\n test: {\\n type: 'FunccallExpression',\\n arguments: [{\\n type: 'Association',\\n value: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"clk\\\"\\n }\\n }]\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'IfStatement',\\n test: {\\n type: 'BinaryExpression',\\n operator: \\\"=\\\",\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"holdn\\\"\\n },\\n right: {\\n type: 'EnumLiteral',\\n value: \\\"'1'\\\"\\n }\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"r\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"rin\\\"\\n }\\n }]\\n }]\\n }]\\n },\\n alternate: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"ipend\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"ipend\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"m\\\"\\n },\\n element: \\\"werr\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"m\\\"\\n },\\n element: \\\"werr\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'IfStatement',\\n test: {\\n type: 'BinaryExpression',\\n operator: \\\"=\\\",\\n left: {\\n type: 'BinaryExpression',\\n operator: \\\"or\\\",\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"holdn\\\"\\n },\\n right: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"ico\\\"\\n },\\n element: \\\"mds\\\"\\n }\\n },\\n right: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"inst\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"inst\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"mexc\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"mexc\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"set\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"set\\\"\\n }\\n }]\\n }]\\n }]\\n }\\n }, {\\n type: 'IfStatement',\\n test: {\\n type: 'BinaryExpression',\\n operator: \\\"=\\\",\\n left: {\\n type: 'BinaryExpression',\\n operator: \\\"or\\\",\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"holdn\\\"\\n },\\n right: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"dco\\\"\\n },\\n element: \\\"mds\\\"\\n }\\n },\\n right: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"data\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"data\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"mexc\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"mexc\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"set\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rin\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"set\\\"\\n }\\n }]\\n }]\\n }]\\n }\\n }]\\n }\\n }, {\\n type: 'IfStatement',\\n test: {\\n type: 'BinaryExpression',\\n operator: \\\"=\\\",\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"rstn\\\"\\n },\\n right: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"w\\\"\\n },\\n element: \\\"s\\\"\\n },\\n element: \\\"s\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'EnumLiteral',\\n value: \\\"'1'\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"w\\\"\\n },\\n element: \\\"s\\\"\\n },\\n element: \\\"ps\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'EnumLiteral',\\n value: \\\"'1'\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'IfStatement',\\n test: {\\n type: 'BinaryExpression',\\n operator: \\\"/=\\\",\\n left: {\\n type: 'IndexExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'const',\\n value: \\\"need_extra_sync_reset\\\"\\n },\\n indexes: [{\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"fabtech\\\"\\n }]\\n },\\n right: {\\n type: 'IntLiteral',\\n value: \\\"0\\\"\\n }\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"d\\\"\\n },\\n element: \\\"inst\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'Aggregate',\\n entries: [{\\n type: 'AggregateEntry',\\n tags: [{\\n type: 'Others'\\n }],\\n value: {\\n type: 'Aggregate',\\n entries: [{\\n type: 'AggregateEntry',\\n tags: [{\\n type: 'Others'\\n }],\\n value: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n }]\\n }\\n }]\\n }\\n }]\\n }]\\n }, {\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"r\\\"\\n },\\n element: \\\"x\\\"\\n },\\n element: \\\"mexc\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n }]\\n }]\\n }]\\n }\\n }]\\n }\\n }]\\n }\\n }]\\n };\\n this.elaborate = function() {}\\n }\",\n \"generate (type) {\\n return generate(type)\\n }\",\n \"transform(program) {\\n var options = AsxFormatter.options(this.file.ast);\\n //DefaultFormatter.prototype.transform.apply(this, arguments);\\n\\n var locals = [];\\n var definitions = [];\\n var body = [];\\n program.body.forEach(item=>{\\n switch(item.type){\\n case 'ExpressionStatement':\\n var exp = item.expression;\\n if(exp.type=='Literal' && exp.value.toLowerCase()=='use strict'){\\n return;\\n }\\n break;\\n case 'VariableDeclaration':\\n item.declarations.forEach(d=>{\\n locals.push(d.id);\\n });\\n break;\\n case 'FunctionDeclaration':\\n if(item.id.name=='module'){\\n item.body.body.forEach(s=>{\\n body.push(s);\\n })\\n return;\\n }else\\n if(item._class){\\n item.id =t.identifier('c$'+item._class);\\n body.push(t.expressionStatement(t.callExpression(\\n t.memberExpression(\\n t.identifier('asx'),\\n t.identifier('c$')\\n ),[item])));\\n return;\\n }else{\\n locals.push(item.id);\\n }\\n break;\\n }\\n body.push(item);\\n });\\n\\n var definer = [];\\n\\n\\n\\n if(Object.keys(this.imports).length){\\n\\n Object.keys(this.imports).forEach(key=>{\\n var items = this.imports[key];\\n if(items['*'] && typeof items['*']=='string'){\\n this.imports[key]=items['*'];\\n }\\n });\\n definer.push(t.property('init',\\n t.identifier('imports'),\\n t.valueToNode(this.imports)\\n ))\\n }\\n var exports;\\n if(this.exports['*']){\\n exports = this.exports['*'];\\n delete this.exports['*'];\\n }\\n if(Object.keys(this.exports).length){\\n definer.push(t.property('init',\\n t.identifier('exports'),\\n t.valueToNode(this.exports)\\n ))\\n }\\n if(body.length){\\n if(exports){\\n var ret = [];\\n Object.keys(exports).forEach(key=>{\\n var val = exports[key];\\n if(typeof val=='string') {\\n ret.push(t.property('init',\\n t.literal(key), t.identifier(val == '*' ? key : val)\\n ))\\n }else{\\n ret.push(t.property('init',\\n t.literal(key), val\\n ))\\n }\\n });\\n body.push(t.returnStatement(\\n t.objectExpression(ret)\\n ));\\n }\\n var initializer = t.functionExpression(null, [t.identifier('asx')], t.blockStatement(body));\\n definer.push(t.property('init',\\n t.identifier('execute'),\\n initializer\\n ))\\n }\\n definitions.forEach(item=>{\\n\\n if(item._class){\\n definer.push(t.property('init',\\n t.literal('.'+item._class),\\n item\\n ))\\n }else{\\n definer.push(t.property('init',\\n t.literal(':'+item.id.name),\\n item\\n ))\\n }\\n\\n })\\n definer = t.objectExpression(definer);\\n\\n\\n\\n /*\\n var definer = t.functionExpression(null, [t.identifier(\\\"module\\\")], t.blockStatement(body));\\n if(options.bind){\\n definer = t.callExpression(\\n t.memberExpression(\\n definer,\\n t.identifier(\\\"bind\\\")\\n ),[\\n t.callExpression(t.identifier(\\\"eval\\\"),[t.literal(\\\"this.global=this\\\")])\\n ]\\n );\\n }*/\\n var body = [];\\n var definer = util.template(\\\"asx-module\\\",{\\n MODULE_NAME: t.literal(this.getModuleName()),\\n MODULE_BODY: definer\\n });\\n if(options.runtime){\\n var rt = util.template(\\\"asx-runtime\\\")\\n //rt._compact = true;\\n body.push(t.expressionStatement(rt));\\n }\\n body.push(t.expressionStatement(definer))\\n program.body = body;\\n }\",\n \"function _t_(_p, _n, _g, _port) {\\n hdl.obj(this, _p, _n);\\n this._seq = {\\n type: 'BlockStatement',\\n body: [{\\n type: 'IfStatement',\\n test: {\\n type: 'FunccallExpression',\\n arguments: [{\\n type: 'Association',\\n value: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"sclk\\\"\\n }\\n }]\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"rp\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"rpin\\\"\\n }\\n }]\\n }]\\n }, {\\n type: 'IfStatement',\\n test: {\\n type: 'BinaryExpression',\\n operator: \\\"=\\\",\\n left: {\\n type: 'Identifier',\\n phase: 'name',\\n value: \\\"rstn\\\"\\n },\\n right: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n },\\n consequence: {\\n type: 'BlockStatement',\\n body: [{\\n type: 'AssignmentExpressionSig',\\n left: {\\n type: 'MemberExpression',\\n object: {\\n type: 'Identifier',\\n phase: 'sig',\\n value: \\\"rp\\\"\\n },\\n element: \\\"error\\\"\\n },\\n right: [{\\n type: 'Waveform',\\n list: [{\\n type: 'WaveformElem',\\n value: {\\n type: 'EnumLiteral',\\n value: \\\"'0'\\\"\\n }\\n }]\\n }]\\n }]\\n }\\n }]\\n }\\n }]\\n };\\n this.elaborate = function() {}\\n }\",\n \"build(regexp) {\\n let ast = regexp;\\n\\n if (regexp instanceof RegExp) {\\n regexp = `${regexp}`;\\n }\\n\\n if (typeof regexp === 'string') {\\n ast = parser.parse(regexp, {\\n captureLocations: true,\\n });\\n }\\n\\n return gen(desugar(ast));\\n }\",\n \"function generateSeq() {\\r\\n\\r\\n}\",\n \"function Transform$7() {}\",\n \"function PlatForm() {}\",\n \"function erlang(hljs) {\\n var BASIC_ATOM_RE = '[a-z\\\\'][a-zA-Z0-9_\\\\']*';\\n var FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\\n var ERLANG_RESERVED = {\\n keyword:\\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\\n 'let not of orelse|10 query receive rem try when xor',\\n literal:\\n 'false true'\\n };\\n\\n var COMMENT = hljs.COMMENT('%', '$');\\n var NUMBER = {\\n className: 'number',\\n begin: '\\\\\\\\b(\\\\\\\\d+(_\\\\\\\\d+)*#[a-fA-F0-9]+(_[a-fA-F0-9]+)*|\\\\\\\\d+(_\\\\\\\\d+)*(\\\\\\\\.\\\\\\\\d+(_\\\\\\\\d+)*)?([eE][-+]?\\\\\\\\d+)?)',\\n relevance: 0\\n };\\n var NAMED_FUN = {\\n begin: 'fun\\\\\\\\s+' + BASIC_ATOM_RE + '/\\\\\\\\d+'\\n };\\n var FUNCTION_CALL = {\\n begin: FUNCTION_NAME_RE + '\\\\\\\\(', end: '\\\\\\\\)',\\n returnBegin: true,\\n relevance: 0,\\n contains: [\\n {\\n begin: FUNCTION_NAME_RE, relevance: 0\\n },\\n {\\n begin: '\\\\\\\\(', end: '\\\\\\\\)', endsWithParent: true,\\n returnEnd: true,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n var TUPLE = {\\n begin: '{', end: '}',\\n relevance: 0\\n // \\\"contains\\\" defined later\\n };\\n var VAR1 = {\\n begin: '\\\\\\\\b_([A-Z][A-Za-z0-9_]*)?',\\n relevance: 0\\n };\\n var VAR2 = {\\n begin: '[A-Z][a-zA-Z0-9_]*',\\n relevance: 0\\n };\\n var RECORD_ACCESS = {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0,\\n returnBegin: true,\\n contains: [\\n {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0\\n },\\n {\\n begin: '{', end: '}',\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n\\n var BLOCK_STATEMENTS = {\\n beginKeywords: 'fun receive if try case', end: 'end',\\n keywords: ERLANG_RESERVED\\n };\\n BLOCK_STATEMENTS.contains = [\\n COMMENT,\\n NAMED_FUN,\\n hljs.inherit(hljs.APOS_STRING_MODE, {className: ''}),\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1, VAR2,\\n RECORD_ACCESS\\n ];\\n\\n var BASIC_MODES = [\\n COMMENT,\\n NAMED_FUN,\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1, VAR2,\\n RECORD_ACCESS\\n ];\\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\\n TUPLE.contains = BASIC_MODES;\\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\\n\\n var PARAMS = {\\n className: 'params',\\n begin: '\\\\\\\\(', end: '\\\\\\\\)',\\n contains: BASIC_MODES\\n };\\n return {\\n name: 'Erlang',\\n aliases: ['erl'],\\n keywords: ERLANG_RESERVED,\\n illegal: '(</|\\\\\\\\*=|\\\\\\\\+=|-=|/\\\\\\\\*|\\\\\\\\*/|\\\\\\\\(\\\\\\\\*|\\\\\\\\*\\\\\\\\))',\\n contains: [\\n {\\n className: 'function',\\n begin: '^' + BASIC_ATOM_RE + '\\\\\\\\s*\\\\\\\\(', end: '->',\\n returnBegin: true,\\n illegal: '\\\\\\\\(|#|//|/\\\\\\\\*|\\\\\\\\\\\\\\\\|:|;',\\n contains: [\\n PARAMS,\\n hljs.inherit(hljs.TITLE_MODE, {begin: BASIC_ATOM_RE})\\n ],\\n starts: {\\n end: ';|\\\\\\\\.',\\n keywords: ERLANG_RESERVED,\\n contains: BASIC_MODES\\n }\\n },\\n COMMENT,\\n {\\n begin: '^-', end: '\\\\\\\\.',\\n relevance: 0,\\n excludeEnd: true,\\n returnBegin: true,\\n keywords: {\\n $pattern: '-' + hljs.IDENT_RE,\\n keyword: '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\\n '-behavior -spec'\\n },\\n contains: [PARAMS]\\n },\\n NUMBER,\\n hljs.QUOTE_STRING_MODE,\\n RECORD_ACCESS,\\n VAR1, VAR2,\\n TUPLE,\\n {begin: /\\\\.$/} // relevance booster\\n ]\\n };\\n}\",\n \"private public function m246() {}\",\n \"function symbol(s, p) {\\n var x = syntax[s];\\n if (!x || typeof x !== 'object') {\\n syntax[s] = x = {\\n id: s,\\n lbp: p,\\n value: s\\n };\\n }\\n return x;\\n }\",\n \"function scala(hljs) {\\n\\n var ANNOTATION = { className: 'meta', begin: '@[A-Za-z]+' };\\n\\n // used in strings for escaping/interpolation/substitution\\n var SUBST = {\\n className: 'subst',\\n variants: [\\n {begin: '\\\\\\\\$[A-Za-z0-9_]+'},\\n {begin: '\\\\\\\\${', end: '}'}\\n ]\\n };\\n\\n var STRING = {\\n className: 'string',\\n variants: [\\n {\\n begin: '\\\"', end: '\\\"',\\n illegal: '\\\\\\\\n',\\n contains: [hljs.BACKSLASH_ESCAPE]\\n },\\n {\\n begin: '\\\"\\\"\\\"', end: '\\\"\\\"\\\"',\\n relevance: 10\\n },\\n {\\n begin: '[a-z]+\\\"', end: '\\\"',\\n illegal: '\\\\\\\\n',\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST]\\n },\\n {\\n className: 'string',\\n begin: '[a-z]+\\\"\\\"\\\"', end: '\\\"\\\"\\\"',\\n contains: [SUBST],\\n relevance: 10\\n }\\n ]\\n\\n };\\n\\n var SYMBOL = {\\n className: 'symbol',\\n begin: '\\\\'\\\\\\\\w[\\\\\\\\w\\\\\\\\d_]*(?!\\\\')'\\n };\\n\\n var TYPE = {\\n className: 'type',\\n begin: '\\\\\\\\b[A-Z][A-Za-z0-9_]*',\\n relevance: 0\\n };\\n\\n var NAME = {\\n className: 'title',\\n begin: /[^0-9\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;][^\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;]+|[^0-9\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;=]/,\\n relevance: 0\\n };\\n\\n var CLASS = {\\n className: 'class',\\n beginKeywords: 'class object trait type',\\n end: /[:={\\\\[\\\\n;]/,\\n excludeEnd: true,\\n contains: [\\n hljs.C_LINE_COMMENT_MODE,\\n hljs.C_BLOCK_COMMENT_MODE,\\n {\\n beginKeywords: 'extends with',\\n relevance: 10\\n },\\n {\\n begin: /\\\\[/,\\n end: /\\\\]/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0,\\n contains: [TYPE]\\n },\\n {\\n className: 'params',\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0,\\n contains: [TYPE]\\n },\\n NAME\\n ]\\n };\\n\\n var METHOD = {\\n className: 'function',\\n beginKeywords: 'def',\\n end: /[:={\\\\[(\\\\n;]/,\\n excludeEnd: true,\\n contains: [NAME]\\n };\\n\\n return {\\n name: 'Scala',\\n keywords: {\\n literal: 'true false null',\\n keyword: 'type yield lazy override def with val var sealed abstract private trait object if forSome for while throw finally protected extends import final return else break new catch super class case package default try this match continue throws implicit'\\n },\\n contains: [\\n hljs.C_LINE_COMMENT_MODE,\\n hljs.C_BLOCK_COMMENT_MODE,\\n STRING,\\n SYMBOL,\\n TYPE,\\n METHOD,\\n CLASS,\\n hljs.C_NUMBER_MODE,\\n ANNOTATION\\n ]\\n };\\n}\",\n \"getAst() {\\n\\n return {\\n type: 'string',\\n val: this.value\\n };\\n }\",\n \"constructor() { super(GeneratorConstants.SPACE) }\",\n \"function Stack_Oliteral() {\\r\\n}\",\n \"function initGenerate(TheBigAST) {\\n var globalItems = TheBigAST[0];\\n var functionBox = TheBigAST[1];\\n allFuncs = findAllFuncs(functionBox[0].body);\\n //strLiteralSection = generateStrLiteralSection();\\n var funcsAsm = findFunctionNames(functionBox[0].body);\\n var headers = includeHeaders(globalItems);\\n var dataSection = generateDataSection(globalItems);\\n var textHeader = generateTextHeader(TheBigAST[1]);\\n var compiled = textHeader + funcsAsm + dataSection;\\n console.log(compiled);\\n return 0;\\n}\",\n \"function erlang(hljs) {\\n var BASIC_ATOM_RE = '[a-z\\\\'][a-zA-Z0-9_\\\\']*';\\n var FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\\n var ERLANG_RESERVED = {\\n keyword:\\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\\n 'let not of orelse|10 query receive rem try when xor',\\n literal:\\n 'false true'\\n };\\n\\n var COMMENT = hljs.COMMENT('%', '$');\\n var NUMBER = {\\n className: 'number',\\n begin: '\\\\\\\\b(\\\\\\\\d+#[a-fA-F0-9]+|\\\\\\\\d+(\\\\\\\\.\\\\\\\\d+)?([eE][-+]?\\\\\\\\d+)?)',\\n relevance: 0\\n };\\n var NAMED_FUN = {\\n begin: 'fun\\\\\\\\s+' + BASIC_ATOM_RE + '/\\\\\\\\d+'\\n };\\n var FUNCTION_CALL = {\\n begin: FUNCTION_NAME_RE + '\\\\\\\\(', end: '\\\\\\\\)',\\n returnBegin: true,\\n relevance: 0,\\n contains: [\\n {\\n begin: FUNCTION_NAME_RE, relevance: 0\\n },\\n {\\n begin: '\\\\\\\\(', end: '\\\\\\\\)', endsWithParent: true,\\n returnEnd: true,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n var TUPLE = {\\n begin: '{', end: '}',\\n relevance: 0\\n // \\\"contains\\\" defined later\\n };\\n var VAR1 = {\\n begin: '\\\\\\\\b_([A-Z][A-Za-z0-9_]*)?',\\n relevance: 0\\n };\\n var VAR2 = {\\n begin: '[A-Z][a-zA-Z0-9_]*',\\n relevance: 0\\n };\\n var RECORD_ACCESS = {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0,\\n returnBegin: true,\\n contains: [\\n {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0\\n },\\n {\\n begin: '{', end: '}',\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n\\n var BLOCK_STATEMENTS = {\\n beginKeywords: 'fun receive if try case', end: 'end',\\n keywords: ERLANG_RESERVED\\n };\\n BLOCK_STATEMENTS.contains = [\\n COMMENT,\\n NAMED_FUN,\\n hljs.inherit(hljs.APOS_STRING_MODE, {className: ''}),\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1, VAR2,\\n RECORD_ACCESS\\n ];\\n\\n var BASIC_MODES = [\\n COMMENT,\\n NAMED_FUN,\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1, VAR2,\\n RECORD_ACCESS\\n ];\\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\\n TUPLE.contains = BASIC_MODES;\\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\\n\\n var PARAMS = {\\n className: 'params',\\n begin: '\\\\\\\\(', end: '\\\\\\\\)',\\n contains: BASIC_MODES\\n };\\n return {\\n name: 'Erlang',\\n aliases: ['erl'],\\n keywords: ERLANG_RESERVED,\\n illegal: '(</|\\\\\\\\*=|\\\\\\\\+=|-=|/\\\\\\\\*|\\\\\\\\*/|\\\\\\\\(\\\\\\\\*|\\\\\\\\*\\\\\\\\))',\\n contains: [\\n {\\n className: 'function',\\n begin: '^' + BASIC_ATOM_RE + '\\\\\\\\s*\\\\\\\\(', end: '->',\\n returnBegin: true,\\n illegal: '\\\\\\\\(|#|//|/\\\\\\\\*|\\\\\\\\\\\\\\\\|:|;',\\n contains: [\\n PARAMS,\\n hljs.inherit(hljs.TITLE_MODE, {begin: BASIC_ATOM_RE})\\n ],\\n starts: {\\n end: ';|\\\\\\\\.',\\n keywords: ERLANG_RESERVED,\\n contains: BASIC_MODES\\n }\\n },\\n COMMENT,\\n {\\n begin: '^-', end: '\\\\\\\\.',\\n relevance: 0,\\n excludeEnd: true,\\n returnBegin: true,\\n lexemes: '-' + hljs.IDENT_RE,\\n keywords:\\n '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\\n '-behavior -spec',\\n contains: [PARAMS]\\n },\\n NUMBER,\\n hljs.QUOTE_STRING_MODE,\\n RECORD_ACCESS,\\n VAR1, VAR2,\\n TUPLE,\\n {begin: /\\\\.$/} // relevance booster\\n ]\\n };\\n}\",\n \"build () {}\",\n \"pillage() {\\n return `p ${this.id}`;\\n }\",\n \"function Parser() {\\n\\n}\",\n \"function Literal( arg ) {\\r\\n}\",\n \"function $436c309948703748$var$scala(hljs) {\\n const ANNOTATION = {\\n className: \\\"meta\\\",\\n begin: \\\"@[A-Za-z]+\\\"\\n };\\n // used in strings for escaping/interpolation/substitution\\n const SUBST = {\\n className: \\\"subst\\\",\\n variants: [\\n {\\n begin: \\\"\\\\\\\\$[A-Za-z0-9_]+\\\"\\n },\\n {\\n begin: /\\\\$\\\\{/,\\n end: /\\\\}/\\n }\\n ]\\n };\\n const STRING = {\\n className: \\\"string\\\",\\n variants: [\\n {\\n begin: '\\\"',\\n end: '\\\"',\\n illegal: \\\"\\\\\\\\n\\\",\\n contains: [\\n hljs.BACKSLASH_ESCAPE\\n ]\\n },\\n {\\n begin: '\\\"\\\"\\\"',\\n end: '\\\"\\\"\\\"',\\n relevance: 10\\n },\\n {\\n begin: '[a-z]+\\\"',\\n end: '\\\"',\\n illegal: \\\"\\\\\\\\n\\\",\\n contains: [\\n hljs.BACKSLASH_ESCAPE,\\n SUBST\\n ]\\n },\\n {\\n className: \\\"string\\\",\\n begin: '[a-z]+\\\"\\\"\\\"',\\n end: '\\\"\\\"\\\"',\\n contains: [\\n SUBST\\n ],\\n relevance: 10\\n }\\n ]\\n };\\n const SYMBOL = {\\n className: \\\"symbol\\\",\\n begin: \\\"'\\\\\\\\w[\\\\\\\\w\\\\\\\\d_]*(?!')\\\"\\n };\\n const TYPE = {\\n className: \\\"type\\\",\\n begin: \\\"\\\\\\\\b[A-Z][A-Za-z0-9_]*\\\",\\n relevance: 0\\n };\\n const NAME = {\\n className: \\\"title\\\",\\n begin: /[^0-9\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;][^\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;]+|[^0-9\\\\n\\\\t \\\"'(),.`{}\\\\[\\\\]:;=]/,\\n relevance: 0\\n };\\n const CLASS = {\\n className: \\\"class\\\",\\n beginKeywords: \\\"class object trait type\\\",\\n end: /[:={\\\\[\\\\n;]/,\\n excludeEnd: true,\\n contains: [\\n hljs.C_LINE_COMMENT_MODE,\\n hljs.C_BLOCK_COMMENT_MODE,\\n {\\n beginKeywords: \\\"extends with\\\",\\n relevance: 10\\n },\\n {\\n begin: /\\\\[/,\\n end: /\\\\]/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0,\\n contains: [\\n TYPE\\n ]\\n },\\n {\\n className: \\\"params\\\",\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0,\\n contains: [\\n TYPE\\n ]\\n },\\n NAME\\n ]\\n };\\n const METHOD = {\\n className: \\\"function\\\",\\n beginKeywords: \\\"def\\\",\\n end: /[:={\\\\[(\\\\n;]/,\\n excludeEnd: true,\\n contains: [\\n NAME\\n ]\\n };\\n return {\\n name: \\\"Scala\\\",\\n keywords: {\\n literal: \\\"true false null\\\",\\n keyword: \\\"type yield lazy override def with val var sealed abstract private trait object if forSome for while throw finally protected extends import final return else break new catch super class case package default try this match continue throws implicit\\\"\\n },\\n contains: [\\n hljs.C_LINE_COMMENT_MODE,\\n hljs.C_BLOCK_COMMENT_MODE,\\n STRING,\\n SYMBOL,\\n TYPE,\\n METHOD,\\n CLASS,\\n hljs.C_NUMBER_MODE,\\n ANNOTATION\\n ]\\n };\\n}\",\n \"function $366c34664626fae6$var$gcode(hljs) {\\n const GCODE_IDENT_RE = \\\"[A-Z_][A-Z0-9_.]*\\\";\\n const GCODE_CLOSE_RE = \\\"%\\\";\\n const GCODE_KEYWORDS = {\\n $pattern: GCODE_IDENT_RE,\\n keyword: \\\"IF DO WHILE ENDWHILE CALL ENDIF SUB ENDSUB GOTO REPEAT ENDREPEAT EQ LT GT NE GE LE OR XOR\\\"\\n };\\n const GCODE_START = {\\n className: \\\"meta\\\",\\n begin: \\\"([O])([0-9]+)\\\"\\n };\\n const NUMBER = hljs.inherit(hljs.C_NUMBER_MODE, {\\n begin: \\\"([-+]?((\\\\\\\\.\\\\\\\\d+)|(\\\\\\\\d+)(\\\\\\\\.\\\\\\\\d*)?))|\\\" + hljs.C_NUMBER_RE\\n });\\n const GCODE_CODE = [\\n hljs.C_LINE_COMMENT_MODE,\\n hljs.C_BLOCK_COMMENT_MODE,\\n hljs.COMMENT(/\\\\(/, /\\\\)/),\\n NUMBER,\\n hljs.inherit(hljs.APOS_STRING_MODE, {\\n illegal: null\\n }),\\n hljs.inherit(hljs.QUOTE_STRING_MODE, {\\n illegal: null\\n }),\\n {\\n className: \\\"name\\\",\\n begin: \\\"([G])([0-9]+\\\\\\\\.?[0-9]?)\\\"\\n },\\n {\\n className: \\\"name\\\",\\n begin: \\\"([M])([0-9]+\\\\\\\\.?[0-9]?)\\\"\\n },\\n {\\n className: \\\"attr\\\",\\n begin: \\\"(VC|VS|#)\\\",\\n end: \\\"(\\\\\\\\d+)\\\"\\n },\\n {\\n className: \\\"attr\\\",\\n begin: \\\"(VZOFX|VZOFY|VZOFZ)\\\"\\n },\\n {\\n className: \\\"built_in\\\",\\n begin: \\\"(ATAN|ABS|ACOS|ASIN|SIN|COS|EXP|FIX|FUP|ROUND|LN|TAN)(\\\\\\\\[)\\\",\\n contains: [\\n NUMBER\\n ],\\n end: \\\"\\\\\\\\]\\\"\\n },\\n {\\n className: \\\"symbol\\\",\\n variants: [\\n {\\n begin: \\\"N\\\",\\n end: \\\"\\\\\\\\d+\\\",\\n illegal: \\\"\\\\\\\\W\\\"\\n }\\n ]\\n }\\n ];\\n return {\\n name: \\\"G-code (ISO 6983)\\\",\\n aliases: [\\n \\\"nc\\\"\\n ],\\n // Some implementations (CNC controls) of G-code are interoperable with uppercase and lowercase letters seamlessly.\\n // However, most prefer all uppercase and uppercase is customary.\\n case_insensitive: true,\\n keywords: GCODE_KEYWORDS,\\n contains: [\\n {\\n className: \\\"meta\\\",\\n begin: GCODE_CLOSE_RE\\n },\\n GCODE_START\\n ].concat(GCODE_CODE)\\n };\\n}\",\n \"function TinyLisp(){ \\n}\",\n \"function _G() {}\",\n \"function _G() {}\",\n \"function generateJS(ast, options) {\\n /* These only indent non-empty lines to avoid trailing whitespace. */\\n function indent2(code) {\\n return code.replace(/^(.+)$/gm, ' $1');\\n }\\n\\n function indent6(code) {\\n return code.replace(/^(.+)$/gm, ' $1');\\n }\\n\\n function indent10(code) {\\n return code.replace(/^(.+)$/gm, ' $1');\\n }\\n\\n function generateTables() {\\n if (options.optimize === \\\"size\\\") {\\n return ['peg$consts = [', indent2(ast.consts.join(',\\\\n')), '],', '', 'peg$bytecode = [', indent2(arrays.map(ast.rules, function (rule) {\\n return 'peg$decode(\\\"' + js.stringEscape(arrays.map(rule.bytecode, function (b) {\\n return String.fromCharCode(b + 32);\\n }).join('')) + '\\\")';\\n }).join(',\\\\n')), '],'].join('\\\\n');\\n } else {\\n return arrays.map(ast.consts, function (c, i) {\\n return 'peg$c' + i + ' = ' + c + ',';\\n }).join('\\\\n');\\n }\\n }\\n\\n function generateRuleHeader(ruleNameCode, ruleIndexCode) {\\n var parts = [];\\n parts.push('');\\n\\n if (options.trace) {\\n parts.push(['peg$tracer.trace({', ' type: \\\"rule.enter\\\",', ' rule: ' + ruleNameCode + ',', ' location: peg$computeLocation(startPos, startPos)', '});', ''].join('\\\\n'));\\n }\\n\\n if (options.cache) {\\n parts.push(['var key = peg$currPos * ' + ast.rules.length + ' + ' + ruleIndexCode + ',', ' cached = peg$resultsCache[key];', '', 'if (cached) {', ' peg$currPos = cached.nextPos;', ''].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push(['if (cached.result !== peg$FAILED) {', ' peg$tracer.trace({', ' type: \\\"rule.match\\\",', ' rule: ' + ruleNameCode + ',', ' result: cached.result,', ' location: peg$computeLocation(startPos, peg$currPos)', ' });', '} else {', ' peg$tracer.trace({', ' type: \\\"rule.fail\\\",', ' rule: ' + ruleNameCode + ',', ' location: peg$computeLocation(startPos, startPos)', ' });', '}', ''].join('\\\\n'));\\n }\\n\\n parts.push([' return cached.result;', '}', ''].join('\\\\n'));\\n }\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateRuleFooter(ruleNameCode, resultCode) {\\n var parts = [];\\n\\n if (options.cache) {\\n parts.push(['', 'peg$resultsCache[key] = { nextPos: peg$currPos, result: ' + resultCode + ' };'].join('\\\\n'));\\n }\\n\\n if (options.trace) {\\n parts.push(['', 'if (' + resultCode + ' !== peg$FAILED) {', ' peg$tracer.trace({', ' type: \\\"rule.match\\\",', ' rule: ' + ruleNameCode + ',', ' result: ' + resultCode + ',', ' location: peg$computeLocation(startPos, peg$currPos)', ' });', '} else {', ' peg$tracer.trace({', ' type: \\\"rule.fail\\\",', ' rule: ' + ruleNameCode + ',', ' location: peg$computeLocation(startPos, startPos)', ' });', '}'].join('\\\\n'));\\n }\\n\\n parts.push(['', 'return ' + resultCode + ';'].join('\\\\n'));\\n return parts.join('\\\\n');\\n }\\n\\n function generateInterpreter() {\\n var parts = [];\\n\\n function generateCondition(cond, argsLength) {\\n var baseLength = argsLength + 3,\\n thenLengthCode = 'bc[ip + ' + (baseLength - 2) + ']',\\n elseLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n return ['ends.push(end);', 'ips.push(ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ');', '', 'if (' + cond + ') {', ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ';', ' ip += ' + baseLength + ';', '} else {', ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ';', ' ip += ' + baseLength + ' + ' + thenLengthCode + ';', '}', '', 'break;'].join('\\\\n');\\n }\\n\\n function generateLoop(cond) {\\n var baseLength = 2,\\n bodyLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n return ['if (' + cond + ') {', ' ends.push(end);', ' ips.push(ip);', '', ' end = ip + ' + baseLength + ' + ' + bodyLengthCode + ';', ' ip += ' + baseLength + ';', '} else {', ' ip += ' + baseLength + ' + ' + bodyLengthCode + ';', '}', '', 'break;'].join('\\\\n');\\n }\\n\\n function generateCall() {\\n var baseLength = 4,\\n paramsLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n return ['params = bc.slice(ip + ' + baseLength + ', ip + ' + baseLength + ' + ' + paramsLengthCode + ');', 'for (i = 0; i < ' + paramsLengthCode + '; i++) {', ' params[i] = stack[stack.length - 1 - params[i]];', '}', '', 'stack.splice(', ' stack.length - bc[ip + 2],', ' bc[ip + 2],', ' peg$consts[bc[ip + 1]].apply(null, params)', ');', '', 'ip += ' + baseLength + ' + ' + paramsLengthCode + ';', 'break;'].join('\\\\n');\\n }\\n\\n parts.push(['function peg$decode(s) {', ' var bc = new Array(s.length), i;', '', ' for (i = 0; i < s.length; i++) {', ' bc[i] = s.charCodeAt(i) - 32;', ' }', '', ' return bc;', '}', '', 'function peg$parseRule(index) {'].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([' var bc = peg$bytecode[index],', ' ip = 0,', ' ips = [],', ' end = bc.length,', ' ends = [],', ' stack = [],', ' startPos = peg$currPos,', ' params, i;'].join('\\\\n'));\\n } else {\\n parts.push([' var bc = peg$bytecode[index],', ' ip = 0,', ' ips = [],', ' end = bc.length,', ' ends = [],', ' stack = [],', ' params, i;'].join('\\\\n'));\\n }\\n\\n parts.push(indent2(generateRuleHeader('peg$ruleNames[index]', 'index')));\\n parts.push([\\n /*\\n * The point of the outer loop and the |ips| & |ends| stacks is to avoid\\n * recursive calls for interpreting parts of bytecode. In other words, we\\n * implement the |interpret| operation of the abstract machine without\\n * function calls. Such calls would likely slow the parser down and more\\n * importantly cause stack overflows for complex grammars.\\n */\\n ' while (true) {', ' while (ip < end) {', ' switch (bc[ip]) {', ' case ' + op.PUSH + ':', // PUSH c\\n ' stack.push(peg$consts[bc[ip + 1]]);', ' ip += 2;', ' break;', '', ' case ' + op.PUSH_UNDEFINED + ':', // PUSH_UNDEFINED\\n ' stack.push(void 0);', ' ip++;', ' break;', '', ' case ' + op.PUSH_NULL + ':', // PUSH_NULL\\n ' stack.push(null);', ' ip++;', ' break;', '', ' case ' + op.PUSH_FAILED + ':', // PUSH_FAILED\\n ' stack.push(peg$FAILED);', ' ip++;', ' break;', '', ' case ' + op.PUSH_EMPTY_ARRAY + ':', // PUSH_EMPTY_ARRAY\\n ' stack.push([]);', ' ip++;', ' break;', '', ' case ' + op.PUSH_CURR_POS + ':', // PUSH_CURR_POS\\n ' stack.push(peg$currPos);', ' ip++;', ' break;', '', ' case ' + op.POP + ':', // POP\\n ' stack.pop();', ' ip++;', ' break;', '', ' case ' + op.POP_CURR_POS + ':', // POP_CURR_POS\\n ' peg$currPos = stack.pop();', ' ip++;', ' break;', '', ' case ' + op.POP_N + ':', // POP_N n\\n ' stack.length -= bc[ip + 1];', ' ip += 2;', ' break;', '', ' case ' + op.NIP + ':', // NIP\\n ' stack.splice(-2, 1);', ' ip++;', ' break;', '', ' case ' + op.APPEND + ':', // APPEND\\n ' stack[stack.length - 2].push(stack.pop());', ' ip++;', ' break;', '', ' case ' + op.WRAP + ':', // WRAP n\\n ' stack.push(stack.splice(stack.length - bc[ip + 1], bc[ip + 1]));', ' ip += 2;', ' break;', '', ' case ' + op.TEXT + ':', // TEXT\\n ' stack.push(input.substring(stack.pop(), peg$currPos));', ' ip++;', ' break;', '', ' case ' + op.IF + ':', // IF t, f\\n indent10(generateCondition('stack[stack.length - 1]', 0)), '', ' case ' + op.IF_ERROR + ':', // IF_ERROR t, f\\n indent10(generateCondition('stack[stack.length - 1] === peg$FAILED', 0)), '', ' case ' + op.IF_NOT_ERROR + ':', // IF_NOT_ERROR t, f\\n indent10(generateCondition('stack[stack.length - 1] !== peg$FAILED', 0)), '', ' case ' + op.WHILE_NOT_ERROR + ':', // WHILE_NOT_ERROR b\\n indent10(generateLoop('stack[stack.length - 1] !== peg$FAILED')), '', ' case ' + op.MATCH_ANY + ':', // MATCH_ANY a, f, ...\\n indent10(generateCondition('input.length > peg$currPos', 0)), '', ' case ' + op.MATCH_STRING + ':', // MATCH_STRING s, a, f, ...\\n indent10(generateCondition('input.substr(peg$currPos, peg$consts[bc[ip + 1]].length) === peg$consts[bc[ip + 1]]', 1)), '', ' case ' + op.MATCH_STRING_IC + ':', // MATCH_STRING_IC s, a, f, ...\\n indent10(generateCondition('input.substr(peg$currPos, peg$consts[bc[ip + 1]].length).toLowerCase() === peg$consts[bc[ip + 1]]', 1)), '', ' case ' + op.MATCH_REGEXP + ':', // MATCH_REGEXP r, a, f, ...\\n indent10(generateCondition('peg$consts[bc[ip + 1]].test(input.charAt(peg$currPos))', 1)), '', ' case ' + op.ACCEPT_N + ':', // ACCEPT_N n\\n ' stack.push(input.substr(peg$currPos, bc[ip + 1]));', ' peg$currPos += bc[ip + 1];', ' ip += 2;', ' break;', '', ' case ' + op.ACCEPT_STRING + ':', // ACCEPT_STRING s\\n ' stack.push(peg$consts[bc[ip + 1]]);', ' peg$currPos += peg$consts[bc[ip + 1]].length;', ' ip += 2;', ' break;', '', ' case ' + op.FAIL + ':', // FAIL e\\n ' stack.push(peg$FAILED);', ' if (peg$silentFails === 0) {', ' peg$fail(peg$consts[bc[ip + 1]]);', ' }', ' ip += 2;', ' break;', '', ' case ' + op.LOAD_SAVED_POS + ':', // LOAD_SAVED_POS p\\n ' peg$savedPos = stack[stack.length - 1 - bc[ip + 1]];', ' ip += 2;', ' break;', '', ' case ' + op.UPDATE_SAVED_POS + ':', // UPDATE_SAVED_POS\\n ' peg$savedPos = peg$currPos;', ' ip++;', ' break;', '', ' case ' + op.CALL + ':', // CALL f, n, pc, p1, p2, ..., pN\\n indent10(generateCall()), '', ' case ' + op.RULE + ':', // RULE r\\n ' stack.push(peg$parseRule(bc[ip + 1]));', ' ip += 2;', ' break;', '', ' case ' + op.SILENT_FAILS_ON + ':', // SILENT_FAILS_ON\\n ' peg$silentFails++;', ' ip++;', ' break;', '', ' case ' + op.SILENT_FAILS_OFF + ':', // SILENT_FAILS_OFF\\n ' peg$silentFails--;', ' ip++;', ' break;', '', ' default:', ' throw new Error(\\\"Invalid opcode: \\\" + bc[ip] + \\\".\\\");', ' }', ' }', '', ' if (ends.length > 0) {', ' end = ends.pop();', ' ip = ips.pop();', ' } else {', ' break;', ' }', ' }'].join('\\\\n'));\\n parts.push(indent2(generateRuleFooter('peg$ruleNames[index]', 'stack[0]')));\\n parts.push('}');\\n return parts.join('\\\\n');\\n }\\n\\n function generateRuleFunction(rule) {\\n var parts = [],\\n code;\\n\\n function c(i) {\\n return \\\"peg$c\\\" + i;\\n } // |consts[i]| of the abstract machine\\n\\n\\n function s(i) {\\n return \\\"s\\\" + i;\\n } // |stack[i]| of the abstract machine\\n\\n\\n var stack = {\\n sp: -1,\\n maxSp: -1,\\n push: function (exprCode) {\\n var code = s(++this.sp) + ' = ' + exprCode + ';';\\n\\n if (this.sp > this.maxSp) {\\n this.maxSp = this.sp;\\n }\\n\\n return code;\\n },\\n pop: function (n) {\\n var values;\\n\\n if (n === void 0) {\\n return s(this.sp--);\\n } else {\\n values = arrays.map(arrays.range(this.sp - n + 1, this.sp + 1), s);\\n this.sp -= n;\\n return values;\\n }\\n },\\n top: function () {\\n return s(this.sp);\\n },\\n index: function (i) {\\n return s(this.sp - i);\\n }\\n };\\n\\n function compile(bc) {\\n var ip = 0,\\n end = bc.length,\\n parts = [],\\n value;\\n\\n function compileCondition(cond, argCount) {\\n var baseLength = argCount + 3,\\n thenLength = bc[ip + baseLength - 2],\\n elseLength = bc[ip + baseLength - 1],\\n baseSp = stack.sp,\\n thenCode,\\n elseCode,\\n thenSp,\\n elseSp;\\n ip += baseLength;\\n thenCode = compile(bc.slice(ip, ip + thenLength));\\n thenSp = stack.sp;\\n ip += thenLength;\\n\\n if (elseLength > 0) {\\n stack.sp = baseSp;\\n elseCode = compile(bc.slice(ip, ip + elseLength));\\n elseSp = stack.sp;\\n ip += elseLength;\\n\\n if (thenSp !== elseSp) {\\n throw new Error(\\\"Branches of a condition must move the stack pointer in the same way.\\\");\\n }\\n }\\n\\n parts.push('if (' + cond + ') {');\\n parts.push(indent2(thenCode));\\n\\n if (elseLength > 0) {\\n parts.push('} else {');\\n parts.push(indent2(elseCode));\\n }\\n\\n parts.push('}');\\n }\\n\\n function compileLoop(cond) {\\n var baseLength = 2,\\n bodyLength = bc[ip + baseLength - 1],\\n baseSp = stack.sp,\\n bodyCode,\\n bodySp;\\n ip += baseLength;\\n bodyCode = compile(bc.slice(ip, ip + bodyLength));\\n bodySp = stack.sp;\\n ip += bodyLength;\\n\\n if (bodySp !== baseSp) {\\n throw new Error(\\\"Body of a loop can't move the stack pointer.\\\");\\n }\\n\\n parts.push('while (' + cond + ') {');\\n parts.push(indent2(bodyCode));\\n parts.push('}');\\n }\\n\\n function compileCall() {\\n var baseLength = 4,\\n paramsLength = bc[ip + baseLength - 1];\\n var value = c(bc[ip + 1]) + '(' + arrays.map(bc.slice(ip + baseLength, ip + baseLength + paramsLength), function (p) {\\n return stack.index(p);\\n }).join(', ') + ')';\\n stack.pop(bc[ip + 2]);\\n parts.push(stack.push(value));\\n ip += baseLength + paramsLength;\\n }\\n\\n while (ip < end) {\\n switch (bc[ip]) {\\n case op.PUSH:\\n // PUSH c\\n parts.push(stack.push(c(bc[ip + 1])));\\n ip += 2;\\n break;\\n\\n case op.PUSH_CURR_POS:\\n // PUSH_CURR_POS\\n parts.push(stack.push('peg$currPos'));\\n ip++;\\n break;\\n\\n case op.PUSH_UNDEFINED:\\n // PUSH_UNDEFINED\\n parts.push(stack.push('void 0'));\\n ip++;\\n break;\\n\\n case op.PUSH_NULL:\\n // PUSH_NULL\\n parts.push(stack.push('null'));\\n ip++;\\n break;\\n\\n case op.PUSH_FAILED:\\n // PUSH_FAILED\\n parts.push(stack.push('peg$FAILED'));\\n ip++;\\n break;\\n\\n case op.PUSH_EMPTY_ARRAY:\\n // PUSH_EMPTY_ARRAY\\n parts.push(stack.push('[]'));\\n ip++;\\n break;\\n\\n case op.POP:\\n // POP\\n stack.pop();\\n ip++;\\n break;\\n\\n case op.POP_CURR_POS:\\n // POP_CURR_POS\\n parts.push('peg$currPos = ' + stack.pop() + ';');\\n ip++;\\n break;\\n\\n case op.POP_N:\\n // POP_N n\\n stack.pop(bc[ip + 1]);\\n ip += 2;\\n break;\\n\\n case op.NIP:\\n // NIP\\n value = stack.pop();\\n stack.pop();\\n parts.push(stack.push(value));\\n ip++;\\n break;\\n\\n case op.APPEND:\\n // APPEND\\n value = stack.pop();\\n parts.push(stack.top() + '.push(' + value + ');');\\n ip++;\\n break;\\n\\n case op.WRAP:\\n // WRAP n\\n parts.push(stack.push('[' + stack.pop(bc[ip + 1]).join(', ') + ']'));\\n ip += 2;\\n break;\\n\\n case op.TEXT:\\n // TEXT\\n parts.push(stack.push('input.substring(' + stack.pop() + ', peg$currPos)'));\\n ip++;\\n break;\\n\\n case op.IF:\\n // IF t, f\\n compileCondition(stack.top(), 0);\\n break;\\n\\n case op.IF_ERROR:\\n // IF_ERROR t, f\\n compileCondition(stack.top() + ' === peg$FAILED', 0);\\n break;\\n\\n case op.IF_NOT_ERROR:\\n // IF_NOT_ERROR t, f\\n compileCondition(stack.top() + ' !== peg$FAILED', 0);\\n break;\\n\\n case op.WHILE_NOT_ERROR:\\n // WHILE_NOT_ERROR b\\n compileLoop(stack.top() + ' !== peg$FAILED', 0);\\n break;\\n\\n case op.MATCH_ANY:\\n // MATCH_ANY a, f, ...\\n compileCondition('input.length > peg$currPos', 0);\\n break;\\n\\n case op.MATCH_STRING:\\n // MATCH_STRING s, a, f, ...\\n compileCondition(eval(ast.consts[bc[ip + 1]]).length > 1 ? 'input.substr(peg$currPos, ' + eval(ast.consts[bc[ip + 1]]).length + ') === ' + c(bc[ip + 1]) : 'input.charCodeAt(peg$currPos) === ' + eval(ast.consts[bc[ip + 1]]).charCodeAt(0), 1);\\n break;\\n\\n case op.MATCH_STRING_IC:\\n // MATCH_STRING_IC s, a, f, ...\\n compileCondition('input.substr(peg$currPos, ' + eval(ast.consts[bc[ip + 1]]).length + ').toLowerCase() === ' + c(bc[ip + 1]), 1);\\n break;\\n\\n case op.MATCH_REGEXP:\\n // MATCH_REGEXP r, a, f, ...\\n compileCondition(c(bc[ip + 1]) + '.test(input.charAt(peg$currPos))', 1);\\n break;\\n\\n case op.ACCEPT_N:\\n // ACCEPT_N n\\n parts.push(stack.push(bc[ip + 1] > 1 ? 'input.substr(peg$currPos, ' + bc[ip + 1] + ')' : 'input.charAt(peg$currPos)'));\\n parts.push(bc[ip + 1] > 1 ? 'peg$currPos += ' + bc[ip + 1] + ';' : 'peg$currPos++;');\\n ip += 2;\\n break;\\n\\n case op.ACCEPT_STRING:\\n // ACCEPT_STRING s\\n parts.push(stack.push(c(bc[ip + 1])));\\n parts.push(eval(ast.consts[bc[ip + 1]]).length > 1 ? 'peg$currPos += ' + eval(ast.consts[bc[ip + 1]]).length + ';' : 'peg$currPos++;');\\n ip += 2;\\n break;\\n\\n case op.FAIL:\\n // FAIL e\\n parts.push(stack.push('peg$FAILED'));\\n parts.push('if (peg$silentFails === 0) { peg$fail(' + c(bc[ip + 1]) + '); }');\\n ip += 2;\\n break;\\n\\n case op.LOAD_SAVED_POS:\\n // LOAD_SAVED_POS p\\n parts.push('peg$savedPos = ' + stack.index(bc[ip + 1]) + ';');\\n ip += 2;\\n break;\\n\\n case op.UPDATE_SAVED_POS:\\n // UPDATE_SAVED_POS\\n parts.push('peg$savedPos = peg$currPos;');\\n ip++;\\n break;\\n\\n case op.CALL:\\n // CALL f, n, pc, p1, p2, ..., pN\\n compileCall();\\n break;\\n\\n case op.RULE:\\n // RULE r\\n parts.push(stack.push(\\\"peg$parse\\\" + ast.rules[bc[ip + 1]].name + \\\"()\\\"));\\n ip += 2;\\n break;\\n\\n case op.SILENT_FAILS_ON:\\n // SILENT_FAILS_ON\\n parts.push('peg$silentFails++;');\\n ip++;\\n break;\\n\\n case op.SILENT_FAILS_OFF:\\n // SILENT_FAILS_OFF\\n parts.push('peg$silentFails--;');\\n ip++;\\n break;\\n\\n default:\\n throw new Error(\\\"Invalid opcode: \\\" + bc[ip] + \\\".\\\");\\n }\\n }\\n\\n return parts.join('\\\\n');\\n }\\n\\n code = compile(rule.bytecode);\\n parts.push('function peg$parse' + rule.name + '() {');\\n\\n if (options.trace) {\\n parts.push([' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ',', ' startPos = peg$currPos;'].join('\\\\n'));\\n } else {\\n parts.push(' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ';');\\n }\\n\\n parts.push(indent2(generateRuleHeader('\\\"' + js.stringEscape(rule.name) + '\\\"', asts.indexOfRule(ast, rule.name))));\\n parts.push(indent2(code));\\n parts.push(indent2(generateRuleFooter('\\\"' + js.stringEscape(rule.name) + '\\\"', s(0))));\\n parts.push('}');\\n return parts.join('\\\\n');\\n }\\n\\n function generateToplevel() {\\n var parts = [],\\n startRuleIndices,\\n startRuleIndex,\\n startRuleFunctions,\\n startRuleFunction,\\n ruleNames;\\n parts.push(['function peg$subclass(child, parent) {', ' function ctor() { this.constructor = child; }', ' ctor.prototype = parent.prototype;', ' child.prototype = new ctor();', '}', '', 'function peg$SyntaxError(message, expected, found, location) {', ' this.message = message;', ' this.expected = expected;', ' this.found = found;', ' this.location = location;', ' this.name = \\\"SyntaxError\\\";', '', ' if (typeof Error.captureStackTrace === \\\"function\\\") {', ' Error.captureStackTrace(this, peg$SyntaxError);', ' }', '}', '', 'peg$subclass(peg$SyntaxError, Error);', '', 'peg$SyntaxError.buildMessage = function(expected, found) {', ' var DESCRIBE_EXPECTATION_FNS = {', ' literal: function(expectation) {', ' return \\\"\\\\\\\\\\\\\\\"\\\" + literalEscape(expectation.text) + \\\"\\\\\\\\\\\\\\\"\\\";', ' },', '', ' \\\"class\\\": function(expectation) {', ' var escapedParts = \\\"\\\",', ' i;', '', ' for (i = 0; i < expectation.parts.length; i++) {', ' escapedParts += expectation.parts[i] instanceof Array', ' ? classEscape(expectation.parts[i][0]) + \\\"-\\\" + classEscape(expectation.parts[i][1])', ' : classEscape(expectation.parts[i]);', ' }', '', ' return \\\"[\\\" + (expectation.inverted ? \\\"^\\\" : \\\"\\\") + escapedParts + \\\"]\\\";', ' },', '', ' any: function(expectation) {', ' return \\\"any character\\\";', ' },', '', ' end: function(expectation) {', ' return \\\"end of input\\\";', ' },', '', ' other: function(expectation) {', ' return expectation.description;', ' }', ' };', '', ' function hex(ch) {', ' return ch.charCodeAt(0).toString(16).toUpperCase();', ' }', '', ' function literalEscape(s) {', ' return s', ' .replace(/\\\\\\\\\\\\\\\\/g, \\\\'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\')', // backslash\\n ' .replace(/\\\"/g, \\\\'\\\\\\\\\\\\\\\\\\\"\\\\')', // closing double quote\\n ' .replace(/\\\\\\\\0/g, \\\\'\\\\\\\\\\\\\\\\0\\\\')', // null\\n ' .replace(/\\\\\\\\t/g, \\\\'\\\\\\\\\\\\\\\\t\\\\')', // horizontal tab\\n ' .replace(/\\\\\\\\n/g, \\\\'\\\\\\\\\\\\\\\\n\\\\')', // line feed\\n ' .replace(/\\\\\\\\r/g, \\\\'\\\\\\\\\\\\\\\\r\\\\')', // carriage return\\n ' .replace(/[\\\\\\\\x00-\\\\\\\\x0F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x0\\\\' + hex(ch); })', ' .replace(/[\\\\\\\\x10-\\\\\\\\x1F\\\\\\\\x7F-\\\\\\\\x9F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x\\\\' + hex(ch); });', ' }', '', ' function classEscape(s) {', ' return s', ' .replace(/\\\\\\\\\\\\\\\\/g, \\\\'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\')', // backslash\\n ' .replace(/\\\\\\\\]/g, \\\\'\\\\\\\\\\\\\\\\]\\\\')', // closing bracket\\n ' .replace(/\\\\\\\\^/g, \\\\'\\\\\\\\\\\\\\\\^\\\\')', // caret\\n ' .replace(/-/g, \\\\'\\\\\\\\\\\\\\\\-\\\\')', // dash\\n ' .replace(/\\\\\\\\0/g, \\\\'\\\\\\\\\\\\\\\\0\\\\')', // null\\n ' .replace(/\\\\\\\\t/g, \\\\'\\\\\\\\\\\\\\\\t\\\\')', // horizontal tab\\n ' .replace(/\\\\\\\\n/g, \\\\'\\\\\\\\\\\\\\\\n\\\\')', // line feed\\n ' .replace(/\\\\\\\\r/g, \\\\'\\\\\\\\\\\\\\\\r\\\\')', // carriage return\\n ' .replace(/[\\\\\\\\x00-\\\\\\\\x0F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x0\\\\' + hex(ch); })', ' .replace(/[\\\\\\\\x10-\\\\\\\\x1F\\\\\\\\x7F-\\\\\\\\x9F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x\\\\' + hex(ch); });', ' }', '', ' function describeExpectation(expectation) {', ' return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);', ' }', '', ' function describeExpected(expected) {', ' var descriptions = new Array(expected.length),', ' i, j;', '', ' for (i = 0; i < expected.length; i++) {', ' descriptions[i] = describeExpectation(expected[i]);', ' }', '', ' descriptions.sort();', '', ' if (descriptions.length > 0) {', ' for (i = 1, j = 1; i < descriptions.length; i++) {', ' if (descriptions[i - 1] !== descriptions[i]) {', ' descriptions[j] = descriptions[i];', ' j++;', ' }', ' }', ' descriptions.length = j;', ' }', '', ' switch (descriptions.length) {', ' case 1:', ' return descriptions[0];', '', ' case 2:', ' return descriptions[0] + \\\" or \\\" + descriptions[1];', '', ' default:', ' return descriptions.slice(0, -1).join(\\\", \\\")', ' + \\\", or \\\"', ' + descriptions[descriptions.length - 1];', ' }', ' }', '', ' function describeFound(found) {', ' return found ? \\\"\\\\\\\\\\\"\\\" + literalEscape(found) + \\\"\\\\\\\\\\\"\\\" : \\\"end of input\\\";', ' }', '', ' return \\\"Expected \\\" + describeExpected(expected) + \\\" but \\\" + describeFound(found) + \\\" found.\\\";', '};', ''].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push(['function peg$DefaultTracer() {', ' this.indentLevel = 0;', '}', '', 'peg$DefaultTracer.prototype.trace = function(event) {', ' var that = this;', '', ' function log(event) {', ' function repeat(string, n) {', ' var result = \\\"\\\", i;', '', ' for (i = 0; i < n; i++) {', ' result += string;', ' }', '', ' return result;', ' }', '', ' function pad(string, length) {', ' return string + repeat(\\\" \\\", length - string.length);', ' }', '', ' if (typeof console === \\\"object\\\") {', // IE 8-10\\n ' console.log(', ' event.location.start.line + \\\":\\\" + event.location.start.column + \\\"-\\\"', ' + event.location.end.line + \\\":\\\" + event.location.end.column + \\\" \\\"', ' + pad(event.type, 10) + \\\" \\\"', ' + repeat(\\\" \\\", that.indentLevel) + event.rule', ' );', ' }', ' }', '', ' switch (event.type) {', ' case \\\"rule.enter\\\":', ' log(event);', ' this.indentLevel++;', ' break;', '', ' case \\\"rule.match\\\":', ' this.indentLevel--;', ' log(event);', ' break;', '', ' case \\\"rule.fail\\\":', ' this.indentLevel--;', ' log(event);', ' break;', '', ' default:', ' throw new Error(\\\"Invalid event type: \\\" + event.type + \\\".\\\");', ' }', '};', ''].join('\\\\n'));\\n }\\n\\n parts.push(['function peg$parse(input, options) {', ' options = options !== void 0 ? options : {};', '', ' var peg$FAILED = {},', ''].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n startRuleIndices = '{ ' + arrays.map(options.allowedStartRules, function (r) {\\n return r + ': ' + asts.indexOfRule(ast, r);\\n }).join(', ') + ' }';\\n startRuleIndex = asts.indexOfRule(ast, options.allowedStartRules[0]);\\n parts.push([' peg$startRuleIndices = ' + startRuleIndices + ',', ' peg$startRuleIndex = ' + startRuleIndex + ','].join('\\\\n'));\\n } else {\\n startRuleFunctions = '{ ' + arrays.map(options.allowedStartRules, function (r) {\\n return r + ': peg$parse' + r;\\n }).join(', ') + ' }';\\n startRuleFunction = 'peg$parse' + options.allowedStartRules[0];\\n parts.push([' peg$startRuleFunctions = ' + startRuleFunctions + ',', ' peg$startRuleFunction = ' + startRuleFunction + ','].join('\\\\n'));\\n }\\n\\n parts.push('');\\n parts.push(indent6(generateTables()));\\n parts.push(['', ' peg$currPos = 0,', ' peg$savedPos = 0,', ' peg$posDetailsCache = [{ line: 1, column: 1 }],', ' peg$maxFailPos = 0,', ' peg$maxFailExpected = [],', ' peg$silentFails = 0,', // 0 = report failures, > 0 = silence failures\\n ''].join('\\\\n'));\\n\\n if (options.cache) {\\n parts.push([' peg$resultsCache = {},', ''].join('\\\\n'));\\n }\\n\\n if (options.trace) {\\n if (options.optimize === \\\"size\\\") {\\n ruleNames = '[' + arrays.map(ast.rules, function (r) {\\n return '\\\"' + js.stringEscape(r.name) + '\\\"';\\n }).join(', ') + ']';\\n parts.push([' peg$ruleNames = ' + ruleNames + ',', ''].join('\\\\n'));\\n }\\n\\n parts.push([' peg$tracer = \\\"tracer\\\" in options ? options.tracer : new peg$DefaultTracer(),', ''].join('\\\\n'));\\n }\\n\\n parts.push([' peg$result;', ''].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push([' if (\\\"startRule\\\" in options) {', ' if (!(options.startRule in peg$startRuleIndices)) {', ' throw new Error(\\\"Can\\\\'t start parsing from rule \\\\\\\\\\\"\\\" + options.startRule + \\\"\\\\\\\\\\\".\\\");', ' }', '', ' peg$startRuleIndex = peg$startRuleIndices[options.startRule];', ' }'].join('\\\\n'));\\n } else {\\n parts.push([' if (\\\"startRule\\\" in options) {', ' if (!(options.startRule in peg$startRuleFunctions)) {', ' throw new Error(\\\"Can\\\\'t start parsing from rule \\\\\\\\\\\"\\\" + options.startRule + \\\"\\\\\\\\\\\".\\\");', ' }', '', ' peg$startRuleFunction = peg$startRuleFunctions[options.startRule];', ' }'].join('\\\\n'));\\n }\\n\\n parts.push(['', ' function text() {', ' return input.substring(peg$savedPos, peg$currPos);', ' }', '', ' function location() {', ' return peg$computeLocation(peg$savedPos, peg$currPos);', ' }', '', ' function expected(description, location) {', ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)', '', ' throw peg$buildStructuredError(', ' [peg$otherExpectation(description)],', ' input.substring(peg$savedPos, peg$currPos),', ' location', ' );', ' }', '', ' function error(message, location) {', ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)', '', ' throw peg$buildSimpleError(message, location);', ' }', '', ' function peg$literalExpectation(text, ignoreCase) {', ' return { type: \\\"literal\\\", text: text, ignoreCase: ignoreCase };', ' }', '', ' function peg$classExpectation(parts, inverted, ignoreCase) {', ' return { type: \\\"class\\\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };', ' }', '', ' function peg$anyExpectation() {', ' return { type: \\\"any\\\" };', ' }', '', ' function peg$endExpectation() {', ' return { type: \\\"end\\\" };', ' }', '', ' function peg$otherExpectation(description) {', ' return { type: \\\"other\\\", description: description };', ' }', '', ' function peg$computePosDetails(pos) {', ' var details = peg$posDetailsCache[pos], p;', '', ' if (details) {', ' return details;', ' } else {', ' p = pos - 1;', ' while (!peg$posDetailsCache[p]) {', ' p--;', ' }', '', ' details = peg$posDetailsCache[p];', ' details = {', ' line: details.line,', ' column: details.column', ' };', '', ' while (p < pos) {', ' if (input.charCodeAt(p) === 10) {', ' details.line++;', ' details.column = 1;', ' } else {', ' details.column++;', ' }', '', ' p++;', ' }', '', ' peg$posDetailsCache[pos] = details;', ' return details;', ' }', ' }', '', ' function peg$computeLocation(startPos, endPos) {', ' var startPosDetails = peg$computePosDetails(startPos),', ' endPosDetails = peg$computePosDetails(endPos);', '', ' return {', ' start: {', ' offset: startPos,', ' line: startPosDetails.line,', ' column: startPosDetails.column', ' },', ' end: {', ' offset: endPos,', ' line: endPosDetails.line,', ' column: endPosDetails.column', ' }', ' };', ' }', '', ' function peg$fail(expected) {', ' if (peg$currPos < peg$maxFailPos) { return; }', '', ' if (peg$currPos > peg$maxFailPos) {', ' peg$maxFailPos = peg$currPos;', ' peg$maxFailExpected = [];', ' }', '', ' peg$maxFailExpected.push(expected);', ' }', '', ' function peg$buildSimpleError(message, location) {', ' return new peg$SyntaxError(message, null, null, location);', ' }', '', ' function peg$buildStructuredError(expected, found, location) {', ' return new peg$SyntaxError(', ' peg$SyntaxError.buildMessage(expected, found),', ' expected,', ' found,', ' location', ' );', ' }', ''].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push(indent2(generateInterpreter()));\\n parts.push('');\\n } else {\\n arrays.each(ast.rules, function (rule) {\\n parts.push(indent2(generateRuleFunction(rule)));\\n parts.push('');\\n });\\n }\\n\\n if (ast.initializer) {\\n parts.push(indent2(ast.initializer.code));\\n parts.push('');\\n }\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push(' peg$result = peg$parseRule(peg$startRuleIndex);');\\n } else {\\n parts.push(' peg$result = peg$startRuleFunction();');\\n }\\n\\n parts.push(['', ' if (peg$result !== peg$FAILED && peg$currPos === input.length) {', ' return peg$result;', ' } else {', ' if (peg$result !== peg$FAILED && peg$currPos < input.length) {', ' peg$fail(peg$endExpectation());', ' }', '', ' throw peg$buildStructuredError(', ' peg$maxFailExpected,', ' peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,', ' peg$maxFailPos < input.length', ' ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)', ' : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)', ' );', ' }', '}'].join('\\\\n'));\\n return parts.join('\\\\n');\\n }\\n\\n function generateWrapper(toplevelCode) {\\n function generateGeneratedByComment() {\\n return ['/*', ' * Generated by PEG.js 0.10.0.', ' *', ' * http://pegjs.org/', ' */'].join('\\\\n');\\n }\\n\\n function generateParserObject() {\\n return options.trace ? ['{', ' SyntaxError: peg$SyntaxError,', ' DefaultTracer: peg$DefaultTracer,', ' parse: peg$parse', '}'].join('\\\\n') : ['{', ' SyntaxError: peg$SyntaxError,', ' parse: peg$parse', '}'].join('\\\\n');\\n }\\n\\n var generators = {\\n bare: function () {\\n return [generateGeneratedByComment(), '(function() {', ' \\\"use strict\\\";', '', indent2(toplevelCode), '', indent2('return ' + generateParserObject() + ';'), '})()'].join('\\\\n');\\n },\\n commonjs: function () {\\n var parts = [],\\n dependencyVars = objects.keys(options.dependencies),\\n requires = arrays.map(dependencyVars, function (variable) {\\n return variable + ' = require(\\\"' + js.stringEscape(options.dependencies[variable]) + '\\\")';\\n });\\n parts.push([generateGeneratedByComment(), '', '\\\"use strict\\\";', ''].join('\\\\n'));\\n\\n if (requires.length > 0) {\\n parts.push('var ' + requires.join(', ') + ';');\\n parts.push('');\\n }\\n\\n parts.push([toplevelCode, '', 'module.exports = ' + generateParserObject() + ';', ''].join('\\\\n'));\\n return parts.join('\\\\n');\\n },\\n amd: function () {\\n var dependencyIds = objects.values(options.dependencies),\\n dependencyVars = objects.keys(options.dependencies),\\n dependencies = '[' + arrays.map(dependencyIds, function (id) {\\n return '\\\"' + js.stringEscape(id) + '\\\"';\\n }).join(', ') + ']',\\n params = dependencyVars.join(', ');\\n return [generateGeneratedByComment(), 'define(' + dependencies + ', function(' + params + ') {', ' \\\"use strict\\\";', '', indent2(toplevelCode), '', indent2('return ' + generateParserObject() + ';'), '});', ''].join('\\\\n');\\n },\\n globals: function () {\\n return [generateGeneratedByComment(), '(function(root) {', ' \\\"use strict\\\";', '', indent2(toplevelCode), '', indent2('root.' + options.exportVar + ' = ' + generateParserObject() + ';'), '})(this);', ''].join('\\\\n');\\n },\\n umd: function () {\\n var parts = [],\\n dependencyIds = objects.values(options.dependencies),\\n dependencyVars = objects.keys(options.dependencies),\\n dependencies = '[' + arrays.map(dependencyIds, function (id) {\\n return '\\\"' + js.stringEscape(id) + '\\\"';\\n }).join(', ') + ']',\\n requires = arrays.map(dependencyIds, function (id) {\\n return 'require(\\\"' + js.stringEscape(id) + '\\\")';\\n }).join(', '),\\n params = dependencyVars.join(', ');\\n parts.push([generateGeneratedByComment(), '(function(root, factory) {', ' if (typeof define === \\\"function\\\" && define.amd) {', ' define(' + dependencies + ', factory);', ' } else if (typeof module === \\\"object\\\" && module.exports) {', ' module.exports = factory(' + requires + ');'].join('\\\\n'));\\n\\n if (options.exportVar !== null) {\\n parts.push([' } else {', ' root.' + options.exportVar + ' = factory();'].join('\\\\n'));\\n }\\n\\n parts.push([' }', '})(this, function(' + params + ') {', ' \\\"use strict\\\";', '', indent2(toplevelCode), '', indent2('return ' + generateParserObject() + ';'), '});', ''].join('\\\\n'));\\n return parts.join('\\\\n');\\n }\\n };\\n return generators[options.format]();\\n }\\n\\n ast.code = generateWrapper(generateToplevel());\\n}\",\n \"function gi(t,e){0}\",\n \"function GeneratorClass () {}\",\n \"__getInputString(line, input, block, key, ugen) {\\n let value = '';\\n if (typeof input === 'number') {\\n if (isNaN(key)) {\\n value += `mem[${ugen.__addresses__[key]}]`; //input\\n } else {\\n value += input;\\n }\\n } else if (typeof input === 'boolean') {\\n value += '' + input;\\n } else {\\n //console.log( 'key:', key, 'input:', ugen.inputs, ugen.inputs[ key ] ) \\n // XXX not sure why this has to be here, but somehow non-processed objects\\n // that only contain id numbers are being passed here...\\n\\n if (input !== undefined) {\\n if (Gibberish.mode === 'processor') {\\n if (input.ugenName === undefined && input.id !== undefined) {\\n if (ugen === undefined) {\\n input = Gibberish.processor.ugens.get(input.id);\\n } else {\\n if (ugen.type !== 'seq') {\\n input = Gibberish.processor.ugens.get(input.id);\\n }\\n }\\n }\\n }\\n\\n Gibberish.processUgen(input, block);\\n\\n if (!input.isop) {\\n // check is needed so that graphs with ssds that refer to themselves\\n // don't add the ssd in more than once\\n if (Gibberish.callbackUgens.indexOf(input.callback) === -1) {\\n Gibberish.callbackUgens.push(input.callback);\\n }\\n }\\n\\n value += `v_${input.id}`;\\n input.__varname = value;\\n }\\n }\\n\\n return value;\\n }\",\n \"function parse(){\\n var syntax = esprima.parse(editor.getValue());\\n codeArray = [];\\n expand(syntax.body, codeArray, 0);\\n}\",\n \"constructor() { super([Space.TAG], JXONLexer.lexemes) }\",\n \"function hg(a){this.wh=a;this.wi=\\\"\\\";this.Mo=new RegExp(this.Eb,\\\"g\\\")}\",\n \"function erlang(hljs) {\\n const BASIC_ATOM_RE = '[a-z\\\\'][a-zA-Z0-9_\\\\']*';\\n const FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\\n const ERLANG_RESERVED = {\\n keyword:\\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\\n 'let not of orelse|10 query receive rem try when xor',\\n literal:\\n 'false true'\\n };\\n\\n const COMMENT = hljs.COMMENT('%', '$');\\n const NUMBER = {\\n className: 'number',\\n begin: '\\\\\\\\b(\\\\\\\\d+(_\\\\\\\\d+)*#[a-fA-F0-9]+(_[a-fA-F0-9]+)*|\\\\\\\\d+(_\\\\\\\\d+)*(\\\\\\\\.\\\\\\\\d+(_\\\\\\\\d+)*)?([eE][-+]?\\\\\\\\d+)?)',\\n relevance: 0\\n };\\n const NAMED_FUN = {\\n begin: 'fun\\\\\\\\s+' + BASIC_ATOM_RE + '/\\\\\\\\d+'\\n };\\n const FUNCTION_CALL = {\\n begin: FUNCTION_NAME_RE + '\\\\\\\\(',\\n end: '\\\\\\\\)',\\n returnBegin: true,\\n relevance: 0,\\n contains: [\\n {\\n begin: FUNCTION_NAME_RE,\\n relevance: 0\\n },\\n {\\n begin: '\\\\\\\\(',\\n end: '\\\\\\\\)',\\n endsWithParent: true,\\n returnEnd: true,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n const TUPLE = {\\n begin: /\\\\{/,\\n end: /\\\\}/,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n };\\n const VAR1 = {\\n begin: '\\\\\\\\b_([A-Z][A-Za-z0-9_]*)?',\\n relevance: 0\\n };\\n const VAR2 = {\\n begin: '[A-Z][a-zA-Z0-9_]*',\\n relevance: 0\\n };\\n const RECORD_ACCESS = {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0,\\n returnBegin: true,\\n contains: [\\n {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0\\n },\\n {\\n begin: /\\\\{/,\\n end: /\\\\}/,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n\\n const BLOCK_STATEMENTS = {\\n beginKeywords: 'fun receive if try case',\\n end: 'end',\\n keywords: ERLANG_RESERVED\\n };\\n BLOCK_STATEMENTS.contains = [\\n COMMENT,\\n NAMED_FUN,\\n hljs.inherit(hljs.APOS_STRING_MODE, {\\n className: ''\\n }),\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1,\\n VAR2,\\n RECORD_ACCESS\\n ];\\n\\n const BASIC_MODES = [\\n COMMENT,\\n NAMED_FUN,\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1,\\n VAR2,\\n RECORD_ACCESS\\n ];\\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\\n TUPLE.contains = BASIC_MODES;\\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\\n\\n const PARAMS = {\\n className: 'params',\\n begin: '\\\\\\\\(',\\n end: '\\\\\\\\)',\\n contains: BASIC_MODES\\n };\\n return {\\n name: 'Erlang',\\n aliases: ['erl'],\\n keywords: ERLANG_RESERVED,\\n illegal: '(</|\\\\\\\\*=|\\\\\\\\+=|-=|/\\\\\\\\*|\\\\\\\\*/|\\\\\\\\(\\\\\\\\*|\\\\\\\\*\\\\\\\\))',\\n contains: [\\n {\\n className: 'function',\\n begin: '^' + BASIC_ATOM_RE + '\\\\\\\\s*\\\\\\\\(',\\n end: '->',\\n returnBegin: true,\\n illegal: '\\\\\\\\(|#|//|/\\\\\\\\*|\\\\\\\\\\\\\\\\|:|;',\\n contains: [\\n PARAMS,\\n hljs.inherit(hljs.TITLE_MODE, {\\n begin: BASIC_ATOM_RE\\n })\\n ],\\n starts: {\\n end: ';|\\\\\\\\.',\\n keywords: ERLANG_RESERVED,\\n contains: BASIC_MODES\\n }\\n },\\n COMMENT,\\n {\\n begin: '^-',\\n end: '\\\\\\\\.',\\n relevance: 0,\\n excludeEnd: true,\\n returnBegin: true,\\n keywords: {\\n $pattern: '-' + hljs.IDENT_RE,\\n keyword: '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\\n '-behavior -spec'\\n },\\n contains: [PARAMS]\\n },\\n NUMBER,\\n hljs.QUOTE_STRING_MODE,\\n RECORD_ACCESS,\\n VAR1,\\n VAR2,\\n TUPLE,\\n {\\n begin: /\\\\.$/\\n } // relevance booster\\n ]\\n };\\n}\",\n \"function erlang(hljs) {\\n const BASIC_ATOM_RE = '[a-z\\\\'][a-zA-Z0-9_\\\\']*';\\n const FUNCTION_NAME_RE = '(' + BASIC_ATOM_RE + ':' + BASIC_ATOM_RE + '|' + BASIC_ATOM_RE + ')';\\n const ERLANG_RESERVED = {\\n keyword:\\n 'after and andalso|10 band begin bnot bor bsl bzr bxor case catch cond div end fun if ' +\\n 'let not of orelse|10 query receive rem try when xor',\\n literal:\\n 'false true'\\n };\\n\\n const COMMENT = hljs.COMMENT('%', '$');\\n const NUMBER = {\\n className: 'number',\\n begin: '\\\\\\\\b(\\\\\\\\d+(_\\\\\\\\d+)*#[a-fA-F0-9]+(_[a-fA-F0-9]+)*|\\\\\\\\d+(_\\\\\\\\d+)*(\\\\\\\\.\\\\\\\\d+(_\\\\\\\\d+)*)?([eE][-+]?\\\\\\\\d+)?)',\\n relevance: 0\\n };\\n const NAMED_FUN = {\\n begin: 'fun\\\\\\\\s+' + BASIC_ATOM_RE + '/\\\\\\\\d+'\\n };\\n const FUNCTION_CALL = {\\n begin: FUNCTION_NAME_RE + '\\\\\\\\(',\\n end: '\\\\\\\\)',\\n returnBegin: true,\\n relevance: 0,\\n contains: [\\n {\\n begin: FUNCTION_NAME_RE,\\n relevance: 0\\n },\\n {\\n begin: '\\\\\\\\(',\\n end: '\\\\\\\\)',\\n endsWithParent: true,\\n returnEnd: true,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n const TUPLE = {\\n begin: /\\\\{/,\\n end: /\\\\}/,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n };\\n const VAR1 = {\\n begin: '\\\\\\\\b_([A-Z][A-Za-z0-9_]*)?',\\n relevance: 0\\n };\\n const VAR2 = {\\n begin: '[A-Z][a-zA-Z0-9_]*',\\n relevance: 0\\n };\\n const RECORD_ACCESS = {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0,\\n returnBegin: true,\\n contains: [\\n {\\n begin: '#' + hljs.UNDERSCORE_IDENT_RE,\\n relevance: 0\\n },\\n {\\n begin: /\\\\{/,\\n end: /\\\\}/,\\n relevance: 0\\n // \\\"contains\\\" defined later\\n }\\n ]\\n };\\n\\n const BLOCK_STATEMENTS = {\\n beginKeywords: 'fun receive if try case',\\n end: 'end',\\n keywords: ERLANG_RESERVED\\n };\\n BLOCK_STATEMENTS.contains = [\\n COMMENT,\\n NAMED_FUN,\\n hljs.inherit(hljs.APOS_STRING_MODE, {\\n className: ''\\n }),\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1,\\n VAR2,\\n RECORD_ACCESS\\n ];\\n\\n const BASIC_MODES = [\\n COMMENT,\\n NAMED_FUN,\\n BLOCK_STATEMENTS,\\n FUNCTION_CALL,\\n hljs.QUOTE_STRING_MODE,\\n NUMBER,\\n TUPLE,\\n VAR1,\\n VAR2,\\n RECORD_ACCESS\\n ];\\n FUNCTION_CALL.contains[1].contains = BASIC_MODES;\\n TUPLE.contains = BASIC_MODES;\\n RECORD_ACCESS.contains[1].contains = BASIC_MODES;\\n\\n const PARAMS = {\\n className: 'params',\\n begin: '\\\\\\\\(',\\n end: '\\\\\\\\)',\\n contains: BASIC_MODES\\n };\\n return {\\n name: 'Erlang',\\n aliases: ['erl'],\\n keywords: ERLANG_RESERVED,\\n illegal: '(</|\\\\\\\\*=|\\\\\\\\+=|-=|/\\\\\\\\*|\\\\\\\\*/|\\\\\\\\(\\\\\\\\*|\\\\\\\\*\\\\\\\\))',\\n contains: [\\n {\\n className: 'function',\\n begin: '^' + BASIC_ATOM_RE + '\\\\\\\\s*\\\\\\\\(',\\n end: '->',\\n returnBegin: true,\\n illegal: '\\\\\\\\(|#|//|/\\\\\\\\*|\\\\\\\\\\\\\\\\|:|;',\\n contains: [\\n PARAMS,\\n hljs.inherit(hljs.TITLE_MODE, {\\n begin: BASIC_ATOM_RE\\n })\\n ],\\n starts: {\\n end: ';|\\\\\\\\.',\\n keywords: ERLANG_RESERVED,\\n contains: BASIC_MODES\\n }\\n },\\n COMMENT,\\n {\\n begin: '^-',\\n end: '\\\\\\\\.',\\n relevance: 0,\\n excludeEnd: true,\\n returnBegin: true,\\n keywords: {\\n $pattern: '-' + hljs.IDENT_RE,\\n keyword: '-module -record -undef -export -ifdef -ifndef -author -copyright -doc -vsn ' +\\n '-import -include -include_lib -compile -define -else -endif -file -behaviour ' +\\n '-behavior -spec'\\n },\\n contains: [PARAMS]\\n },\\n NUMBER,\\n hljs.QUOTE_STRING_MODE,\\n RECORD_ACCESS,\\n VAR1,\\n VAR2,\\n TUPLE,\\n {\\n begin: /\\\\.$/\\n } // relevance booster\\n ]\\n };\\n}\",\n \"function generateJS(ast, options) {\\n /* These only indent non-empty lines to avoid trailing whitespace. */\\n function indent2(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n function indent6(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n function indent10(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n\\n function generateTables() {\\n if (options.optimize === \\\"size\\\") {\\n return [\\n 'peg$consts = [',\\n indent2(ast.consts.join(',\\\\n')),\\n '],',\\n '',\\n 'peg$bytecode = [',\\n indent2(arrays.map(ast.rules, function(rule) {\\n return 'peg$decode(\\\"'\\n + js.stringEscape(arrays.map(\\n rule.bytecode,\\n function(b) { return String.fromCharCode(b + 32); }\\n ).join(''))\\n + '\\\")';\\n }).join(',\\\\n')),\\n '],'\\n ].join('\\\\n');\\n } else {\\n return arrays.map(\\n ast.consts,\\n function(c, i) { return 'peg$c' + i + ' = ' + c + ','; }\\n ).join('\\\\n');\\n }\\n }\\n\\n function generateRuleHeader(ruleNameCode, ruleIndexCode) {\\n var parts = [];\\n\\n parts.push('');\\n\\n if (options.trace) {\\n parts.push([\\n 'peg$tracer.trace({',\\n ' type: \\\"rule.enter\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' location: peg$computeLocation(startPos, startPos)',\\n '});',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n if (options.cache) {\\n parts.push([\\n 'var key = peg$currPos * ' + ast.rules.length + ' + ' + ruleIndexCode + ',',\\n ' cached = peg$resultsCache[key];',\\n '',\\n 'if (cached) {',\\n ' peg$currPos = cached.nextPos;',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n 'if (cached.result !== peg$FAILED) {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.match\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' result: cached.result,',\\n ' location: peg$computeLocation(startPos, peg$currPos)',\\n ' });',\\n '} else {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.fail\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' location: peg$computeLocation(startPos, startPos)',\\n ' });',\\n '}',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' return cached.result;',\\n '}',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateRuleFooter(ruleNameCode, resultCode) {\\n var parts = [];\\n\\n if (options.cache) {\\n parts.push([\\n '',\\n 'peg$resultsCache[key] = { nextPos: peg$currPos, result: ' + resultCode + ' };'\\n ].join('\\\\n'));\\n }\\n\\n if (options.trace) {\\n parts.push([\\n '',\\n 'if (' + resultCode + ' !== peg$FAILED) {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.match\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' result: ' + resultCode + ',',\\n ' location: peg$computeLocation(startPos, peg$currPos)',\\n ' });',\\n '} else {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.fail\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' location: peg$computeLocation(startPos, startPos)',\\n ' });',\\n '}'\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n '',\\n 'return ' + resultCode + ';'\\n ].join('\\\\n'));\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateInterpreter() {\\n var parts = [];\\n\\n function generateCondition(cond, argsLength) {\\n var baseLength = argsLength + 3,\\n thenLengthCode = 'bc[ip + ' + (baseLength - 2) + ']',\\n elseLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n\\n return [\\n 'ends.push(end);',\\n 'ips.push(ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ');',\\n '',\\n 'if (' + cond + ') {',\\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ';',\\n ' ip += ' + baseLength + ';',\\n '} else {',\\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ';',\\n ' ip += ' + baseLength + ' + ' + thenLengthCode + ';',\\n '}',\\n '',\\n 'break;'\\n ].join('\\\\n');\\n }\\n\\n function generateLoop(cond) {\\n var baseLength = 2,\\n bodyLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n\\n return [\\n 'if (' + cond + ') {',\\n ' ends.push(end);',\\n ' ips.push(ip);',\\n '',\\n ' end = ip + ' + baseLength + ' + ' + bodyLengthCode + ';',\\n ' ip += ' + baseLength + ';',\\n '} else {',\\n ' ip += ' + baseLength + ' + ' + bodyLengthCode + ';',\\n '}',\\n '',\\n 'break;'\\n ].join('\\\\n');\\n }\\n\\n function generateCall() {\\n var baseLength = 4,\\n paramsLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n\\n return [\\n 'params = bc.slice(ip + ' + baseLength + ', ip + ' + baseLength + ' + ' + paramsLengthCode + ');',\\n 'for (i = 0; i < ' + paramsLengthCode + '; i++) {',\\n ' params[i] = stack[stack.length - 1 - params[i]];',\\n '}',\\n '',\\n 'stack.splice(',\\n ' stack.length - bc[ip + 2],',\\n ' bc[ip + 2],',\\n ' peg$consts[bc[ip + 1]].apply(null, params)',\\n ');',\\n '',\\n 'ip += ' + baseLength + ' + ' + paramsLengthCode + ';',\\n 'break;'\\n ].join('\\\\n');\\n }\\n\\n parts.push([\\n 'function peg$decode(s) {',\\n ' var bc = new Array(s.length), i;',\\n '',\\n ' for (i = 0; i < s.length; i++) {',\\n ' bc[i] = s.charCodeAt(i) - 32;',\\n ' }',\\n '',\\n ' return bc;',\\n '}',\\n '',\\n 'function peg$parseRule(index) {'\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n ' var bc = peg$bytecode[index],',\\n ' ip = 0,',\\n ' ips = [],',\\n ' end = bc.length,',\\n ' ends = [],',\\n ' stack = [],',\\n ' startPos = peg$currPos,',\\n ' params, i;'\\n ].join('\\\\n'));\\n } else {\\n parts.push([\\n ' var bc = peg$bytecode[index],',\\n ' ip = 0,',\\n ' ips = [],',\\n ' end = bc.length,',\\n ' ends = [],',\\n ' stack = [],',\\n ' params, i;'\\n ].join('\\\\n'));\\n }\\n\\n parts.push(indent2(generateRuleHeader('peg$ruleNames[index]', 'index')));\\n\\n parts.push([\\n /*\\n * The point of the outer loop and the |ips| & |ends| stacks is to avoid\\n * recursive calls for interpreting parts of bytecode. In other words, we\\n * implement the |interpret| operation of the abstract machine without\\n * function calls. Such calls would likely slow the parser down and more\\n * importantly cause stack overflows for complex grammars.\\n */\\n ' while (true) {',\\n ' while (ip < end) {',\\n ' switch (bc[ip]) {',\\n ' case ' + op.PUSH + ':', // PUSH c\\n ' stack.push(peg$consts[bc[ip + 1]]);',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_UNDEFINED + ':', // PUSH_UNDEFINED\\n ' stack.push(void 0);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_NULL + ':', // PUSH_NULL\\n ' stack.push(null);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_FAILED + ':', // PUSH_FAILED\\n ' stack.push(peg$FAILED);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_EMPTY_ARRAY + ':', // PUSH_EMPTY_ARRAY\\n ' stack.push([]);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_CURR_POS + ':', // PUSH_CURR_POS\\n ' stack.push(peg$currPos);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.POP + ':', // POP\\n ' stack.pop();',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.POP_CURR_POS + ':', // POP_CURR_POS\\n ' peg$currPos = stack.pop();',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.POP_N + ':', // POP_N n\\n ' stack.length -= bc[ip + 1];',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.NIP + ':', // NIP\\n ' stack.splice(-2, 1);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.APPEND + ':', // APPEND\\n ' stack[stack.length - 2].push(stack.pop());',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.WRAP + ':', // WRAP n\\n ' stack.push(stack.splice(stack.length - bc[ip + 1], bc[ip + 1]));',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.TEXT + ':', // TEXT\\n ' stack.push(input.substring(stack.pop(), peg$currPos));',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.IF + ':', // IF t, f\\n indent10(generateCondition('stack[stack.length - 1]', 0)),\\n '',\\n ' case ' + op.IF_ERROR + ':', // IF_ERROR t, f\\n indent10(generateCondition(\\n 'stack[stack.length - 1] === peg$FAILED',\\n 0\\n )),\\n '',\\n ' case ' + op.IF_NOT_ERROR + ':', // IF_NOT_ERROR t, f\\n indent10(\\n generateCondition('stack[stack.length - 1] !== peg$FAILED',\\n 0\\n )),\\n '',\\n ' case ' + op.WHILE_NOT_ERROR + ':', // WHILE_NOT_ERROR b\\n indent10(generateLoop('stack[stack.length - 1] !== peg$FAILED')),\\n '',\\n ' case ' + op.MATCH_ANY + ':', // MATCH_ANY a, f, ...\\n indent10(generateCondition('input.length > peg$currPos', 0)),\\n '',\\n ' case ' + op.MATCH_STRING + ':', // MATCH_STRING s, a, f, ...\\n indent10(generateCondition(\\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length) === peg$consts[bc[ip + 1]]',\\n 1\\n )),\\n '',\\n ' case ' + op.MATCH_STRING_IC + ':', // MATCH_STRING_IC s, a, f, ...\\n indent10(generateCondition(\\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length).toLowerCase() === peg$consts[bc[ip + 1]]',\\n 1\\n )),\\n '',\\n ' case ' + op.MATCH_REGEXP + ':', // MATCH_REGEXP r, a, f, ...\\n indent10(generateCondition(\\n 'peg$consts[bc[ip + 1]].test(input.charAt(peg$currPos))',\\n 1\\n )),\\n '',\\n ' case ' + op.ACCEPT_N + ':', // ACCEPT_N n\\n ' stack.push(input.substr(peg$currPos, bc[ip + 1]));',\\n ' peg$currPos += bc[ip + 1];',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.ACCEPT_STRING + ':', // ACCEPT_STRING s\\n ' stack.push(peg$consts[bc[ip + 1]]);',\\n ' peg$currPos += peg$consts[bc[ip + 1]].length;',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.FAIL + ':', // FAIL e\\n ' stack.push(peg$FAILED);',\\n ' if (peg$silentFails === 0) {',\\n ' peg$fail(peg$consts[bc[ip + 1]]);',\\n ' }',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.LOAD_SAVED_POS + ':', // LOAD_SAVED_POS p\\n ' peg$savedPos = stack[stack.length - 1 - bc[ip + 1]];',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.UPDATE_SAVED_POS + ':', // UPDATE_SAVED_POS\\n ' peg$savedPos = peg$currPos;',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.CALL + ':', // CALL f, n, pc, p1, p2, ..., pN\\n indent10(generateCall()),\\n '',\\n ' case ' + op.RULE + ':', // RULE r\\n ' stack.push(peg$parseRule(bc[ip + 1]));',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.SILENT_FAILS_ON + ':', // SILENT_FAILS_ON\\n ' peg$silentFails++;',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.SILENT_FAILS_OFF + ':', // SILENT_FAILS_OFF\\n ' peg$silentFails--;',\\n ' ip++;',\\n ' break;',\\n '',\\n ' default:',\\n ' throw new Error(\\\"Invalid opcode: \\\" + bc[ip] + \\\".\\\");',\\n ' }',\\n ' }',\\n '',\\n ' if (ends.length > 0) {',\\n ' end = ends.pop();',\\n ' ip = ips.pop();',\\n ' } else {',\\n ' break;',\\n ' }',\\n ' }'\\n ].join('\\\\n'));\\n\\n parts.push(indent2(generateRuleFooter('peg$ruleNames[index]', 'stack[0]')));\\n parts.push('}');\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateRuleFunction(rule) {\\n var parts = [], code;\\n\\n function c(i) { return \\\"peg$c\\\" + i; } // |consts[i]| of the abstract machine\\n function s(i) { return \\\"s\\\" + i; } // |stack[i]| of the abstract machine\\n\\n var stack = {\\n sp: -1,\\n maxSp: -1,\\n\\n push: function(exprCode) {\\n var code = s(++this.sp) + ' = ' + exprCode + ';';\\n\\n if (this.sp > this.maxSp) { this.maxSp = this.sp; }\\n\\n return code;\\n },\\n\\n pop: function(n) {\\n var values;\\n\\n if (n === void 0) {\\n return s(this.sp--);\\n } else {\\n values = arrays.map(arrays.range(this.sp - n + 1, this.sp + 1), s);\\n this.sp -= n;\\n\\n return values;\\n }\\n },\\n\\n top: function() {\\n return s(this.sp);\\n },\\n\\n index: function(i) {\\n return s(this.sp - i);\\n }\\n };\\n\\n function compile(bc) {\\n var ip = 0,\\n end = bc.length,\\n parts = [],\\n value;\\n\\n function compileCondition(cond, argCount) {\\n var baseLength = argCount + 3,\\n thenLength = bc[ip + baseLength - 2],\\n elseLength = bc[ip + baseLength - 1],\\n baseSp = stack.sp,\\n thenCode, elseCode, thenSp, elseSp;\\n\\n ip += baseLength;\\n thenCode = compile(bc.slice(ip, ip + thenLength));\\n thenSp = stack.sp;\\n ip += thenLength;\\n\\n if (elseLength > 0) {\\n stack.sp = baseSp;\\n elseCode = compile(bc.slice(ip, ip + elseLength));\\n elseSp = stack.sp;\\n ip += elseLength;\\n\\n if (thenSp !== elseSp) {\\n throw new Error(\\n \\\"Branches of a condition must move the stack pointer in the same way.\\\"\\n );\\n }\\n }\\n\\n parts.push('if (' + cond + ') {');\\n parts.push(indent2(thenCode));\\n if (elseLength > 0) {\\n parts.push('} else {');\\n parts.push(indent2(elseCode));\\n }\\n parts.push('}');\\n }\\n\\n function compileLoop(cond) {\\n var baseLength = 2,\\n bodyLength = bc[ip + baseLength - 1],\\n baseSp = stack.sp,\\n bodyCode, bodySp;\\n\\n ip += baseLength;\\n bodyCode = compile(bc.slice(ip, ip + bodyLength));\\n bodySp = stack.sp;\\n ip += bodyLength;\\n\\n if (bodySp !== baseSp) {\\n throw new Error(\\\"Body of a loop can't move the stack pointer.\\\");\\n }\\n\\n parts.push('while (' + cond + ') {');\\n parts.push(indent2(bodyCode));\\n parts.push('}');\\n }\\n\\n function compileCall() {\\n var baseLength = 4,\\n paramsLength = bc[ip + baseLength - 1];\\n\\n var value = c(bc[ip + 1]) + '('\\n + arrays.map(\\n bc.slice(ip + baseLength, ip + baseLength + paramsLength),\\n function(p) { return stack.index(p); }\\n ).join(', ')\\n + ')';\\n stack.pop(bc[ip + 2]);\\n parts.push(stack.push(value));\\n ip += baseLength + paramsLength;\\n }\\n\\n while (ip < end) {\\n switch (bc[ip]) {\\n case op.PUSH: // PUSH c\\n parts.push(stack.push(c(bc[ip + 1])));\\n ip += 2;\\n break;\\n\\n case op.PUSH_CURR_POS: // PUSH_CURR_POS\\n parts.push(stack.push('peg$currPos'));\\n ip++;\\n break;\\n\\n case op.PUSH_UNDEFINED: // PUSH_UNDEFINED\\n parts.push(stack.push('void 0'));\\n ip++;\\n break;\\n\\n case op.PUSH_NULL: // PUSH_NULL\\n parts.push(stack.push('null'));\\n ip++;\\n break;\\n\\n case op.PUSH_FAILED: // PUSH_FAILED\\n parts.push(stack.push('peg$FAILED'));\\n ip++;\\n break;\\n\\n case op.PUSH_EMPTY_ARRAY: // PUSH_EMPTY_ARRAY\\n parts.push(stack.push('[]'));\\n ip++;\\n break;\\n\\n case op.POP: // POP\\n stack.pop();\\n ip++;\\n break;\\n\\n case op.POP_CURR_POS: // POP_CURR_POS\\n parts.push('peg$currPos = ' + stack.pop() + ';');\\n ip++;\\n break;\\n\\n case op.POP_N: // POP_N n\\n stack.pop(bc[ip + 1]);\\n ip += 2;\\n break;\\n\\n case op.NIP: // NIP\\n value = stack.pop();\\n stack.pop();\\n parts.push(stack.push(value));\\n ip++;\\n break;\\n\\n case op.APPEND: // APPEND\\n value = stack.pop();\\n parts.push(stack.top() + '.push(' + value + ');');\\n ip++;\\n break;\\n\\n case op.WRAP: // WRAP n\\n parts.push(\\n stack.push('[' + stack.pop(bc[ip + 1]).join(', ') + ']')\\n );\\n ip += 2;\\n break;\\n\\n case op.TEXT: // TEXT\\n parts.push(\\n stack.push('input.substring(' + stack.pop() + ', peg$currPos)')\\n );\\n ip++;\\n break;\\n\\n case op.IF: // IF t, f\\n compileCondition(stack.top(), 0);\\n break;\\n\\n case op.IF_ERROR: // IF_ERROR t, f\\n compileCondition(stack.top() + ' === peg$FAILED', 0);\\n break;\\n\\n case op.IF_NOT_ERROR: // IF_NOT_ERROR t, f\\n compileCondition(stack.top() + ' !== peg$FAILED', 0);\\n break;\\n\\n case op.WHILE_NOT_ERROR: // WHILE_NOT_ERROR b\\n compileLoop(stack.top() + ' !== peg$FAILED', 0);\\n break;\\n\\n case op.MATCH_ANY: // MATCH_ANY a, f, ...\\n compileCondition('input.length > peg$currPos', 0);\\n break;\\n\\n case op.MATCH_STRING: // MATCH_STRING s, a, f, ...\\n compileCondition(\\n eval(ast.consts[bc[ip + 1]]).length > 1\\n ? 'input.substr(peg$currPos, '\\n + eval(ast.consts[bc[ip + 1]]).length\\n + ') === '\\n + c(bc[ip + 1])\\n : 'input.charCodeAt(peg$currPos) === '\\n + eval(ast.consts[bc[ip + 1]]).charCodeAt(0),\\n 1\\n );\\n break;\\n\\n case op.MATCH_STRING_IC: // MATCH_STRING_IC s, a, f, ...\\n compileCondition(\\n 'input.substr(peg$currPos, '\\n + eval(ast.consts[bc[ip + 1]]).length\\n + ').toLowerCase() === '\\n + c(bc[ip + 1]),\\n 1\\n );\\n break;\\n\\n case op.MATCH_REGEXP: // MATCH_REGEXP r, a, f, ...\\n compileCondition(\\n c(bc[ip + 1]) + '.test(input.charAt(peg$currPos))',\\n 1\\n );\\n break;\\n\\n case op.ACCEPT_N: // ACCEPT_N n\\n parts.push(stack.push(\\n bc[ip + 1] > 1\\n ? 'input.substr(peg$currPos, ' + bc[ip + 1] + ')'\\n : 'input.charAt(peg$currPos)'\\n ));\\n parts.push(\\n bc[ip + 1] > 1\\n ? 'peg$currPos += ' + bc[ip + 1] + ';'\\n : 'peg$currPos++;'\\n );\\n ip += 2;\\n break;\\n\\n case op.ACCEPT_STRING: // ACCEPT_STRING s\\n parts.push(stack.push(c(bc[ip + 1])));\\n parts.push(\\n eval(ast.consts[bc[ip + 1]]).length > 1\\n ? 'peg$currPos += ' + eval(ast.consts[bc[ip + 1]]).length + ';'\\n : 'peg$currPos++;'\\n );\\n ip += 2;\\n break;\\n\\n case op.FAIL: // FAIL e\\n parts.push(stack.push('peg$FAILED'));\\n parts.push('if (peg$silentFails === 0) { peg$fail(' + c(bc[ip + 1]) + '); }');\\n ip += 2;\\n break;\\n\\n case op.LOAD_SAVED_POS: // LOAD_SAVED_POS p\\n parts.push('peg$savedPos = ' + stack.index(bc[ip + 1]) + ';');\\n ip += 2;\\n break;\\n\\n case op.UPDATE_SAVED_POS: // UPDATE_SAVED_POS\\n parts.push('peg$savedPos = peg$currPos;');\\n ip++;\\n break;\\n\\n case op.CALL: // CALL f, n, pc, p1, p2, ..., pN\\n compileCall();\\n break;\\n\\n case op.RULE: // RULE r\\n parts.push(stack.push(\\\"peg$parse\\\" + ast.rules[bc[ip + 1]].name + \\\"()\\\"));\\n ip += 2;\\n break;\\n\\n case op.SILENT_FAILS_ON: // SILENT_FAILS_ON\\n parts.push('peg$silentFails++;');\\n ip++;\\n break;\\n\\n case op.SILENT_FAILS_OFF: // SILENT_FAILS_OFF\\n parts.push('peg$silentFails--;');\\n ip++;\\n break;\\n\\n default:\\n throw new Error(\\\"Invalid opcode: \\\" + bc[ip] + \\\".\\\");\\n }\\n }\\n\\n return parts.join('\\\\n');\\n }\\n\\n code = compile(rule.bytecode);\\n\\n parts.push('function peg$parse' + rule.name + '() {');\\n\\n if (options.trace) {\\n parts.push([\\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ',',\\n ' startPos = peg$currPos;'\\n ].join('\\\\n'));\\n } else {\\n parts.push(\\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ';'\\n );\\n }\\n\\n parts.push(indent2(generateRuleHeader(\\n '\\\"' + js.stringEscape(rule.name) + '\\\"',\\n asts.indexOfRule(ast, rule.name)\\n )));\\n parts.push(indent2(code));\\n parts.push(indent2(generateRuleFooter(\\n '\\\"' + js.stringEscape(rule.name) + '\\\"',\\n s(0)\\n )));\\n\\n parts.push('}');\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateToplevel() {\\n var parts = [],\\n startRuleIndices, startRuleIndex,\\n startRuleFunctions, startRuleFunction,\\n ruleNames;\\n\\n parts.push([\\n 'function peg$subclass(child, parent) {',\\n ' function ctor() { this.constructor = child; }',\\n ' ctor.prototype = parent.prototype;',\\n ' child.prototype = new ctor();',\\n '}',\\n '',\\n 'function peg$SyntaxError(message, expected, found, location) {',\\n ' this.message = message;',\\n ' this.expected = expected;',\\n ' this.found = found;',\\n ' this.location = location;',\\n ' this.name = \\\"SyntaxError\\\";',\\n '',\\n ' if (typeof Error.captureStackTrace === \\\"function\\\") {',\\n ' Error.captureStackTrace(this, peg$SyntaxError);',\\n ' }',\\n '}',\\n '',\\n 'peg$subclass(peg$SyntaxError, Error);',\\n '',\\n 'peg$SyntaxError.buildMessage = function(expected, found) {',\\n ' var DESCRIBE_EXPECTATION_FNS = {',\\n ' literal: function(expectation) {',\\n ' return \\\"\\\\\\\\\\\\\\\"\\\" + literalEscape(expectation.text) + \\\"\\\\\\\\\\\\\\\"\\\";',\\n ' },',\\n '',\\n ' \\\"class\\\": function(expectation) {',\\n ' var escapedParts = \\\"\\\",',\\n ' i;',\\n '',\\n ' for (i = 0; i < expectation.parts.length; i++) {',\\n ' escapedParts += expectation.parts[i] instanceof Array',\\n ' ? classEscape(expectation.parts[i][0]) + \\\"-\\\" + classEscape(expectation.parts[i][1])',\\n ' : classEscape(expectation.parts[i]);',\\n ' }',\\n '',\\n ' return \\\"[\\\" + (expectation.inverted ? \\\"^\\\" : \\\"\\\") + escapedParts + \\\"]\\\";',\\n ' },',\\n '',\\n ' any: function(expectation) {',\\n ' return \\\"any character\\\";',\\n ' },',\\n '',\\n ' end: function(expectation) {',\\n ' return \\\"end of input\\\";',\\n ' },',\\n '',\\n ' other: function(expectation) {',\\n ' return expectation.description;',\\n ' }',\\n ' };',\\n '',\\n ' function hex(ch) {',\\n ' return ch.charCodeAt(0).toString(16).toUpperCase();',\\n ' }',\\n '',\\n ' function literalEscape(s) {',\\n ' return s',\\n ' .replace(/\\\\\\\\\\\\\\\\/g, \\\\'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\')', // backslash\\n ' .replace(/\\\"/g, \\\\'\\\\\\\\\\\\\\\\\\\"\\\\')', // closing double quote\\n ' .replace(/\\\\\\\\0/g, \\\\'\\\\\\\\\\\\\\\\0\\\\')', // null\\n ' .replace(/\\\\\\\\t/g, \\\\'\\\\\\\\\\\\\\\\t\\\\')', // horizontal tab\\n ' .replace(/\\\\\\\\n/g, \\\\'\\\\\\\\\\\\\\\\n\\\\')', // line feed\\n ' .replace(/\\\\\\\\r/g, \\\\'\\\\\\\\\\\\\\\\r\\\\')', // carriage return\\n ' .replace(/[\\\\\\\\x00-\\\\\\\\x0F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x0\\\\' + hex(ch); })',\\n ' .replace(/[\\\\\\\\x10-\\\\\\\\x1F\\\\\\\\x7F-\\\\\\\\x9F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x\\\\' + hex(ch); });',\\n ' }',\\n '',\\n ' function classEscape(s) {',\\n ' return s',\\n ' .replace(/\\\\\\\\\\\\\\\\/g, \\\\'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\')', // backslash\\n ' .replace(/\\\\\\\\]/g, \\\\'\\\\\\\\\\\\\\\\]\\\\')', // closing bracket\\n ' .replace(/\\\\\\\\^/g, \\\\'\\\\\\\\\\\\\\\\^\\\\')', // caret\\n ' .replace(/-/g, \\\\'\\\\\\\\\\\\\\\\-\\\\')', // dash\\n ' .replace(/\\\\\\\\0/g, \\\\'\\\\\\\\\\\\\\\\0\\\\')', // null\\n ' .replace(/\\\\\\\\t/g, \\\\'\\\\\\\\\\\\\\\\t\\\\')', // horizontal tab\\n ' .replace(/\\\\\\\\n/g, \\\\'\\\\\\\\\\\\\\\\n\\\\')', // line feed\\n ' .replace(/\\\\\\\\r/g, \\\\'\\\\\\\\\\\\\\\\r\\\\')', // carriage return\\n ' .replace(/[\\\\\\\\x00-\\\\\\\\x0F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x0\\\\' + hex(ch); })',\\n ' .replace(/[\\\\\\\\x10-\\\\\\\\x1F\\\\\\\\x7F-\\\\\\\\x9F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x\\\\' + hex(ch); });',\\n ' }',\\n '',\\n ' function describeExpectation(expectation) {',\\n ' return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);',\\n ' }',\\n '',\\n ' function describeExpected(expected) {',\\n ' var descriptions = new Array(expected.length),',\\n ' i, j;',\\n '',\\n ' for (i = 0; i < expected.length; i++) {',\\n ' descriptions[i] = describeExpectation(expected[i]);',\\n ' }',\\n '',\\n ' descriptions.sort();',\\n '',\\n ' if (descriptions.length > 0) {',\\n ' for (i = 1, j = 1; i < descriptions.length; i++) {',\\n ' if (descriptions[i - 1] !== descriptions[i]) {',\\n ' descriptions[j] = descriptions[i];',\\n ' j++;',\\n ' }',\\n ' }',\\n ' descriptions.length = j;',\\n ' }',\\n '',\\n ' switch (descriptions.length) {',\\n ' case 1:',\\n ' return descriptions[0];',\\n '',\\n ' case 2:',\\n ' return descriptions[0] + \\\" or \\\" + descriptions[1];',\\n '',\\n ' default:',\\n ' return descriptions.slice(0, -1).join(\\\", \\\")',\\n ' + \\\", or \\\"',\\n ' + descriptions[descriptions.length - 1];',\\n ' }',\\n ' }',\\n '',\\n ' function describeFound(found) {',\\n ' return found ? \\\"\\\\\\\\\\\"\\\" + literalEscape(found) + \\\"\\\\\\\\\\\"\\\" : \\\"end of input\\\";',\\n ' }',\\n '',\\n ' return \\\"Expected \\\" + describeExpected(expected) + \\\" but \\\" + describeFound(found) + \\\" found.\\\";',\\n '};',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n 'function peg$DefaultTracer() {',\\n ' this.indentLevel = 0;',\\n '}',\\n '',\\n 'peg$DefaultTracer.prototype.trace = function(event) {',\\n ' var that = this;',\\n '',\\n ' function log(event) {',\\n ' function repeat(string, n) {',\\n ' var result = \\\"\\\", i;',\\n '',\\n ' for (i = 0; i < n; i++) {',\\n ' result += string;',\\n ' }',\\n '',\\n ' return result;',\\n ' }',\\n '',\\n ' function pad(string, length) {',\\n ' return string + repeat(\\\" \\\", length - string.length);',\\n ' }',\\n '',\\n ' if (typeof console === \\\"object\\\") {', // IE 8-10\\n ' console.log(',\\n ' event.location.start.line + \\\":\\\" + event.location.start.column + \\\"-\\\"',\\n ' + event.location.end.line + \\\":\\\" + event.location.end.column + \\\" \\\"',\\n ' + pad(event.type, 10) + \\\" \\\"',\\n ' + repeat(\\\" \\\", that.indentLevel) + event.rule',\\n ' );',\\n ' }',\\n ' }',\\n '',\\n ' switch (event.type) {',\\n ' case \\\"rule.enter\\\":',\\n ' log(event);',\\n ' this.indentLevel++;',\\n ' break;',\\n '',\\n ' case \\\"rule.match\\\":',\\n ' this.indentLevel--;',\\n ' log(event);',\\n ' break;',\\n '',\\n ' case \\\"rule.fail\\\":',\\n ' this.indentLevel--;',\\n ' log(event);',\\n ' break;',\\n '',\\n ' default:',\\n ' throw new Error(\\\"Invalid event type: \\\" + event.type + \\\".\\\");',\\n ' }',\\n '};',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n 'function peg$parse(input, options) {',\\n ' options = options !== void 0 ? options : {};',\\n '',\\n ' var peg$FAILED = {},',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n startRuleIndices = '{ '\\n + arrays.map(\\n options.allowedStartRules,\\n function(r) { return r + ': ' + asts.indexOfRule(ast, r); }\\n ).join(', ')\\n + ' }';\\n startRuleIndex = asts.indexOfRule(ast, options.allowedStartRules[0]);\\n\\n parts.push([\\n ' peg$startRuleIndices = ' + startRuleIndices + ',',\\n ' peg$startRuleIndex = ' + startRuleIndex + ','\\n ].join('\\\\n'));\\n } else {\\n startRuleFunctions = '{ '\\n + arrays.map(\\n options.allowedStartRules,\\n function(r) { return r + ': peg$parse' + r; }\\n ).join(', ')\\n + ' }';\\n startRuleFunction = 'peg$parse' + options.allowedStartRules[0];\\n\\n parts.push([\\n ' peg$startRuleFunctions = ' + startRuleFunctions + ',',\\n ' peg$startRuleFunction = ' + startRuleFunction + ','\\n ].join('\\\\n'));\\n }\\n\\n parts.push('');\\n\\n parts.push(indent6(generateTables()));\\n\\n parts.push([\\n '',\\n ' peg$currPos = 0,',\\n ' peg$savedPos = 0,',\\n ' peg$posDetailsCache = [{ line: 1, column: 1 }],',\\n ' peg$maxFailPos = 0,',\\n ' peg$maxFailExpected = [],',\\n ' peg$silentFails = 0,', // 0 = report failures, > 0 = silence failures\\n ''\\n ].join('\\\\n'));\\n\\n if (options.cache) {\\n parts.push([\\n ' peg$resultsCache = {},',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n if (options.trace) {\\n if (options.optimize === \\\"size\\\") {\\n ruleNames = '['\\n + arrays.map(\\n ast.rules,\\n function(r) { return '\\\"' + js.stringEscape(r.name) + '\\\"'; }\\n ).join(', ')\\n + ']';\\n\\n parts.push([\\n ' peg$ruleNames = ' + ruleNames + ',',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' peg$tracer = \\\"tracer\\\" in options ? options.tracer : new peg$DefaultTracer(),',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' peg$result;',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push([\\n ' if (\\\"startRule\\\" in options) {',\\n ' if (!(options.startRule in peg$startRuleIndices)) {',\\n ' throw new Error(\\\"Can\\\\'t start parsing from rule \\\\\\\\\\\"\\\" + options.startRule + \\\"\\\\\\\\\\\".\\\");',\\n ' }',\\n '',\\n ' peg$startRuleIndex = peg$startRuleIndices[options.startRule];',\\n ' }'\\n ].join('\\\\n'));\\n } else {\\n parts.push([\\n ' if (\\\"startRule\\\" in options) {',\\n ' if (!(options.startRule in peg$startRuleFunctions)) {',\\n ' throw new Error(\\\"Can\\\\'t start parsing from rule \\\\\\\\\\\"\\\" + options.startRule + \\\"\\\\\\\\\\\".\\\");',\\n ' }',\\n '',\\n ' peg$startRuleFunction = peg$startRuleFunctions[options.startRule];',\\n ' }'\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n '',\\n ' function text() {',\\n ' return input.substring(peg$savedPos, peg$currPos);',\\n ' }',\\n '',\\n ' function location() {',\\n ' return peg$computeLocation(peg$savedPos, peg$currPos);',\\n ' }',\\n '',\\n ' function expected(description, location) {',\\n ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)',\\n '',\\n ' throw peg$buildStructuredError(',\\n ' [peg$otherExpectation(description)],',\\n ' input.substring(peg$savedPos, peg$currPos),',\\n ' location',\\n ' );',\\n ' }',\\n '',\\n ' function error(message, location) {',\\n ' location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)',\\n '',\\n ' throw peg$buildSimpleError(message, location);',\\n ' }',\\n '',\\n ' function peg$literalExpectation(text, ignoreCase) {',\\n ' return { type: \\\"literal\\\", text: text, ignoreCase: ignoreCase };',\\n ' }',\\n '',\\n ' function peg$classExpectation(parts, inverted, ignoreCase) {',\\n ' return { type: \\\"class\\\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };',\\n ' }',\\n '',\\n ' function peg$anyExpectation() {',\\n ' return { type: \\\"any\\\" };',\\n ' }',\\n '',\\n ' function peg$endExpectation() {',\\n ' return { type: \\\"end\\\" };',\\n ' }',\\n '',\\n ' function peg$otherExpectation(description) {',\\n ' return { type: \\\"other\\\", description: description };',\\n ' }',\\n '',\\n ' function peg$computePosDetails(pos) {',\\n ' var details = peg$posDetailsCache[pos], p;',\\n '',\\n ' if (details) {',\\n ' return details;',\\n ' } else {',\\n ' p = pos - 1;',\\n ' while (!peg$posDetailsCache[p]) {',\\n ' p--;',\\n ' }',\\n '',\\n ' details = peg$posDetailsCache[p];',\\n ' details = {',\\n ' line: details.line,',\\n ' column: details.column',\\n ' };',\\n '',\\n ' while (p < pos) {',\\n ' if (input.charCodeAt(p) === 10) {',\\n ' details.line++;',\\n ' details.column = 1;',\\n ' } else {',\\n ' details.column++;',\\n ' }',\\n '',\\n ' p++;',\\n ' }',\\n '',\\n ' peg$posDetailsCache[pos] = details;',\\n ' return details;',\\n ' }',\\n ' }',\\n '',\\n ' function peg$computeLocation(startPos, endPos) {',\\n ' var startPosDetails = peg$computePosDetails(startPos),',\\n ' endPosDetails = peg$computePosDetails(endPos);',\\n '',\\n ' return {',\\n ' start: {',\\n ' offset: startPos,',\\n ' line: startPosDetails.line,',\\n ' column: startPosDetails.column',\\n ' },',\\n ' end: {',\\n ' offset: endPos,',\\n ' line: endPosDetails.line,',\\n ' column: endPosDetails.column',\\n ' }',\\n ' };',\\n ' }',\\n '',\\n ' function peg$fail(expected) {',\\n ' if (peg$currPos < peg$maxFailPos) { return; }',\\n '',\\n ' if (peg$currPos > peg$maxFailPos) {',\\n ' peg$maxFailPos = peg$currPos;',\\n ' peg$maxFailExpected = [];',\\n ' }',\\n '',\\n ' peg$maxFailExpected.push(expected);',\\n ' }',\\n '',\\n ' function peg$buildSimpleError(message, location) {',\\n ' return new peg$SyntaxError(message, null, null, location);',\\n ' }',\\n '',\\n ' function peg$buildStructuredError(expected, found, location) {',\\n ' return new peg$SyntaxError(',\\n ' peg$SyntaxError.buildMessage(expected, found),',\\n ' expected,',\\n ' found,',\\n ' location',\\n ' );',\\n ' }',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push(indent2(generateInterpreter()));\\n parts.push('');\\n } else {\\n arrays.each(ast.rules, function(rule) {\\n parts.push(indent2(generateRuleFunction(rule)));\\n parts.push('');\\n });\\n }\\n\\n if (ast.initializer) {\\n parts.push(indent2(ast.initializer.code));\\n parts.push('');\\n }\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push(' peg$result = peg$parseRule(peg$startRuleIndex);');\\n } else {\\n parts.push(' peg$result = peg$startRuleFunction();');\\n }\\n\\n parts.push([\\n '',\\n ' if (peg$result !== peg$FAILED && peg$currPos === input.length) {',\\n ' return peg$result;',\\n ' } else {',\\n ' if (peg$result !== peg$FAILED && peg$currPos < input.length) {',\\n ' peg$fail(peg$endExpectation());',\\n ' }',\\n '',\\n ' throw peg$buildStructuredError(',\\n ' peg$maxFailExpected,',\\n ' peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,',\\n ' peg$maxFailPos < input.length',\\n ' ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)',\\n ' : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)',\\n ' );',\\n ' }',\\n '}'\\n ].join('\\\\n'));\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateWrapper(toplevelCode) {\\n function generateGeneratedByComment() {\\n return [\\n '/*',\\n ' * Generated by PEG.js 0.10.0.',\\n ' *',\\n ' * http://pegjs.org/',\\n ' */'\\n ].join('\\\\n');\\n }\\n\\n function generateParserObject() {\\n return options.trace\\n ? [\\n '{',\\n ' SyntaxError: peg$SyntaxError,',\\n ' DefaultTracer: peg$DefaultTracer,',\\n ' parse: peg$parse',\\n '}'\\n ].join('\\\\n')\\n : [\\n '{',\\n ' SyntaxError: peg$SyntaxError,',\\n ' parse: peg$parse',\\n '}'\\n ].join('\\\\n');\\n }\\n\\n var generators = {\\n bare: function() {\\n return [\\n generateGeneratedByComment(),\\n '(function() {',\\n ' \\\"use strict\\\";',\\n '',\\n indent2(toplevelCode),\\n '',\\n indent2('return ' + generateParserObject() + ';'),\\n '})()'\\n ].join('\\\\n');\\n },\\n\\n commonjs: function() {\\n var parts = [],\\n dependencyVars = objects.keys(options.dependencies),\\n requires = arrays.map(\\n dependencyVars,\\n function(variable) {\\n return variable\\n + ' = require(\\\"'\\n + js.stringEscape(options.dependencies[variable])\\n + '\\\")';\\n }\\n );\\n\\n parts.push([\\n generateGeneratedByComment(),\\n '',\\n '\\\"use strict\\\";',\\n ''\\n ].join('\\\\n'));\\n\\n if (requires.length > 0) {\\n parts.push('var ' + requires.join(', ') + ';');\\n parts.push('');\\n }\\n\\n parts.push([\\n toplevelCode,\\n '',\\n 'module.exports = ' + generateParserObject() + ';',\\n ''\\n ].join('\\\\n'));\\n\\n return parts.join('\\\\n');\\n },\\n\\n amd: function() {\\n var dependencyIds = objects.values(options.dependencies),\\n dependencyVars = objects.keys(options.dependencies),\\n dependencies = '['\\n + arrays.map(\\n dependencyIds,\\n function(id) { return '\\\"' + js.stringEscape(id) + '\\\"'; }\\n ).join(', ')\\n + ']',\\n params = dependencyVars.join(', ');\\n\\n return [\\n generateGeneratedByComment(),\\n 'define(' + dependencies + ', function(' + params + ') {',\\n ' \\\"use strict\\\";',\\n '',\\n indent2(toplevelCode),\\n '',\\n indent2('return ' + generateParserObject() + ';'),\\n '});',\\n ''\\n ].join('\\\\n');\\n },\\n\\n globals: function() {\\n return [\\n generateGeneratedByComment(),\\n '(function(root) {',\\n ' \\\"use strict\\\";',\\n '',\\n indent2(toplevelCode),\\n '',\\n indent2('root.' + options.exportVar + ' = ' + generateParserObject() + ';'),\\n '})(this);',\\n ''\\n ].join('\\\\n');\\n },\\n\\n umd: function() {\\n var parts = [],\\n dependencyIds = objects.values(options.dependencies),\\n dependencyVars = objects.keys(options.dependencies),\\n dependencies = '['\\n + arrays.map(\\n dependencyIds,\\n function(id) { return '\\\"' + js.stringEscape(id) + '\\\"'; }\\n ).join(', ')\\n + ']',\\n requires = arrays.map(\\n dependencyIds,\\n function(id) { return 'require(\\\"' + js.stringEscape(id) + '\\\")'; }\\n ).join(', '),\\n params = dependencyVars.join(', ');\\n\\n parts.push([\\n generateGeneratedByComment(),\\n '(function(root, factory) {',\\n ' if (typeof define === \\\"function\\\" && define.amd) {',\\n ' define(' + dependencies + ', factory);',\\n ' } else if (typeof module === \\\"object\\\" && module.exports) {',\\n ' module.exports = factory(' + requires + ');'\\n ].join('\\\\n'));\\n\\n if (options.exportVar !== null) {\\n parts.push([\\n ' } else {',\\n ' root.' + options.exportVar + ' = factory();'\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' }',\\n '})(this, function(' + params + ') {',\\n ' \\\"use strict\\\";',\\n '',\\n indent2(toplevelCode),\\n '',\\n indent2('return ' + generateParserObject() + ';'),\\n '});',\\n ''\\n ].join('\\\\n'));\\n\\n return parts.join('\\\\n');\\n }\\n };\\n\\n return generators[options.format]();\\n }\\n\\n ast.code = generateWrapper(generateToplevel());\\n}\",\n \"function t(e){switch(e.type){case V.AssignmentExpression:case V.ArrayExpression:case V.ArrayPattern:case V.BinaryExpression:case V.CallExpression:case V.ConditionalExpression:case V.ClassExpression:case V.ExportBatchSpecifier:case V.ExportSpecifier:case V.FunctionExpression:case V.Identifier:case V.ImportSpecifier:case V.Literal:case V.LogicalExpression:case V.MemberExpression:case V.MethodDefinition:case V.NewExpression:case V.ObjectExpression:case V.ObjectPattern:case V.Property:case V.SequenceExpression:case V.ThisExpression:case V.UnaryExpression:case V.UpdateExpression:case V.YieldExpression:return!0}return!1}\",\n \"function $af9a22e3e9ab50b7$var$reasonml(hljs) {\\n function orReValues(ops) {\\n return ops.map(function(op) {\\n return op.split(\\\"\\\").map(function(char) {\\n return \\\"\\\\\\\\\\\" + char;\\n }).join(\\\"\\\");\\n }).join(\\\"|\\\");\\n }\\n const RE_IDENT = \\\"~?[a-z$_][0-9a-zA-Z$_]*\\\";\\n const RE_MODULE_IDENT = \\\"`?[A-Z$_][0-9a-zA-Z$_]*\\\";\\n const RE_PARAM_TYPEPARAM = \\\"'?[a-z$_][0-9a-z$_]*\\\";\\n const RE_PARAM_TYPE = \\\"\\\\\\\\s*:\\\\\\\\s*[a-z$_][0-9a-z$_]*(\\\\\\\\(\\\\\\\\s*(\\\" + RE_PARAM_TYPEPARAM + \\\"\\\\\\\\s*(,\\\" + RE_PARAM_TYPEPARAM + \\\"\\\\\\\\s*)*)?\\\\\\\\))?\\\";\\n const RE_PARAM = RE_IDENT + \\\"(\\\" + RE_PARAM_TYPE + \\\"){0,2}\\\";\\n const RE_OPERATOR = \\\"(\\\" + orReValues([\\n \\\"||\\\",\\n \\\"++\\\",\\n \\\"**\\\",\\n \\\"+.\\\",\\n \\\"*\\\",\\n \\\"/\\\",\\n \\\"*.\\\",\\n \\\"/.\\\",\\n \\\"...\\\"\\n ]) + \\\"|\\\\\\\\|>|&&|==|===)\\\";\\n const RE_OPERATOR_SPACED = \\\"\\\\\\\\s+\\\" + RE_OPERATOR + \\\"\\\\\\\\s+\\\";\\n const KEYWORDS = {\\n keyword: \\\"and as asr assert begin class constraint do done downto else end exception external for fun function functor if in include inherit initializer land lazy let lor lsl lsr lxor match method mod module mutable new nonrec object of open or private rec sig struct then to try type val virtual when while with\\\",\\n built_in: \\\"array bool bytes char exn|5 float int int32 int64 list lazy_t|5 nativeint|5 ref string unit \\\",\\n literal: \\\"true false\\\"\\n };\\n const RE_NUMBER = \\\"\\\\\\\\b(0[xX][a-fA-F0-9_]+[Lln]?|0[oO][0-7_]+[Lln]?|0[bB][01_]+[Lln]?|[0-9][0-9_]*([Lln]|(\\\\\\\\.[0-9_]*)?([eE][-+]?[0-9_]+)?)?)\\\";\\n const NUMBER_MODE = {\\n className: \\\"number\\\",\\n relevance: 0,\\n variants: [\\n {\\n begin: RE_NUMBER\\n },\\n {\\n begin: \\\"\\\\\\\\(-\\\" + RE_NUMBER + \\\"\\\\\\\\)\\\"\\n }\\n ]\\n };\\n const OPERATOR_MODE = {\\n className: \\\"operator\\\",\\n relevance: 0,\\n begin: RE_OPERATOR\\n };\\n const LIST_CONTENTS_MODES = [\\n {\\n className: \\\"identifier\\\",\\n relevance: 0,\\n begin: RE_IDENT\\n },\\n OPERATOR_MODE,\\n NUMBER_MODE\\n ];\\n const MODULE_ACCESS_CONTENTS = [\\n hljs.QUOTE_STRING_MODE,\\n OPERATOR_MODE,\\n {\\n className: \\\"module\\\",\\n begin: \\\"\\\\\\\\b\\\" + RE_MODULE_IDENT,\\n returnBegin: true,\\n end: \\\".\\\",\\n contains: [\\n {\\n className: \\\"identifier\\\",\\n begin: RE_MODULE_IDENT,\\n relevance: 0\\n }\\n ]\\n }\\n ];\\n const PARAMS_CONTENTS = [\\n {\\n className: \\\"module\\\",\\n begin: \\\"\\\\\\\\b\\\" + RE_MODULE_IDENT,\\n returnBegin: true,\\n end: \\\".\\\",\\n relevance: 0,\\n contains: [\\n {\\n className: \\\"identifier\\\",\\n begin: RE_MODULE_IDENT,\\n relevance: 0\\n }\\n ]\\n }\\n ];\\n const PARAMS_MODE = {\\n begin: RE_IDENT,\\n end: \\\"(,|\\\\\\\\n|\\\\\\\\))\\\",\\n relevance: 0,\\n contains: [\\n OPERATOR_MODE,\\n {\\n className: \\\"typing\\\",\\n begin: \\\":\\\",\\n end: \\\"(,|\\\\\\\\n)\\\",\\n returnBegin: true,\\n relevance: 0,\\n contains: PARAMS_CONTENTS\\n }\\n ]\\n };\\n const FUNCTION_BLOCK_MODE = {\\n className: \\\"function\\\",\\n relevance: 0,\\n keywords: KEYWORDS,\\n variants: [\\n {\\n begin: \\\"\\\\\\\\s(\\\\\\\\(\\\\\\\\.?.*?\\\\\\\\)|\\\" + RE_IDENT + \\\")\\\\\\\\s*=>\\\",\\n end: \\\"\\\\\\\\s*=>\\\",\\n returnBegin: true,\\n relevance: 0,\\n contains: [\\n {\\n className: \\\"params\\\",\\n variants: [\\n {\\n begin: RE_IDENT\\n },\\n {\\n begin: RE_PARAM\\n },\\n {\\n begin: /\\\\(\\\\s*\\\\)/\\n }\\n ]\\n }\\n ]\\n },\\n {\\n begin: \\\"\\\\\\\\s\\\\\\\\(\\\\\\\\.?[^;\\\\\\\\|]*\\\\\\\\)\\\\\\\\s*=>\\\",\\n end: \\\"\\\\\\\\s=>\\\",\\n returnBegin: true,\\n relevance: 0,\\n contains: [\\n {\\n className: \\\"params\\\",\\n relevance: 0,\\n variants: [\\n PARAMS_MODE\\n ]\\n }\\n ]\\n },\\n {\\n begin: \\\"\\\\\\\\(\\\\\\\\.\\\\\\\\s\\\" + RE_IDENT + \\\"\\\\\\\\)\\\\\\\\s*=>\\\"\\n }\\n ]\\n };\\n MODULE_ACCESS_CONTENTS.push(FUNCTION_BLOCK_MODE);\\n const CONSTRUCTOR_MODE = {\\n className: \\\"constructor\\\",\\n begin: RE_MODULE_IDENT + \\\"\\\\\\\\(\\\",\\n end: \\\"\\\\\\\\)\\\",\\n illegal: \\\"\\\\\\\\n\\\",\\n keywords: KEYWORDS,\\n contains: [\\n hljs.QUOTE_STRING_MODE,\\n OPERATOR_MODE,\\n {\\n className: \\\"params\\\",\\n begin: \\\"\\\\\\\\b\\\" + RE_IDENT\\n }\\n ]\\n };\\n const PATTERN_MATCH_BLOCK_MODE = {\\n className: \\\"pattern-match\\\",\\n begin: \\\"\\\\\\\\|\\\",\\n returnBegin: true,\\n keywords: KEYWORDS,\\n end: \\\"=>\\\",\\n relevance: 0,\\n contains: [\\n CONSTRUCTOR_MODE,\\n OPERATOR_MODE,\\n {\\n relevance: 0,\\n className: \\\"constructor\\\",\\n begin: RE_MODULE_IDENT\\n }\\n ]\\n };\\n const MODULE_ACCESS_MODE = {\\n className: \\\"module-access\\\",\\n keywords: KEYWORDS,\\n returnBegin: true,\\n variants: [\\n {\\n begin: \\\"\\\\\\\\b(\\\" + RE_MODULE_IDENT + \\\"\\\\\\\\.)+\\\" + RE_IDENT\\n },\\n {\\n begin: \\\"\\\\\\\\b(\\\" + RE_MODULE_IDENT + \\\"\\\\\\\\.)+\\\\\\\\(\\\",\\n end: \\\"\\\\\\\\)\\\",\\n returnBegin: true,\\n contains: [\\n FUNCTION_BLOCK_MODE,\\n {\\n begin: \\\"\\\\\\\\(\\\",\\n end: \\\"\\\\\\\\)\\\",\\n skip: true\\n }\\n ].concat(MODULE_ACCESS_CONTENTS)\\n },\\n {\\n begin: \\\"\\\\\\\\b(\\\" + RE_MODULE_IDENT + \\\"\\\\\\\\.)+\\\\\\\\{\\\",\\n end: /\\\\}/\\n }\\n ],\\n contains: MODULE_ACCESS_CONTENTS\\n };\\n PARAMS_CONTENTS.push(MODULE_ACCESS_MODE);\\n return {\\n name: \\\"ReasonML\\\",\\n aliases: [\\n \\\"re\\\"\\n ],\\n keywords: KEYWORDS,\\n illegal: \\\"(:-|:=|\\\\\\\\$\\\\\\\\{|\\\\\\\\+=)\\\",\\n contains: [\\n hljs.COMMENT(\\\"/\\\\\\\\*\\\", \\\"\\\\\\\\*/\\\", {\\n illegal: \\\"^(#,\\\\\\\\/\\\\\\\\/)\\\"\\n }),\\n {\\n className: \\\"character\\\",\\n begin: \\\"'(\\\\\\\\\\\\\\\\[^']+|[^'])'\\\",\\n illegal: \\\"\\\\\\\\n\\\",\\n relevance: 0\\n },\\n hljs.QUOTE_STRING_MODE,\\n {\\n className: \\\"literal\\\",\\n begin: \\\"\\\\\\\\(\\\\\\\\)\\\",\\n relevance: 0\\n },\\n {\\n className: \\\"literal\\\",\\n begin: \\\"\\\\\\\\[\\\\\\\\|\\\",\\n end: \\\"\\\\\\\\|\\\\\\\\]\\\",\\n relevance: 0,\\n contains: LIST_CONTENTS_MODES\\n },\\n {\\n className: \\\"literal\\\",\\n begin: \\\"\\\\\\\\[\\\",\\n end: \\\"\\\\\\\\]\\\",\\n relevance: 0,\\n contains: LIST_CONTENTS_MODES\\n },\\n CONSTRUCTOR_MODE,\\n {\\n className: \\\"operator\\\",\\n begin: RE_OPERATOR_SPACED,\\n illegal: \\\"-->\\\",\\n relevance: 0\\n },\\n NUMBER_MODE,\\n hljs.C_LINE_COMMENT_MODE,\\n PATTERN_MATCH_BLOCK_MODE,\\n FUNCTION_BLOCK_MODE,\\n {\\n className: \\\"module-def\\\",\\n begin: \\\"\\\\\\\\bmodule\\\\\\\\s+\\\" + RE_IDENT + \\\"\\\\\\\\s+\\\" + RE_MODULE_IDENT + \\\"\\\\\\\\s+=\\\\\\\\s+\\\\\\\\{\\\",\\n end: /\\\\}/,\\n returnBegin: true,\\n keywords: KEYWORDS,\\n relevance: 0,\\n contains: [\\n {\\n className: \\\"module\\\",\\n relevance: 0,\\n begin: RE_MODULE_IDENT\\n },\\n {\\n begin: /\\\\{/,\\n end: /\\\\}/,\\n skip: true\\n }\\n ].concat(MODULE_ACCESS_CONTENTS)\\n },\\n MODULE_ACCESS_MODE\\n ]\\n };\\n}\",\n \"function Generator(){}\",\n \"function Generator(){}\",\n \"function Generator(){}\",\n \"function Generator(){}\",\n \"function Generator(){}\",\n \"function Generator(){}\",\n \"function ruby(hljs) {\\n var RUBY_METHOD_RE = '[a-zA-Z_]\\\\\\\\w*[!?=]?|[-+~]\\\\\\\\@|<<|>>|=~|===?|<=>|[<>]=?|\\\\\\\\*\\\\\\\\*|[-/+%^&*~`|]|\\\\\\\\[\\\\\\\\]=?';\\n var RUBY_KEYWORDS = {\\n keyword:\\n 'and then defined module in return redo if BEGIN retry end for self when ' +\\n 'next until do begin unless END rescue else break undef not super class case ' +\\n 'require yield alias while ensure elsif or include attr_reader attr_writer attr_accessor',\\n literal:\\n 'true false nil'\\n };\\n var YARDOCTAG = {\\n className: 'doctag',\\n begin: '@[A-Za-z]+'\\n };\\n var IRB_OBJECT = {\\n begin: '#<', end: '>'\\n };\\n var COMMENT_MODES = [\\n hljs.COMMENT(\\n '#',\\n '$',\\n {\\n contains: [YARDOCTAG]\\n }\\n ),\\n hljs.COMMENT(\\n '^\\\\\\\\=begin',\\n '^\\\\\\\\=end',\\n {\\n contains: [YARDOCTAG],\\n relevance: 10\\n }\\n ),\\n hljs.COMMENT('^__END__', '\\\\\\\\n$')\\n ];\\n var SUBST = {\\n className: 'subst',\\n begin: '#\\\\\\\\{', end: '}',\\n keywords: RUBY_KEYWORDS\\n };\\n var STRING = {\\n className: 'string',\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\\n variants: [\\n {begin: /'/, end: /'/},\\n {begin: /\\\"/, end: /\\\"/},\\n {begin: /`/, end: /`/},\\n {begin: '%[qQwWx]?\\\\\\\\(', end: '\\\\\\\\)'},\\n {begin: '%[qQwWx]?\\\\\\\\[', end: '\\\\\\\\]'},\\n {begin: '%[qQwWx]?{', end: '}'},\\n {begin: '%[qQwWx]?<', end: '>'},\\n {begin: '%[qQwWx]?/', end: '/'},\\n {begin: '%[qQwWx]?%', end: '%'},\\n {begin: '%[qQwWx]?-', end: '-'},\\n {begin: '%[qQwWx]?\\\\\\\\|', end: '\\\\\\\\|'},\\n {\\n // \\\\B in the beginning suppresses recognition of ?-sequences where ?\\n // is the last character of a preceding identifier, as in: `func?4`\\n begin: /\\\\B\\\\?(\\\\\\\\\\\\d{1,3}|\\\\\\\\x[A-Fa-f0-9]{1,2}|\\\\\\\\u[A-Fa-f0-9]{4}|\\\\\\\\?\\\\S)\\\\b/\\n },\\n { // heredocs\\n begin: /<<[-~]?'?(\\\\w+)(?:.|\\\\n)*?\\\\n\\\\s*\\\\1\\\\b/,\\n returnBegin: true,\\n contains: [\\n { begin: /<<[-~]?'?/ },\\n hljs.END_SAME_AS_BEGIN({\\n begin: /(\\\\w+)/, end: /(\\\\w+)/,\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\\n })\\n ]\\n }\\n ]\\n };\\n var PARAMS = {\\n className: 'params',\\n begin: '\\\\\\\\(', end: '\\\\\\\\)', endsParent: true,\\n keywords: RUBY_KEYWORDS\\n };\\n\\n var RUBY_DEFAULT_CONTAINS = [\\n STRING,\\n IRB_OBJECT,\\n {\\n className: 'class',\\n beginKeywords: 'class module', end: '$|;',\\n illegal: /=/,\\n contains: [\\n hljs.inherit(hljs.TITLE_MODE, {begin: '[A-Za-z_]\\\\\\\\w*(::\\\\\\\\w+)*(\\\\\\\\?|\\\\\\\\!)?'}),\\n {\\n begin: '<\\\\\\\\s*',\\n contains: [{\\n begin: '(' + hljs.IDENT_RE + '::)?' + hljs.IDENT_RE\\n }]\\n }\\n ].concat(COMMENT_MODES)\\n },\\n {\\n className: 'function',\\n beginKeywords: 'def', end: '$|;',\\n contains: [\\n hljs.inherit(hljs.TITLE_MODE, {begin: RUBY_METHOD_RE}),\\n PARAMS\\n ].concat(COMMENT_MODES)\\n },\\n {\\n // swallow namespace qualifiers before symbols\\n begin: hljs.IDENT_RE + '::'\\n },\\n {\\n className: 'symbol',\\n begin: hljs.UNDERSCORE_IDENT_RE + '(\\\\\\\\!|\\\\\\\\?)?:',\\n relevance: 0\\n },\\n {\\n className: 'symbol',\\n begin: ':(?!\\\\\\\\s)',\\n contains: [STRING, {begin: RUBY_METHOD_RE}],\\n relevance: 0\\n },\\n {\\n className: 'number',\\n begin: '(\\\\\\\\b0[0-7_]+)|(\\\\\\\\b0x[0-9a-fA-F_]+)|(\\\\\\\\b[1-9][0-9_]*(\\\\\\\\.[0-9_]+)?)|[0_]\\\\\\\\b',\\n relevance: 0\\n },\\n {\\n begin: '(\\\\\\\\$\\\\\\\\W)|((\\\\\\\\$|\\\\\\\\@\\\\\\\\@?)(\\\\\\\\w+))' // variables\\n },\\n {\\n className: 'params',\\n begin: /\\\\|/, end: /\\\\|/,\\n keywords: RUBY_KEYWORDS\\n },\\n { // regexp container\\n begin: '(' + hljs.RE_STARTERS_RE + '|unless)\\\\\\\\s*',\\n keywords: 'unless',\\n contains: [\\n IRB_OBJECT,\\n {\\n className: 'regexp',\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\\n illegal: /\\\\n/,\\n variants: [\\n {begin: '/', end: '/[a-z]*'},\\n {begin: '%r{', end: '}[a-z]*'},\\n {begin: '%r\\\\\\\\(', end: '\\\\\\\\)[a-z]*'},\\n {begin: '%r!', end: '![a-z]*'},\\n {begin: '%r\\\\\\\\[', end: '\\\\\\\\][a-z]*'}\\n ]\\n }\\n ].concat(COMMENT_MODES),\\n relevance: 0\\n }\\n ].concat(COMMENT_MODES);\\n\\n SUBST.contains = RUBY_DEFAULT_CONTAINS;\\n PARAMS.contains = RUBY_DEFAULT_CONTAINS;\\n\\n var SIMPLE_PROMPT = \\\"[>?]>\\\";\\n var DEFAULT_PROMPT = \\\"[\\\\\\\\w#]+\\\\\\\\(\\\\\\\\w+\\\\\\\\):\\\\\\\\d+:\\\\\\\\d+>\\\";\\n var RVM_PROMPT = \\\"(\\\\\\\\w+-)?\\\\\\\\d+\\\\\\\\.\\\\\\\\d+\\\\\\\\.\\\\\\\\d(p\\\\\\\\d+)?[^>]+>\\\";\\n\\n var IRB_DEFAULT = [\\n {\\n begin: /^\\\\s*=>/,\\n starts: {\\n end: '$', contains: RUBY_DEFAULT_CONTAINS\\n }\\n },\\n {\\n className: 'meta',\\n begin: '^('+SIMPLE_PROMPT+\\\"|\\\"+DEFAULT_PROMPT+'|'+RVM_PROMPT+')',\\n starts: {\\n end: '$', contains: RUBY_DEFAULT_CONTAINS\\n }\\n }\\n ];\\n\\n return {\\n name: 'Ruby',\\n aliases: ['rb', 'gemspec', 'podspec', 'thor', 'irb'],\\n keywords: RUBY_KEYWORDS,\\n illegal: /\\\\/\\\\*/,\\n contains: COMMENT_MODES.concat(IRB_DEFAULT).concat(RUBY_DEFAULT_CONTAINS)\\n };\\n}\",\n \"function ruby(hljs) {\\n var RUBY_METHOD_RE = '[a-zA-Z_]\\\\\\\\w*[!?=]?|[-+~]\\\\\\\\@|<<|>>|=~|===?|<=>|[<>]=?|\\\\\\\\*\\\\\\\\*|[-/+%^&*~`|]|\\\\\\\\[\\\\\\\\]=?';\\n var RUBY_KEYWORDS = {\\n keyword:\\n 'and then defined module in return redo if BEGIN retry end for self when ' +\\n 'next until do begin unless END rescue else break undef not super class case ' +\\n 'require yield alias while ensure elsif or include attr_reader attr_writer attr_accessor',\\n literal:\\n 'true false nil'\\n };\\n var YARDOCTAG = {\\n className: 'doctag',\\n begin: '@[A-Za-z]+'\\n };\\n var IRB_OBJECT = {\\n begin: '#<', end: '>'\\n };\\n var COMMENT_MODES = [\\n hljs.COMMENT(\\n '#',\\n '$',\\n {\\n contains: [YARDOCTAG]\\n }\\n ),\\n hljs.COMMENT(\\n '^\\\\\\\\=begin',\\n '^\\\\\\\\=end',\\n {\\n contains: [YARDOCTAG],\\n relevance: 10\\n }\\n ),\\n hljs.COMMENT('^__END__', '\\\\\\\\n$')\\n ];\\n var SUBST = {\\n className: 'subst',\\n begin: '#\\\\\\\\{', end: '}',\\n keywords: RUBY_KEYWORDS\\n };\\n var STRING = {\\n className: 'string',\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\\n variants: [\\n {begin: /'/, end: /'/},\\n {begin: /\\\"/, end: /\\\"/},\\n {begin: /`/, end: /`/},\\n {begin: '%[qQwWx]?\\\\\\\\(', end: '\\\\\\\\)'},\\n {begin: '%[qQwWx]?\\\\\\\\[', end: '\\\\\\\\]'},\\n {begin: '%[qQwWx]?{', end: '}'},\\n {begin: '%[qQwWx]?<', end: '>'},\\n {begin: '%[qQwWx]?/', end: '/'},\\n {begin: '%[qQwWx]?%', end: '%'},\\n {begin: '%[qQwWx]?-', end: '-'},\\n {begin: '%[qQwWx]?\\\\\\\\|', end: '\\\\\\\\|'},\\n {\\n // \\\\B in the beginning suppresses recognition of ?-sequences where ?\\n // is the last character of a preceding identifier, as in: `func?4`\\n begin: /\\\\B\\\\?(\\\\\\\\\\\\d{1,3}|\\\\\\\\x[A-Fa-f0-9]{1,2}|\\\\\\\\u[A-Fa-f0-9]{4}|\\\\\\\\?\\\\S)\\\\b/\\n },\\n { // heredocs\\n begin: /<<[-~]?'?(\\\\w+)(?:.|\\\\n)*?\\\\n\\\\s*\\\\1\\\\b/,\\n returnBegin: true,\\n contains: [\\n { begin: /<<[-~]?'?/ },\\n { begin: /\\\\w+/,\\n endSameAsBegin: true,\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\\n }\\n ]\\n }\\n ]\\n };\\n var PARAMS = {\\n className: 'params',\\n begin: '\\\\\\\\(', end: '\\\\\\\\)', endsParent: true,\\n keywords: RUBY_KEYWORDS\\n };\\n\\n var RUBY_DEFAULT_CONTAINS = [\\n STRING,\\n IRB_OBJECT,\\n {\\n className: 'class',\\n beginKeywords: 'class module', end: '$|;',\\n illegal: /=/,\\n contains: [\\n hljs.inherit(hljs.TITLE_MODE, {begin: '[A-Za-z_]\\\\\\\\w*(::\\\\\\\\w+)*(\\\\\\\\?|\\\\\\\\!)?'}),\\n {\\n begin: '<\\\\\\\\s*',\\n contains: [{\\n begin: '(' + hljs.IDENT_RE + '::)?' + hljs.IDENT_RE\\n }]\\n }\\n ].concat(COMMENT_MODES)\\n },\\n {\\n className: 'function',\\n beginKeywords: 'def', end: '$|;',\\n contains: [\\n hljs.inherit(hljs.TITLE_MODE, {begin: RUBY_METHOD_RE}),\\n PARAMS\\n ].concat(COMMENT_MODES)\\n },\\n {\\n // swallow namespace qualifiers before symbols\\n begin: hljs.IDENT_RE + '::'\\n },\\n {\\n className: 'symbol',\\n begin: hljs.UNDERSCORE_IDENT_RE + '(\\\\\\\\!|\\\\\\\\?)?:',\\n relevance: 0\\n },\\n {\\n className: 'symbol',\\n begin: ':(?!\\\\\\\\s)',\\n contains: [STRING, {begin: RUBY_METHOD_RE}],\\n relevance: 0\\n },\\n {\\n className: 'number',\\n begin: '(\\\\\\\\b0[0-7_]+)|(\\\\\\\\b0x[0-9a-fA-F_]+)|(\\\\\\\\b[1-9][0-9_]*(\\\\\\\\.[0-9_]+)?)|[0_]\\\\\\\\b',\\n relevance: 0\\n },\\n {\\n begin: '(\\\\\\\\$\\\\\\\\W)|((\\\\\\\\$|\\\\\\\\@\\\\\\\\@?)(\\\\\\\\w+))' // variables\\n },\\n {\\n className: 'params',\\n begin: /\\\\|/, end: /\\\\|/,\\n keywords: RUBY_KEYWORDS\\n },\\n { // regexp container\\n begin: '(' + hljs.RE_STARTERS_RE + '|unless)\\\\\\\\s*',\\n keywords: 'unless',\\n contains: [\\n IRB_OBJECT,\\n {\\n className: 'regexp',\\n contains: [hljs.BACKSLASH_ESCAPE, SUBST],\\n illegal: /\\\\n/,\\n variants: [\\n {begin: '/', end: '/[a-z]*'},\\n {begin: '%r{', end: '}[a-z]*'},\\n {begin: '%r\\\\\\\\(', end: '\\\\\\\\)[a-z]*'},\\n {begin: '%r!', end: '![a-z]*'},\\n {begin: '%r\\\\\\\\[', end: '\\\\\\\\][a-z]*'}\\n ]\\n }\\n ].concat(COMMENT_MODES),\\n relevance: 0\\n }\\n ].concat(COMMENT_MODES);\\n\\n SUBST.contains = RUBY_DEFAULT_CONTAINS;\\n PARAMS.contains = RUBY_DEFAULT_CONTAINS;\\n\\n var SIMPLE_PROMPT = \\\"[>?]>\\\";\\n var DEFAULT_PROMPT = \\\"[\\\\\\\\w#]+\\\\\\\\(\\\\\\\\w+\\\\\\\\):\\\\\\\\d+:\\\\\\\\d+>\\\";\\n var RVM_PROMPT = \\\"(\\\\\\\\w+-)?\\\\\\\\d+\\\\\\\\.\\\\\\\\d+\\\\\\\\.\\\\\\\\d(p\\\\\\\\d+)?[^>]+>\\\";\\n\\n var IRB_DEFAULT = [\\n {\\n begin: /^\\\\s*=>/,\\n starts: {\\n end: '$', contains: RUBY_DEFAULT_CONTAINS\\n }\\n },\\n {\\n className: 'meta',\\n begin: '^('+SIMPLE_PROMPT+\\\"|\\\"+DEFAULT_PROMPT+'|'+RVM_PROMPT+')',\\n starts: {\\n end: '$', contains: RUBY_DEFAULT_CONTAINS\\n }\\n }\\n ];\\n\\n return {\\n name: 'Ruby',\\n aliases: ['rb', 'gemspec', 'podspec', 'thor', 'irb'],\\n keywords: RUBY_KEYWORDS,\\n illegal: /\\\\/\\\\*/,\\n contains: COMMENT_MODES.concat(IRB_DEFAULT).concat(RUBY_DEFAULT_CONTAINS)\\n };\\n}\",\n \"function _p(t,e){0}\",\n \"function generateTags(sourcefile,source) {\\n\\n sourcelines = source.split(/\\\\r?\\\\n/); //access text of a line from source file by index \\n\\n try {\\n // var result = parse(source,{loc:true});\\n var result = parse(source,{\\n sourceType: moduleParseMode ? 'module' : 'script',\\n plugins: [\\n // enable experimental async functions\\n \\\"asyncFunctions\\\",\\n \\\"classProperties\\\", //class AAA { ooo = { x:3} }\\n \\\"objectRestSpread\\\",\\n \\\"classConstructorCall\\\",\\n \\\"doExpressions\\\",\\n \\\"trailingFunctionCommas\\\",\\n \\\"decorators\\\",\\n \\\"exportExtensions\\\",\\n \\\"exponentiationOperator\\\",\\n \\\"asyncGenerators\\\",\\n \\\"functionBind\\\",\\n \\\"functionSent\\\",\\n // enable jsx and flow syntax\\n \\\"jsx\\\",\\n \\\"flow\\\"\\n ]\\n });\\n //console.log(JSON.stringify(result)); //TODO:Debug:Remove\\n } catch (e) {\\n console.error(\\\"parse error in \\\"+sourcefile,e);\\n return;\\n }\\n\\n var scopes = []; // stack of function body scopes\\n\\n plugins.forEach(function(plugin) { \\n plugin.init(tags);\\n });\\n\\n function extractTags(node,ancestorsPath,children){\\n var scope;\\n\\n // TODO: various module systems\\n // (for the moment, we fake it by tracking 'exports')\\n // not to mention various class/mixin systems or ember's \\n // lifted object system..\\n // var f = function(){}\\n // { f : function(){} }\\n\\n // NOTE: location info is start of parsed text to start of unparsed text;\\n // also, lines are 1-based, columns are 0-based;\\n // for 1-based line/colums, we need to adjust start columns\\n\\n if ((node.type==='FunctionDeclaration')\\n ||(node.type==='FunctionExpression')\\n ||(node.type==='ArrowFunctionExpression') ) {\\n\\n scopes.push(nodeScope(node));\\n\\n scope = scopes.length>1 ? scopes[scopes.length-2] : \\\"global\\\";\\n\\n if (node.type==='FunctionDeclaration' && node.id)\\n {\\n\\n tags_push({name: node.id.name\\n ,file: sourcefile\\n ,addr: node.id.loc.start.line\\n ,kind: \\\"f\\\"\\n ,lineno: node.id.loc.start.line\\n ,scope: scope\\n });\\n\\n } else if (node.id)\\n {\\n\\n tags_push({name: node.id.name\\n ,file: sourcefile\\n ,addr: node.id.loc.start.line\\n ,kind: \\\"fe\\\"\\n ,lineno: node.id.loc.start.line\\n ,scope: node.loc.start.line+\\\":\\\"+(node.loc.start.column+1)+\\\"-\\\"\\n +node.loc.end.line+\\\":\\\"+node.loc.end.column\\n });\\n }\\n\\n var paramScope = nodeScope(node);\\n\\n node.params.forEach(function(param){\\n indexDestructId(param,sourcefile,paramScope, 'vp');\\n });\\n\\n } else if (node.type==='VariableDeclarator') {\\n\\n scope = scopes.length>0 ? scopes[scopes.length-1] : \\\"global\\\";\\n indexDestructId(node.id,sourcefile,scope, 'v');\\n } else if (node.type==='CatchClause') {\\n\\n tags_push({name: node.param.name\\n ,file: sourcefile\\n ,addr: node.param.loc.start.line\\n ,kind: \\\"ve\\\"\\n ,lineno: node.param.loc.start.line\\n ,scope: node.loc.start.line+\\\":\\\"+(node.loc.start.column+1)+\\\"-\\\"\\n +node.loc.end.line+\\\":\\\"+node.loc.end.column\\n });\\n\\n } else if (node.type==='AssignmentExpression') {\\n\\n if (node.operator==='='\\n && node.left.type==='MemberExpression'\\n && !node.left.computed) {\\n\\n if (node.left.object.type==='Identifier'\\n && node.left.object.name==='exports') {\\n\\n // approximation: we don't handle module systems properly,\\n // so record tags for 'exports' properties, at least\\n tags_push({name: node.left.property.name\\n ,file: sourcefile\\n ,addr: node.left.property.loc.start.line\\n ,kind: \\\"export\\\"\\n ,lineno: node.left.property.loc.start.line\\n ,scope: \\\"global\\\"\\n });\\n\\n } else if (node.left.object.type==='MemberExpression'\\n && !node.left.object.computed\\n && node.left.object.property.type==='Identifier'\\n && node.left.object.property.name==='prototype'\\n && node.left.property.type==='Identifier') {\\n\\n // approximation: we don't handle object properties properly,\\n // so record tags for 'prototype' properties as globals\\n tags_push({name: node.left.property.name\\n ,file: sourcefile\\n ,addr: node.left.property.loc.start.line\\n ,kind: \\\"prototype\\\"\\n ,lineno: node.left.property.loc.start.line\\n ,scope: \\\"global\\\"\\n });\\n\\n } else if (classic && (node.right.type==='FunctionExpression' || node.right.type==='ArrowFunctionExpression')) {\\n\\n // approximation: record tags for function assignments as globals\\n tags_push({name: node.left.property.name\\n ,file: sourcefile\\n ,addr: node.left.property.loc.start.line\\n ,kind: \\\"fa\\\"\\n ,lineno: node.left.property.loc.start.line\\n ,scope: \\\"global\\\"\\n });\\n\\n }\\n }\\n } else if (classic && node.type==='ObjectExpression') {\\n\\n node.properties.forEach(function(property){\\n\\n plugins.forEach(function(plugin) { \\n plugin.visitObjectExpressionProperty && plugin.visitObjectExpressionProperty(property,node,ancestorsPath,sourcefile);\\n });\\n\\n if (property.value && (property.value.type==='FunctionExpression' || property.value.type==='ArrowFunctionExpression') && property.key && property.key.value) { \\n // approximation: we don't handle object properties properly,\\n // so record tags for function properties as globals\\n tags_push({name: property.key.value\\n ,file: sourcefile\\n ,addr: property.loc.start.line\\n ,kind: \\\"f\\\"\\n ,lineno: property.loc.start.line\\n ,scope: \\\"global\\\"\\n ,class_id: node.class_id\\n });\\n\\n } else if (property.key && property.key.name) {\\n // approximation: we don't handle object properties properly,\\n // so record tags for function properties as globals\\n tags_push({name: property.key.name\\n ,file: sourcefile\\n ,addr: property.loc.start.line\\n ,kind: (property.type === 'ObjectMethod') || (property.value && (property.value.type==='FunctionExpression' || property.value.type==='ArrowFunctionExpression')) ? \\\"f\\\" : \\\"property\\\"\\n ,lineno: property.loc.start.line\\n ,scope: \\\"global\\\"\\n ,class_id: node.class_id\\n });\\n\\n }\\n });\\n\\n } else if (node.type==='CallExpression') { \\n plugins.forEach(function(plugin) { \\n plugin.visitCallExpression && plugin.visitCallExpression(node, sourcefile);\\n });\\n } else {\\n plugins.forEach(function(plugin) { \\n plugin.visitUnknownNode && plugin.visitUnknownNode(node,ancestorsPath,sourcefile,scopes);\\n });\\n }\\n\\n children.forEach(function(child) {\\n traverseWithPath(extractTags)(child,ancestorsPath.slice().concat([node])); \\n });\\n\\n if ((node.type==='FunctionDeclaration')\\n ||(node.type==='FunctionExpression')\\n ||(node.type==='ArrowFunctionExpression')\\n ||(node.type==='ClassMethod')) {\\n\\n scopes.pop();\\n\\n }\\n }\\n\\n traverseWithPath(extractTags)(result,[]);\\n}\",\n \"function findAndReplace(node, state) {\\n var comp, parts, c, func\\n parts = generators[node.type](node)\\n for (var i = 0; i < parsed_dsl[node.type].length; i++) {\\n comp = parsed_dsl[node.type][i]\\n if (parts.length != comp.length) continue\\n\\n for (var j = 0; j < parts.length; j++) {\\n if (parts[j] === comp[j]) continue\\n if (parts[j] === false) continue\\n if (~parts[j].indexOf(\\\".\\\")) continue\\n\\n c = _.cloneDeep(node)\\n walk(c, { Identifier: function (node, state) { if (node.name === parts[j]) node.name = comp[j] }})\\n if (_.isEqual(comp, generators[node.type](c))) {\\n func = getScope(parts[j], state)\\n if (!func) console.log(state, parts[j], comp[j])\\n replaceVar(func, parts[j], comp[j])\\n return\\n }\\n }\\n }\\n}\",\n \"astProperties() {\\r\\n\\t\\t\\t\\t\\treturn {};\\r\\n\\t\\t\\t\\t}\",\n \"*next(token) {\\n switch (token.type) {\\n case 'directive':\\n this.directives.add(token.source, (offset, message, warning) => {\\n const pos = getErrorPos(token);\\n pos[0] += offset;\\n this.onError(pos, 'BAD_DIRECTIVE', message, warning);\\n });\\n this.prelude.push(token.source);\\n this.atDirectives = true;\\n break;\\n case 'document': {\\n const doc = composeDoc(this.options, this.directives, token, this.onError);\\n if (this.atDirectives && !doc.directives.docStart)\\n this.onError(token, 'MISSING_CHAR', 'Missing directives-end/doc-start indicator line');\\n this.decorate(doc, false);\\n if (this.doc)\\n yield this.doc;\\n this.doc = doc;\\n this.atDirectives = false;\\n break;\\n }\\n case 'byte-order-mark':\\n case 'space':\\n break;\\n case 'comment':\\n case 'newline':\\n this.prelude.push(token.source);\\n break;\\n case 'error': {\\n const msg = token.source\\n ? `${token.message}: ${JSON.stringify(token.source)}`\\n : token.message;\\n const error = new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', msg);\\n if (this.atDirectives || !this.doc)\\n this.errors.push(error);\\n else\\n this.doc.errors.push(error);\\n break;\\n }\\n case 'doc-end': {\\n if (!this.doc) {\\n const msg = 'Unexpected doc-end without preceding document';\\n this.errors.push(new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', msg));\\n break;\\n }\\n this.doc.directives.docEnd = true;\\n const end = resolveEnd(token.end, token.offset + token.source.length, this.doc.options.strict, this.onError);\\n this.decorate(this.doc, true);\\n if (end.comment) {\\n const dc = this.doc.comment;\\n this.doc.comment = dc ? `${dc}\\\\n${end.comment}` : end.comment;\\n }\\n this.doc.range[2] = end.offset;\\n break;\\n }\\n default:\\n this.errors.push(new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', `Unsupported token ${token.type}`));\\n }\\n }\",\n \"getAst() {\\n\\n return {\\n type: 'procedure',\\n params: this.params,\\n body: this.body ? this.body.getAst() : null,\\n isService: this.isService\\n };\\n }\",\n \"function Gb(){}\",\n \"Compile() {\\n\\n }\",\n \"function generateJavascript(ast, options) {\\n /* These only indent non-empty lines to avoid trailing whitespace. */\\n function indent2(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n function indent4(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n function indent8(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n function indent10(code) { return code.replace(/^(.+)$/gm, ' $1'); }\\n\\n function generateTables() {\\n if (options.optimize === \\\"size\\\") {\\n return [\\n 'peg$consts = [',\\n indent2(ast.consts.join(',\\\\n')),\\n '],',\\n '',\\n 'peg$bytecode = [',\\n indent2(arrays.map(ast.rules, function(rule) {\\n return 'peg$decode(\\\"'\\n + js.stringEscape(arrays.map(\\n rule.bytecode,\\n function(b) { return String.fromCharCode(b + 32); }\\n ).join(''))\\n + '\\\")';\\n }).join(',\\\\n')),\\n '],'\\n ].join('\\\\n');\\n } else {\\n return arrays.map(\\n ast.consts,\\n function(c, i) { return 'peg$c' + i + ' = ' + c + ','; }\\n ).join('\\\\n');\\n }\\n }\\n\\n function generateRuleHeader(ruleNameCode, ruleIndexCode) {\\n var parts = [];\\n\\n parts.push('');\\n\\n if (options.trace) {\\n parts.push([\\n 'peg$tracer.trace({',\\n ' type: \\\"rule.enter\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' location: peg$computeLocation(startPos, startPos)',\\n '});',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n if (options.cache) {\\n parts.push([\\n 'var key = peg$currPos * ' + ast.rules.length + ' + ' + ruleIndexCode + ',',\\n ' cached = peg$resultsCache[key];',\\n '',\\n 'if (cached) {',\\n ' peg$currPos = cached.nextPos;',\\n '',\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n 'if (cached.result !== peg$FAILED) {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.match\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' result: cached.result,',\\n ' location: peg$computeLocation(startPos, peg$currPos)',\\n ' });',\\n '} else {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.fail\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' location: peg$computeLocation(startPos, startPos)',\\n ' });',\\n '}',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' return cached.result;',\\n '}',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateRuleFooter(ruleNameCode, resultCode) {\\n var parts = [];\\n\\n if (options.cache) {\\n parts.push([\\n '',\\n 'peg$resultsCache[key] = { nextPos: peg$currPos, result: ' + resultCode + ' };'\\n ].join('\\\\n'));\\n }\\n\\n if (options.trace) {\\n parts.push([\\n '',\\n 'if (' + resultCode + ' !== peg$FAILED) {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.match\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' result: ' + resultCode + ',',\\n ' location: peg$computeLocation(startPos, peg$currPos)',\\n ' });',\\n '} else {',\\n ' peg$tracer.trace({',\\n ' type: \\\"rule.fail\\\",',\\n ' rule: ' + ruleNameCode + ',',\\n ' location: peg$computeLocation(startPos, startPos)',\\n ' });',\\n '}'\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n '',\\n 'return ' + resultCode + ';'\\n ].join('\\\\n'));\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateInterpreter() {\\n var parts = [];\\n\\n function generateCondition(cond, argsLength) {\\n var baseLength = argsLength + 3,\\n thenLengthCode = 'bc[ip + ' + (baseLength - 2) + ']',\\n elseLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n\\n return [\\n 'ends.push(end);',\\n 'ips.push(ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ');',\\n '',\\n 'if (' + cond + ') {',\\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ';',\\n ' ip += ' + baseLength + ';',\\n '} else {',\\n ' end = ip + ' + baseLength + ' + ' + thenLengthCode + ' + ' + elseLengthCode + ';',\\n ' ip += ' + baseLength + ' + ' + thenLengthCode + ';',\\n '}',\\n '',\\n 'break;'\\n ].join('\\\\n');\\n }\\n\\n function generateLoop(cond) {\\n var baseLength = 2,\\n bodyLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n\\n return [\\n 'if (' + cond + ') {',\\n ' ends.push(end);',\\n ' ips.push(ip);',\\n '',\\n ' end = ip + ' + baseLength + ' + ' + bodyLengthCode + ';',\\n ' ip += ' + baseLength + ';',\\n '} else {',\\n ' ip += ' + baseLength + ' + ' + bodyLengthCode + ';',\\n '}',\\n '',\\n 'break;'\\n ].join('\\\\n');\\n }\\n\\n function generateCall() {\\n var baseLength = 4,\\n paramsLengthCode = 'bc[ip + ' + (baseLength - 1) + ']';\\n\\n return [\\n 'params = bc.slice(ip + ' + baseLength + ', ip + ' + baseLength + ' + ' + paramsLengthCode + ');',\\n 'for (i = 0; i < ' + paramsLengthCode + '; i++) {',\\n ' params[i] = stack[stack.length - 1 - params[i]];',\\n '}',\\n '',\\n 'stack.splice(',\\n ' stack.length - bc[ip + 2],',\\n ' bc[ip + 2],',\\n ' peg$consts[bc[ip + 1]].apply(null, params)',\\n ');',\\n '',\\n 'ip += ' + baseLength + ' + ' + paramsLengthCode + ';',\\n 'break;'\\n ].join('\\\\n');\\n }\\n\\n parts.push([\\n 'function peg$decode(s) {',\\n ' var bc = new Array(s.length), i;',\\n '',\\n ' for (i = 0; i < s.length; i++) {',\\n ' bc[i] = s.charCodeAt(i) - 32;',\\n ' }',\\n '',\\n ' return bc;',\\n '}',\\n '',\\n 'function peg$parseRule(index) {',\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n ' var bc = peg$bytecode[index],',\\n ' ip = 0,',\\n ' ips = [],',\\n ' end = bc.length,',\\n ' ends = [],',\\n ' stack = [],',\\n ' startPos = peg$currPos,',\\n ' params, i;',\\n ].join('\\\\n'));\\n } else {\\n parts.push([\\n ' var bc = peg$bytecode[index],',\\n ' ip = 0,',\\n ' ips = [],',\\n ' end = bc.length,',\\n ' ends = [],',\\n ' stack = [],',\\n ' params, i;',\\n ].join('\\\\n'));\\n }\\n\\n parts.push(indent2(generateRuleHeader('peg$ruleNames[index]', 'index')));\\n\\n parts.push([\\n /*\\n * The point of the outer loop and the |ips| & |ends| stacks is to avoid\\n * recursive calls for interpreting parts of bytecode. In other words, we\\n * implement the |interpret| operation of the abstract machine without\\n * function calls. Such calls would likely slow the parser down and more\\n * importantly cause stack overflows for complex grammars.\\n */\\n ' while (true) {',\\n ' while (ip < end) {',\\n ' switch (bc[ip]) {',\\n ' case ' + op.PUSH + ':', // PUSH c\\n ' stack.push(peg$consts[bc[ip + 1]]);',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_UNDEFINED + ':', // PUSH_UNDEFINED\\n ' stack.push(void 0);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_NULL + ':', // PUSH_NULL\\n ' stack.push(null);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_FAILED + ':', // PUSH_FAILED\\n ' stack.push(peg$FAILED);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_EMPTY_ARRAY + ':', // PUSH_EMPTY_ARRAY\\n ' stack.push([]);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.PUSH_CURR_POS + ':', // PUSH_CURR_POS\\n ' stack.push(peg$currPos);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.POP + ':', // POP\\n ' stack.pop();',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.POP_CURR_POS + ':', // POP_CURR_POS\\n ' peg$currPos = stack.pop();',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.POP_N + ':', // POP_N n\\n ' stack.length -= bc[ip + 1];',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.NIP + ':', // NIP\\n ' stack.splice(-2, 1);',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.APPEND + ':', // APPEND\\n ' stack[stack.length - 2].push(stack.pop());',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.WRAP + ':', // WRAP n\\n ' stack.push(stack.splice(stack.length - bc[ip + 1], bc[ip + 1]));',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.TEXT + ':', // TEXT\\n ' stack.push(input.substring(stack.pop(), peg$currPos));',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.IF + ':', // IF t, f\\n indent10(generateCondition('stack[stack.length - 1]', 0)),\\n '',\\n ' case ' + op.IF_ERROR + ':', // IF_ERROR t, f\\n indent10(generateCondition(\\n 'stack[stack.length - 1] === peg$FAILED',\\n 0\\n )),\\n '',\\n ' case ' + op.IF_NOT_ERROR + ':', // IF_NOT_ERROR t, f\\n indent10(\\n generateCondition('stack[stack.length - 1] !== peg$FAILED',\\n 0\\n )),\\n '',\\n ' case ' + op.WHILE_NOT_ERROR + ':', // WHILE_NOT_ERROR b\\n indent10(generateLoop('stack[stack.length - 1] !== peg$FAILED')),\\n '',\\n ' case ' + op.MATCH_ANY + ':', // MATCH_ANY a, f, ...\\n indent10(generateCondition('input.length > peg$currPos', 0)),\\n '',\\n ' case ' + op.MATCH_STRING + ':', // MATCH_STRING s, a, f, ...\\n indent10(generateCondition(\\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length) === peg$consts[bc[ip + 1]]',\\n 1\\n )),\\n '',\\n ' case ' + op.MATCH_STRING_IC + ':', // MATCH_STRING_IC s, a, f, ...\\n indent10(generateCondition(\\n 'input.substr(peg$currPos, peg$consts[bc[ip + 1]].length).toLowerCase() === peg$consts[bc[ip + 1]]',\\n 1\\n )),\\n '',\\n ' case ' + op.MATCH_REGEXP + ':', // MATCH_REGEXP r, a, f, ...\\n indent10(generateCondition(\\n 'peg$consts[bc[ip + 1]].test(input.charAt(peg$currPos))',\\n 1\\n )),\\n '',\\n ' case ' + op.ACCEPT_N + ':', // ACCEPT_N n\\n ' stack.push(input.substr(peg$currPos, bc[ip + 1]));',\\n ' peg$currPos += bc[ip + 1];',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.ACCEPT_STRING + ':', // ACCEPT_STRING s\\n ' stack.push(peg$consts[bc[ip + 1]]);',\\n ' peg$currPos += peg$consts[bc[ip + 1]].length;',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.FAIL + ':', // FAIL e\\n ' stack.push(peg$FAILED);',\\n ' if (peg$silentFails === 0) {',\\n ' peg$fail(peg$consts[bc[ip + 1]]);',\\n ' }',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.LOAD_SAVED_POS + ':', // LOAD_SAVED_POS p\\n ' peg$savedPos = stack[stack.length - 1 - bc[ip + 1]];',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.UPDATE_SAVED_POS + ':', // UPDATE_SAVED_POS\\n ' peg$savedPos = peg$currPos;',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.CALL + ':', // CALL f, n, pc, p1, p2, ..., pN\\n indent10(generateCall()),\\n '',\\n ' case ' + op.RULE + ':', // RULE r\\n ' stack.push(peg$parseRule(bc[ip + 1]));',\\n ' ip += 2;',\\n ' break;',\\n '',\\n ' case ' + op.SILENT_FAILS_ON + ':', // SILENT_FAILS_ON\\n ' peg$silentFails++;',\\n ' ip++;',\\n ' break;',\\n '',\\n ' case ' + op.SILENT_FAILS_OFF + ':', // SILENT_FAILS_OFF\\n ' peg$silentFails--;',\\n ' ip++;',\\n ' break;',\\n '',\\n ' default:',\\n ' throw new Error(\\\"Invalid opcode: \\\" + bc[ip] + \\\".\\\");',\\n ' }',\\n ' }',\\n '',\\n ' if (ends.length > 0) {',\\n ' end = ends.pop();',\\n ' ip = ips.pop();',\\n ' } else {',\\n ' break;',\\n ' }',\\n ' }'\\n ].join('\\\\n'));\\n\\n parts.push(indent2(generateRuleFooter('peg$ruleNames[index]', 'stack[0]')));\\n parts.push('}');\\n\\n return parts.join('\\\\n');\\n }\\n\\n function generateRuleFunction(rule) {\\n var parts = [], code;\\n\\n function c(i) { return \\\"peg$c\\\" + i; } // |consts[i]| of the abstract machine\\n function s(i) { return \\\"s\\\" + i; } // |stack[i]| of the abstract machine\\n\\n var stack = {\\n sp: -1,\\n maxSp: -1,\\n\\n push: function(exprCode) {\\n var code = s(++this.sp) + ' = ' + exprCode + ';';\\n\\n if (this.sp > this.maxSp) { this.maxSp = this.sp; }\\n\\n return code;\\n },\\n\\n pop: function() {\\n var n, values;\\n\\n if (arguments.length === 0) {\\n return s(this.sp--);\\n } else {\\n n = arguments[0];\\n values = arrays.map(arrays.range(this.sp - n + 1, this.sp + 1), s);\\n this.sp -= n;\\n\\n return values;\\n }\\n },\\n\\n top: function() {\\n return s(this.sp);\\n },\\n\\n index: function(i) {\\n return s(this.sp - i);\\n }\\n };\\n\\n function compile(bc) {\\n var ip = 0,\\n end = bc.length,\\n parts = [],\\n value;\\n\\n function compileCondition(cond, argCount) {\\n var baseLength = argCount + 3,\\n thenLength = bc[ip + baseLength - 2],\\n elseLength = bc[ip + baseLength - 1],\\n baseSp = stack.sp,\\n thenCode, elseCode, thenSp, elseSp;\\n\\n ip += baseLength;\\n thenCode = compile(bc.slice(ip, ip + thenLength));\\n thenSp = stack.sp;\\n ip += thenLength;\\n\\n if (elseLength > 0) {\\n stack.sp = baseSp;\\n elseCode = compile(bc.slice(ip, ip + elseLength));\\n elseSp = stack.sp;\\n ip += elseLength;\\n\\n if (thenSp !== elseSp) {\\n throw new Error(\\n \\\"Branches of a condition must move the stack pointer in the same way.\\\"\\n );\\n }\\n }\\n\\n parts.push('if (' + cond + ') {');\\n parts.push(indent2(thenCode));\\n if (elseLength > 0) {\\n parts.push('} else {');\\n parts.push(indent2(elseCode));\\n }\\n parts.push('}');\\n }\\n\\n function compileLoop(cond) {\\n var baseLength = 2,\\n bodyLength = bc[ip + baseLength - 1],\\n baseSp = stack.sp,\\n bodyCode, bodySp;\\n\\n ip += baseLength;\\n bodyCode = compile(bc.slice(ip, ip + bodyLength));\\n bodySp = stack.sp;\\n ip += bodyLength;\\n\\n if (bodySp !== baseSp) {\\n throw new Error(\\\"Body of a loop can't move the stack pointer.\\\");\\n }\\n\\n parts.push('while (' + cond + ') {');\\n parts.push(indent2(bodyCode));\\n parts.push('}');\\n }\\n\\n function compileCall() {\\n var baseLength = 4,\\n paramsLength = bc[ip + baseLength - 1];\\n\\n var value = c(bc[ip + 1]) + '('\\n + arrays.map(\\n bc.slice(ip + baseLength, ip + baseLength + paramsLength),\\n function(p) { return stack.index(p); }\\n ).join(', ')\\n + ')';\\n stack.pop(bc[ip + 2]);\\n parts.push(stack.push(value));\\n ip += baseLength + paramsLength;\\n }\\n\\n while (ip < end) {\\n switch (bc[ip]) {\\n case op.PUSH: // PUSH c\\n parts.push(stack.push(c(bc[ip + 1])));\\n ip += 2;\\n break;\\n\\n case op.PUSH_CURR_POS: // PUSH_CURR_POS\\n parts.push(stack.push('peg$currPos'));\\n ip++;\\n break;\\n\\n case op.PUSH_UNDEFINED: // PUSH_UNDEFINED\\n parts.push(stack.push('void 0'));\\n ip++;\\n break;\\n\\n case op.PUSH_NULL: // PUSH_NULL\\n parts.push(stack.push('null'));\\n ip++;\\n break;\\n\\n case op.PUSH_FAILED: // PUSH_FAILED\\n parts.push(stack.push('peg$FAILED'));\\n ip++;\\n break;\\n\\n case op.PUSH_EMPTY_ARRAY: // PUSH_EMPTY_ARRAY\\n parts.push(stack.push('[]'));\\n ip++;\\n break;\\n\\n case op.POP: // POP\\n stack.pop();\\n ip++;\\n break;\\n\\n case op.POP_CURR_POS: // POP_CURR_POS\\n parts.push('peg$currPos = ' + stack.pop() + ';');\\n ip++;\\n break;\\n\\n case op.POP_N: // POP_N n\\n stack.pop(bc[ip + 1]);\\n ip += 2;\\n break;\\n\\n case op.NIP: // NIP\\n value = stack.pop();\\n stack.pop();\\n parts.push(stack.push(value));\\n ip++;\\n break;\\n\\n case op.APPEND: // APPEND\\n value = stack.pop();\\n parts.push(stack.top() + '.push(' + value + ');');\\n ip++;\\n break;\\n\\n case op.WRAP: // WRAP n\\n parts.push(\\n stack.push('[' + stack.pop(bc[ip + 1]).join(', ') + ']')\\n );\\n ip += 2;\\n break;\\n\\n case op.TEXT: // TEXT\\n parts.push(\\n stack.push('input.substring(' + stack.pop() + ', peg$currPos)')\\n );\\n ip++;\\n break;\\n\\n case op.IF: // IF t, f\\n compileCondition(stack.top(), 0);\\n break;\\n\\n case op.IF_ERROR: // IF_ERROR t, f\\n compileCondition(stack.top() + ' === peg$FAILED', 0);\\n break;\\n\\n case op.IF_NOT_ERROR: // IF_NOT_ERROR t, f\\n compileCondition(stack.top() + ' !== peg$FAILED', 0);\\n break;\\n\\n case op.WHILE_NOT_ERROR: // WHILE_NOT_ERROR b\\n compileLoop(stack.top() + ' !== peg$FAILED', 0);\\n break;\\n\\n case op.MATCH_ANY: // MATCH_ANY a, f, ...\\n compileCondition('input.length > peg$currPos', 0);\\n break;\\n\\n case op.MATCH_STRING: // MATCH_STRING s, a, f, ...\\n compileCondition(\\n eval(ast.consts[bc[ip + 1]]).length > 1\\n ? 'input.substr(peg$currPos, '\\n + eval(ast.consts[bc[ip + 1]]).length\\n + ') === '\\n + c(bc[ip + 1])\\n : 'input.charCodeAt(peg$currPos) === '\\n + eval(ast.consts[bc[ip + 1]]).charCodeAt(0),\\n 1\\n );\\n break;\\n\\n case op.MATCH_STRING_IC: // MATCH_STRING_IC s, a, f, ...\\n compileCondition(\\n 'input.substr(peg$currPos, '\\n + eval(ast.consts[bc[ip + 1]]).length\\n + ').toLowerCase() === '\\n + c(bc[ip + 1]),\\n 1\\n );\\n break;\\n\\n case op.MATCH_REGEXP: // MATCH_REGEXP r, a, f, ...\\n compileCondition(\\n c(bc[ip + 1]) + '.test(input.charAt(peg$currPos))',\\n 1\\n );\\n break;\\n\\n case op.ACCEPT_N: // ACCEPT_N n\\n parts.push(stack.push(\\n bc[ip + 1] > 1\\n ? 'input.substr(peg$currPos, ' + bc[ip + 1] + ')'\\n : 'input.charAt(peg$currPos)'\\n ));\\n parts.push(\\n bc[ip + 1] > 1\\n ? 'peg$currPos += ' + bc[ip + 1] + ';'\\n : 'peg$currPos++;'\\n );\\n ip += 2;\\n break;\\n\\n case op.ACCEPT_STRING: // ACCEPT_STRING s\\n parts.push(stack.push(c(bc[ip + 1])));\\n parts.push(\\n eval(ast.consts[bc[ip + 1]]).length > 1\\n ? 'peg$currPos += ' + eval(ast.consts[bc[ip + 1]]).length + ';'\\n : 'peg$currPos++;'\\n );\\n ip += 2;\\n break;\\n\\n case op.FAIL: // FAIL e\\n parts.push(stack.push('peg$FAILED'));\\n parts.push('if (peg$silentFails === 0) { peg$fail(' + c(bc[ip + 1]) + '); }');\\n ip += 2;\\n break;\\n\\n case op.LOAD_SAVED_POS: // LOAD_SAVED_POS p\\n parts.push('peg$savedPos = ' + stack.index(bc[ip + 1]) + ';');\\n ip += 2;\\n break;\\n\\n case op.UPDATE_SAVED_POS: // UPDATE_SAVED_POS\\n parts.push('peg$savedPos = peg$currPos;');\\n ip++;\\n break;\\n\\n case op.CALL: // CALL f, n, pc, p1, p2, ..., pN\\n compileCall();\\n break;\\n\\n case op.RULE: // RULE r\\n parts.push(stack.push(\\\"peg$parse\\\" + ast.rules[bc[ip + 1]].name + \\\"()\\\"));\\n ip += 2;\\n break;\\n\\n case op.SILENT_FAILS_ON: // SILENT_FAILS_ON\\n parts.push('peg$silentFails++;');\\n ip++;\\n break;\\n\\n case op.SILENT_FAILS_OFF: // SILENT_FAILS_OFF\\n parts.push('peg$silentFails--;');\\n ip++;\\n break;\\n\\n default:\\n throw new Error(\\\"Invalid opcode: \\\" + bc[ip] + \\\".\\\");\\n }\\n }\\n\\n return parts.join('\\\\n');\\n }\\n\\n code = compile(rule.bytecode);\\n\\n parts.push('function peg$parse' + rule.name + '() {');\\n\\n if (options.trace) {\\n parts.push([\\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ',',\\n ' startPos = peg$currPos;'\\n ].join('\\\\n'));\\n } else {\\n parts.push(\\n ' var ' + arrays.map(arrays.range(0, stack.maxSp + 1), s).join(', ') + ';'\\n );\\n }\\n\\n parts.push(indent2(generateRuleHeader(\\n '\\\"' + js.stringEscape(rule.name) + '\\\"',\\n asts.indexOfRule(ast, rule.name)\\n )));\\n parts.push(indent2(code));\\n parts.push(indent2(generateRuleFooter(\\n '\\\"' + js.stringEscape(rule.name) + '\\\"',\\n s(0)\\n )));\\n\\n parts.push('}');\\n\\n return parts.join('\\\\n');\\n }\\n\\n var parts = [],\\n startRuleIndices, startRuleIndex,\\n startRuleFunctions, startRuleFunction,\\n ruleNames;\\n\\n parts.push([\\n '(function() {',\\n ' \\\"use strict\\\";',\\n '',\\n ' /*',\\n ' * Generated by PEG.js 0.9.0.',\\n ' *',\\n ' * http://pegjs.org/',\\n ' */',\\n '',\\n ' function peg$subclass(child, parent) {',\\n ' function ctor() { this.constructor = child; }',\\n ' ctor.prototype = parent.prototype;',\\n ' child.prototype = new ctor();',\\n ' }',\\n '',\\n ' function peg$SyntaxError(message, expected, found, location) {',\\n ' this.message = message;',\\n ' this.expected = expected;',\\n ' this.found = found;',\\n ' this.location = location;',\\n ' this.name = \\\"SyntaxError\\\";',\\n '',\\n ' if (typeof Error.captureStackTrace === \\\"function\\\") {',\\n ' Error.captureStackTrace(this, peg$SyntaxError);',\\n ' }',\\n ' }',\\n '',\\n ' peg$subclass(peg$SyntaxError, Error);',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n ' function peg$DefaultTracer() {',\\n ' this.indentLevel = 0;',\\n ' }',\\n '',\\n ' peg$DefaultTracer.prototype.trace = function(event) {',\\n ' var that = this;',\\n '',\\n ' function log(event) {',\\n ' function repeat(string, n) {',\\n ' var result = \\\"\\\", i;',\\n '',\\n ' for (i = 0; i < n; i++) {',\\n ' result += string;',\\n ' }',\\n '',\\n ' return result;',\\n ' }',\\n '',\\n ' function pad(string, length) {',\\n ' return string + repeat(\\\" \\\", length - string.length);',\\n ' }',\\n '',\\n ' if (typeof console === \\\"object\\\") {', // IE 8-10\\n ' console.log(',\\n ' event.location.start.line + \\\":\\\" + event.location.start.column + \\\"-\\\"',\\n ' + event.location.end.line + \\\":\\\" + event.location.end.column + \\\" \\\"',\\n ' + pad(event.type, 10) + \\\" \\\"',\\n ' + repeat(\\\" \\\", that.indentLevel) + event.rule',\\n ' );',\\n ' }',\\n ' }',\\n '',\\n ' switch (event.type) {',\\n ' case \\\"rule.enter\\\":',\\n ' log(event);',\\n ' this.indentLevel++;',\\n ' break;',\\n '',\\n ' case \\\"rule.match\\\":',\\n ' this.indentLevel--;',\\n ' log(event);',\\n ' break;',\\n '',\\n ' case \\\"rule.fail\\\":',\\n ' this.indentLevel--;',\\n ' log(event);',\\n ' break;',\\n '',\\n ' default:',\\n ' throw new Error(\\\"Invalid event type: \\\" + event.type + \\\".\\\");',\\n ' }',\\n ' };',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' function peg$parse(input) {',\\n ' var options = arguments.length > 1 ? arguments[1] : {},',\\n ' parser = this,',\\n '',\\n ' peg$FAILED = {},',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n startRuleIndices = '{ '\\n + arrays.map(\\n options.allowedStartRules,\\n function(r) { return r + ': ' + asts.indexOfRule(ast, r); }\\n ).join(', ')\\n + ' }';\\n startRuleIndex = asts.indexOfRule(ast, options.allowedStartRules[0]);\\n\\n parts.push([\\n ' peg$startRuleIndices = ' + startRuleIndices + ',',\\n ' peg$startRuleIndex = ' + startRuleIndex + ','\\n ].join('\\\\n'));\\n } else {\\n startRuleFunctions = '{ '\\n + arrays.map(\\n options.allowedStartRules,\\n function(r) { return r + ': peg$parse' + r; }\\n ).join(', ')\\n + ' }';\\n startRuleFunction = 'peg$parse' + options.allowedStartRules[0];\\n\\n parts.push([\\n ' peg$startRuleFunctions = ' + startRuleFunctions + ',',\\n ' peg$startRuleFunction = ' + startRuleFunction + ','\\n ].join('\\\\n'));\\n }\\n\\n parts.push('');\\n\\n parts.push(indent8(generateTables()));\\n\\n parts.push([\\n '',\\n ' peg$currPos = 0,',\\n ' peg$savedPos = 0,',\\n ' peg$posDetailsCache = [{ line: 1, column: 1, seenCR: false }],',\\n ' peg$maxFailPos = 0,',\\n ' peg$maxFailExpected = [],',\\n ' peg$silentFails = 0,', // 0 = report failures, > 0 = silence failures\\n ''\\n ].join('\\\\n'));\\n\\n if (options.cache) {\\n parts.push([\\n ' peg$resultsCache = {},',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n if (options.trace) {\\n if (options.optimize === \\\"size\\\") {\\n ruleNames = '['\\n + arrays.map(\\n ast.rules,\\n function(r) { return '\\\"' + js.stringEscape(r.name) + '\\\"'; }\\n ).join(', ')\\n + ']';\\n\\n parts.push([\\n ' peg$ruleNames = ' + ruleNames + ',',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' peg$tracer = \\\"tracer\\\" in options ? options.tracer : new peg$DefaultTracer(),',\\n ''\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' peg$result;',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push([\\n ' if (\\\"startRule\\\" in options) {',\\n ' if (!(options.startRule in peg$startRuleIndices)) {',\\n ' throw new Error(\\\"Can\\\\'t start parsing from rule \\\\\\\\\\\"\\\" + options.startRule + \\\"\\\\\\\\\\\".\\\");',\\n ' }',\\n '',\\n ' peg$startRuleIndex = peg$startRuleIndices[options.startRule];',\\n ' }'\\n ].join('\\\\n'));\\n } else {\\n parts.push([\\n ' if (\\\"startRule\\\" in options) {',\\n ' if (!(options.startRule in peg$startRuleFunctions)) {',\\n ' throw new Error(\\\"Can\\\\'t start parsing from rule \\\\\\\\\\\"\\\" + options.startRule + \\\"\\\\\\\\\\\".\\\");',\\n ' }',\\n '',\\n ' peg$startRuleFunction = peg$startRuleFunctions[options.startRule];',\\n ' }'\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n '',\\n ' function text() {',\\n ' return input.substring(peg$savedPos, peg$currPos);',\\n ' }',\\n '',\\n ' function location() {',\\n ' return peg$computeLocation(peg$savedPos, peg$currPos);',\\n ' }',\\n '',\\n ' function expected(description) {',\\n ' throw peg$buildException(',\\n ' null,',\\n ' [{ type: \\\"other\\\", description: description }],',\\n ' input.substring(peg$savedPos, peg$currPos),',\\n ' peg$computeLocation(peg$savedPos, peg$currPos)',\\n ' );',\\n ' }',\\n '',\\n ' function error(message) {',\\n ' throw peg$buildException(',\\n ' message,',\\n ' null,',\\n ' input.substring(peg$savedPos, peg$currPos),',\\n ' peg$computeLocation(peg$savedPos, peg$currPos)',\\n ' );',\\n ' }',\\n '',\\n ' function peg$computePosDetails(pos) {',\\n ' var details = peg$posDetailsCache[pos],',\\n ' p, ch;',\\n '',\\n ' if (details) {',\\n ' return details;',\\n ' } else {',\\n ' p = pos - 1;',\\n ' while (!peg$posDetailsCache[p]) {',\\n ' p--;',\\n ' }',\\n '',\\n ' details = peg$posDetailsCache[p];',\\n ' details = {',\\n ' line: details.line,',\\n ' column: details.column,',\\n ' seenCR: details.seenCR',\\n ' };',\\n '',\\n ' while (p < pos) {',\\n ' ch = input.charAt(p);',\\n ' if (ch === \\\"\\\\\\\\n\\\") {',\\n ' if (!details.seenCR) { details.line++; }',\\n ' details.column = 1;',\\n ' details.seenCR = false;',\\n ' } else if (ch === \\\"\\\\\\\\r\\\" || ch === \\\"\\\\\\\\u2028\\\" || ch === \\\"\\\\\\\\u2029\\\") {',\\n ' details.line++;',\\n ' details.column = 1;',\\n ' details.seenCR = true;',\\n ' } else {',\\n ' details.column++;',\\n ' details.seenCR = false;',\\n ' }',\\n '',\\n ' p++;',\\n ' }',\\n '',\\n ' peg$posDetailsCache[pos] = details;',\\n ' return details;',\\n ' }',\\n ' }',\\n '',\\n ' function peg$computeLocation(startPos, endPos) {',\\n ' var startPosDetails = peg$computePosDetails(startPos),',\\n ' endPosDetails = peg$computePosDetails(endPos);',\\n '',\\n ' return {',\\n ' start: {',\\n ' offset: startPos,',\\n ' line: startPosDetails.line,',\\n ' column: startPosDetails.column',\\n ' },',\\n ' end: {',\\n ' offset: endPos,',\\n ' line: endPosDetails.line,',\\n ' column: endPosDetails.column',\\n ' }',\\n ' };',\\n ' }',\\n '',\\n ' function peg$fail(expected) {',\\n ' if (peg$currPos < peg$maxFailPos) { return; }',\\n '',\\n ' if (peg$currPos > peg$maxFailPos) {',\\n ' peg$maxFailPos = peg$currPos;',\\n ' peg$maxFailExpected = [];',\\n ' }',\\n '',\\n ' peg$maxFailExpected.push(expected);',\\n ' }',\\n '',\\n ' function peg$buildException(message, expected, found, location) {',\\n ' function cleanupExpected(expected) {',\\n ' var i = 1;',\\n '',\\n ' expected.sort(function(a, b) {',\\n ' if (a.description < b.description) {',\\n ' return -1;',\\n ' } else if (a.description > b.description) {',\\n ' return 1;',\\n ' } else {',\\n ' return 0;',\\n ' }',\\n ' });',\\n '',\\n /*\\n * This works because the bytecode generator guarantees that every\\n * expectation object exists only once, so it's enough to use |===| instead\\n * of deeper structural comparison.\\n */\\n ' while (i < expected.length) {',\\n ' if (expected[i - 1] === expected[i]) {',\\n ' expected.splice(i, 1);',\\n ' } else {',\\n ' i++;',\\n ' }',\\n ' }',\\n ' }',\\n '',\\n ' function buildMessage(expected, found) {',\\n ' function stringEscape(s) {',\\n ' function hex(ch) { return ch.charCodeAt(0).toString(16).toUpperCase(); }',\\n '',\\n /*\\n * ECMA-262, 5th ed., 7.8.4: All characters may appear literally in a string\\n * literal except for the closing quote character, backslash, carriage\\n * return, line separator, paragraph separator, and line feed. Any character\\n * may appear in the form of an escape sequence.\\n *\\n * For portability, we also escape all control and non-ASCII characters.\\n * Note that \\\"\\\\0\\\" and \\\"\\\\v\\\" escape sequences are not used because JSHint does\\n * not like the first and IE the second.\\n */\\n ' return s',\\n ' .replace(/\\\\\\\\\\\\\\\\/g, \\\\'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\')', // backslash\\n ' .replace(/\\\"/g, \\\\'\\\\\\\\\\\\\\\\\\\"\\\\')', // closing double quote\\n ' .replace(/\\\\\\\\x08/g, \\\\'\\\\\\\\\\\\\\\\b\\\\')', // backspace\\n ' .replace(/\\\\\\\\t/g, \\\\'\\\\\\\\\\\\\\\\t\\\\')', // horizontal tab\\n ' .replace(/\\\\\\\\n/g, \\\\'\\\\\\\\\\\\\\\\n\\\\')', // line feed\\n ' .replace(/\\\\\\\\f/g, \\\\'\\\\\\\\\\\\\\\\f\\\\')', // form feed\\n ' .replace(/\\\\\\\\r/g, \\\\'\\\\\\\\\\\\\\\\r\\\\')', // carriage return\\n ' .replace(/[\\\\\\\\x00-\\\\\\\\x07\\\\\\\\x0B\\\\\\\\x0E\\\\\\\\x0F]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x0\\\\' + hex(ch); })',\\n ' .replace(/[\\\\\\\\x10-\\\\\\\\x1F\\\\\\\\x80-\\\\\\\\xFF]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\x\\\\' + hex(ch); })',\\n ' .replace(/[\\\\\\\\u0100-\\\\\\\\u0FFF]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\u0\\\\' + hex(ch); })',\\n ' .replace(/[\\\\\\\\u1000-\\\\\\\\uFFFF]/g, function(ch) { return \\\\'\\\\\\\\\\\\\\\\u\\\\' + hex(ch); });',\\n ' }',\\n '',\\n ' var expectedDescs = new Array(expected.length),',\\n ' expectedDesc, foundDesc, i;',\\n '',\\n ' for (i = 0; i < expected.length; i++) {',\\n ' expectedDescs[i] = expected[i].description;',\\n ' }',\\n '',\\n ' expectedDesc = expected.length > 1',\\n ' ? expectedDescs.slice(0, -1).join(\\\", \\\")',\\n ' + \\\" or \\\"',\\n ' + expectedDescs[expected.length - 1]',\\n ' : expectedDescs[0];',\\n '',\\n ' foundDesc = found ? \\\"\\\\\\\\\\\"\\\" + stringEscape(found) + \\\"\\\\\\\\\\\"\\\" : \\\"end of input\\\";',\\n '',\\n ' return \\\"Expected \\\" + expectedDesc + \\\" but \\\" + foundDesc + \\\" found.\\\";',\\n ' }',\\n '',\\n ' if (expected !== null) {',\\n ' cleanupExpected(expected);',\\n ' }',\\n '',\\n ' return new peg$SyntaxError(',\\n ' message !== null ? message : buildMessage(expected, found),',\\n ' expected,',\\n ' found,',\\n ' location',\\n ' );',\\n ' }',\\n ''\\n ].join('\\\\n'));\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push(indent4(generateInterpreter()));\\n parts.push('');\\n } else {\\n arrays.each(ast.rules, function(rule) {\\n parts.push(indent4(generateRuleFunction(rule)));\\n parts.push('');\\n });\\n }\\n\\n if (ast.initializer) {\\n parts.push(indent4(ast.initializer.code));\\n parts.push('');\\n }\\n\\n if (options.optimize === \\\"size\\\") {\\n parts.push(' peg$result = peg$parseRule(peg$startRuleIndex);');\\n } else {\\n parts.push(' peg$result = peg$startRuleFunction();');\\n }\\n\\n parts.push([\\n '',\\n ' if (peg$result !== peg$FAILED && peg$currPos === input.length) {',\\n ' return peg$result;',\\n ' } else {',\\n ' if (peg$result !== peg$FAILED && peg$currPos < input.length) {',\\n ' peg$fail({ type: \\\"end\\\", description: \\\"end of input\\\" });',\\n ' }',\\n '',\\n ' throw peg$buildException(',\\n ' null,',\\n ' peg$maxFailExpected,',\\n ' peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,',\\n ' peg$maxFailPos < input.length',\\n ' ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)',\\n ' : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)',\\n ' );',\\n ' }',\\n ' }',\\n '',\\n ' return {'\\n ].join('\\\\n'));\\n\\n if (options.trace) {\\n parts.push([\\n ' SyntaxError: peg$SyntaxError,',\\n ' DefaultTracer: peg$DefaultTracer,',\\n ' parse: peg$parse'\\n ].join('\\\\n'));\\n } else {\\n parts.push([\\n ' SyntaxError: peg$SyntaxError,',\\n ' parse: peg$parse'\\n ].join('\\\\n'));\\n }\\n\\n parts.push([\\n ' };',\\n '})()'\\n ].join('\\\\n'));\\n\\n ast.code = parts.join('\\\\n');\\n }\",\n \"function Generator() {}\",\n \"function Generator() {}\",\n \"function Generator() {}\",\n \"function Generator() {}\",\n \"function Generator() {}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.62169564","0.5706019","0.5684357","0.5656814","0.554739","0.5442892","0.54246783","0.53784406","0.533806","0.53049433","0.52785397","0.52753025","0.52733904","0.52694523","0.5256397","0.5236033","0.52267605","0.52171594","0.5213136","0.52108103","0.5204597","0.52036107","0.5199579","0.51869357","0.51662856","0.5146934","0.5141915","0.51365525","0.513556","0.5129279","0.5126407","0.51185393","0.51119465","0.5099191","0.5095716","0.508612","0.50830495","0.5082974","0.5079878","0.5071202","0.50702345","0.5054051","0.5049057","0.5041018","0.50352377","0.50335723","0.5025826","0.49985483","0.49961013","0.49885908","0.49879113","0.49867475","0.4982453","0.4975862","0.49719104","0.49715412","0.49676117","0.496042","0.4958096","0.49578428","0.49436253","0.49321955","0.49314708","0.49279526","0.49277988","0.4918203","0.4918203","0.49181765","0.49129197","0.4907295","0.4902214","0.48891446","0.48879805","0.48844156","0.48841625","0.48841625","0.48793626","0.48765376","0.48693356","0.4869162","0.4869162","0.4869162","0.4869162","0.4869162","0.4869162","0.4862635","0.4862635","0.48597986","0.48568767","0.48492774","0.48492646","0.48482114","0.48468384","0.48468032","0.48467022","0.48372632","0.48337787","0.48337787","0.48337787","0.48337787","0.48337787"],"string":"[\n \"0.62169564\",\n \"0.5706019\",\n \"0.5684357\",\n \"0.5656814\",\n \"0.554739\",\n \"0.5442892\",\n \"0.54246783\",\n \"0.53784406\",\n \"0.533806\",\n \"0.53049433\",\n \"0.52785397\",\n \"0.52753025\",\n \"0.52733904\",\n \"0.52694523\",\n \"0.5256397\",\n \"0.5236033\",\n \"0.52267605\",\n \"0.52171594\",\n \"0.5213136\",\n \"0.52108103\",\n \"0.5204597\",\n \"0.52036107\",\n \"0.5199579\",\n \"0.51869357\",\n \"0.51662856\",\n \"0.5146934\",\n \"0.5141915\",\n \"0.51365525\",\n \"0.513556\",\n \"0.5129279\",\n \"0.5126407\",\n \"0.51185393\",\n \"0.51119465\",\n \"0.5099191\",\n \"0.5095716\",\n \"0.508612\",\n \"0.50830495\",\n \"0.5082974\",\n \"0.5079878\",\n \"0.5071202\",\n \"0.50702345\",\n \"0.5054051\",\n \"0.5049057\",\n \"0.5041018\",\n \"0.50352377\",\n \"0.50335723\",\n \"0.5025826\",\n \"0.49985483\",\n \"0.49961013\",\n \"0.49885908\",\n \"0.49879113\",\n \"0.49867475\",\n \"0.4982453\",\n \"0.4975862\",\n \"0.49719104\",\n \"0.49715412\",\n \"0.49676117\",\n \"0.496042\",\n \"0.4958096\",\n \"0.49578428\",\n \"0.49436253\",\n \"0.49321955\",\n \"0.49314708\",\n \"0.49279526\",\n \"0.49277988\",\n \"0.4918203\",\n \"0.4918203\",\n \"0.49181765\",\n \"0.49129197\",\n \"0.4907295\",\n \"0.4902214\",\n \"0.48891446\",\n \"0.48879805\",\n \"0.48844156\",\n \"0.48841625\",\n \"0.48841625\",\n \"0.48793626\",\n \"0.48765376\",\n \"0.48693356\",\n \"0.4869162\",\n \"0.4869162\",\n \"0.4869162\",\n \"0.4869162\",\n \"0.4869162\",\n \"0.4869162\",\n \"0.4862635\",\n \"0.4862635\",\n \"0.48597986\",\n \"0.48568767\",\n \"0.48492774\",\n \"0.48492646\",\n \"0.48482114\",\n \"0.48468384\",\n \"0.48468032\",\n \"0.48467022\",\n \"0.48372632\",\n \"0.48337787\",\n \"0.48337787\",\n \"0.48337787\",\n \"0.48337787\",\n \"0.48337787\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74174,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the hash."},"document":{"kind":"string","value":"function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }","function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}","remove(key) {\r\n const hash = this.calculateHash(key);\r\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\r\n delete this.values[hash][key];\r\n this.numberOfValues--;\r\n }\r\n }","removeFromHash(hash, ...keys) {\n let hashObj = this.parseHash(hash);\n keys.forEach((key, i) => {\n delete hashObj[key]\n });\n return this.buildHash(hashObj);\n }","clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }","function _cleanupKeys()\n {\n if (this._count == this._keys.length) {\n return;\n }\n var srcIndex = 0;\n var destIndex = 0;\n var seen = {};\n while (srcIndex < this._keys.length) {\n var key = this._keys[srcIndex];\n if (_hasKey(this._map, key)\n && !_hasKey(seen, key)\n ) {\n this._keys[destIndex++] = key;\n seen[key] = true;\n }\n srcIndex++;\n }\n this._keys.length = destIndex;\n }","async clear() {\n return await keyv.clear();\n }","remove() {\n for (var key of this.keys) {\n this.elements[key].remove();\n }\n }","function clear () {\n keys().each(function (cookie) {\n remove(cookie);\n });\n }","function clearAll(){\r\n\tObject.keys(this.datastore).forEach((key)=>\r\n\t{\r\n\t\tdelete this.datastore[key];\r\n\t});\t\r\n}","function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t}","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","clear() {\n for (const key of Object.keys(this.datastore)) {\n delete this.datastore[key];\n // this.remove(key);\n }\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t }","function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }"],"string":"[\n \"clear() {\\n var map = this._map;\\n var keys = Object.keys(map);\\n\\n for (var i = 0; i < keys.length; i++) {\\n var key = keys[i];\\n map[key].clear();\\n }\\n }\",\n \"function clear() {\\n this.keys.forEach((key) => {\\n this._store[key] = undefined;\\n delete this._store[key];\\n });\\n}\",\n \"remove(key) {\\r\\n const hash = this.calculateHash(key);\\r\\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\\r\\n delete this.values[hash][key];\\r\\n this.numberOfValues--;\\r\\n }\\r\\n }\",\n \"removeFromHash(hash, ...keys) {\\n let hashObj = this.parseHash(hash);\\n keys.forEach((key, i) => {\\n delete hashObj[key]\\n });\\n return this.buildHash(hashObj);\\n }\",\n \"clear() {\\n log.map(\\\"Clearing the map of all the entries\\\");\\n this._map.clear();\\n }\",\n \"function _cleanupKeys()\\n {\\n if (this._count == this._keys.length) {\\n return;\\n }\\n var srcIndex = 0;\\n var destIndex = 0;\\n var seen = {};\\n while (srcIndex < this._keys.length) {\\n var key = this._keys[srcIndex];\\n if (_hasKey(this._map, key)\\n && !_hasKey(seen, key)\\n ) {\\n this._keys[destIndex++] = key;\\n seen[key] = true;\\n }\\n srcIndex++;\\n }\\n this._keys.length = destIndex;\\n }\",\n \"async clear() {\\n return await keyv.clear();\\n }\",\n \"remove() {\\n for (var key of this.keys) {\\n this.elements[key].remove();\\n }\\n }\",\n \"function clear () {\\n keys().each(function (cookie) {\\n remove(cookie);\\n });\\n }\",\n \"function clearAll(){\\r\\n\\tObject.keys(this.datastore).forEach((key)=>\\r\\n\\t{\\r\\n\\t\\tdelete this.datastore[key];\\r\\n\\t});\\t\\r\\n}\",\n \"function hashClear() {\\n\\t\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t\\t this.size = 0;\\n\\t\\t}\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"clear() {\\n for (const key of Object.keys(this.datastore)) {\\n delete this.datastore[key];\\n // this.remove(key);\\n }\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t\\t this.size = 0;\\n\\t\\t }\",\n \"function hashClear() {\\n\\t\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t\\t this.size = 0;\\n\\t\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.67325383","0.66216296","0.6511944","0.6454195","0.6214277","0.6200593","0.61385626","0.61101323","0.6029097","0.5966128","0.5934792","0.5905935","0.5905935","0.5905935","0.5903774","0.5899288","0.5899288","0.5899288","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.58634514","0.5861084","0.5861084","0.58483696","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575","0.58482575"],"string":"[\n \"0.67325383\",\n \"0.66216296\",\n \"0.6511944\",\n \"0.6454195\",\n \"0.6214277\",\n \"0.6200593\",\n \"0.61385626\",\n \"0.61101323\",\n \"0.6029097\",\n \"0.5966128\",\n \"0.5934792\",\n \"0.5905935\",\n \"0.5905935\",\n \"0.5905935\",\n \"0.5903774\",\n \"0.5899288\",\n \"0.5899288\",\n \"0.5899288\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.58634514\",\n \"0.5861084\",\n \"0.5861084\",\n \"0.58483696\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\",\n \"0.58482575\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74175,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the list cache."},"document":{"kind":"string","value":"function listCacheClear() {\n this.__data__ = [];\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function listCacheClear(){this.__data__=[];}","function listCacheClear(){this.__data__=[];}","function listCacheClear(){this.__data__=[];}","function listCacheClear(){this.__data__=[];}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t this.size = 0;\n\t\t}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t }","function listCacheClear(){this.__data__=[];this.size=0}","function listCacheClear(){this.__data__=[];this.size=0}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear(){this.__data__=[];this.size=0;}","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }"],"string":"[\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t this.size = 0;\\n\\t\\t}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t }\",\n \"function listCacheClear(){this.__data__=[];this.size=0}\",\n \"function listCacheClear(){this.__data__=[];this.size=0}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear(){this.__data__=[];this.size=0;}\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7357779","0.7357779","0.7357779","0.7357779","0.7317932","0.72645503","0.72645503","0.7262977","0.72569066","0.72569066","0.7236393","0.7236393","0.7236393","0.7236393","0.7236393","0.7236393","0.7236393","0.7236393","0.7236393","0.7236393","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.72320706","0.7231067","0.7231067","0.7231067","0.7231067","0.7231067","0.7231067","0.7226719","0.7226719","0.7226719","0.7226719","0.7214961","0.7214961","0.7207822","0.7207822","0.7207822","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724"],"string":"[\n \"0.7357779\",\n \"0.7357779\",\n \"0.7357779\",\n \"0.7357779\",\n \"0.7317932\",\n \"0.72645503\",\n \"0.72645503\",\n \"0.7262977\",\n \"0.72569066\",\n \"0.72569066\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7236393\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.72320706\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7226719\",\n \"0.7226719\",\n \"0.7226719\",\n \"0.7226719\",\n \"0.7214961\",\n \"0.7214961\",\n \"0.7207822\",\n \"0.7207822\",\n \"0.7207822\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74176,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the map."},"document":{"kind":"string","value":"function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }","clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }","function multiMapRemove(map, key, value) {\n const values = map.get(key);\n if (values) {\n array_1.removeUnordered(values, value);\n if (values.length === 0)\n map.delete(key);\n }\n}","function _cleanupKeys()\n {\n if (this._count == this._keys.length) {\n return;\n }\n var srcIndex = 0;\n var destIndex = 0;\n var seen = {};\n while (srcIndex < this._keys.length) {\n var key = this._keys[srcIndex];\n if (_hasKey(this._map, key)\n && !_hasKey(seen, key)\n ) {\n this._keys[destIndex++] = key;\n seen[key] = true;\n }\n srcIndex++;\n }\n this._keys.length = destIndex;\n }","function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}","remove() {\n for (var key of this.keys) {\n this.elements[key].remove();\n }\n }","function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}","function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}","function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}","function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }","function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }","function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t }","remove(key) {\r\n const hash = this.calculateHash(key);\r\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\r\n delete this.values[hash][key];\r\n this.numberOfValues--;\r\n }\r\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash(),\n\t 'map': Map ? new Map() : [],\n\t 'string': new Hash()\n\t };\n\t}","function mapClear() {\n\t this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","clear() {\n this.map = {};\n if (this.store) this.store.clear();\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function clear()\r{\r\tvar end = mapping_names.length;\r\r\tfor(var i=end-1; i>=0; i--){\r\t\tremove(mapping_names[i]);\r\t}\r\twhile(mapping_names.pop());\r\twhile(mapping_sources.pop());\r\twhile(mapping_destinations.pop());\r\twhile(mapping_algorithms.pop());\r}","function filterMutateMap(map, predicate) {\n for (const [key, value] of map) {\n if (!predicate(key, value)) {\n map.delete(key);\n }\n }\n}","delete(key) {\n this.map[key] = undefined;\n if (this.store) this.store.removeItem(key);\n }","mapRemove() {\n\n\t\tthis.map.remove();\n\n\t}","garbageCollect() {\n // Q: Can we delete keys from the map while iterating over it?\n // A: The ECMA spec states that yes, keys may be deleted during forEach.\n // It is less clear for iterators.\n let deleteBefore = new Date().getTime() - MAX_GLOBAL_COOLDOWN;\n this._cooldowns.forEach((value, key) => {\n if (value < deleteBefore) {\n this._cooldowns.delete(key);\n }\n });\n }","function clearAll(){\r\n\tObject.keys(this.datastore).forEach((key)=>\r\n\t{\r\n\t\tdelete this.datastore[key];\r\n\t});\t\r\n}","async clear() {\n return await keyv.clear();\n }","clear() {\n for (const key of Object.keys(this.datastore)) {\n delete this.datastore[key];\n // this.remove(key);\n }\n }","function clearObjects() {\n setMapOnAll(null);\n}","clear() {\n const _ = this;\n _._map.clear();\n _._nameSet.clear();\n }","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function clear () {\n keys().each(function (cookie) {\n remove(cookie);\n });\n }","function clean_maps() {\n var count;\n list_maps();\n\n for (var k in maps) {\n for (var i = 0; i < maps[k].length; i++) {\n var map = maps[k][i];\n count++;\n\n // if map render job is idle and last render process is older than\n // an hour, remove map\n if (map.renderer_idle && (time() - map.renderer_stop > 3600000)) {\n console.log(k + '/' + i + ': garbage collector removes map');\n maps[k].splice(i, 1);\n i--;\n }\n }\n }\n}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map$1||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","stopAll() {\n const _ = this;\n for (const entry of _._map.values()) {\n clearTimeout(entry.handle);\n }\n _._map.clear();\n }","function mapCacheClear() {\n\t\t this.size = 0;\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}","function mapCacheClear() {\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}","function mapCacheClear() {\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map$1 || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map$1 || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash(),\n 'map': new (_Map || _ListCache)(),\n 'string': new _Hash()\n };\n }","clearance () {\n mapDoS.forEach((val, key, map) => {\n if (val.at < moment().utc().subtract(val.interval, 'seconds')) {\n map.delete(key)\n }\n })\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash.default(),\n 'map': new (_Map.default || _ListCache.default)(),\n 'string': new _Hash.default()\n };\n }","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash(),\n\t 'map': new (_Map || _ListCache)(),\n\t 'string': new _Hash()\n\t };\n\t}","function clearEntry () {\n\n nextValue = null;\n}","remove(key) {\n let index = this._hash(key);\n if (this.keyMap[index] && this.keyMap[index].length) {\n this.keyMap[index] = undefined;\n this.size--;\n return true;\n } else {\n return false;\n }\n }","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function clearAllMarkers() {\n setMarkersOnMap(null);\n}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","clear () {\n if (this.doc !== null) {\n transact(this.doc, transaction => {\n this.forEach(function (_value, key, map) {\n typeMapDelete(transaction, map, key)\n })\n })\n } else {\n /** @type {Map<string, any>} */ (this._prelimContent).clear()\n }\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n\tthis.size = 0;\n\tthis.__data__ = {\n\t\thash: new _Hash(),\n\t\tmap: new ( _Map || _ListCache )(),\n\t\tstring: new _Hash(),\n\t};\n}","function mapCacheClear() {\n\t this.__data__ = {\n\t 'hash': new Hash(),\n\t 'map': new (Map || ListCache)(),\n\t 'string': new Hash()\n\t };\n\t }","function clearAllMarkers() {\n setAllMap(null);\n}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }"],"string":"[\n \"clear() {\\n var map = this._map;\\n var keys = Object.keys(map);\\n\\n for (var i = 0; i < keys.length; i++) {\\n var key = keys[i];\\n map[key].clear();\\n }\\n }\",\n \"clear() {\\n log.map(\\\"Clearing the map of all the entries\\\");\\n this._map.clear();\\n }\",\n \"function multiMapRemove(map, key, value) {\\n const values = map.get(key);\\n if (values) {\\n array_1.removeUnordered(values, value);\\n if (values.length === 0)\\n map.delete(key);\\n }\\n}\",\n \"function _cleanupKeys()\\n {\\n if (this._count == this._keys.length) {\\n return;\\n }\\n var srcIndex = 0;\\n var destIndex = 0;\\n var seen = {};\\n while (srcIndex < this._keys.length) {\\n var key = this._keys[srcIndex];\\n if (_hasKey(this._map, key)\\n && !_hasKey(seen, key)\\n ) {\\n this._keys[destIndex++] = key;\\n seen[key] = true;\\n }\\n srcIndex++;\\n }\\n this._keys.length = destIndex;\\n }\",\n \"function clear() {\\n this.keys.forEach((key) => {\\n this._store[key] = undefined;\\n delete this._store[key];\\n });\\n}\",\n \"remove() {\\n for (var key of this.keys) {\\n this.elements[key].remove();\\n }\\n }\",\n \"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}\",\n \"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}\",\n \"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}\",\n \"function mapClear() {\\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n }\",\n \"function mapClear() {\\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n }\",\n \"function mapClear() {\\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n }\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t }\",\n \"remove(key) {\\r\\n const hash = this.calculateHash(key);\\r\\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\\r\\n delete this.values[hash][key];\\r\\n this.numberOfValues--;\\r\\n }\\r\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash(),\\n\\t 'map': Map ? new Map() : [],\\n\\t 'string': new Hash()\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"clear() {\\n this.map = {};\\n if (this.store) this.store.clear();\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function clear()\\r{\\r\\tvar end = mapping_names.length;\\r\\r\\tfor(var i=end-1; i>=0; i--){\\r\\t\\tremove(mapping_names[i]);\\r\\t}\\r\\twhile(mapping_names.pop());\\r\\twhile(mapping_sources.pop());\\r\\twhile(mapping_destinations.pop());\\r\\twhile(mapping_algorithms.pop());\\r}\",\n \"function filterMutateMap(map, predicate) {\\n for (const [key, value] of map) {\\n if (!predicate(key, value)) {\\n map.delete(key);\\n }\\n }\\n}\",\n \"delete(key) {\\n this.map[key] = undefined;\\n if (this.store) this.store.removeItem(key);\\n }\",\n \"mapRemove() {\\n\\n\\t\\tthis.map.remove();\\n\\n\\t}\",\n \"garbageCollect() {\\n // Q: Can we delete keys from the map while iterating over it?\\n // A: The ECMA spec states that yes, keys may be deleted during forEach.\\n // It is less clear for iterators.\\n let deleteBefore = new Date().getTime() - MAX_GLOBAL_COOLDOWN;\\n this._cooldowns.forEach((value, key) => {\\n if (value < deleteBefore) {\\n this._cooldowns.delete(key);\\n }\\n });\\n }\",\n \"function clearAll(){\\r\\n\\tObject.keys(this.datastore).forEach((key)=>\\r\\n\\t{\\r\\n\\t\\tdelete this.datastore[key];\\r\\n\\t});\\t\\r\\n}\",\n \"async clear() {\\n return await keyv.clear();\\n }\",\n \"clear() {\\n for (const key of Object.keys(this.datastore)) {\\n delete this.datastore[key];\\n // this.remove(key);\\n }\\n }\",\n \"function clearObjects() {\\n setMapOnAll(null);\\n}\",\n \"clear() {\\n const _ = this;\\n _._map.clear();\\n _._nameSet.clear();\\n }\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function clear () {\\n keys().each(function (cookie) {\\n remove(cookie);\\n });\\n }\",\n \"function clean_maps() {\\n var count;\\n list_maps();\\n\\n for (var k in maps) {\\n for (var i = 0; i < maps[k].length; i++) {\\n var map = maps[k][i];\\n count++;\\n\\n // if map render job is idle and last render process is older than\\n // an hour, remove map\\n if (map.renderer_idle && (time() - map.renderer_stop > 3600000)) {\\n console.log(k + '/' + i + ': garbage collector removes map');\\n maps[k].splice(i, 1);\\n i--;\\n }\\n }\\n }\\n}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map$1||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"stopAll() {\\n const _ = this;\\n for (const entry of _._map.values()) {\\n clearTimeout(entry.handle);\\n }\\n _._map.clear();\\n }\",\n \"function mapCacheClear() {\\n\\t\\t this.size = 0;\\n\\t\\t this.__data__ = {\\n\\t\\t 'hash': new Hash,\\n\\t\\t 'map': new (Map || ListCache),\\n\\t\\t 'string': new Hash\\n\\t\\t };\\n\\t\\t}\",\n \"function mapCacheClear() {\\n\\t\\t this.__data__ = {\\n\\t\\t 'hash': new Hash,\\n\\t\\t 'map': new (Map || ListCache),\\n\\t\\t 'string': new Hash\\n\\t\\t };\\n\\t\\t}\",\n \"function mapCacheClear() {\\n\\t\\t this.__data__ = {\\n\\t\\t 'hash': new Hash,\\n\\t\\t 'map': new (Map || ListCache),\\n\\t\\t 'string': new Hash\\n\\t\\t };\\n\\t\\t}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map$1 || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map$1 || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash(),\\n 'map': new (_Map || _ListCache)(),\\n 'string': new _Hash()\\n };\\n }\",\n \"clearance () {\\n mapDoS.forEach((val, key, map) => {\\n if (val.at < moment().utc().subtract(val.interval, 'seconds')) {\\n map.delete(key)\\n }\\n })\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash.default(),\\n 'map': new (_Map.default || _ListCache.default)(),\\n 'string': new _Hash.default()\\n };\\n }\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash(),\\n\\t 'map': new (_Map || _ListCache)(),\\n\\t 'string': new _Hash()\\n\\t };\\n\\t}\",\n \"function clearEntry () {\\n\\n nextValue = null;\\n}\",\n \"remove(key) {\\n let index = this._hash(key);\\n if (this.keyMap[index] && this.keyMap[index].length) {\\n this.keyMap[index] = undefined;\\n this.size--;\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function clearAllMarkers() {\\n setMarkersOnMap(null);\\n}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"clear () {\\n if (this.doc !== null) {\\n transact(this.doc, transaction => {\\n this.forEach(function (_value, key, map) {\\n typeMapDelete(transaction, map, key)\\n })\\n })\\n } else {\\n /** @type {Map<string, any>} */ (this._prelimContent).clear()\\n }\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n\\tthis.size = 0;\\n\\tthis.__data__ = {\\n\\t\\thash: new _Hash(),\\n\\t\\tmap: new ( _Map || _ListCache )(),\\n\\t\\tstring: new _Hash(),\\n\\t};\\n}\",\n \"function mapCacheClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash(),\\n\\t 'map': new (Map || ListCache)(),\\n\\t 'string': new Hash()\\n\\t };\\n\\t }\",\n \"function clearAllMarkers() {\\n setAllMap(null);\\n}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7590112","0.70694387","0.6735414","0.6652174","0.6530006","0.6267597","0.62582785","0.62582785","0.62582785","0.617115","0.617115","0.617115","0.6166302","0.61519635","0.614778","0.614778","0.614778","0.614778","0.614778","0.614778","0.614778","0.614778","0.614778","0.6128783","0.6107819","0.61020905","0.61020905","0.61020905","0.61020905","0.61020905","0.61020905","0.60481024","0.60264283","0.60264283","0.60264283","0.60264283","0.60264283","0.60264283","0.60264283","0.6025953","0.6008959","0.60038495","0.5983478","0.59401333","0.5922161","0.5904722","0.5903561","0.58624434","0.58589303","0.5847903","0.5847903","0.5847903","0.5847903","0.58467245","0.5841128","0.58262974","0.5723219","0.5723219","0.5723219","0.5723219","0.5723219","0.5723219","0.5723219","0.5723219","0.5723219","0.57226574","0.5719132","0.5708688","0.5708688","0.57040244","0.56992704","0.56992704","0.5689804","0.5685224","0.5684027","0.5682696","0.56815845","0.56811434","0.5673945","0.5673945","0.5673945","0.5673945","0.5673529","0.5673529","0.5672286","0.5672286","0.5672286","0.5660965","0.5659265","0.5659265","0.5655427","0.5655427","0.5655427","0.56540984","0.5646518","0.56439686","0.5634391","0.5630649","0.5630361","0.5630361","0.5630361"],"string":"[\n \"0.7590112\",\n \"0.70694387\",\n \"0.6735414\",\n \"0.6652174\",\n \"0.6530006\",\n \"0.6267597\",\n \"0.62582785\",\n \"0.62582785\",\n \"0.62582785\",\n \"0.617115\",\n \"0.617115\",\n \"0.617115\",\n \"0.6166302\",\n \"0.61519635\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.614778\",\n \"0.6128783\",\n \"0.6107819\",\n \"0.61020905\",\n \"0.61020905\",\n \"0.61020905\",\n \"0.61020905\",\n \"0.61020905\",\n \"0.61020905\",\n \"0.60481024\",\n \"0.60264283\",\n \"0.60264283\",\n \"0.60264283\",\n \"0.60264283\",\n \"0.60264283\",\n \"0.60264283\",\n \"0.60264283\",\n \"0.6025953\",\n \"0.6008959\",\n \"0.60038495\",\n \"0.5983478\",\n \"0.59401333\",\n \"0.5922161\",\n \"0.5904722\",\n \"0.5903561\",\n \"0.58624434\",\n \"0.58589303\",\n \"0.5847903\",\n \"0.5847903\",\n \"0.5847903\",\n \"0.5847903\",\n \"0.58467245\",\n \"0.5841128\",\n \"0.58262974\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.5723219\",\n \"0.57226574\",\n \"0.5719132\",\n \"0.5708688\",\n \"0.5708688\",\n \"0.57040244\",\n \"0.56992704\",\n \"0.56992704\",\n \"0.5689804\",\n \"0.5685224\",\n \"0.5684027\",\n \"0.5682696\",\n \"0.56815845\",\n \"0.56811434\",\n \"0.5673945\",\n \"0.5673945\",\n \"0.5673945\",\n \"0.5673945\",\n \"0.5673529\",\n \"0.5673529\",\n \"0.5672286\",\n \"0.5672286\",\n \"0.5672286\",\n \"0.5660965\",\n \"0.5659265\",\n \"0.5659265\",\n \"0.5655427\",\n \"0.5655427\",\n \"0.5655427\",\n \"0.56540984\",\n \"0.5646518\",\n \"0.56439686\",\n \"0.5634391\",\n \"0.5630649\",\n \"0.5630361\",\n \"0.5630361\",\n \"0.5630361\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74177,"cells":{"query":{"kind":"string","value":"Implements a subset of Node's stream.Transform in a crossplatform manner."},"document":{"kind":"string","value":"function Transform() {}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["static transform() {}","get transform() {}","get transform() {}","get transform() {}","get transform() {}","function pipeTransforms (stream, transforms) {\n var head, rest;\n if (!Array.isArray(transforms) || !transforms.length) {\n return stream;\n }\n head = transforms[0];\n rest = transforms.slice(1);\n // recursively pipe to remaining Transforms\n return pipeTransforms(stream.pipe(head), rest);\n}","function Transform$7() {}","set transform(value) {}","set transform(value) {}","set transform(value) {}","set transform(value) {}","transform(a, b, c, d, e, f) {\n this.ctx.transform(a, b, c, d, e, f);\n }","runTransformation(input) {\n return this.transform(input)\n }","function transform(stream, transformer, reducer) {\n const target = newWriteableStream(reducer);\n stream.on('data', data => target.write(transformer.data(data)));\n stream.on('end', () => target.end());\n stream.on('error', error => target.error(transformer.error ? transformer.error(error) : error));\n return target;\n }","transform() {\n throw new Error('Missing _transform_ method on extractor');\n }","function transform(stream, transformer, reducer) {\n var target = newWriteableStream(reducer);\n stream.on('data', function (data) { return target.write(transformer.data(data)); });\n stream.on('end', function () { return target.end(); });\n stream.on('error', function (error) { return target.error(transformer.error ? transformer.error(error) : error); });\n return target;\n}","function test_transform() {\n var f = function(x) {\n return Number($(x)) + 1;\n };\n\n\n var plan1 = tasks(\"ns:identity\").plan({\n x: [0, 1]\n });\n\n var plan2 = tasks(\"ns:mult\").plan({\n x: transform(f, plan1),\n y: [3, 5]\n });\n\n // Optimize and run\n // Should be an array of XML values 3, 6, 5, 10\n var result = plan2.run();\n check_array(result, [3, 5, 6, 10]);\n}","getTransform(){return this.__transform}","function _transform(node, callback) {\n return node.map(function (child, path, parent) {\n var replacement = callback(child, path, parent);\n return _transform(replacement, callback);\n });\n }","function _transform (node, callback) {\n return node.map(function(child, path, parent) {\n var replacement = callback(child, path, parent);\n return _transform(replacement, callback);\n });\n }","function _transform (node, callback) {\n return node.map(function(child, path, parent) {\n var replacement = callback(child, path, parent);\n return _transform(replacement, callback);\n });\n }","function compress() {\n // Create a native streaming gzip compressing with Neon\n const compressor = compressNew();\n\n return new Transform({\n // Compress a chunk of data by delegating to `compressChunk`\n transform(chunk, encoding, callback) {\n compressChunk(compressor, encoding, chunk)\n .then(data => callback(null, data))\n .catch(callback);\n },\n\n // Complete the compression by delegating to `compressFinish`\n flush(callback) {\n compressFinish(compressor)\n .then(data => callback(null, data))\n .catch(callback);\n }\n });\n}","function LGraphTransform()\r\n\t{\r\n\t\tthis.properties = {node_id:\"\"};\r\n\t\tif(LGraphSceneNode._current_node_id)\r\n\t\t\tthis.properties.node_id = LGraphSceneNode._current_node_id;\r\n\t\tthis.addInput(\"Transform\",\"Transform\");\r\n\t\tthis.addOutput(\"Position\",\"vec3\");\r\n\t}","function map(stream, transform) {\n var q = new TupleQueue(function() {\n return q.emitData(transform.apply(null, arguments));\n });\n stream.pipe(q);\n return q;\n}","function transform( node, transformations ){\n\t\tfor( var key in node.attrs )\n\t\t\tif( transformations.hasOwnProperty( node.attrs[ key ] ) ){\n\t\t\t\tvar transformed = transformations[ key ](\n\t\t\t\t\tnode,\n\t\t\t\t\tnode.attrs[ key ],\n\t\t\t\t\tnode.attrs\n\t\t\t\t)\n\n\t\t\t\tif( transformed !== undefined )\n\t\t\t\t\tnode = transformed\n\t\t\t}\n\n\t\treturn node\n\t}","function Transformation() {\r\n\t\tvar fn = {\r\n\t\t\ttranslate: new TransformFunction('translate({x}px,{y}px)', {x:0, y:0}),\r\n\t\t\tscale: new TransformFunction('scale({x},{y})', {x:1, y:1}),\r\n\t\t\trotate: new TransformFunction('rotate({deg}deg)', {deg:0})\r\n\t\t};\r\n\t\t\r\n\t\tif (supports3d) {\r\n\t\t\t// Use 3D transforms for better performance\r\n\t\t\tfn.translate = new TransformFunction('translate3d({x}px,{y}px,0px)', {x:0, y:0});\r\n\t\t\tfn.scale = new TransformFunction('scale3d({x},{y},1)', {x:1, y:1});\r\n\t\t}\t\r\n\t\t\r\n\t\tvar commands = {\r\n\t\t\trotate: function(deg) {\r\n\t\t\t\tfn.rotate.deg = deg;\r\n\t\t\t},\r\n\t\t\trotateBy: function(deg) {\r\n\t\t\t\tfn.rotate.deg += deg;\r\n\t\t\t},\r\n\t\t\tscale: function(s) {\r\n\t\t\t\tif (typeof s == 'number') {\r\n\t\t\t\t\ts = {x: s, y: s};\r\n\t\t\t\t}\r\n\t\t\t\tfn.scale.x = s.x;\r\n\t\t\t\tfn.scale.y = s.y;\r\n\t\t\t},\r\n\t\t\tscaleBy: function(s) {\r\n\t\t\t\tif (typeof s == 'number') {\r\n\t\t\t\t\ts = {x: s, y: s};\r\n\t\t\t\t}\r\n\t\t\t\tfn.scale.x *= s.x;\r\n\t\t\t\tfn.scale.y *= s.y;\r\n\t\t\t},\r\n\t\t\ttranslate: function(s) {\r\n\t\t\t\tvar t = fn.translate;\r\n\t\t\t\tif (!s) {\r\n\t\t\t\t\ts = {x: 0, y: 0};\r\n\t\t\t\t}\r\n\t\t\t\tt.x = (s.x !== undefined) ? parseInt(s.x, 10) : t.x;\r\n\t\t\t\tt.y = (s.y !== undefined) ? parseInt(s.y, 10) : t.y;\r\n\t\t\t},\r\n\t\t\ttranslateBy: function(s) {\r\n\t\t\t\tvar t = fn.translate;\r\n\t\t\t\tt.x += parseInt(s.x, 10) || 0;\r\n\t\t\t\tt.y += parseInt(s.y, 10) || 0;\r\n\t\t\t}\r\n\t\t};\r\n\t\tthis.fn = fn;\r\n\t\tthis.exec = function(cmd) {\r\n\t\t\tfor (var n in cmd) {\r\n\t\t\t\tif (commands[n]) {\r\n\t\t\t\t\tcommands[n](cmd[n]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t};\r\n\t\tthis.reset = function() {\r\n\t\t\t$.each(fn, function() {\r\n\t\t\t\tthis.reset();\r\n\t\t\t});\r\n\t\t};\r\n\t\tthis.format = function() {\r\n\t\t\tvar s = '';\r\n\t\t\t$.each(fn, function(k, v) {\r\n\t\t\t\ts += v.format() + ' ';\r\n\t\t\t});\r\n\t\t\treturn s;\r\n\t\t};\r\n\t}","map(transform) {\n assertUninitialized(this);\n const oldTransform = this[kTransform]; // TODO(NODE-3283): Improve transform typing\n if (oldTransform) {\n this[kTransform] = doc => {\n return transform(oldTransform(doc));\n };\n }\n else {\n this[kTransform] = transform;\n }\n return this;\n }","function LogicNodeTransformComponent() {\n\t\tLogicNode.call(this);\n\t\tthis.logicInterface = LogicNodeTransformComponent.logicInterface;\n\t\tthis.type = 'TransformComponent';\n\t}","transform(point, op) {\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n return Object(__WEBPACK_IMPORTED_MODULE_1_immer__[\"d\" /* produce */])(point, p => {\n var {\n affinity = 'forward'\n } = options;\n var {\n path,\n offset\n } = p;\n\n switch (op.type) {\n case 'insert_node':\n case 'move_node':\n {\n p.path = Path.transform(path, op, options);\n break;\n }\n\n case 'insert_text':\n {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset += op.text.length;\n }\n\n break;\n }\n\n case 'merge_node':\n {\n if (Path.equals(op.path, path)) {\n p.offset += op.position;\n }\n\n p.path = Path.transform(path, op, options);\n break;\n }\n\n case 'remove_text':\n {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset -= Math.min(offset - op.offset, op.text.length);\n }\n\n break;\n }\n\n case 'remove_node':\n {\n if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\n return null;\n }\n\n p.path = Path.transform(path, op, options);\n break;\n }\n\n case 'split_node':\n {\n if (Path.equals(op.path, path)) {\n if (op.position === offset && affinity == null) {\n return null;\n } else if (op.position < offset || op.position === offset && affinity === 'forward') {\n p.offset -= op.position;\n p.path = Path.transform(path, op, _objectSpread$2({}, options, {\n affinity: 'forward'\n }));\n }\n } else {\n p.path = Path.transform(path, op, options);\n }\n\n break;\n }\n }\n });\n }","function makeTransform(registry) {\n\n return function(filename, options) {\n options = options || {};\n\n var registry = registry || registryFromOptions(options);\n\n return aggregate(function(src) {\n try {\n src = jstransform(src);\n } catch(err) {\n return this.emit('error', err);\n }\n this.queue(src);\n this.queue(null);\n });\n }\n}","passthrough() {\n const me = this;\n // A chunk counter for debugging\n let _scan_complete = false;\n let _av_waiting = null;\n let _av_scan_time = false;\n\n // DRY method for clearing the interval and counter related to scan times\n const clear_scan_benchmark = () => {\n if (_av_waiting) clearInterval(_av_waiting);\n _av_waiting = null;\n _av_scan_time = 0;\n };\n\n // Return a Transform stream so this can act as a \"man-in-the-middle\"\n // for the streaming pipeline.\n // Ex. upload_stream.pipe(<this_transform_stream>).pipe(destination_stream)\n return new Transform({\n // This should be fired on each chunk received\n async transform(chunk, encoding, cb) {\n\n // DRY method for handling each chunk as it comes in\n const do_transform = () => {\n // Write data to our fork stream. If it fails,\n // emit a 'drain' event\n if (!this._fork_stream.write(chunk)) {\n this._fork_stream.once('drain', () => {\n cb(null, chunk);\n });\n } else {\n // Push data back out to whatever is listening (if anything)\n // and let Node know we're ready for more data\n cb(null, chunk);\n }\n };\n\n // DRY method for handling errors when the arise from the\n // ClamAV Socket connection\n const handle_error = (err, is_infected=null, result=null) => {\n this._fork_stream.unpipe();\n this._fork_stream.destroy();\n this._clamav_transform.destroy();\n clear_scan_benchmark();\n\n // Finding an infected file isn't really an error...\n if (is_infected === true) {\n if (_scan_complete === false) {\n _scan_complete = true;\n this.emit('scan-complete', result);\n }\n this.emit('stream-infected', result); // just another way to catch an infected stream\n } else {\n this.emit('error', err);\n }\n };\n\n // If we haven't initialized a socket connection to ClamAV yet,\n // now is the time...\n if (!this._clamav_socket) {\n // We're using a PassThrough stream as a middle man to fork the input\n // into two paths... (1) ClamAV and (2) The final destination.\n this._fork_stream = new PassThrough();\n // Instantiate our custom Transform stream that coddles\n // chunks into the correct format for the ClamAV socket.\n this._clamav_transform = new NodeClamTransform({}, me.settings.debug_mode);\n // Setup an array to collect the responses from ClamAV\n this._clamav_response_chunks = [];\n\n try {\n // Get a connection to the ClamAV Socket\n this._clamav_socket = await me._init_socket('passthrough');\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV Socket Initialized...`);\n\n // Setup a pipeline that will pass chunks through our custom Tranform and on to ClamAV\n this._fork_stream.pipe(this._clamav_transform).pipe(this._clamav_socket);\n\n // When the CLamAV socket connection is closed (could be after 'end' or because of an error)...\n this._clamav_socket.on('close', hadError => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has been closed! Because of Error:`, hadError);\n })\n // When the ClamAV socket connection ends (receives chunk)\n .on('end', () => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has received the last chunk!`);\n // Process the collected chunks\n const response = Buffer.concat(this._clamav_response_chunks);\n const result = me._process_result(response.toString('utf8'), null);\n this._clamav_response_chunks = [];\n if (me.settings.debug_mode) {\n console.log(`${me.debug_label}: Result of scan:`, result);\n console.log(`${me.debug_label}: It took ${_av_scan_time} seconds to scan the file(s).`);\n clear_scan_benchmark();\n }\n\n // NOTE: \"scan-complete\" could be called by the `handle_error` method.\n // We don't want to to double-emit this message.\n if (_scan_complete === false) {\n _scan_complete = true;\n this.emit('scan-complete', result);\n }\n })\n // If connection timesout.\n .on('timeout', () => {\n this.emit('timeout', new Error('Connection to host/socket has timed out'));\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connection to host/socket has timed out`);\n })\n // When the ClamAV socket is ready to receive packets (this will probably never fire here)\n .on('ready', () => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket ready to receive`);\n })\n // When we are officially connected to the ClamAV socket (probably will never fire here)\n .on('connect', () => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connected to ClamAV socket`);\n })\n // If an error is emitted from the ClamAV socket\n .on('error', err => {\n console.error(`${me.debug_label}: Error emitted from ClamAV socket: `, err);\n handle_error(err);\n })\n // If ClamAV is sending stuff to us (ie, an \"OK\", \"Virus FOUND\", or \"ERROR\")\n .on('data', cv_chunk => {\n // Push this chunk to our results collection array\n this._clamav_response_chunks.push(cv_chunk);\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Got result!`, cv_chunk.toString());\n\n // Parse what we've gotten back from ClamAV so far...\n const response = Buffer.concat(this._clamav_response_chunks);\n const result = me._process_result(response.toString(), null);\n\n // If there's an error supplied or if we detect a virus, stop stream immediately.\n if (result instanceof NodeClamError || (typeof result === 'object' && 'is_infected' in result && result.is_infected === true)) {\n // If a virus is detected...\n if (typeof result === 'object' && 'is_infected' in result && result.is_infected === true) {\n // handle_error(new NodeClamError(result, `Virus(es) found! ${'viruses' in result && Array.isArray(result.viruses) ? `Suspects: ${result.viruses.join(', ')}` : ''}`));\n handle_error(null, true, result);\n }\n // If any other kind of error is detected...\n else {\n handle_error(result);\n }\n }\n // For debugging purposes, spit out what was processed (if anything).\n else {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Processed Result: `, result, response.toString());\n }\n });\n\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing initial transform!`);\n // Handle the chunk\n do_transform();\n } catch (err) {\n // If there's an issue connecting to the ClamAV socket, this is where that's handled\n if (me.settings.debug_mode) console.error(`${me.debug_label}: Error initiating socket to ClamAV: `, err);\n handle_error(err);\n }\n } else {\n //if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing transform: ${++counter}`);\n // Handle the chunk\n do_transform();\n }\n },\n\n // This is what is called when the input stream has dried up\n flush(cb) {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Done with the full pipeline.`);\n\n // Keep track of how long it's taking to scan a file..\n _av_waiting = null;\n _av_scan_time = 0;\n if (me.settings.debug_mode) {\n _av_waiting = setInterval(() => {\n _av_scan_time += 1;\n if (_av_scan_time % 5 === 0) console.log(`${me.debug_label}: ClamAV has been scanning for ${_av_scan_time} seconds...`);\n }, 1000);\n }\n\n // TODO: Investigate why this needs to be done in order\n // for the ClamAV socket to be closed (why NodeClamTransform's\n // `_flush` method isn't getting called)\n // If the incoming stream is empty, transform() won't have been called, so we won't\n // have a socket here.\n if (this._clamav_socket && this._clamav_socket.writable === true) {\n const size = Buffer.alloc(4);\n size.writeInt32BE(0, 0);\n this._clamav_socket.write(size, cb);\n }\n }\n });\n }","function SampleTransform (opts) {\n if (!(this instanceof SampleTransform)) return new SampleTransform(opts);\n\n opts = opts || {};\n \n Transform.call(this, opts);\n}","transform(ref, op) {\n var {\n current,\n affinity\n } = ref;\n\n if (current == null) {\n return;\n }\n\n var point = Point.transform(current, op, {\n affinity\n });\n ref.current = point;\n\n if (point == null) {\n ref.unref();\n }\n }","transform(ref, op) {\n var {\n current,\n affinity\n } = ref;\n\n if (current == null) {\n return;\n }\n\n var point = Point.transform(current, op, {\n affinity\n });\n ref.current = point;\n\n if (point == null) {\n ref.unref();\n }\n }","function TransformFn( fn , xAdd = 0 , xMul = 1 , yAdd = 0 , yMul = 1 ) {\n\tthis.fn = fn ;\n\tthis.xAdd = xAdd ;\n\tthis.xMul = xMul ;\n\tthis.yAdd = yAdd ;\n\tthis.yMul = yMul ;\n}","transformer (source, name, filename, options) {\n return (size) => {\n let readStream;\n readStream = fs.createReadStream(filename);\n this.state(name, { sync: true }) // update header\n// // Since the function is not immediately invoked,\n// // the source stream (chain file) may have already closed\n// // by the time this function is called. \n// // Therefore check if it's already closed\n// // If already closed, create a normal stream\n// // If stil open (still writing, in case of a large file), create a tailstream\n// if (!source || source.writableFinished) {\n// readStream = fs.createReadStream(filename);\n// this.state(name, { sync: true }) // update header\n// } else {\n// readStream = ts.createReadStream(filename, { waitForCreate: true })\n// source.on(\"close\", () => {\n// this.state(name, { sync: true }) // update header\n// readStream.on(\"eof\", () => { readStream.end() }) // close tail stream\n// })\n// }\n let stx = readStream.pipe(es.split()).pipe(es.map((item, cb) => {\n this.parse(item, options).then((data) => {\n cb(null, data);\n })\n }))\n if (this.filter) stx = stx.pipe(es.filterSync(this.filter))\n if (this.map) stx = stx.pipe(es.mapSync((e) => {\n let mapped = this.map(e)\n let res = Object.assign({\"$\": mapped}, {tx: e.tx})\n if (e.blk) res.blk = e.blk\n return res\n }))\n // If 'size' is specified, create a batch stream\n if (size) {\n let batch = new BatchStream({ size : size });\n stx = stx.pipe(batch)\n }\n return stx;\n }\n }","function Transform() {\n\t\t\t\t this.reset();\n\t\t\t\t}","function ShimStream(options) {\n // be lenient with 'new' keyword\n if (!(this instanceof ShimStream)) {\n return new ShimStream(options);\n }\n\n // super\n Transform.call(this, options);\n\n // internal state\n this._onFirst = true;\n this._prefixString = prefixTemplate(); // TODO: dependencies support\n this._suffixString = suffixTemplate();\n}","function Transform(transformFn, options) {\n return function (target, key) {\n var metadata = new TransformMetadata_1.TransformMetadata(target.constructor, key, transformFn, options);\n storage_2.defaultMetadataStorage.addTransformMetadata(metadata);\n };\n }","_updateTransform() {\n this._applyTransform(this._transform)\n this.redraw()\n if (this.callbacks.didUpdateTransform) {\n this.callbacks.didUpdateTransform(this._transform)\n }\n }","async transform(chunk, encoding, cb) {\n\n // DRY method for handling each chunk as it comes in\n const do_transform = () => {\n // Write data to our fork stream. If it fails,\n // emit a 'drain' event\n if (!this._fork_stream.write(chunk)) {\n this._fork_stream.once('drain', () => {\n cb(null, chunk);\n });\n } else {\n // Push data back out to whatever is listening (if anything)\n // and let Node know we're ready for more data\n cb(null, chunk);\n }\n };\n\n // DRY method for handling errors when the arise from the\n // ClamAV Socket connection\n const handle_error = (err, is_infected=null, result=null) => {\n this._fork_stream.unpipe();\n this._fork_stream.destroy();\n this._clamav_transform.destroy();\n clear_scan_benchmark();\n\n // Finding an infected file isn't really an error...\n if (is_infected === true) {\n if (_scan_complete === false) {\n _scan_complete = true;\n this.emit('scan-complete', result);\n }\n this.emit('stream-infected', result); // just another way to catch an infected stream\n } else {\n this.emit('error', err);\n }\n };\n\n // If we haven't initialized a socket connection to ClamAV yet,\n // now is the time...\n if (!this._clamav_socket) {\n // We're using a PassThrough stream as a middle man to fork the input\n // into two paths... (1) ClamAV and (2) The final destination.\n this._fork_stream = new PassThrough();\n // Instantiate our custom Transform stream that coddles\n // chunks into the correct format for the ClamAV socket.\n this._clamav_transform = new NodeClamTransform({}, me.settings.debug_mode);\n // Setup an array to collect the responses from ClamAV\n this._clamav_response_chunks = [];\n\n try {\n // Get a connection to the ClamAV Socket\n this._clamav_socket = await me._init_socket('passthrough');\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV Socket Initialized...`);\n\n // Setup a pipeline that will pass chunks through our custom Tranform and on to ClamAV\n this._fork_stream.pipe(this._clamav_transform).pipe(this._clamav_socket);\n\n // When the CLamAV socket connection is closed (could be after 'end' or because of an error)...\n this._clamav_socket.on('close', hadError => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has been closed! Because of Error:`, hadError);\n })\n // When the ClamAV socket connection ends (receives chunk)\n .on('end', () => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has received the last chunk!`);\n // Process the collected chunks\n const response = Buffer.concat(this._clamav_response_chunks);\n const result = me._process_result(response.toString('utf8'), null);\n this._clamav_response_chunks = [];\n if (me.settings.debug_mode) {\n console.log(`${me.debug_label}: Result of scan:`, result);\n console.log(`${me.debug_label}: It took ${_av_scan_time} seconds to scan the file(s).`);\n clear_scan_benchmark();\n }\n\n // NOTE: \"scan-complete\" could be called by the `handle_error` method.\n // We don't want to to double-emit this message.\n if (_scan_complete === false) {\n _scan_complete = true;\n this.emit('scan-complete', result);\n }\n })\n // If connection timesout.\n .on('timeout', () => {\n this.emit('timeout', new Error('Connection to host/socket has timed out'));\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connection to host/socket has timed out`);\n })\n // When the ClamAV socket is ready to receive packets (this will probably never fire here)\n .on('ready', () => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket ready to receive`);\n })\n // When we are officially connected to the ClamAV socket (probably will never fire here)\n .on('connect', () => {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connected to ClamAV socket`);\n })\n // If an error is emitted from the ClamAV socket\n .on('error', err => {\n console.error(`${me.debug_label}: Error emitted from ClamAV socket: `, err);\n handle_error(err);\n })\n // If ClamAV is sending stuff to us (ie, an \"OK\", \"Virus FOUND\", or \"ERROR\")\n .on('data', cv_chunk => {\n // Push this chunk to our results collection array\n this._clamav_response_chunks.push(cv_chunk);\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Got result!`, cv_chunk.toString());\n\n // Parse what we've gotten back from ClamAV so far...\n const response = Buffer.concat(this._clamav_response_chunks);\n const result = me._process_result(response.toString(), null);\n\n // If there's an error supplied or if we detect a virus, stop stream immediately.\n if (result instanceof NodeClamError || (typeof result === 'object' && 'is_infected' in result && result.is_infected === true)) {\n // If a virus is detected...\n if (typeof result === 'object' && 'is_infected' in result && result.is_infected === true) {\n // handle_error(new NodeClamError(result, `Virus(es) found! ${'viruses' in result && Array.isArray(result.viruses) ? `Suspects: ${result.viruses.join(', ')}` : ''}`));\n handle_error(null, true, result);\n }\n // If any other kind of error is detected...\n else {\n handle_error(result);\n }\n }\n // For debugging purposes, spit out what was processed (if anything).\n else {\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Processed Result: `, result, response.toString());\n }\n });\n\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing initial transform!`);\n // Handle the chunk\n do_transform();\n } catch (err) {\n // If there's an issue connecting to the ClamAV socket, this is where that's handled\n if (me.settings.debug_mode) console.error(`${me.debug_label}: Error initiating socket to ClamAV: `, err);\n handle_error(err);\n }\n } else {\n //if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing transform: ${++counter}`);\n // Handle the chunk\n do_transform();\n }\n }","transform(o) {\n // Check if o is a matrix and then left multiply it directly\n if (Matrix_Matrix.isMatrixLike(o)) {\n var matrix = new Matrix_Matrix(o);\n return matrix.multiplyO(this);\n } // Get the proposed transformations and the current transformations\n\n\n var t = Matrix_Matrix.formatTransforms(o);\n var current = this;\n let {\n x: ox,\n y: oy\n } = new Point_Point(t.ox, t.oy).transform(current); // Construct the resulting matrix\n\n var transformer = new Matrix_Matrix().translateO(t.rx, t.ry).lmultiplyO(current).translateO(-ox, -oy).scaleO(t.scaleX, t.scaleY).skewO(t.skewX, t.skewY).shearO(t.shear).rotateO(t.theta).translateO(ox, oy); // If we want the origin at a particular place, we force it there\n\n if (isFinite(t.px) || isFinite(t.py)) {\n const origin = new Point_Point(ox, oy).transform(transformer); // TODO: Replace t.px with isFinite(t.px)\n\n const dx = t.px ? t.px - origin.x : 0;\n const dy = t.py ? t.py - origin.y : 0;\n transformer.translateO(dx, dy);\n } // Translate now after positioning\n\n\n transformer.translateO(t.tx, t.ty);\n return transformer;\n }","transform()\n {\n super.transform();\n \n spriteStrategyManager.transform();\n }","transformVertices(transformFunction) {\n this.checkVertices();\n var vert = this.verts;\n\n for (let i = 0; i < vert.length; i += 3) {\n let transform = transformFunction(vert[i], vert[i + 1], vert[i + 2]);\n if (transform) {\n vert[i] += transform[0];\n vert[i + 1] += transform[1];\n vert[i + 2] += transform[2];\n }\n }\n this.verts = vert;\n }","updateLocalTransform()\n {\n // empty\n }","transform(ref, op) {\n var {\n current,\n affinity\n } = ref;\n\n if (current == null) {\n return;\n }\n\n var path = Path.transform(current, op, {\n affinity\n });\n ref.current = path;\n\n if (path == null) {\n ref.unref();\n }\n }","transform(ref, op) {\n var {\n current,\n affinity\n } = ref;\n\n if (current == null) {\n return;\n }\n\n var path = Path.transform(current, op, {\n affinity\n });\n ref.current = path;\n\n if (path == null) {\n ref.unref();\n }\n }","function LinkTransform(opts, readStream, writeStream, timeout) {\n if (!(this instanceof LinkTransform)) { return new LinkTransform(opts, readStream, writeStream, timeout); }\n this._opts = opts;\n this._readStream = readStream;\n this._writeStream = writeStream;\n\n // Create the protocol wrapper streams\n var decodeStream = metaWrapStream.decodeMetaWrapStream();\n readStream.pipe(decodeStream);\n\n var encodeStream = metaWrapStream.encodeMetaWrapStream();\n encodeStream.pipe(writeStream);\n\n // Wrap the streams in heartbeat.\n if (timeout) {\n timeout = Math.floor(timeout / 2);\n }\n\n var pair = heartbeatStream(timeout);\n var heartbeatSend = pair.encode;\n var heartbeatRead = pair.decode;\n\n heartbeatSend.pipe(encodeStream);\n decodeStream.pipe(heartbeatRead);\n\n // Wrap with a link stream.\n var stream = this._linkStream = linkStream({\n readTransport: heartbeatRead,\n sendTransport: heartbeatSend\n }, opts);\n\n // If the heartbeat timer detects an issue, end the transport.\n heartbeatSend.on('heartbeat-timeout', function() {\n stream.end();\n });\n}","function TransformBase()\n{\n /**\n * The global matrix transform. It can be swapped temporarily by some functions like getLocalBounds()\n *\n * @member {PIXI.Matrix}\n */\n this.worldTransform = new math.Matrix();\n /**\n * The local matrix transform\n * \n * @member {PIXI.Matrix}\n */\n this.localTransform = new math.Matrix();\n\n this._worldID = 0;\n}","function transform (p, fn) {\n return () => {\n const result = p()\n return result === null ? null : fn(result)\n }\n }","function forEachTransform(args, math, scope) {\n var x, callback;\n\n if (args[0]) {\n x = args[0].compile().evaluate(scope);\n }\n\n if (args[1]) {\n if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\n // a function pointer, like forEach([3, -2, 5], myTestFunction)\n callback = args[1].compile().evaluate(scope);\n } else {\n // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )\n callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\n }\n }\n\n return _forEach(x, callback);\n }","transform(path, operation) {\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n return Object(__WEBPACK_IMPORTED_MODULE_1_immer__[\"d\" /* produce */])(path, p => {\n var {\n affinity = 'forward'\n } = options; // PERF: Exit early if the operation is guaranteed not to have an effect.\n\n if (path.length === 0) {\n return;\n }\n\n switch (operation.type) {\n case 'insert_node':\n {\n var {\n path: op\n } = operation;\n\n if (Path.equals(op, p) || Path.endsBefore(op, p) || Path.isAncestor(op, p)) {\n p[op.length - 1] += 1;\n }\n\n break;\n }\n\n case 'remove_node':\n {\n var {\n path: _op\n } = operation;\n\n if (Path.equals(_op, p) || Path.isAncestor(_op, p)) {\n return null;\n } else if (Path.endsBefore(_op, p)) {\n p[_op.length - 1] -= 1;\n }\n\n break;\n }\n\n case 'merge_node':\n {\n var {\n path: _op2,\n position\n } = operation;\n\n if (Path.equals(_op2, p) || Path.endsBefore(_op2, p)) {\n p[_op2.length - 1] -= 1;\n } else if (Path.isAncestor(_op2, p)) {\n p[_op2.length - 1] -= 1;\n p[_op2.length] += position;\n }\n\n break;\n }\n\n case 'split_node':\n {\n var {\n path: _op3,\n position: _position\n } = operation;\n\n if (Path.equals(_op3, p)) {\n if (affinity === 'forward') {\n p[p.length - 1] += 1;\n } else if (affinity === 'backward') ; else {\n return null;\n }\n } else if (Path.endsBefore(_op3, p)) {\n p[_op3.length - 1] += 1;\n } else if (Path.isAncestor(_op3, p) && path[_op3.length] >= _position) {\n p[_op3.length - 1] += 1;\n p[_op3.length] -= _position;\n }\n\n break;\n }\n\n case 'move_node':\n {\n var {\n path: _op4,\n newPath: onp\n } = operation; // If the old and new path are the same, it's a no-op.\n\n if (Path.equals(_op4, onp)) {\n return;\n }\n\n if (Path.isAncestor(_op4, p) || Path.equals(_op4, p)) {\n var copy = onp.slice();\n\n if (Path.endsBefore(_op4, onp) && _op4.length < onp.length) {\n copy[_op4.length - 1] -= 1;\n }\n\n return copy.concat(p.slice(_op4.length));\n } else if (Path.isSibling(_op4, onp) && (Path.isAncestor(onp, p) || Path.equals(onp, p))) {\n if (Path.endsBefore(_op4, p)) {\n p[_op4.length - 1] -= 1;\n } else {\n p[_op4.length - 1] += 1;\n }\n } else if (Path.endsBefore(onp, p) || Path.equals(onp, p) || Path.isAncestor(onp, p)) {\n if (Path.endsBefore(_op4, p)) {\n p[_op4.length - 1] -= 1;\n }\n\n p[onp.length - 1] += 1;\n } else if (Path.endsBefore(_op4, p)) {\n if (Path.equals(onp, p)) {\n p[onp.length - 1] += 1;\n }\n\n p[_op4.length - 1] -= 1;\n }\n\n break;\n }\n }\n });\n }","function perform_transform(inputAndParameters, payload, transNode, debug) {\n if (debug == undefined) debug = false;\n var output = [];\n var outputarray = [];\n\n\tvar address = inputAndParameters.address;\n\tvar parameters = inputAndParameters.parameters;\n\t\n if(transNode.type == \"JAVASCRIPT\") {\n\t\tif(debug) console.log('Performing JAVASCRIPT on transformer ' + transNode.id);\n\t\t//This eval needs to be cleaned up/secured so code can't be run on the server.\n\t\teval(transNode.process);\t\n\t\t\n\t} else if(transNode.type == \"PASSTHROUGH\"){\n\t\tif(debug) console.log('Performing PASSTHROUGH on transformer ' + transNode.id);\n\t\t//need to go over each output defined in the array as we don't specically know which output is a passthrough.\n\t\tfor(outputID in transNode.output){\n\t\t\toutput[transNode.output[outputID]] = payload;\n\t\t}\n\t}\n\treturn output;\n}","function transform() { \n return d3.geoTransform({\n point: function(x, y) {\n if(x && y) {\n var point = map.latLngToLayerPoint(new L.LatLng(y, x));\n this.stream.point(point.x, point.y);\n }\n }\n })\n }","function pipe(fs) {\n return function(x) {\n return reduce (T) (x) (fs);\n };\n }","transform(ref, op) {\n var {\n current,\n affinity\n } = ref;\n\n if (current == null) {\n return;\n }\n\n var path = Range.transform(current, op, {\n affinity\n });\n ref.current = path;\n\n if (path == null) {\n ref.unref();\n }\n }","transform(ref, op) {\n var {\n current,\n affinity\n } = ref;\n\n if (current == null) {\n return;\n }\n\n var path = Range.transform(current, op, {\n affinity\n });\n ref.current = path;\n\n if (path == null) {\n ref.unref();\n }\n }","function CollectStream() {\n stream.Transform.call(this);\n this._chunks = [];\n this._transform = (chunk, enc, cb) => { this._chunks.push(chunk); cb(); }\n this.collect = () => { return Buffer.concat(this._chunks); this._chunks = []; }\n}","function mapTransform(args, math, scope) {\n var x, callback;\n\n if (args[0]) {\n x = args[0].compile().evaluate(scope);\n }\n\n if (args[1]) {\n if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\n // a function pointer, like filter([3, -2, 5], myTestFunction)\n callback = args[1].compile().evaluate(scope);\n } else {\n // an expression like filter([3, -2, 5], x > 0)\n callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\n }\n }\n\n return map(x, callback);\n }","transform(transforms, relative, affine) {\n // If we have a declarative function, we should retarget it if possible\n relative = transforms.relative || relative;\n\n if (this._isDeclarative && !relative && this._tryRetarget('transform', transforms)) {\n return this;\n } // Parse the parameters\n\n\n var isMatrix = Matrix_Matrix.isMatrixLike(transforms);\n affine = transforms.affine != null ? transforms.affine : affine != null ? affine : !isMatrix; // Create a morepher and set its type\n\n const morpher = new Morphable_Morphable(this._stepper).type(affine ? TransformBag : Matrix_Matrix);\n let origin;\n let element;\n let current;\n let currentAngle;\n let startTransform;\n\n function setup() {\n // make sure element and origin is defined\n element = element || this.element();\n origin = origin || getOrigin(transforms, element);\n startTransform = new Matrix_Matrix(relative ? undefined : element); // add the runner to the element so it can merge transformations\n\n element._addRunner(this); // Deactivate all transforms that have run so far if we are absolute\n\n\n if (!relative) {\n element._clearTransformRunnersBefore(this);\n }\n }\n\n function run(pos) {\n // clear all other transforms before this in case something is saved\n // on this runner. We are absolute. We dont need these!\n if (!relative) this.clearTransform();\n let {\n x,\n y\n } = new Point_Point(origin).transform(element._currentTransform(this));\n let target = new Matrix_Matrix(Runner_objectSpread({}, transforms, {\n origin: [x, y]\n }));\n let start = this._isDeclarative && current ? current : startTransform;\n\n if (affine) {\n target = target.decompose(x, y);\n start = start.decompose(x, y); // Get the current and target angle as it was set\n\n const rTarget = target.rotate;\n const rCurrent = start.rotate; // Figure out the shortest path to rotate directly\n\n const possibilities = [rTarget - 360, rTarget, rTarget + 360];\n const distances = possibilities.map(a => Math.abs(a - rCurrent));\n const shortest = Math.min(...distances);\n const index = distances.indexOf(shortest);\n target.rotate = possibilities[index];\n }\n\n if (relative) {\n // we have to be careful here not to overwrite the rotation\n // with the rotate method of Matrix\n if (!isMatrix) {\n target.rotate = transforms.rotate || 0;\n }\n\n if (this._isDeclarative && currentAngle) {\n start.rotate = currentAngle;\n }\n }\n\n morpher.from(start);\n morpher.to(target);\n let affineParameters = morpher.at(pos);\n currentAngle = affineParameters.rotate;\n current = new Matrix_Matrix(affineParameters);\n this.addTransform(current);\n\n element._addRunner(this);\n\n return morpher.done();\n }\n\n function retarget(newTransforms) {\n // only get a new origin if it changed since the last call\n if ((newTransforms.origin || 'center').toString() !== (transforms.origin || 'center').toString()) {\n origin = getOrigin(transforms, element);\n } // overwrite the old transformations with the new ones\n\n\n transforms = Runner_objectSpread({}, newTransforms, {\n origin\n });\n }\n\n this.queue(setup, run, retarget, true);\n this._isDeclarative && this._rememberMorpher('transform', morpher);\n return this;\n }","transformed(transform){\n let result = new AffineTransform();\n\n result.position = this.position.copy();\n result.position.mult(transform.scale);\n\n let rotated = new p5.Vector(result.position.x, result.position.y).rotate(transform.rotation);\n\n result.position.x = rotated.x;\n result.position.y = rotated.y;\n result.position.add(transform.position);\n\n result.scale = this.scale.copy();\n result.scale.mult(transform.scale);\n\n result.rotation = this.rotation + transform.rotation;\n\n return result;\n }","transform(matrix) {\n return matrix ? matrix._transformPoint(this) : this;\n }","function createUploadContainer(){\n\n function transform( requestOptions, _, next ){\n\n requestOptions.method = 'post';\n\n sendRequest( requestOptions, null, ( err, response )=>{\n\n if( err ){\n\n process.nextTick( next.bind( null, err ) );\n\n }else{\n\n process.nextTick( next.bind( null, null, response ) );\n\n }\n\n } );\n \n }\n\n return require( 'stream' ).Transform( {\n objectMode: true,\n transform,\n flush: require( 'tessa-common/lib/stream/util/just-flush' )\n } );\n\n}","function pipeExec(fn) {\n\n\t\tlet canExec = true;\n\n\t\tfunction transform(chunk, enc, cb) {\n\t\t\tif (canExec) {\n\t\t\t\tfn();\n\t\t\t\tcanExec = false;\n\t\t\t}\n\t\t\tcb(null, chunk);\n\t\t}\n\n\t\tfunction flush(cb) {\n\t\t\tcanExec = false;\n\t\t\tcb();\n\t\t}\n\n\t\treturn lib.through.obj(null, transform, flush);\n\n\t}","function f(e,t,n,o){const r=\"function\"==typeof n.transform,s=r?n.transform:y;if(Array.isArray(e)){const i=[],a=e.length;for(let c=0;c<a;++c){let a=e[c];const l=Array.isArray(o)?o[c]:o;if((m(a)||n.retainNullValues&&null==a||r)&&(r&&(a=s(m(a)?a:null,l)),d(a,t),i.push(a),t.originalLimit&&i.length>=t.originalLimit))break}for(;e.length>i.length;)Array.prototype.pop.apply(e,[]);for(let t=0;t<i.length;++t)e[t]=i[t];return e}return m(e)?(d(e,t),s(e,o)):e instanceof Map?e:!0===n.justOne?s(null==e?e:null,o):!1===n.justOne?[]:s(null==e?e:null,o)}","_transform(data, done){\r\n this.stdio.stdin.splitPush(data)\r\n this.fork.stdin.write(data) && done() || this.fork.stdin.on('drain', done)\r\n }","function tjs_gulp_transformFile(file) {\n\t// console.log(file)\n\treturn `gulp.task('${file.file}', function() {\n\tlet pipe = gulp.src('${file.file}', { base: __dirname })\n\n\t// pre-piping\n\tif (typeof __t.start == 'function')\n\t\tpipe = pipe.pipe(__t.start.bind(pipe)())\n\n\t${file.transforms.length == 0 ? `if (typeof __t.blank == 'function') pipe = __t.blank.bind(pipe)()` : ''}\n\n\t${file.transforms.map(t => `// pipe setup for ${t.name}\n\tpipe = __t.${t.name}.bind(pipe)${t.argsTuple}\n\tif (typeof __t.each == 'function') pipe = pipe.pipe(__t.each.bind(pipe)())`).join('\\n\\t')}\n\n\t// post-piping\n\tif (typeof __t.finish == 'function')\n\t\tpipe = pipe.pipe(__t.finish.bind(pipe)())\n\t\n\treturn pipe\n})`\n}","function transform(el, value) {\n el.style['transform'] = value;\n el.style['webkitTransform'] = value;\n}","function transform_script(script) {\n idents.reset()\n scan_for_functions_to_transform(script).forEach(transform_function)\n\n // Post-processing. The script is already valid, but we clean up redundancies to improve readability of the output.\n replace_passthrough_callbacks(script)\n replace_passthrough_functions(script)\n inline_functions_only_called_once(script)\n}","function mapTransform (args, math, scope) {\n let x, callback\n\n if (args[0]) {\n x = args[0].compile().evaluate(scope)\n }\n\n if (args[1]) {\n if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {\n // a function pointer, like filter([3, -2, 5], myTestFunction)\n callback = args[1].compile().evaluate(scope)\n } else {\n // an expression like filter([3, -2, 5], x > 0)\n callback = compileInlineExpression(args[1], math, scope)\n }\n }\n\n return map(x, callback)\n }","function TransformStatic()\n{\n TransformBase.call(this);\n /**\n * The coordinate of the object relative to the local coordinates of the parent.\n *\n * @member {PIXI.ObservablePoint}\n */\n this.position = new math.ObservablePoint(this.onChange, this,0,0);\n\n /**\n * The scale factor of the object.\n *\n * @member {PIXI.ObservablePoint}\n */\n this.scale = new math.ObservablePoint(this.onChange, this,1,1);\n\n /**\n * The pivot point of the displayObject that it rotates around\n *\n * @member {PIXI.ObservablePoint}\n */\n this.pivot = new math.ObservablePoint(this.onChange, this,0, 0);\n\n /**\n * The skew amount, on the x and y axis.\n *\n * @member {PIXI.ObservablePoint}\n */\n this.skew = new math.ObservablePoint(this.updateSkew, this,0, 0);\n\n this._rotation = 0;\n\n this._sr = Math.sin(0);\n this._cr = Math.cos(0);\n this._cy = Math.cos(0);//skewY);\n this._sy = Math.sin(0);//skewY);\n this._nsx = Math.sin(0);//skewX);\n this._cx = Math.cos(0);//skewX);\n\n this._localID = 0;\n this._currentLocalID = 0;\n}","function transform( el, value ) {\n\tvar style = el.style;\n\n\tstyle.transform = value;\n\tstyle.webkitTransform = value;\n\tstyle.oTransform = value;\n\tstyle.msTransform = value;\n}","transform(point, op) {\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n return fn(point, p => {\n if (p === null) {\n return null;\n }\n\n var {\n affinity = 'forward'\n } = options;\n var {\n path,\n offset\n } = p;\n\n switch (op.type) {\n case 'insert_node':\n case 'move_node':\n {\n p.path = Path.transform(path, op, options);\n break;\n }\n\n case 'insert_text':\n {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset += op.text.length;\n }\n\n break;\n }\n\n case 'merge_node':\n {\n if (Path.equals(op.path, path)) {\n p.offset += op.position;\n }\n\n p.path = Path.transform(path, op, options);\n break;\n }\n\n case 'remove_text':\n {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset -= Math.min(offset - op.offset, op.text.length);\n }\n\n break;\n }\n\n case 'remove_node':\n {\n if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\n return null;\n }\n\n p.path = Path.transform(path, op, options);\n break;\n }\n\n case 'split_node':\n {\n if (Path.equals(op.path, path)) {\n if (op.position === offset && affinity == null) {\n return null;\n } else if (op.position < offset || op.position === offset && affinity === 'forward') {\n p.offset -= op.position;\n p.path = Path.transform(path, op, _objectSpread$6(_objectSpread$6({}, options), {}, {\n affinity: 'forward'\n }));\n }\n } else {\n p.path = Path.transform(path, op, options);\n }\n\n break;\n }\n }\n });\n }","function transformItem(stream, item) {\n var ret;\n if (isArray(item)) {\n if (isHashArray(item)) {\n ret = transformHashArrayData(stream, item);\n } else {\n ret = transformArrayData(stream, item);\n }\n } else {\n ret = transformHashData(stream, item);\n }\n return ret;\n}","function transformItem(stream, item) {\n var ret;\n if (isArray(item)) {\n if (isHashArray(item)) {\n ret = transformHashArrayData(stream, item);\n } else {\n ret = transformArrayData(stream, item);\n }\n } else {\n ret = transformHashData(stream, item);\n }\n return ret;\n}","function transform(context, file, fileSet, next) {\n if (stats(file).fatal) {\n next()\n } else {\n debug('Transforming document `%s`', file.path)\n context.processor.run(context.tree, file, onrun)\n }\n\n function onrun(error, node) {\n debug('Transformed document (error: %s)', error)\n context.tree = node\n next(error)\n }\n}","transform(e3v) {\nreturn (this._r.rotate(e3v)).setAdd(this._t);\n}","_transform( data, encoding, streamCallback )\n {\n // convert buffer to string\n const text = data.toString( this.stringEncoding )\n\n // split data at newline\n const lines = text.split( this.newlineCharacter )\n\n // prepend previously buffered data to first line\n lines[0] = this.lineBuffer + lines[0]\n\n // last \"line\" is probably not a complete line,\n // remove it from the processing array and store it for next time\n this.lineBuffer = lines.pop()\n\n // process and push data with adding newline back\n this.handleLines( streamCallback, this.transformCallback, lines, this.newlineCharacter )\n }","function Transform(area, root) {\n this.area = area;\n this.root = root.tag();\n}","transform(chunk, encoding, callback) {\n compressChunk(compressor, encoding, chunk)\n .then(data => callback(null, data))\n .catch(callback);\n }","function transform ( p, fn ) {\n\t\t\t\treturn function () {\n\t\t\t\t\tvar result = p();\n\n\t\t\t\t\treturn result === null ? null : fn( result );\n\t\t\t\t};\n\t\t\t}","function Transform(str) {\r\n\t\tif (typeof str === 'string') {\r\n\t\t\tthis.parse(str);\r\n\t\t}\r\n\t}","ohlcv() {\n const self = this\n const stream = new Transform({\n objectMode: true,\n transform(chunk, encoding, callback) {\n self.analyze(chunk, callback)\n }\n })\n return stream\n }","function Transform() { // eslint-disable-line no-unused-vars\n\n var request = new XMLHttpRequest();\n\n setLocalStorageItem('code', cppEditor.getValue());\n setLocalStorageItem('insightsOptions', getInsightsOptions());\n\n request.onreadystatechange = function() {\n if (this.readyState == 4 && this.status == 200) {\n var response = JSON.parse(this.responseText);\n cppOutEditor.setValue(response.stdout);\n stdErrEditor.setValue(response.stderr);\n SetRunListeners();\n } else if (this.readyState == 4 && this.status != 200) {\n stdErrEditor.setValue('Sorry, your request failed');\n SetRunListeners();\n }\n };\n\n stdErrEditor.setValue('Waiting for response...');\n\n var url = buildURL('/api/v1/transform');\n\n request.open('POST', url, true);\n request.setRequestHeader('Content-Type', 'application/json;charset=UTF-8');\n\n var data = {};\n\n data.insightsOptions = getInsightsOptions();\n data.code = cppEditor.getValue();\n\n SetWaitForResultListeners();\n request.send(JSON.stringify(data));\n}","function trackTransforms(ctx){\n let svg = document.createElementNS(\"http://www.w3.org/2000/svg\",'svg');\n let xform = svg.createSVGMatrix();\n ctx.getTransform = function(){ return xform; };\n\n let savedTransforms = [];\n let save = ctx.save;\n ctx.save = function(){\n savedTransforms.push(xform.translate(0,0));\n return save.call(ctx);\n };\n\n let restore = ctx.restore;\n ctx.restore = function(){\n xform = savedTransforms.pop();\n return restore.call(ctx);\n };\n\n let scale = ctx.scale;\n ctx.scale = function(sx,sy){\n xform = xform.scaleNonUniform(sx,sy);\n return scale.call(ctx,sx,sy);\n };\n\n let rotate = ctx.rotate;\n ctx.rotate = function(radians){\n xform = xform.rotate(radians*180/Math.PI);\n return rotate.call(ctx,radians);\n };\n\n let translate = ctx.translate;\n ctx.translate = function(dx,dy){\n xform = xform.translate(dx,dy);\n return translate.call(ctx,dx,dy);\n };\n\n let transform = ctx.transform;\n ctx.transform = function(a,b,c,d,e,f){\n var m2 = svg.createSVGMatrix();\n m2.a=a; m2.b=b; m2.c=c; m2.d=d; m2.e=e; m2.f=f;\n xform = xform.multiply(m2);\n return transform.call(ctx,a,b,c,d,e,f);\n };\n\n let setTransform = ctx.setTransform;\n ctx.setTransform = function(a,b,c,d,e,f){\n xform.a = a;\n xform.b = b;\n xform.c = c;\n xform.d = d;\n xform.e = e;\n xform.f = f;\n return setTransform.call(ctx,a,b,c,d,e,f);\n };\n\n let pt = svg.createSVGPoint();\n ctx.transformedPoint = function(x,y){\n pt.x=x; pt.y=y;\n return pt.matrixTransform(xform.inverse());\n }\n}","_transform(chunk,encoding,cb) {\n\n const uint8_view = new Uint8Array(chunk, 0, chunk.length);\n var dataView = new DataView(uint8_view.buffer);\n\n let iFloat = Array(this.sz*2);\n let asComplex = Array(this.sz);\n\n\n // for(let i = 0; i < this.sz*2; i+=1) {\n // iFloat[i] = dataView.getFloat64(i*8, true);\n // }\n\n for(let i = 0; i < this.sz*2; i+=2) {\n let re = dataView.getFloat64(i*8, true);\n let im = dataView.getFloat64((i*8)+8, true);\n\n asComplex[i/2] = mt.complex(re,im);\n\n iFloat[i] = re;\n iFloat[i+1] = im;\n\n // if( i < 16 ) {\n // console.log(re);\n // }\n\n }\n\n let iShort = mutil.IFloatToIShortMulti(iFloat);\n\n if( this.onFrameIShort !== null ) {\n this.onFrameIShort(iShort);\n }\n\n // console.log(\"iFloat length \" + iFloat.length);\n // console.log(iFloat.slice(0,16));\n\n // console.log(\"iShort length \" + iShort.length);\n // console.log(iShort.slice(0,16));\n\n\n this.handleDefaultStream(iFloat,iShort,asComplex);\n this.handleFineSync(iFloat,iShort,asComplex);\n this.handleAllSubcarriers(iFloat,iShort,asComplex);\n this.handleDemodData(iFloat,iShort,asComplex);\n\n\n // for(x of iFloat) {\n // console.log(x);\n // }\n\n\n this.uint.frame_track_counter++;\n cb();\n }","transform (matrix) {\n return new Point(this.native().matrixTransform(matrix))\n }","static getTransform({ x = 0, y = 0, zoom = 1, width, targetWidth }) {\n let nextX = x;\n const windowWidth = getWindowWidth();\n if (width > windowWidth) {\n nextX += (windowWidth - width) / 2;\n }\n const scaleFactor = zoom * (targetWidth / width);\n\n return {\n transform: `translate3d(${nextX}px,${y}px,0) scale3d(${scaleFactor},${scaleFactor},1)`,\n };\n }","processTransform(context, result, inputParams, index) {\n var _a;\n result.element = (_a = result.element) !== null && _a !== void 0 ? _a : [];\n const element = inputParams.element;\n const a = +inputParams.a;\n const b = +inputParams.b;\n const c = +inputParams.c;\n const d = +inputParams.d;\n const e = +inputParams.e;\n const f = +inputParams.f;\n const matrix = new SVG.Matrix({ a: a, b: b, c: c, d: d, e: e, f: f });\n this.applyMatrix(element, matrix);\n result.element.push(element);\n }","_processBabel(file) {\n// Return a through Transform stream, in which we transform source code with babel......\n return through( function(chunk, enc, done) {\n let {code} = babel.transformSync(chunk.toString(), {\n babelrc: true,\n filename: file\n })\n\n// Push result to stream....\n this.push(code)\n\n// Call callback.....\n done()\n })\n }","function transform( xslSrc, filterKey, filterValue, arg )\r\n{\r\n // load the xsl stylesheet\r\n var xsl = new ActiveXObject(\"Msxml2.FreeThreadedDOMDocument.3.0\");\r\n xsl.async = false;\r\n xsl.load(xslSrc);\r\n\r\n // create xsl template from xsl document\r\n var xslt = new ActiveXObject(\"Msxml2.XSLTemplate.3.0\");\r\n xslt.stylesheet = xsl;\r\n\r\n // create processor and feed xml\r\n var processor = xslt.createProcessor();\t\t\r\n processor.input = xml;\r\n \r\n if ( typeof(arg) != \"undefined\" ) \r\n {\r\n processor.addParameter(\"OUTPUTPATH\",arg);\r\n }\r\n\r\n\tprocessor.addParameter( filterKey, filterValue ) ;\r\n processor.addParameter( \"package\", package ) ;\r\n\r\n\r\n // do the magic\r\n processor.transform();\r\n\r\n return processor.output;\r\n}","multiply(transform) {\n const rotation = this.rotation.mul(transform.rotation);\n const trans = this.apply({position: transform.getTranslation()});\n\n return new Transform({\n translation: trans.position,\n rotation\n });\n }","function transformSync(src, filename, options) {\n validateArguments(src, filename);\n const normalizedOptions = options_1.validateTransformOptions(options);\n return transformFile(src, filename, normalizedOptions);\n}","function AddTransformer() {}","function FastMessageEncoder()\n{\n\tmod_stream.Transform.call(this, {\n\t 'highWaterMark': 16,\n\t 'objectMode': true\n\t});\n}","function trackTransforms(ctx){\n var svg = document.createElementNS(\"http://www.w3.org/2000/svg\",'svg');\n var xform = svg.createSVGMatrix();\n ctx.getTransform = function(){ return xform; };\n\n var savedTransforms = [];\n var save = ctx.save;\n ctx.save = function(){\n savedTransforms.push(xform.translate(0,0));\n return save.call(ctx);\n };\n\n var restore = ctx.restore;\n ctx.restore = function(){\n xform = savedTransforms.pop();\n return restore.call(ctx);\n };\n\n var scale = ctx.scale;\n ctx.scale = function(sx,sy){\n xform = xform.scaleNonUniform(sx,sy);\n return scale.call(ctx,sx,sy);\n };\n\n var rotate = ctx.rotate;\n ctx.rotate = function(radians){\n xform = xform.rotate(radians*180/Math.PI);\n return rotate.call(ctx,radians);\n };\n\n var translate = ctx.translate;\n ctx.translate = function(dx,dy){\n xform = xform.translate(dx,dy);\n return translate.call(ctx,dx,dy);\n };\n\n var transform = ctx.transform;\n ctx.transform = function(a,b,c,d,e,f){\n var m2 = svg.createSVGMatrix();\n m2.a=a; m2.b=b; m2.c=c; m2.d=d; m2.e=e; m2.f=f;\n xform = xform.multiply(m2);\n return transform.call(ctx,a,b,c,d,e,f);\n };\n\n var setTransform = ctx.setTransform;\n ctx.setTransform = function(a,b,c,d,e,f){\n xform.a = a;\n xform.b = b;\n xform.c = c;\n xform.d = d;\n xform.e = e;\n xform.f = f;\n return setTransform.call(ctx,a,b,c,d,e,f);\n };\n\n var pt = svg.createSVGPoint();\n ctx.transformedPoint = function(x,y){\n pt.x=x; pt.y=y;\n return pt.matrixTransform(xform.inverse());\n }\n ctx.transformedPointBack = function(x,y){\n pt.x=x; pt.y=y;\n return pt.matrixTransform(xform);\n }\n }"],"string":"[\n \"static transform() {}\",\n \"get transform() {}\",\n \"get transform() {}\",\n \"get transform() {}\",\n \"get transform() {}\",\n \"function pipeTransforms (stream, transforms) {\\n var head, rest;\\n if (!Array.isArray(transforms) || !transforms.length) {\\n return stream;\\n }\\n head = transforms[0];\\n rest = transforms.slice(1);\\n // recursively pipe to remaining Transforms\\n return pipeTransforms(stream.pipe(head), rest);\\n}\",\n \"function Transform$7() {}\",\n \"set transform(value) {}\",\n \"set transform(value) {}\",\n \"set transform(value) {}\",\n \"set transform(value) {}\",\n \"transform(a, b, c, d, e, f) {\\n this.ctx.transform(a, b, c, d, e, f);\\n }\",\n \"runTransformation(input) {\\n return this.transform(input)\\n }\",\n \"function transform(stream, transformer, reducer) {\\n const target = newWriteableStream(reducer);\\n stream.on('data', data => target.write(transformer.data(data)));\\n stream.on('end', () => target.end());\\n stream.on('error', error => target.error(transformer.error ? transformer.error(error) : error));\\n return target;\\n }\",\n \"transform() {\\n throw new Error('Missing _transform_ method on extractor');\\n }\",\n \"function transform(stream, transformer, reducer) {\\n var target = newWriteableStream(reducer);\\n stream.on('data', function (data) { return target.write(transformer.data(data)); });\\n stream.on('end', function () { return target.end(); });\\n stream.on('error', function (error) { return target.error(transformer.error ? transformer.error(error) : error); });\\n return target;\\n}\",\n \"function test_transform() {\\n var f = function(x) {\\n return Number($(x)) + 1;\\n };\\n\\n\\n var plan1 = tasks(\\\"ns:identity\\\").plan({\\n x: [0, 1]\\n });\\n\\n var plan2 = tasks(\\\"ns:mult\\\").plan({\\n x: transform(f, plan1),\\n y: [3, 5]\\n });\\n\\n // Optimize and run\\n // Should be an array of XML values 3, 6, 5, 10\\n var result = plan2.run();\\n check_array(result, [3, 5, 6, 10]);\\n}\",\n \"getTransform(){return this.__transform}\",\n \"function _transform(node, callback) {\\n return node.map(function (child, path, parent) {\\n var replacement = callback(child, path, parent);\\n return _transform(replacement, callback);\\n });\\n }\",\n \"function _transform (node, callback) {\\n return node.map(function(child, path, parent) {\\n var replacement = callback(child, path, parent);\\n return _transform(replacement, callback);\\n });\\n }\",\n \"function _transform (node, callback) {\\n return node.map(function(child, path, parent) {\\n var replacement = callback(child, path, parent);\\n return _transform(replacement, callback);\\n });\\n }\",\n \"function compress() {\\n // Create a native streaming gzip compressing with Neon\\n const compressor = compressNew();\\n\\n return new Transform({\\n // Compress a chunk of data by delegating to `compressChunk`\\n transform(chunk, encoding, callback) {\\n compressChunk(compressor, encoding, chunk)\\n .then(data => callback(null, data))\\n .catch(callback);\\n },\\n\\n // Complete the compression by delegating to `compressFinish`\\n flush(callback) {\\n compressFinish(compressor)\\n .then(data => callback(null, data))\\n .catch(callback);\\n }\\n });\\n}\",\n \"function LGraphTransform()\\r\\n\\t{\\r\\n\\t\\tthis.properties = {node_id:\\\"\\\"};\\r\\n\\t\\tif(LGraphSceneNode._current_node_id)\\r\\n\\t\\t\\tthis.properties.node_id = LGraphSceneNode._current_node_id;\\r\\n\\t\\tthis.addInput(\\\"Transform\\\",\\\"Transform\\\");\\r\\n\\t\\tthis.addOutput(\\\"Position\\\",\\\"vec3\\\");\\r\\n\\t}\",\n \"function map(stream, transform) {\\n var q = new TupleQueue(function() {\\n return q.emitData(transform.apply(null, arguments));\\n });\\n stream.pipe(q);\\n return q;\\n}\",\n \"function transform( node, transformations ){\\n\\t\\tfor( var key in node.attrs )\\n\\t\\t\\tif( transformations.hasOwnProperty( node.attrs[ key ] ) ){\\n\\t\\t\\t\\tvar transformed = transformations[ key ](\\n\\t\\t\\t\\t\\tnode,\\n\\t\\t\\t\\t\\tnode.attrs[ key ],\\n\\t\\t\\t\\t\\tnode.attrs\\n\\t\\t\\t\\t)\\n\\n\\t\\t\\t\\tif( transformed !== undefined )\\n\\t\\t\\t\\t\\tnode = transformed\\n\\t\\t\\t}\\n\\n\\t\\treturn node\\n\\t}\",\n \"function Transformation() {\\r\\n\\t\\tvar fn = {\\r\\n\\t\\t\\ttranslate: new TransformFunction('translate({x}px,{y}px)', {x:0, y:0}),\\r\\n\\t\\t\\tscale: new TransformFunction('scale({x},{y})', {x:1, y:1}),\\r\\n\\t\\t\\trotate: new TransformFunction('rotate({deg}deg)', {deg:0})\\r\\n\\t\\t};\\r\\n\\t\\t\\r\\n\\t\\tif (supports3d) {\\r\\n\\t\\t\\t// Use 3D transforms for better performance\\r\\n\\t\\t\\tfn.translate = new TransformFunction('translate3d({x}px,{y}px,0px)', {x:0, y:0});\\r\\n\\t\\t\\tfn.scale = new TransformFunction('scale3d({x},{y},1)', {x:1, y:1});\\r\\n\\t\\t}\\t\\r\\n\\t\\t\\r\\n\\t\\tvar commands = {\\r\\n\\t\\t\\trotate: function(deg) {\\r\\n\\t\\t\\t\\tfn.rotate.deg = deg;\\r\\n\\t\\t\\t},\\r\\n\\t\\t\\trotateBy: function(deg) {\\r\\n\\t\\t\\t\\tfn.rotate.deg += deg;\\r\\n\\t\\t\\t},\\r\\n\\t\\t\\tscale: function(s) {\\r\\n\\t\\t\\t\\tif (typeof s == 'number') {\\r\\n\\t\\t\\t\\t\\ts = {x: s, y: s};\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfn.scale.x = s.x;\\r\\n\\t\\t\\t\\tfn.scale.y = s.y;\\r\\n\\t\\t\\t},\\r\\n\\t\\t\\tscaleBy: function(s) {\\r\\n\\t\\t\\t\\tif (typeof s == 'number') {\\r\\n\\t\\t\\t\\t\\ts = {x: s, y: s};\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfn.scale.x *= s.x;\\r\\n\\t\\t\\t\\tfn.scale.y *= s.y;\\r\\n\\t\\t\\t},\\r\\n\\t\\t\\ttranslate: function(s) {\\r\\n\\t\\t\\t\\tvar t = fn.translate;\\r\\n\\t\\t\\t\\tif (!s) {\\r\\n\\t\\t\\t\\t\\ts = {x: 0, y: 0};\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tt.x = (s.x !== undefined) ? parseInt(s.x, 10) : t.x;\\r\\n\\t\\t\\t\\tt.y = (s.y !== undefined) ? parseInt(s.y, 10) : t.y;\\r\\n\\t\\t\\t},\\r\\n\\t\\t\\ttranslateBy: function(s) {\\r\\n\\t\\t\\t\\tvar t = fn.translate;\\r\\n\\t\\t\\t\\tt.x += parseInt(s.x, 10) || 0;\\r\\n\\t\\t\\t\\tt.y += parseInt(s.y, 10) || 0;\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t\\tthis.fn = fn;\\r\\n\\t\\tthis.exec = function(cmd) {\\r\\n\\t\\t\\tfor (var n in cmd) {\\r\\n\\t\\t\\t\\tif (commands[n]) {\\r\\n\\t\\t\\t\\t\\tcommands[n](cmd[n]);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t\\tthis.reset = function() {\\r\\n\\t\\t\\t$.each(fn, function() {\\r\\n\\t\\t\\t\\tthis.reset();\\r\\n\\t\\t\\t});\\r\\n\\t\\t};\\r\\n\\t\\tthis.format = function() {\\r\\n\\t\\t\\tvar s = '';\\r\\n\\t\\t\\t$.each(fn, function(k, v) {\\r\\n\\t\\t\\t\\ts += v.format() + ' ';\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\treturn s;\\r\\n\\t\\t};\\r\\n\\t}\",\n \"map(transform) {\\n assertUninitialized(this);\\n const oldTransform = this[kTransform]; // TODO(NODE-3283): Improve transform typing\\n if (oldTransform) {\\n this[kTransform] = doc => {\\n return transform(oldTransform(doc));\\n };\\n }\\n else {\\n this[kTransform] = transform;\\n }\\n return this;\\n }\",\n \"function LogicNodeTransformComponent() {\\n\\t\\tLogicNode.call(this);\\n\\t\\tthis.logicInterface = LogicNodeTransformComponent.logicInterface;\\n\\t\\tthis.type = 'TransformComponent';\\n\\t}\",\n \"transform(point, op) {\\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\\n return Object(__WEBPACK_IMPORTED_MODULE_1_immer__[\\\"d\\\" /* produce */])(point, p => {\\n var {\\n affinity = 'forward'\\n } = options;\\n var {\\n path,\\n offset\\n } = p;\\n\\n switch (op.type) {\\n case 'insert_node':\\n case 'move_node':\\n {\\n p.path = Path.transform(path, op, options);\\n break;\\n }\\n\\n case 'insert_text':\\n {\\n if (Path.equals(op.path, path) && op.offset <= offset) {\\n p.offset += op.text.length;\\n }\\n\\n break;\\n }\\n\\n case 'merge_node':\\n {\\n if (Path.equals(op.path, path)) {\\n p.offset += op.position;\\n }\\n\\n p.path = Path.transform(path, op, options);\\n break;\\n }\\n\\n case 'remove_text':\\n {\\n if (Path.equals(op.path, path) && op.offset <= offset) {\\n p.offset -= Math.min(offset - op.offset, op.text.length);\\n }\\n\\n break;\\n }\\n\\n case 'remove_node':\\n {\\n if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\\n return null;\\n }\\n\\n p.path = Path.transform(path, op, options);\\n break;\\n }\\n\\n case 'split_node':\\n {\\n if (Path.equals(op.path, path)) {\\n if (op.position === offset && affinity == null) {\\n return null;\\n } else if (op.position < offset || op.position === offset && affinity === 'forward') {\\n p.offset -= op.position;\\n p.path = Path.transform(path, op, _objectSpread$2({}, options, {\\n affinity: 'forward'\\n }));\\n }\\n } else {\\n p.path = Path.transform(path, op, options);\\n }\\n\\n break;\\n }\\n }\\n });\\n }\",\n \"function makeTransform(registry) {\\n\\n return function(filename, options) {\\n options = options || {};\\n\\n var registry = registry || registryFromOptions(options);\\n\\n return aggregate(function(src) {\\n try {\\n src = jstransform(src);\\n } catch(err) {\\n return this.emit('error', err);\\n }\\n this.queue(src);\\n this.queue(null);\\n });\\n }\\n}\",\n \"passthrough() {\\n const me = this;\\n // A chunk counter for debugging\\n let _scan_complete = false;\\n let _av_waiting = null;\\n let _av_scan_time = false;\\n\\n // DRY method for clearing the interval and counter related to scan times\\n const clear_scan_benchmark = () => {\\n if (_av_waiting) clearInterval(_av_waiting);\\n _av_waiting = null;\\n _av_scan_time = 0;\\n };\\n\\n // Return a Transform stream so this can act as a \\\"man-in-the-middle\\\"\\n // for the streaming pipeline.\\n // Ex. upload_stream.pipe(<this_transform_stream>).pipe(destination_stream)\\n return new Transform({\\n // This should be fired on each chunk received\\n async transform(chunk, encoding, cb) {\\n\\n // DRY method for handling each chunk as it comes in\\n const do_transform = () => {\\n // Write data to our fork stream. If it fails,\\n // emit a 'drain' event\\n if (!this._fork_stream.write(chunk)) {\\n this._fork_stream.once('drain', () => {\\n cb(null, chunk);\\n });\\n } else {\\n // Push data back out to whatever is listening (if anything)\\n // and let Node know we're ready for more data\\n cb(null, chunk);\\n }\\n };\\n\\n // DRY method for handling errors when the arise from the\\n // ClamAV Socket connection\\n const handle_error = (err, is_infected=null, result=null) => {\\n this._fork_stream.unpipe();\\n this._fork_stream.destroy();\\n this._clamav_transform.destroy();\\n clear_scan_benchmark();\\n\\n // Finding an infected file isn't really an error...\\n if (is_infected === true) {\\n if (_scan_complete === false) {\\n _scan_complete = true;\\n this.emit('scan-complete', result);\\n }\\n this.emit('stream-infected', result); // just another way to catch an infected stream\\n } else {\\n this.emit('error', err);\\n }\\n };\\n\\n // If we haven't initialized a socket connection to ClamAV yet,\\n // now is the time...\\n if (!this._clamav_socket) {\\n // We're using a PassThrough stream as a middle man to fork the input\\n // into two paths... (1) ClamAV and (2) The final destination.\\n this._fork_stream = new PassThrough();\\n // Instantiate our custom Transform stream that coddles\\n // chunks into the correct format for the ClamAV socket.\\n this._clamav_transform = new NodeClamTransform({}, me.settings.debug_mode);\\n // Setup an array to collect the responses from ClamAV\\n this._clamav_response_chunks = [];\\n\\n try {\\n // Get a connection to the ClamAV Socket\\n this._clamav_socket = await me._init_socket('passthrough');\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV Socket Initialized...`);\\n\\n // Setup a pipeline that will pass chunks through our custom Tranform and on to ClamAV\\n this._fork_stream.pipe(this._clamav_transform).pipe(this._clamav_socket);\\n\\n // When the CLamAV socket connection is closed (could be after 'end' or because of an error)...\\n this._clamav_socket.on('close', hadError => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has been closed! Because of Error:`, hadError);\\n })\\n // When the ClamAV socket connection ends (receives chunk)\\n .on('end', () => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has received the last chunk!`);\\n // Process the collected chunks\\n const response = Buffer.concat(this._clamav_response_chunks);\\n const result = me._process_result(response.toString('utf8'), null);\\n this._clamav_response_chunks = [];\\n if (me.settings.debug_mode) {\\n console.log(`${me.debug_label}: Result of scan:`, result);\\n console.log(`${me.debug_label}: It took ${_av_scan_time} seconds to scan the file(s).`);\\n clear_scan_benchmark();\\n }\\n\\n // NOTE: \\\"scan-complete\\\" could be called by the `handle_error` method.\\n // We don't want to to double-emit this message.\\n if (_scan_complete === false) {\\n _scan_complete = true;\\n this.emit('scan-complete', result);\\n }\\n })\\n // If connection timesout.\\n .on('timeout', () => {\\n this.emit('timeout', new Error('Connection to host/socket has timed out'));\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connection to host/socket has timed out`);\\n })\\n // When the ClamAV socket is ready to receive packets (this will probably never fire here)\\n .on('ready', () => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket ready to receive`);\\n })\\n // When we are officially connected to the ClamAV socket (probably will never fire here)\\n .on('connect', () => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connected to ClamAV socket`);\\n })\\n // If an error is emitted from the ClamAV socket\\n .on('error', err => {\\n console.error(`${me.debug_label}: Error emitted from ClamAV socket: `, err);\\n handle_error(err);\\n })\\n // If ClamAV is sending stuff to us (ie, an \\\"OK\\\", \\\"Virus FOUND\\\", or \\\"ERROR\\\")\\n .on('data', cv_chunk => {\\n // Push this chunk to our results collection array\\n this._clamav_response_chunks.push(cv_chunk);\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Got result!`, cv_chunk.toString());\\n\\n // Parse what we've gotten back from ClamAV so far...\\n const response = Buffer.concat(this._clamav_response_chunks);\\n const result = me._process_result(response.toString(), null);\\n\\n // If there's an error supplied or if we detect a virus, stop stream immediately.\\n if (result instanceof NodeClamError || (typeof result === 'object' && 'is_infected' in result && result.is_infected === true)) {\\n // If a virus is detected...\\n if (typeof result === 'object' && 'is_infected' in result && result.is_infected === true) {\\n // handle_error(new NodeClamError(result, `Virus(es) found! ${'viruses' in result && Array.isArray(result.viruses) ? `Suspects: ${result.viruses.join(', ')}` : ''}`));\\n handle_error(null, true, result);\\n }\\n // If any other kind of error is detected...\\n else {\\n handle_error(result);\\n }\\n }\\n // For debugging purposes, spit out what was processed (if anything).\\n else {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Processed Result: `, result, response.toString());\\n }\\n });\\n\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing initial transform!`);\\n // Handle the chunk\\n do_transform();\\n } catch (err) {\\n // If there's an issue connecting to the ClamAV socket, this is where that's handled\\n if (me.settings.debug_mode) console.error(`${me.debug_label}: Error initiating socket to ClamAV: `, err);\\n handle_error(err);\\n }\\n } else {\\n //if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing transform: ${++counter}`);\\n // Handle the chunk\\n do_transform();\\n }\\n },\\n\\n // This is what is called when the input stream has dried up\\n flush(cb) {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Done with the full pipeline.`);\\n\\n // Keep track of how long it's taking to scan a file..\\n _av_waiting = null;\\n _av_scan_time = 0;\\n if (me.settings.debug_mode) {\\n _av_waiting = setInterval(() => {\\n _av_scan_time += 1;\\n if (_av_scan_time % 5 === 0) console.log(`${me.debug_label}: ClamAV has been scanning for ${_av_scan_time} seconds...`);\\n }, 1000);\\n }\\n\\n // TODO: Investigate why this needs to be done in order\\n // for the ClamAV socket to be closed (why NodeClamTransform's\\n // `_flush` method isn't getting called)\\n // If the incoming stream is empty, transform() won't have been called, so we won't\\n // have a socket here.\\n if (this._clamav_socket && this._clamav_socket.writable === true) {\\n const size = Buffer.alloc(4);\\n size.writeInt32BE(0, 0);\\n this._clamav_socket.write(size, cb);\\n }\\n }\\n });\\n }\",\n \"function SampleTransform (opts) {\\n if (!(this instanceof SampleTransform)) return new SampleTransform(opts);\\n\\n opts = opts || {};\\n \\n Transform.call(this, opts);\\n}\",\n \"transform(ref, op) {\\n var {\\n current,\\n affinity\\n } = ref;\\n\\n if (current == null) {\\n return;\\n }\\n\\n var point = Point.transform(current, op, {\\n affinity\\n });\\n ref.current = point;\\n\\n if (point == null) {\\n ref.unref();\\n }\\n }\",\n \"transform(ref, op) {\\n var {\\n current,\\n affinity\\n } = ref;\\n\\n if (current == null) {\\n return;\\n }\\n\\n var point = Point.transform(current, op, {\\n affinity\\n });\\n ref.current = point;\\n\\n if (point == null) {\\n ref.unref();\\n }\\n }\",\n \"function TransformFn( fn , xAdd = 0 , xMul = 1 , yAdd = 0 , yMul = 1 ) {\\n\\tthis.fn = fn ;\\n\\tthis.xAdd = xAdd ;\\n\\tthis.xMul = xMul ;\\n\\tthis.yAdd = yAdd ;\\n\\tthis.yMul = yMul ;\\n}\",\n \"transformer (source, name, filename, options) {\\n return (size) => {\\n let readStream;\\n readStream = fs.createReadStream(filename);\\n this.state(name, { sync: true }) // update header\\n// // Since the function is not immediately invoked,\\n// // the source stream (chain file) may have already closed\\n// // by the time this function is called. \\n// // Therefore check if it's already closed\\n// // If already closed, create a normal stream\\n// // If stil open (still writing, in case of a large file), create a tailstream\\n// if (!source || source.writableFinished) {\\n// readStream = fs.createReadStream(filename);\\n// this.state(name, { sync: true }) // update header\\n// } else {\\n// readStream = ts.createReadStream(filename, { waitForCreate: true })\\n// source.on(\\\"close\\\", () => {\\n// this.state(name, { sync: true }) // update header\\n// readStream.on(\\\"eof\\\", () => { readStream.end() }) // close tail stream\\n// })\\n// }\\n let stx = readStream.pipe(es.split()).pipe(es.map((item, cb) => {\\n this.parse(item, options).then((data) => {\\n cb(null, data);\\n })\\n }))\\n if (this.filter) stx = stx.pipe(es.filterSync(this.filter))\\n if (this.map) stx = stx.pipe(es.mapSync((e) => {\\n let mapped = this.map(e)\\n let res = Object.assign({\\\"$\\\": mapped}, {tx: e.tx})\\n if (e.blk) res.blk = e.blk\\n return res\\n }))\\n // If 'size' is specified, create a batch stream\\n if (size) {\\n let batch = new BatchStream({ size : size });\\n stx = stx.pipe(batch)\\n }\\n return stx;\\n }\\n }\",\n \"function Transform() {\\n\\t\\t\\t\\t this.reset();\\n\\t\\t\\t\\t}\",\n \"function ShimStream(options) {\\n // be lenient with 'new' keyword\\n if (!(this instanceof ShimStream)) {\\n return new ShimStream(options);\\n }\\n\\n // super\\n Transform.call(this, options);\\n\\n // internal state\\n this._onFirst = true;\\n this._prefixString = prefixTemplate(); // TODO: dependencies support\\n this._suffixString = suffixTemplate();\\n}\",\n \"function Transform(transformFn, options) {\\n return function (target, key) {\\n var metadata = new TransformMetadata_1.TransformMetadata(target.constructor, key, transformFn, options);\\n storage_2.defaultMetadataStorage.addTransformMetadata(metadata);\\n };\\n }\",\n \"_updateTransform() {\\n this._applyTransform(this._transform)\\n this.redraw()\\n if (this.callbacks.didUpdateTransform) {\\n this.callbacks.didUpdateTransform(this._transform)\\n }\\n }\",\n \"async transform(chunk, encoding, cb) {\\n\\n // DRY method for handling each chunk as it comes in\\n const do_transform = () => {\\n // Write data to our fork stream. If it fails,\\n // emit a 'drain' event\\n if (!this._fork_stream.write(chunk)) {\\n this._fork_stream.once('drain', () => {\\n cb(null, chunk);\\n });\\n } else {\\n // Push data back out to whatever is listening (if anything)\\n // and let Node know we're ready for more data\\n cb(null, chunk);\\n }\\n };\\n\\n // DRY method for handling errors when the arise from the\\n // ClamAV Socket connection\\n const handle_error = (err, is_infected=null, result=null) => {\\n this._fork_stream.unpipe();\\n this._fork_stream.destroy();\\n this._clamav_transform.destroy();\\n clear_scan_benchmark();\\n\\n // Finding an infected file isn't really an error...\\n if (is_infected === true) {\\n if (_scan_complete === false) {\\n _scan_complete = true;\\n this.emit('scan-complete', result);\\n }\\n this.emit('stream-infected', result); // just another way to catch an infected stream\\n } else {\\n this.emit('error', err);\\n }\\n };\\n\\n // If we haven't initialized a socket connection to ClamAV yet,\\n // now is the time...\\n if (!this._clamav_socket) {\\n // We're using a PassThrough stream as a middle man to fork the input\\n // into two paths... (1) ClamAV and (2) The final destination.\\n this._fork_stream = new PassThrough();\\n // Instantiate our custom Transform stream that coddles\\n // chunks into the correct format for the ClamAV socket.\\n this._clamav_transform = new NodeClamTransform({}, me.settings.debug_mode);\\n // Setup an array to collect the responses from ClamAV\\n this._clamav_response_chunks = [];\\n\\n try {\\n // Get a connection to the ClamAV Socket\\n this._clamav_socket = await me._init_socket('passthrough');\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV Socket Initialized...`);\\n\\n // Setup a pipeline that will pass chunks through our custom Tranform and on to ClamAV\\n this._fork_stream.pipe(this._clamav_transform).pipe(this._clamav_socket);\\n\\n // When the CLamAV socket connection is closed (could be after 'end' or because of an error)...\\n this._clamav_socket.on('close', hadError => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has been closed! Because of Error:`, hadError);\\n })\\n // When the ClamAV socket connection ends (receives chunk)\\n .on('end', () => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket has received the last chunk!`);\\n // Process the collected chunks\\n const response = Buffer.concat(this._clamav_response_chunks);\\n const result = me._process_result(response.toString('utf8'), null);\\n this._clamav_response_chunks = [];\\n if (me.settings.debug_mode) {\\n console.log(`${me.debug_label}: Result of scan:`, result);\\n console.log(`${me.debug_label}: It took ${_av_scan_time} seconds to scan the file(s).`);\\n clear_scan_benchmark();\\n }\\n\\n // NOTE: \\\"scan-complete\\\" could be called by the `handle_error` method.\\n // We don't want to to double-emit this message.\\n if (_scan_complete === false) {\\n _scan_complete = true;\\n this.emit('scan-complete', result);\\n }\\n })\\n // If connection timesout.\\n .on('timeout', () => {\\n this.emit('timeout', new Error('Connection to host/socket has timed out'));\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connection to host/socket has timed out`);\\n })\\n // When the ClamAV socket is ready to receive packets (this will probably never fire here)\\n .on('ready', () => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: ClamAV socket ready to receive`);\\n })\\n // When we are officially connected to the ClamAV socket (probably will never fire here)\\n .on('connect', () => {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Connected to ClamAV socket`);\\n })\\n // If an error is emitted from the ClamAV socket\\n .on('error', err => {\\n console.error(`${me.debug_label}: Error emitted from ClamAV socket: `, err);\\n handle_error(err);\\n })\\n // If ClamAV is sending stuff to us (ie, an \\\"OK\\\", \\\"Virus FOUND\\\", or \\\"ERROR\\\")\\n .on('data', cv_chunk => {\\n // Push this chunk to our results collection array\\n this._clamav_response_chunks.push(cv_chunk);\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Got result!`, cv_chunk.toString());\\n\\n // Parse what we've gotten back from ClamAV so far...\\n const response = Buffer.concat(this._clamav_response_chunks);\\n const result = me._process_result(response.toString(), null);\\n\\n // If there's an error supplied or if we detect a virus, stop stream immediately.\\n if (result instanceof NodeClamError || (typeof result === 'object' && 'is_infected' in result && result.is_infected === true)) {\\n // If a virus is detected...\\n if (typeof result === 'object' && 'is_infected' in result && result.is_infected === true) {\\n // handle_error(new NodeClamError(result, `Virus(es) found! ${'viruses' in result && Array.isArray(result.viruses) ? `Suspects: ${result.viruses.join(', ')}` : ''}`));\\n handle_error(null, true, result);\\n }\\n // If any other kind of error is detected...\\n else {\\n handle_error(result);\\n }\\n }\\n // For debugging purposes, spit out what was processed (if anything).\\n else {\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Processed Result: `, result, response.toString());\\n }\\n });\\n\\n if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing initial transform!`);\\n // Handle the chunk\\n do_transform();\\n } catch (err) {\\n // If there's an issue connecting to the ClamAV socket, this is where that's handled\\n if (me.settings.debug_mode) console.error(`${me.debug_label}: Error initiating socket to ClamAV: `, err);\\n handle_error(err);\\n }\\n } else {\\n //if (me.settings.debug_mode) console.log(`${me.debug_label}: Doing transform: ${++counter}`);\\n // Handle the chunk\\n do_transform();\\n }\\n }\",\n \"transform(o) {\\n // Check if o is a matrix and then left multiply it directly\\n if (Matrix_Matrix.isMatrixLike(o)) {\\n var matrix = new Matrix_Matrix(o);\\n return matrix.multiplyO(this);\\n } // Get the proposed transformations and the current transformations\\n\\n\\n var t = Matrix_Matrix.formatTransforms(o);\\n var current = this;\\n let {\\n x: ox,\\n y: oy\\n } = new Point_Point(t.ox, t.oy).transform(current); // Construct the resulting matrix\\n\\n var transformer = new Matrix_Matrix().translateO(t.rx, t.ry).lmultiplyO(current).translateO(-ox, -oy).scaleO(t.scaleX, t.scaleY).skewO(t.skewX, t.skewY).shearO(t.shear).rotateO(t.theta).translateO(ox, oy); // If we want the origin at a particular place, we force it there\\n\\n if (isFinite(t.px) || isFinite(t.py)) {\\n const origin = new Point_Point(ox, oy).transform(transformer); // TODO: Replace t.px with isFinite(t.px)\\n\\n const dx = t.px ? t.px - origin.x : 0;\\n const dy = t.py ? t.py - origin.y : 0;\\n transformer.translateO(dx, dy);\\n } // Translate now after positioning\\n\\n\\n transformer.translateO(t.tx, t.ty);\\n return transformer;\\n }\",\n \"transform()\\n {\\n super.transform();\\n \\n spriteStrategyManager.transform();\\n }\",\n \"transformVertices(transformFunction) {\\n this.checkVertices();\\n var vert = this.verts;\\n\\n for (let i = 0; i < vert.length; i += 3) {\\n let transform = transformFunction(vert[i], vert[i + 1], vert[i + 2]);\\n if (transform) {\\n vert[i] += transform[0];\\n vert[i + 1] += transform[1];\\n vert[i + 2] += transform[2];\\n }\\n }\\n this.verts = vert;\\n }\",\n \"updateLocalTransform()\\n {\\n // empty\\n }\",\n \"transform(ref, op) {\\n var {\\n current,\\n affinity\\n } = ref;\\n\\n if (current == null) {\\n return;\\n }\\n\\n var path = Path.transform(current, op, {\\n affinity\\n });\\n ref.current = path;\\n\\n if (path == null) {\\n ref.unref();\\n }\\n }\",\n \"transform(ref, op) {\\n var {\\n current,\\n affinity\\n } = ref;\\n\\n if (current == null) {\\n return;\\n }\\n\\n var path = Path.transform(current, op, {\\n affinity\\n });\\n ref.current = path;\\n\\n if (path == null) {\\n ref.unref();\\n }\\n }\",\n \"function LinkTransform(opts, readStream, writeStream, timeout) {\\n if (!(this instanceof LinkTransform)) { return new LinkTransform(opts, readStream, writeStream, timeout); }\\n this._opts = opts;\\n this._readStream = readStream;\\n this._writeStream = writeStream;\\n\\n // Create the protocol wrapper streams\\n var decodeStream = metaWrapStream.decodeMetaWrapStream();\\n readStream.pipe(decodeStream);\\n\\n var encodeStream = metaWrapStream.encodeMetaWrapStream();\\n encodeStream.pipe(writeStream);\\n\\n // Wrap the streams in heartbeat.\\n if (timeout) {\\n timeout = Math.floor(timeout / 2);\\n }\\n\\n var pair = heartbeatStream(timeout);\\n var heartbeatSend = pair.encode;\\n var heartbeatRead = pair.decode;\\n\\n heartbeatSend.pipe(encodeStream);\\n decodeStream.pipe(heartbeatRead);\\n\\n // Wrap with a link stream.\\n var stream = this._linkStream = linkStream({\\n readTransport: heartbeatRead,\\n sendTransport: heartbeatSend\\n }, opts);\\n\\n // If the heartbeat timer detects an issue, end the transport.\\n heartbeatSend.on('heartbeat-timeout', function() {\\n stream.end();\\n });\\n}\",\n \"function TransformBase()\\n{\\n /**\\n * The global matrix transform. It can be swapped temporarily by some functions like getLocalBounds()\\n *\\n * @member {PIXI.Matrix}\\n */\\n this.worldTransform = new math.Matrix();\\n /**\\n * The local matrix transform\\n * \\n * @member {PIXI.Matrix}\\n */\\n this.localTransform = new math.Matrix();\\n\\n this._worldID = 0;\\n}\",\n \"function transform (p, fn) {\\n return () => {\\n const result = p()\\n return result === null ? null : fn(result)\\n }\\n }\",\n \"function forEachTransform(args, math, scope) {\\n var x, callback;\\n\\n if (args[0]) {\\n x = args[0].compile().evaluate(scope);\\n }\\n\\n if (args[1]) {\\n if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\\n // a function pointer, like forEach([3, -2, 5], myTestFunction)\\n callback = args[1].compile().evaluate(scope);\\n } else {\\n // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )\\n callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\\n }\\n }\\n\\n return _forEach(x, callback);\\n }\",\n \"transform(path, operation) {\\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\\n return Object(__WEBPACK_IMPORTED_MODULE_1_immer__[\\\"d\\\" /* produce */])(path, p => {\\n var {\\n affinity = 'forward'\\n } = options; // PERF: Exit early if the operation is guaranteed not to have an effect.\\n\\n if (path.length === 0) {\\n return;\\n }\\n\\n switch (operation.type) {\\n case 'insert_node':\\n {\\n var {\\n path: op\\n } = operation;\\n\\n if (Path.equals(op, p) || Path.endsBefore(op, p) || Path.isAncestor(op, p)) {\\n p[op.length - 1] += 1;\\n }\\n\\n break;\\n }\\n\\n case 'remove_node':\\n {\\n var {\\n path: _op\\n } = operation;\\n\\n if (Path.equals(_op, p) || Path.isAncestor(_op, p)) {\\n return null;\\n } else if (Path.endsBefore(_op, p)) {\\n p[_op.length - 1] -= 1;\\n }\\n\\n break;\\n }\\n\\n case 'merge_node':\\n {\\n var {\\n path: _op2,\\n position\\n } = operation;\\n\\n if (Path.equals(_op2, p) || Path.endsBefore(_op2, p)) {\\n p[_op2.length - 1] -= 1;\\n } else if (Path.isAncestor(_op2, p)) {\\n p[_op2.length - 1] -= 1;\\n p[_op2.length] += position;\\n }\\n\\n break;\\n }\\n\\n case 'split_node':\\n {\\n var {\\n path: _op3,\\n position: _position\\n } = operation;\\n\\n if (Path.equals(_op3, p)) {\\n if (affinity === 'forward') {\\n p[p.length - 1] += 1;\\n } else if (affinity === 'backward') ; else {\\n return null;\\n }\\n } else if (Path.endsBefore(_op3, p)) {\\n p[_op3.length - 1] += 1;\\n } else if (Path.isAncestor(_op3, p) && path[_op3.length] >= _position) {\\n p[_op3.length - 1] += 1;\\n p[_op3.length] -= _position;\\n }\\n\\n break;\\n }\\n\\n case 'move_node':\\n {\\n var {\\n path: _op4,\\n newPath: onp\\n } = operation; // If the old and new path are the same, it's a no-op.\\n\\n if (Path.equals(_op4, onp)) {\\n return;\\n }\\n\\n if (Path.isAncestor(_op4, p) || Path.equals(_op4, p)) {\\n var copy = onp.slice();\\n\\n if (Path.endsBefore(_op4, onp) && _op4.length < onp.length) {\\n copy[_op4.length - 1] -= 1;\\n }\\n\\n return copy.concat(p.slice(_op4.length));\\n } else if (Path.isSibling(_op4, onp) && (Path.isAncestor(onp, p) || Path.equals(onp, p))) {\\n if (Path.endsBefore(_op4, p)) {\\n p[_op4.length - 1] -= 1;\\n } else {\\n p[_op4.length - 1] += 1;\\n }\\n } else if (Path.endsBefore(onp, p) || Path.equals(onp, p) || Path.isAncestor(onp, p)) {\\n if (Path.endsBefore(_op4, p)) {\\n p[_op4.length - 1] -= 1;\\n }\\n\\n p[onp.length - 1] += 1;\\n } else if (Path.endsBefore(_op4, p)) {\\n if (Path.equals(onp, p)) {\\n p[onp.length - 1] += 1;\\n }\\n\\n p[_op4.length - 1] -= 1;\\n }\\n\\n break;\\n }\\n }\\n });\\n }\",\n \"function perform_transform(inputAndParameters, payload, transNode, debug) {\\n if (debug == undefined) debug = false;\\n var output = [];\\n var outputarray = [];\\n\\n\\tvar address = inputAndParameters.address;\\n\\tvar parameters = inputAndParameters.parameters;\\n\\t\\n if(transNode.type == \\\"JAVASCRIPT\\\") {\\n\\t\\tif(debug) console.log('Performing JAVASCRIPT on transformer ' + transNode.id);\\n\\t\\t//This eval needs to be cleaned up/secured so code can't be run on the server.\\n\\t\\teval(transNode.process);\\t\\n\\t\\t\\n\\t} else if(transNode.type == \\\"PASSTHROUGH\\\"){\\n\\t\\tif(debug) console.log('Performing PASSTHROUGH on transformer ' + transNode.id);\\n\\t\\t//need to go over each output defined in the array as we don't specically know which output is a passthrough.\\n\\t\\tfor(outputID in transNode.output){\\n\\t\\t\\toutput[transNode.output[outputID]] = payload;\\n\\t\\t}\\n\\t}\\n\\treturn output;\\n}\",\n \"function transform() { \\n return d3.geoTransform({\\n point: function(x, y) {\\n if(x && y) {\\n var point = map.latLngToLayerPoint(new L.LatLng(y, x));\\n this.stream.point(point.x, point.y);\\n }\\n }\\n })\\n }\",\n \"function pipe(fs) {\\n return function(x) {\\n return reduce (T) (x) (fs);\\n };\\n }\",\n \"transform(ref, op) {\\n var {\\n current,\\n affinity\\n } = ref;\\n\\n if (current == null) {\\n return;\\n }\\n\\n var path = Range.transform(current, op, {\\n affinity\\n });\\n ref.current = path;\\n\\n if (path == null) {\\n ref.unref();\\n }\\n }\",\n \"transform(ref, op) {\\n var {\\n current,\\n affinity\\n } = ref;\\n\\n if (current == null) {\\n return;\\n }\\n\\n var path = Range.transform(current, op, {\\n affinity\\n });\\n ref.current = path;\\n\\n if (path == null) {\\n ref.unref();\\n }\\n }\",\n \"function CollectStream() {\\n stream.Transform.call(this);\\n this._chunks = [];\\n this._transform = (chunk, enc, cb) => { this._chunks.push(chunk); cb(); }\\n this.collect = () => { return Buffer.concat(this._chunks); this._chunks = []; }\\n}\",\n \"function mapTransform(args, math, scope) {\\n var x, callback;\\n\\n if (args[0]) {\\n x = args[0].compile().evaluate(scope);\\n }\\n\\n if (args[1]) {\\n if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\\n // a function pointer, like filter([3, -2, 5], myTestFunction)\\n callback = args[1].compile().evaluate(scope);\\n } else {\\n // an expression like filter([3, -2, 5], x > 0)\\n callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\\n }\\n }\\n\\n return map(x, callback);\\n }\",\n \"transform(transforms, relative, affine) {\\n // If we have a declarative function, we should retarget it if possible\\n relative = transforms.relative || relative;\\n\\n if (this._isDeclarative && !relative && this._tryRetarget('transform', transforms)) {\\n return this;\\n } // Parse the parameters\\n\\n\\n var isMatrix = Matrix_Matrix.isMatrixLike(transforms);\\n affine = transforms.affine != null ? transforms.affine : affine != null ? affine : !isMatrix; // Create a morepher and set its type\\n\\n const morpher = new Morphable_Morphable(this._stepper).type(affine ? TransformBag : Matrix_Matrix);\\n let origin;\\n let element;\\n let current;\\n let currentAngle;\\n let startTransform;\\n\\n function setup() {\\n // make sure element and origin is defined\\n element = element || this.element();\\n origin = origin || getOrigin(transforms, element);\\n startTransform = new Matrix_Matrix(relative ? undefined : element); // add the runner to the element so it can merge transformations\\n\\n element._addRunner(this); // Deactivate all transforms that have run so far if we are absolute\\n\\n\\n if (!relative) {\\n element._clearTransformRunnersBefore(this);\\n }\\n }\\n\\n function run(pos) {\\n // clear all other transforms before this in case something is saved\\n // on this runner. We are absolute. We dont need these!\\n if (!relative) this.clearTransform();\\n let {\\n x,\\n y\\n } = new Point_Point(origin).transform(element._currentTransform(this));\\n let target = new Matrix_Matrix(Runner_objectSpread({}, transforms, {\\n origin: [x, y]\\n }));\\n let start = this._isDeclarative && current ? current : startTransform;\\n\\n if (affine) {\\n target = target.decompose(x, y);\\n start = start.decompose(x, y); // Get the current and target angle as it was set\\n\\n const rTarget = target.rotate;\\n const rCurrent = start.rotate; // Figure out the shortest path to rotate directly\\n\\n const possibilities = [rTarget - 360, rTarget, rTarget + 360];\\n const distances = possibilities.map(a => Math.abs(a - rCurrent));\\n const shortest = Math.min(...distances);\\n const index = distances.indexOf(shortest);\\n target.rotate = possibilities[index];\\n }\\n\\n if (relative) {\\n // we have to be careful here not to overwrite the rotation\\n // with the rotate method of Matrix\\n if (!isMatrix) {\\n target.rotate = transforms.rotate || 0;\\n }\\n\\n if (this._isDeclarative && currentAngle) {\\n start.rotate = currentAngle;\\n }\\n }\\n\\n morpher.from(start);\\n morpher.to(target);\\n let affineParameters = morpher.at(pos);\\n currentAngle = affineParameters.rotate;\\n current = new Matrix_Matrix(affineParameters);\\n this.addTransform(current);\\n\\n element._addRunner(this);\\n\\n return morpher.done();\\n }\\n\\n function retarget(newTransforms) {\\n // only get a new origin if it changed since the last call\\n if ((newTransforms.origin || 'center').toString() !== (transforms.origin || 'center').toString()) {\\n origin = getOrigin(transforms, element);\\n } // overwrite the old transformations with the new ones\\n\\n\\n transforms = Runner_objectSpread({}, newTransforms, {\\n origin\\n });\\n }\\n\\n this.queue(setup, run, retarget, true);\\n this._isDeclarative && this._rememberMorpher('transform', morpher);\\n return this;\\n }\",\n \"transformed(transform){\\n let result = new AffineTransform();\\n\\n result.position = this.position.copy();\\n result.position.mult(transform.scale);\\n\\n let rotated = new p5.Vector(result.position.x, result.position.y).rotate(transform.rotation);\\n\\n result.position.x = rotated.x;\\n result.position.y = rotated.y;\\n result.position.add(transform.position);\\n\\n result.scale = this.scale.copy();\\n result.scale.mult(transform.scale);\\n\\n result.rotation = this.rotation + transform.rotation;\\n\\n return result;\\n }\",\n \"transform(matrix) {\\n return matrix ? matrix._transformPoint(this) : this;\\n }\",\n \"function createUploadContainer(){\\n\\n function transform( requestOptions, _, next ){\\n\\n requestOptions.method = 'post';\\n\\n sendRequest( requestOptions, null, ( err, response )=>{\\n\\n if( err ){\\n\\n process.nextTick( next.bind( null, err ) );\\n\\n }else{\\n\\n process.nextTick( next.bind( null, null, response ) );\\n\\n }\\n\\n } );\\n \\n }\\n\\n return require( 'stream' ).Transform( {\\n objectMode: true,\\n transform,\\n flush: require( 'tessa-common/lib/stream/util/just-flush' )\\n } );\\n\\n}\",\n \"function pipeExec(fn) {\\n\\n\\t\\tlet canExec = true;\\n\\n\\t\\tfunction transform(chunk, enc, cb) {\\n\\t\\t\\tif (canExec) {\\n\\t\\t\\t\\tfn();\\n\\t\\t\\t\\tcanExec = false;\\n\\t\\t\\t}\\n\\t\\t\\tcb(null, chunk);\\n\\t\\t}\\n\\n\\t\\tfunction flush(cb) {\\n\\t\\t\\tcanExec = false;\\n\\t\\t\\tcb();\\n\\t\\t}\\n\\n\\t\\treturn lib.through.obj(null, transform, flush);\\n\\n\\t}\",\n \"function f(e,t,n,o){const r=\\\"function\\\"==typeof n.transform,s=r?n.transform:y;if(Array.isArray(e)){const i=[],a=e.length;for(let c=0;c<a;++c){let a=e[c];const l=Array.isArray(o)?o[c]:o;if((m(a)||n.retainNullValues&&null==a||r)&&(r&&(a=s(m(a)?a:null,l)),d(a,t),i.push(a),t.originalLimit&&i.length>=t.originalLimit))break}for(;e.length>i.length;)Array.prototype.pop.apply(e,[]);for(let t=0;t<i.length;++t)e[t]=i[t];return e}return m(e)?(d(e,t),s(e,o)):e instanceof Map?e:!0===n.justOne?s(null==e?e:null,o):!1===n.justOne?[]:s(null==e?e:null,o)}\",\n \"_transform(data, done){\\r\\n this.stdio.stdin.splitPush(data)\\r\\n this.fork.stdin.write(data) && done() || this.fork.stdin.on('drain', done)\\r\\n }\",\n \"function tjs_gulp_transformFile(file) {\\n\\t// console.log(file)\\n\\treturn `gulp.task('${file.file}', function() {\\n\\tlet pipe = gulp.src('${file.file}', { base: __dirname })\\n\\n\\t// pre-piping\\n\\tif (typeof __t.start == 'function')\\n\\t\\tpipe = pipe.pipe(__t.start.bind(pipe)())\\n\\n\\t${file.transforms.length == 0 ? `if (typeof __t.blank == 'function') pipe = __t.blank.bind(pipe)()` : ''}\\n\\n\\t${file.transforms.map(t => `// pipe setup for ${t.name}\\n\\tpipe = __t.${t.name}.bind(pipe)${t.argsTuple}\\n\\tif (typeof __t.each == 'function') pipe = pipe.pipe(__t.each.bind(pipe)())`).join('\\\\n\\\\t')}\\n\\n\\t// post-piping\\n\\tif (typeof __t.finish == 'function')\\n\\t\\tpipe = pipe.pipe(__t.finish.bind(pipe)())\\n\\t\\n\\treturn pipe\\n})`\\n}\",\n \"function transform(el, value) {\\n el.style['transform'] = value;\\n el.style['webkitTransform'] = value;\\n}\",\n \"function transform_script(script) {\\n idents.reset()\\n scan_for_functions_to_transform(script).forEach(transform_function)\\n\\n // Post-processing. The script is already valid, but we clean up redundancies to improve readability of the output.\\n replace_passthrough_callbacks(script)\\n replace_passthrough_functions(script)\\n inline_functions_only_called_once(script)\\n}\",\n \"function mapTransform (args, math, scope) {\\n let x, callback\\n\\n if (args[0]) {\\n x = args[0].compile().evaluate(scope)\\n }\\n\\n if (args[1]) {\\n if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {\\n // a function pointer, like filter([3, -2, 5], myTestFunction)\\n callback = args[1].compile().evaluate(scope)\\n } else {\\n // an expression like filter([3, -2, 5], x > 0)\\n callback = compileInlineExpression(args[1], math, scope)\\n }\\n }\\n\\n return map(x, callback)\\n }\",\n \"function TransformStatic()\\n{\\n TransformBase.call(this);\\n /**\\n * The coordinate of the object relative to the local coordinates of the parent.\\n *\\n * @member {PIXI.ObservablePoint}\\n */\\n this.position = new math.ObservablePoint(this.onChange, this,0,0);\\n\\n /**\\n * The scale factor of the object.\\n *\\n * @member {PIXI.ObservablePoint}\\n */\\n this.scale = new math.ObservablePoint(this.onChange, this,1,1);\\n\\n /**\\n * The pivot point of the displayObject that it rotates around\\n *\\n * @member {PIXI.ObservablePoint}\\n */\\n this.pivot = new math.ObservablePoint(this.onChange, this,0, 0);\\n\\n /**\\n * The skew amount, on the x and y axis.\\n *\\n * @member {PIXI.ObservablePoint}\\n */\\n this.skew = new math.ObservablePoint(this.updateSkew, this,0, 0);\\n\\n this._rotation = 0;\\n\\n this._sr = Math.sin(0);\\n this._cr = Math.cos(0);\\n this._cy = Math.cos(0);//skewY);\\n this._sy = Math.sin(0);//skewY);\\n this._nsx = Math.sin(0);//skewX);\\n this._cx = Math.cos(0);//skewX);\\n\\n this._localID = 0;\\n this._currentLocalID = 0;\\n}\",\n \"function transform( el, value ) {\\n\\tvar style = el.style;\\n\\n\\tstyle.transform = value;\\n\\tstyle.webkitTransform = value;\\n\\tstyle.oTransform = value;\\n\\tstyle.msTransform = value;\\n}\",\n \"transform(point, op) {\\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\\n return fn(point, p => {\\n if (p === null) {\\n return null;\\n }\\n\\n var {\\n affinity = 'forward'\\n } = options;\\n var {\\n path,\\n offset\\n } = p;\\n\\n switch (op.type) {\\n case 'insert_node':\\n case 'move_node':\\n {\\n p.path = Path.transform(path, op, options);\\n break;\\n }\\n\\n case 'insert_text':\\n {\\n if (Path.equals(op.path, path) && op.offset <= offset) {\\n p.offset += op.text.length;\\n }\\n\\n break;\\n }\\n\\n case 'merge_node':\\n {\\n if (Path.equals(op.path, path)) {\\n p.offset += op.position;\\n }\\n\\n p.path = Path.transform(path, op, options);\\n break;\\n }\\n\\n case 'remove_text':\\n {\\n if (Path.equals(op.path, path) && op.offset <= offset) {\\n p.offset -= Math.min(offset - op.offset, op.text.length);\\n }\\n\\n break;\\n }\\n\\n case 'remove_node':\\n {\\n if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\\n return null;\\n }\\n\\n p.path = Path.transform(path, op, options);\\n break;\\n }\\n\\n case 'split_node':\\n {\\n if (Path.equals(op.path, path)) {\\n if (op.position === offset && affinity == null) {\\n return null;\\n } else if (op.position < offset || op.position === offset && affinity === 'forward') {\\n p.offset -= op.position;\\n p.path = Path.transform(path, op, _objectSpread$6(_objectSpread$6({}, options), {}, {\\n affinity: 'forward'\\n }));\\n }\\n } else {\\n p.path = Path.transform(path, op, options);\\n }\\n\\n break;\\n }\\n }\\n });\\n }\",\n \"function transformItem(stream, item) {\\n var ret;\\n if (isArray(item)) {\\n if (isHashArray(item)) {\\n ret = transformHashArrayData(stream, item);\\n } else {\\n ret = transformArrayData(stream, item);\\n }\\n } else {\\n ret = transformHashData(stream, item);\\n }\\n return ret;\\n}\",\n \"function transformItem(stream, item) {\\n var ret;\\n if (isArray(item)) {\\n if (isHashArray(item)) {\\n ret = transformHashArrayData(stream, item);\\n } else {\\n ret = transformArrayData(stream, item);\\n }\\n } else {\\n ret = transformHashData(stream, item);\\n }\\n return ret;\\n}\",\n \"function transform(context, file, fileSet, next) {\\n if (stats(file).fatal) {\\n next()\\n } else {\\n debug('Transforming document `%s`', file.path)\\n context.processor.run(context.tree, file, onrun)\\n }\\n\\n function onrun(error, node) {\\n debug('Transformed document (error: %s)', error)\\n context.tree = node\\n next(error)\\n }\\n}\",\n \"transform(e3v) {\\nreturn (this._r.rotate(e3v)).setAdd(this._t);\\n}\",\n \"_transform( data, encoding, streamCallback )\\n {\\n // convert buffer to string\\n const text = data.toString( this.stringEncoding )\\n\\n // split data at newline\\n const lines = text.split( this.newlineCharacter )\\n\\n // prepend previously buffered data to first line\\n lines[0] = this.lineBuffer + lines[0]\\n\\n // last \\\"line\\\" is probably not a complete line,\\n // remove it from the processing array and store it for next time\\n this.lineBuffer = lines.pop()\\n\\n // process and push data with adding newline back\\n this.handleLines( streamCallback, this.transformCallback, lines, this.newlineCharacter )\\n }\",\n \"function Transform(area, root) {\\n this.area = area;\\n this.root = root.tag();\\n}\",\n \"transform(chunk, encoding, callback) {\\n compressChunk(compressor, encoding, chunk)\\n .then(data => callback(null, data))\\n .catch(callback);\\n }\",\n \"function transform ( p, fn ) {\\n\\t\\t\\t\\treturn function () {\\n\\t\\t\\t\\t\\tvar result = p();\\n\\n\\t\\t\\t\\t\\treturn result === null ? null : fn( result );\\n\\t\\t\\t\\t};\\n\\t\\t\\t}\",\n \"function Transform(str) {\\r\\n\\t\\tif (typeof str === 'string') {\\r\\n\\t\\t\\tthis.parse(str);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"ohlcv() {\\n const self = this\\n const stream = new Transform({\\n objectMode: true,\\n transform(chunk, encoding, callback) {\\n self.analyze(chunk, callback)\\n }\\n })\\n return stream\\n }\",\n \"function Transform() { // eslint-disable-line no-unused-vars\\n\\n var request = new XMLHttpRequest();\\n\\n setLocalStorageItem('code', cppEditor.getValue());\\n setLocalStorageItem('insightsOptions', getInsightsOptions());\\n\\n request.onreadystatechange = function() {\\n if (this.readyState == 4 && this.status == 200) {\\n var response = JSON.parse(this.responseText);\\n cppOutEditor.setValue(response.stdout);\\n stdErrEditor.setValue(response.stderr);\\n SetRunListeners();\\n } else if (this.readyState == 4 && this.status != 200) {\\n stdErrEditor.setValue('Sorry, your request failed');\\n SetRunListeners();\\n }\\n };\\n\\n stdErrEditor.setValue('Waiting for response...');\\n\\n var url = buildURL('/api/v1/transform');\\n\\n request.open('POST', url, true);\\n request.setRequestHeader('Content-Type', 'application/json;charset=UTF-8');\\n\\n var data = {};\\n\\n data.insightsOptions = getInsightsOptions();\\n data.code = cppEditor.getValue();\\n\\n SetWaitForResultListeners();\\n request.send(JSON.stringify(data));\\n}\",\n \"function trackTransforms(ctx){\\n let svg = document.createElementNS(\\\"http://www.w3.org/2000/svg\\\",'svg');\\n let xform = svg.createSVGMatrix();\\n ctx.getTransform = function(){ return xform; };\\n\\n let savedTransforms = [];\\n let save = ctx.save;\\n ctx.save = function(){\\n savedTransforms.push(xform.translate(0,0));\\n return save.call(ctx);\\n };\\n\\n let restore = ctx.restore;\\n ctx.restore = function(){\\n xform = savedTransforms.pop();\\n return restore.call(ctx);\\n };\\n\\n let scale = ctx.scale;\\n ctx.scale = function(sx,sy){\\n xform = xform.scaleNonUniform(sx,sy);\\n return scale.call(ctx,sx,sy);\\n };\\n\\n let rotate = ctx.rotate;\\n ctx.rotate = function(radians){\\n xform = xform.rotate(radians*180/Math.PI);\\n return rotate.call(ctx,radians);\\n };\\n\\n let translate = ctx.translate;\\n ctx.translate = function(dx,dy){\\n xform = xform.translate(dx,dy);\\n return translate.call(ctx,dx,dy);\\n };\\n\\n let transform = ctx.transform;\\n ctx.transform = function(a,b,c,d,e,f){\\n var m2 = svg.createSVGMatrix();\\n m2.a=a; m2.b=b; m2.c=c; m2.d=d; m2.e=e; m2.f=f;\\n xform = xform.multiply(m2);\\n return transform.call(ctx,a,b,c,d,e,f);\\n };\\n\\n let setTransform = ctx.setTransform;\\n ctx.setTransform = function(a,b,c,d,e,f){\\n xform.a = a;\\n xform.b = b;\\n xform.c = c;\\n xform.d = d;\\n xform.e = e;\\n xform.f = f;\\n return setTransform.call(ctx,a,b,c,d,e,f);\\n };\\n\\n let pt = svg.createSVGPoint();\\n ctx.transformedPoint = function(x,y){\\n pt.x=x; pt.y=y;\\n return pt.matrixTransform(xform.inverse());\\n }\\n}\",\n \"_transform(chunk,encoding,cb) {\\n\\n const uint8_view = new Uint8Array(chunk, 0, chunk.length);\\n var dataView = new DataView(uint8_view.buffer);\\n\\n let iFloat = Array(this.sz*2);\\n let asComplex = Array(this.sz);\\n\\n\\n // for(let i = 0; i < this.sz*2; i+=1) {\\n // iFloat[i] = dataView.getFloat64(i*8, true);\\n // }\\n\\n for(let i = 0; i < this.sz*2; i+=2) {\\n let re = dataView.getFloat64(i*8, true);\\n let im = dataView.getFloat64((i*8)+8, true);\\n\\n asComplex[i/2] = mt.complex(re,im);\\n\\n iFloat[i] = re;\\n iFloat[i+1] = im;\\n\\n // if( i < 16 ) {\\n // console.log(re);\\n // }\\n\\n }\\n\\n let iShort = mutil.IFloatToIShortMulti(iFloat);\\n\\n if( this.onFrameIShort !== null ) {\\n this.onFrameIShort(iShort);\\n }\\n\\n // console.log(\\\"iFloat length \\\" + iFloat.length);\\n // console.log(iFloat.slice(0,16));\\n\\n // console.log(\\\"iShort length \\\" + iShort.length);\\n // console.log(iShort.slice(0,16));\\n\\n\\n this.handleDefaultStream(iFloat,iShort,asComplex);\\n this.handleFineSync(iFloat,iShort,asComplex);\\n this.handleAllSubcarriers(iFloat,iShort,asComplex);\\n this.handleDemodData(iFloat,iShort,asComplex);\\n\\n\\n // for(x of iFloat) {\\n // console.log(x);\\n // }\\n\\n\\n this.uint.frame_track_counter++;\\n cb();\\n }\",\n \"transform (matrix) {\\n return new Point(this.native().matrixTransform(matrix))\\n }\",\n \"static getTransform({ x = 0, y = 0, zoom = 1, width, targetWidth }) {\\n let nextX = x;\\n const windowWidth = getWindowWidth();\\n if (width > windowWidth) {\\n nextX += (windowWidth - width) / 2;\\n }\\n const scaleFactor = zoom * (targetWidth / width);\\n\\n return {\\n transform: `translate3d(${nextX}px,${y}px,0) scale3d(${scaleFactor},${scaleFactor},1)`,\\n };\\n }\",\n \"processTransform(context, result, inputParams, index) {\\n var _a;\\n result.element = (_a = result.element) !== null && _a !== void 0 ? _a : [];\\n const element = inputParams.element;\\n const a = +inputParams.a;\\n const b = +inputParams.b;\\n const c = +inputParams.c;\\n const d = +inputParams.d;\\n const e = +inputParams.e;\\n const f = +inputParams.f;\\n const matrix = new SVG.Matrix({ a: a, b: b, c: c, d: d, e: e, f: f });\\n this.applyMatrix(element, matrix);\\n result.element.push(element);\\n }\",\n \"_processBabel(file) {\\n// Return a through Transform stream, in which we transform source code with babel......\\n return through( function(chunk, enc, done) {\\n let {code} = babel.transformSync(chunk.toString(), {\\n babelrc: true,\\n filename: file\\n })\\n\\n// Push result to stream....\\n this.push(code)\\n\\n// Call callback.....\\n done()\\n })\\n }\",\n \"function transform( xslSrc, filterKey, filterValue, arg )\\r\\n{\\r\\n // load the xsl stylesheet\\r\\n var xsl = new ActiveXObject(\\\"Msxml2.FreeThreadedDOMDocument.3.0\\\");\\r\\n xsl.async = false;\\r\\n xsl.load(xslSrc);\\r\\n\\r\\n // create xsl template from xsl document\\r\\n var xslt = new ActiveXObject(\\\"Msxml2.XSLTemplate.3.0\\\");\\r\\n xslt.stylesheet = xsl;\\r\\n\\r\\n // create processor and feed xml\\r\\n var processor = xslt.createProcessor();\\t\\t\\r\\n processor.input = xml;\\r\\n \\r\\n if ( typeof(arg) != \\\"undefined\\\" ) \\r\\n {\\r\\n processor.addParameter(\\\"OUTPUTPATH\\\",arg);\\r\\n }\\r\\n\\r\\n\\tprocessor.addParameter( filterKey, filterValue ) ;\\r\\n processor.addParameter( \\\"package\\\", package ) ;\\r\\n\\r\\n\\r\\n // do the magic\\r\\n processor.transform();\\r\\n\\r\\n return processor.output;\\r\\n}\",\n \"multiply(transform) {\\n const rotation = this.rotation.mul(transform.rotation);\\n const trans = this.apply({position: transform.getTranslation()});\\n\\n return new Transform({\\n translation: trans.position,\\n rotation\\n });\\n }\",\n \"function transformSync(src, filename, options) {\\n validateArguments(src, filename);\\n const normalizedOptions = options_1.validateTransformOptions(options);\\n return transformFile(src, filename, normalizedOptions);\\n}\",\n \"function AddTransformer() {}\",\n \"function FastMessageEncoder()\\n{\\n\\tmod_stream.Transform.call(this, {\\n\\t 'highWaterMark': 16,\\n\\t 'objectMode': true\\n\\t});\\n}\",\n \"function trackTransforms(ctx){\\n var svg = document.createElementNS(\\\"http://www.w3.org/2000/svg\\\",'svg');\\n var xform = svg.createSVGMatrix();\\n ctx.getTransform = function(){ return xform; };\\n\\n var savedTransforms = [];\\n var save = ctx.save;\\n ctx.save = function(){\\n savedTransforms.push(xform.translate(0,0));\\n return save.call(ctx);\\n };\\n\\n var restore = ctx.restore;\\n ctx.restore = function(){\\n xform = savedTransforms.pop();\\n return restore.call(ctx);\\n };\\n\\n var scale = ctx.scale;\\n ctx.scale = function(sx,sy){\\n xform = xform.scaleNonUniform(sx,sy);\\n return scale.call(ctx,sx,sy);\\n };\\n\\n var rotate = ctx.rotate;\\n ctx.rotate = function(radians){\\n xform = xform.rotate(radians*180/Math.PI);\\n return rotate.call(ctx,radians);\\n };\\n\\n var translate = ctx.translate;\\n ctx.translate = function(dx,dy){\\n xform = xform.translate(dx,dy);\\n return translate.call(ctx,dx,dy);\\n };\\n\\n var transform = ctx.transform;\\n ctx.transform = function(a,b,c,d,e,f){\\n var m2 = svg.createSVGMatrix();\\n m2.a=a; m2.b=b; m2.c=c; m2.d=d; m2.e=e; m2.f=f;\\n xform = xform.multiply(m2);\\n return transform.call(ctx,a,b,c,d,e,f);\\n };\\n\\n var setTransform = ctx.setTransform;\\n ctx.setTransform = function(a,b,c,d,e,f){\\n xform.a = a;\\n xform.b = b;\\n xform.c = c;\\n xform.d = d;\\n xform.e = e;\\n xform.f = f;\\n return setTransform.call(ctx,a,b,c,d,e,f);\\n };\\n\\n var pt = svg.createSVGPoint();\\n ctx.transformedPoint = function(x,y){\\n pt.x=x; pt.y=y;\\n return pt.matrixTransform(xform.inverse());\\n }\\n ctx.transformedPointBack = function(x,y){\\n pt.x=x; pt.y=y;\\n return pt.matrixTransform(xform);\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.72023124","0.6511461","0.6511461","0.6511461","0.6511461","0.6387618","0.6365295","0.6328733","0.6328733","0.6328733","0.6328733","0.6131349","0.60108596","0.5802047","0.58001786","0.5791837","0.5763781","0.5761768","0.5692121","0.56904036","0.56904036","0.56874245","0.56843024","0.567538","0.5663154","0.56540376","0.558498","0.55597544","0.55163735","0.55129945","0.55123425","0.55024195","0.549086","0.549086","0.5488301","0.54491574","0.54362386","0.5432633","0.542943","0.5393483","0.53795195","0.5379025","0.5363699","0.5357374","0.53559744","0.53530514","0.53530514","0.5352819","0.5349383","0.53484464","0.5345819","0.5340593","0.5339702","0.532776","0.53089225","0.52981585","0.52981585","0.5272268","0.52709055","0.52703613","0.5267369","0.52595073","0.525758","0.52546185","0.5234585","0.52326554","0.52274805","0.52220225","0.5218423","0.5199479","0.5194609","0.5190722","0.51881313","0.51864976","0.51864976","0.5172962","0.5158727","0.51484203","0.5147171","0.51236457","0.51205254","0.51164573","0.51098853","0.51062334","0.5087755","0.50870156","0.5067805","0.5066551","0.5064679","0.50627697","0.5047121","0.5041054","0.5024063","0.5023791","0.5023153","0.5022585"],"string":"[\n \"0.72023124\",\n \"0.6511461\",\n \"0.6511461\",\n \"0.6511461\",\n \"0.6511461\",\n \"0.6387618\",\n \"0.6365295\",\n \"0.6328733\",\n \"0.6328733\",\n \"0.6328733\",\n \"0.6328733\",\n \"0.6131349\",\n \"0.60108596\",\n \"0.5802047\",\n \"0.58001786\",\n \"0.5791837\",\n \"0.5763781\",\n \"0.5761768\",\n \"0.5692121\",\n \"0.56904036\",\n \"0.56904036\",\n \"0.56874245\",\n \"0.56843024\",\n \"0.567538\",\n \"0.5663154\",\n \"0.56540376\",\n \"0.558498\",\n \"0.55597544\",\n \"0.55163735\",\n \"0.55129945\",\n \"0.55123425\",\n \"0.55024195\",\n \"0.549086\",\n \"0.549086\",\n \"0.5488301\",\n \"0.54491574\",\n \"0.54362386\",\n \"0.5432633\",\n \"0.542943\",\n \"0.5393483\",\n \"0.53795195\",\n \"0.5379025\",\n \"0.5363699\",\n \"0.5357374\",\n \"0.53559744\",\n \"0.53530514\",\n \"0.53530514\",\n \"0.5352819\",\n \"0.5349383\",\n \"0.53484464\",\n \"0.5345819\",\n \"0.5340593\",\n \"0.5339702\",\n \"0.532776\",\n \"0.53089225\",\n \"0.52981585\",\n \"0.52981585\",\n \"0.5272268\",\n \"0.52709055\",\n \"0.52703613\",\n \"0.5267369\",\n \"0.52595073\",\n \"0.525758\",\n \"0.52546185\",\n \"0.5234585\",\n \"0.52326554\",\n \"0.52274805\",\n \"0.52220225\",\n \"0.5218423\",\n \"0.5199479\",\n \"0.5194609\",\n \"0.5190722\",\n \"0.51881313\",\n \"0.51864976\",\n \"0.51864976\",\n \"0.5172962\",\n \"0.5158727\",\n \"0.51484203\",\n \"0.5147171\",\n \"0.51236457\",\n \"0.51205254\",\n \"0.51164573\",\n \"0.51098853\",\n \"0.51062334\",\n \"0.5087755\",\n \"0.50870156\",\n \"0.5067805\",\n \"0.5066551\",\n \"0.5064679\",\n \"0.50627697\",\n \"0.5047121\",\n \"0.5041054\",\n \"0.5024063\",\n \"0.5023791\",\n \"0.5023153\",\n \"0.5022585\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.74456626"},"document_rank":{"kind":"string","value":"3"}}},{"rowIdx":74178,"cells":{"query":{"kind":"string","value":"v8 likes predictible objects"},"document":{"kind":"string","value":"function Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function compareLike(a,b){\n var al = a.idLikesProp.length;\n var bl = b.idLikesProp.length;\n if(al > bl) return -1;\n if(bl > al) return 1;\n return 0;\n}","function lookAround() {\n var objectDescription = \"\"\n tj.see().then(function(objects) {\n objects.forEach(function(each) {\n if (each.score >= 0.4) {\n objectDescription = objectDescription + \", \" + each.class\n }\n })\n tj.speak(\"The objects I see are: \" + objectDescription)\n });\n}","function recommendNewPosts() {\n model.loadModel();\n getNewPosts(function (err, posts) {\n var label\n ;\n posts.forEach(function (post) {\n label = model.classifyPost(post);\n if (label == 'like') {\n console.log(post);\n }\n });\n });\n }","function BOT_onLike() {\r\n\tBOT_traceString += \"GOTO command judge\" + \"\\n\"; // change performative\r\n\tBOT_theReqJudgement = \"likeable\";\r\n\tBOT_onJudge(); \t\r\n\tif(BOT_reqSuccess) {\r\n\t\tvar ta = [BOT_theReqTopic,BOT_theReqAttribute]; \r\n\t\tBOT_del(BOT_theUserTopicId,\"distaste\",\"VAL\",ta);\r\n\t\tBOT_add(BOT_theUserTopicId,\"preference\",\"VAL\",ta);\r\n\t}\r\n}","function like (data, archetype) {\n var name;\n\n for (name in archetype) {\n if (archetype.hasOwnProperty(name)) {\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof archetype[name]) {\n return false;\n }\n\n if (object(data[name]) && like(data[name], archetype[name]) === false) {\n return false;\n }\n }\n }\n\n return true;\n }","function LanguageUnderstandingModel() {\n }","function guess() {\n classifier.predict(video.elt, 5, gotResult);\n}","function theBigBang() {\n\t\tinitLibs();\n\t\tinitFuncs();\n\t\tObject.setPrototypeOf(Universe.prototype, universe.kjsclasses._primitive_prototype);\n\t\tObject.setPrototypeOf(Object.prototype, universe); // [0]\n\t}","function readOwn(obj, name, pumpkin) {\n if (typeof obj !== 'object' || !obj) {\n if (typeOf(obj) !== 'object') {\n return pumpkin;\n }\n }\n if (typeof name === 'number' && name >= 0) {\n if (myOriginalHOP.call(obj, name)) { return obj[name]; }\n return pumpkin;\n }\n name = String(name);\n if (obj[name + '_canRead___'] === obj) { return obj[name]; }\n if (!myOriginalHOP.call(obj, name)) { return pumpkin; }\n // inline remaining relevant cases from canReadPub\n if (endsWith__.test(name)) { return pumpkin; }\n if (name === 'toString') { return pumpkin; }\n if (!isJSONContainer(obj)) { return pumpkin; }\n fastpathRead(obj, name);\n return obj[name];\n }","function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach(function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)})}","function NXObject() {}","function isPrimative(val) { return (typeof val !== 'object') }","function like (data, duck) {\n var name;\n\n assert.object(data);\n assert.object(duck);\n\n for (name in duck) {\n if (duck.hasOwnProperty(name)) {\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof duck[name]) {\n return false;\n }\n\n if (object(data[name]) && like(data[name], duck[name]) === false) {\n return false;\n }\n }\n }\n\n return true;\n }","static get observedAttributes() {\n return ['rainbow', 'lang'];\n }","function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach((function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)}))}","function testSimpleHole_prototype() {\n var theHole = Object.create({ x: \"in proto\" });\n var theReplacement = \"yay\";\n var serialized = bidar.serialize(theHole, holeFilter);\n var parsed = bidar.parse(serialized, holeFiller);\n\n assert.equal(parsed, theReplacement);\n\n function holeFilter(x) {\n assert.equal(x, theHole);\n return { data: \"blort\" };\n }\n\n function holeFiller(x) {\n assert.equal(x, \"blort\");\n return theReplacement;\n }\n}","function test() {\n\t// \"ex nihilo\" object creation using the literal\n\t// object notation {}.\n\tvar foo = {\n\t\tname : \"foo\",\n\t\tone : 1,\n\t\ttwo : 2\n\t};\n\n\t// Another \"ex nihilo\" object.\n\tvar bar = {\n\t\ttwo : \"two\",\n\t\tthree : 3\n\t};\n\n\t// Gecko and Webkit JavaScript engines can directly\n\t// manipulate the internal prototype link.\n\t// For the sake of simplicity, let us pretend\n\t// that the following line works regardless of the\n\t// engine used:\n\tbar.__proto__ = foo; // foo is now the prototype of bar.\n\n\t// If we try to access foo's properties from bar\n\t// from now on, we'll succeed.\n\tlog(bar.one) // Resolves to 1.\n\n\t// The child object's properties are also accessible.\n\tlog(bar.three) // Resolves to 3.\n\n\t// Own properties shadow prototype properties\n\tlog(bar.two); // Resolves to \"two\"\n\tlog(foo.name); // unaffected, resolves to \"foo\"\n\tlog(bar.name); // Resolves to \"foo\"\n log(foo.__proto__);\n}","function wrappedPrimitivePreviewer(className, classObj, objectActor, grip) {\r\n let {_obj} = objectActor;\r\n\r\n if (!_obj.proto || _obj.proto.class != className) {\r\n return false;\r\n }\r\n\r\n let raw = _obj.unsafeDereference();\r\n let v = null;\r\n try {\r\n v = classObj.prototype.valueOf.call(raw);\r\n } catch (ex) {\r\n // valueOf() can throw if the raw JS object is \"misbehaved\".\r\n return false;\r\n }\r\n\r\n if (v === null) {\r\n return false;\r\n }\r\n\r\n let canHandle = GenericObject(objectActor, grip, className === \"String\");\r\n if (!canHandle) {\r\n return false;\r\n }\r\n\r\n grip.preview.wrappedValue = objectActor.getGrip(makeDebuggeeValueIfNeeded(_obj, v));\r\n return true;\r\n}","function DartObject(o) {\n this.o = o;\n}","function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}","function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}","function likeVsLikes(toyLikeCount){\n\t\tif (toyLikeCount == 1){\n\t\t\treturn 'Like';\n\t\t} else {\n\t\t\treturn 'Likes';\n\t\t}\n\t}","wordClass(word) {\r\n return {\r\n der: word.artikel == \"der\",\r\n die: word.artikel == \"die\",\r\n das: word.artikel == \"das\",\r\n marked: word.marker\r\n }\r\n }","constructor(spec) {\n this.cached = /* @__PURE__ */ Object.create(null);\n let instanceSpec = this.spec = {};\n for (let prop in spec)\n instanceSpec[prop] = spec[prop];\n instanceSpec.nodes = OrderedMap.from(spec.nodes), instanceSpec.marks = OrderedMap.from(spec.marks || {}), this.nodes = NodeType$1.compile(this.spec.nodes, this);\n this.marks = MarkType.compile(this.spec.marks, this);\n let contentExprCache = /* @__PURE__ */ Object.create(null);\n for (let prop in this.nodes) {\n if (prop in this.marks)\n throw new RangeError(prop + \" can not be both a node and a mark\");\n let type = this.nodes[prop], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n type.contentMatch = contentExprCache[contentExpr] || (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\n type.inlineContent = type.contentMatch.inlineContent;\n type.markSet = markExpr == \"_\" ? null : markExpr ? gatherMarks(this, markExpr.split(\" \")) : markExpr == \"\" || !type.inlineContent ? [] : null;\n }\n for (let prop in this.marks) {\n let type = this.marks[prop], excl = type.spec.excludes;\n type.excluded = excl == null ? [type] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"));\n }\n this.nodeFromJSON = this.nodeFromJSON.bind(this);\n this.markFromJSON = this.markFromJSON.bind(this);\n this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n this.cached.wrappings = /* @__PURE__ */ Object.create(null);\n }","function dummyObjects(name, age){\n this.name = name\n this.age = age\n}","function handleLikes() {\n // Get a random number\n let randomNumber = Math.random();\n // To make it unpredictable, only change the likes if =>\n if (randomNumber < REVEAL_PROBABILITY) {\n defineLikes();\n }\n}","constructor() { \n \n Like.initialize(this);\n }","like() {\r\n return this.clone(Comment, \"Like\").postCore();\r\n }","like() {\r\n return this.getItem().then(i => {\r\n return i.like();\r\n });\r\n }","added(vrobject){}","classify(phrase) { return this.clf.classify(phrase) }","function badIdea(){\n this.idea = \"bad\";\n}","static get observedAttributes(){this.finalize();const e=[];// Use forEach so this works even if for/of loops are compiled to for loops\n// expecting arrays\nreturn this._classProperties.forEach((t,n)=>{const r=this._attributeNameForProperty(n,t);void 0!==r&&(this._attributeToPropertyMap.set(r,n),e.push(r))}),e}","shouldSerialize(prop, dataKey) {\n const contains = (str, re) => (str.match(re) || []).length > 0;\n const a = contains(dataKey, /\\./g);\n const b = contains(dataKey, /\\[/g);\n return !!prop.object && !(a || b);\n }","function oldAndLoud(object){\n\tobject.age++;\n\tobject.name = object.name.toUpperCase();\n}","function classifyPose() {\n if (pose && working) {\n inputs = [];\n for (let i = 0; i < pose.landmarks.length; i++) {\n inputs.push(pose.landmarks[i][0]);\n inputs.push(pose.landmarks[i][1]);\n inputs.push(pose.landmarks[i][2]);\n }\n brain.classify(inputs, gotResult)\n }\n }","function PropertyDetection() {}","constructor()\n {\n this.likes = [];\n }","like() {\r\n return this.clone(Item, \"like\").postCore();\r\n }","function classifyVideo() {\n classifier.predict(gotResult);\n}","function classifyVideo() {\n classifier.predict(gotResult);\n}","function classifyVideo() {\n classifier.predict(gotResult);\n}","async TestLikeDoctorPost(){\n var response = await entity.Likes(6,28,true,true);\n //console.log(response)\n if(response != null){\n console.log(\"\\x1b[32m%s\\x1b[0m\",\"TestDOctorRating Passed\");\n }else{\n console.log(\"\\x1b[31m%s\\x1b[0m\",\"TestDOctorRating Failed\");\n }\n\n }","function showLikes(likes) {\n\tconsole.log(`THINGS I LIKE:\\n`);\n\tfor(let like of likes) {\n\t\tconsole.log(like);\n\t}\n}","function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}","function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}","function Nevis() {}","function Nevis() {}","function Nevis() {}","test_primitivesExtended() {\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.primitivesExtended);\n let object = translator.decode(text).getRoot();\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.PrimitivesExtended\", object.constructor.__getClass());\n Assert.equals(\"alpha16\", object.string);\n }","function buildObjectsObj(gCloudV, azureCV, minScore = 0.0){\n let objects = [];\n\n if(gCloudV) {// gcloud vision results are available\n let gCloudObjects = gCloudV['localizedObjectAnnotations'];\n\n //apply standard bounding box to all the detected objects\n if(azureCV)// azure computer vision results are available\n gCloudVObjsToCogniBoundingBox(gCloudObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\n\n else//need to retrieve image sizes from gcloud (already done and put in the metadata tag of gcloudv with appropriate calls)\n gCloudVObjsToCogniBoundingBox(gCloudObjects, gCloudV['metadata']['width'], gCloudV['metadata']['height']);\n\n for (let gCloudObj of gCloudObjects) {\n if (gCloudObj['score'] > minScore) { //filter out unwanted tags\n objects.push({\n name: gCloudObj['name'],\n mid: (gCloudObj['mid'] && gCloudObj['mid']!= '')? gCloudObj['mid']: undefined,\n confidence: gCloudObj['score'],\n boundingBox: gCloudObj['boundingBox']\n });\n }\n }\n }\n\n if(azureCV){// azure computer vision results are available\n let azureObjects = azureCV['objects'];\n //apply standard bounding box to all the detected objects\n azureCVObjsToCogniBoundingBox(azureObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\n for(let aObj of azureObjects){\n if(aObj['confidence'] > minScore) { //filter out unwanted tags\n objects.push({\n name: aObj['object'],\n confidence: aObj['confidence'],\n boundingBox: aObj['boundingBox']\n });\n }\n }\n }\n\n objects = combineObjectsArray(objects);// build an array where labels regarding the same exact object are combined with averaged confidence\n\n objects.sort((a, b) => {\n if(a['confidence']>b['confidence'])\n return -1;\n else if(a['confidence']==b['confidence'])\n return 0;\n else\n return 1;\n });\n\n return objects;\n}","function V(e){if(null===e||\"[object Object]\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}","function classifyVideo() {\r\n classifier.classify(vid, gotResult);\r\n\r\n}","function test_nountag_does_not_think_it_has_watch_tag_when_it_does_not() {\n Assert.equal(TagNoun.fromJSON(\"watch\"), undefined);\n}","function markRaw(obj) {\r\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\r\n return obj;\r\n }\r\n // set the vue observable flag at obj\r\n var ob = createObserver();\r\n ob.__raw__ = true;\r\n def(obj, '__ob__', ob);\r\n // mark as Raw\r\n rawSet.set(obj, true);\r\n return obj;\r\n}","function markRaw(obj) {\r\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\r\n return obj;\r\n }\r\n // set the vue observable flag at obj\r\n var ob = createObserver();\r\n ob.__raw__ = true;\r\n def(obj, '__ob__', ob);\r\n // mark as Raw\r\n rawSet.set(obj, true);\r\n return obj;\r\n}","function v11(v12,v13) {\n const v15 = v11(Object,Function);\n // v15 = .unknown\n const v16 = Object(v13,v8,0,v6);\n // v16 = .object()\n const v17 = 0;\n // v17 = .integer\n const v18 = 1;\n // v18 = .integer\n const v19 = 512;\n // v19 = .integer\n const v20 = \"-1024\";\n // v20 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v21 = isFinite;\n // v21 = .function([.anything] => .boolean)\n const v23 = [1337];\n // v23 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v24 = {};\n // v24 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v25 = v23;\n const v26 = -29897853;\n // v26 = .integer\n const v27 = \"replace\";\n // v27 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v28 = Boolean;\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v30 = [13.37,13.37];\n // v30 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v31 = 1337;\n // v31 = .integer\n let v32 = 13.37;\n const v36 = [13.37,13.37,13.37];\n // v36 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v38 = [1337,1337];\n // v38 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v39 = [13.37,1337,v38,1337,\"-128\",13.37,\"-128\",\"-128\",2147483647,1337];\n // v39 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v40 = {__proto__:v36,length:v39};\n // v40 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"length\"])\n const v41 = \"0\";\n // v41 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v42 = -4130093409;\n // v42 = .integer\n const v44 = {b:2147483647,e:v38,valueOf:v36};\n // v44 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"b\", \"valueOf\", \"e\"])\n const v45 = \"k**baeaDif\";\n // v45 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v46 = 65536;\n // v46 = .integer\n const v47 = \"k**baeaDif\";\n // v47 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v48 = 13.37;\n // v48 = .float\n const v50 = [13.37,13.37];\n // v50 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v51 = ~v50;\n // v51 = .boolean\n const v53 = [13.37];\n // v53 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n let v54 = v53;\n const v55 = gc;\n // v55 = .function([] => .undefined)\n const v58 = [13.37,13.37,13.37,13.37];\n // v58 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v60 = [1337,1337,1337,1337];\n // v60 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v61 = [3697200800,v58,v60];\n // v61 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\n // v62 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"length\", \"constructor\", \"toString\", \"valueOf\"])\n const v65 = [13.37,13.37,13.37,13.37];\n // v65 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v67 = [1337,1337,1337,1337];\n // v67 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v68 = [3697200800,v65,v67];\n // v68 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\n // v69 = .object(ofGroup: Object, withProperties: [\"e\", \"constructor\", \"__proto__\", \"length\", \"toString\", \"valueOf\"])\n const v70 = Object;\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n function v71(v72) {\n }\n const v74 = [13.37];\n // v74 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v75 = 1337;\n // v75 = .integer\n const v76 = v44 ** 13.37;\n // v76 = .integer | .float | .bigint\n function v77(v78,v79,v80,v81,v82) {\n }\n let v83 = v74;\n const v84 = \"2\";\n // v84 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v85 = \"2\";\n // v85 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v88 = [13.37,13.37,1337,13.37];\n // v88 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v89(v90,v91,v92) {\n }\n const v94 = [1337,1337,1337,1337];\n // v94 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v95 = [3697200800,v88,v94];\n // v95 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v96(v97,v98) {\n }\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\n // v99 = .object(ofGroup: Object, withProperties: [\"toString\", \"length\", \"constructor\", \"__proto__\", \"e\", \"d\"])\n let v100 = 13.37;\n const v101 = typeof v74;\n // v101 = .string\n const v102 = \"symbol\";\n // v102 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v103 = 3697200800;\n // v103 = .integer\n const v104 = \"2\";\n // v104 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v105 = Boolean;\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v106 = Function;\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v107 = 13.37;\n // v107 = .float\n const v108 = 1337;\n // v108 = .integer\n const v109 = \"2\";\n // v109 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v110 = Function;\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v112 = [13.37,13.37,13.37,13.37];\n // v112 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v113 = 1337;\n // v113 = .integer\n let v114 = 13.37;\n const v116 = {...3697200800,...3697200800};\n // v116 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n const v117 = Object;\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v118 = Function;\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v119 = {};\n // v119 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v120 = v119;\n const v121 = (3697200800).constructor;\n // v121 = .unknown\n function v122(v123,v124) {\n }\n const v125 = Promise;\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\"prototype\"], withMethods: [\"race\", \"allSettled\", \"reject\", \"all\", \"resolve\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\"__proto__\"], withMethods: [\"finally\", \"then\", \"catch\"]))\n const v128 = 4;\n // v128 = .integer\n let v129 = 0;\n const v131 = [13.37,13.37,13.37,13.37];\n // v131 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v133 = [1337,1337,1337,1337];\n // v133 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v134 = [3697200800,v131,v133];\n // v134 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v135 = Object;\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v136 = -944747134;\n // v136 = .integer\n const v139 = [13.37,13.37,13.37,13.37];\n // v139 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v141 = [1337,1337,1337,1337];\n // v141 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v142 = [3697200800,v139,v141];\n // v142 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\n // v143 = .object(ofGroup: Object, withProperties: [\"toString\", \"constructor\", \"e\", \"__proto__\", \"valueOf\", \"length\"])\n let v144 = v143;\n const v145 = gc;\n // v145 = .function([] => .undefined)\n let v146 = 13.37;\n const v150 = [13.37,13.37,13.37,Function];\n // v150 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v152 = [1337,1337,1337,1337];\n // v152 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v153 = [3697200800,v150,v152];\n // v153 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v154 = v153 + 1;\n // v154 = .primitive\n let v155 = 0;\n const v156 = v155 + 1;\n // v156 = .primitive\n const v158 = \"2\";\n // v158 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v160 = [13.37,13.37,13.37,13.37];\n // v160 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v162 = 0;\n // v162 = .integer\n const v163 = [1337,1337,1337,1337];\n // v163 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v164 = [3697200800,1337,v163];\n // v164 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v166 = 1337;\n // v166 = .integer\n let v167 = 2594067260;\n const v169 = 4;\n // v169 = .integer\n let v170 = 0;\n const v171 = v167 + 1;\n // v171 = .primitive\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\n // v172 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"constructor\", \"valueOf\", \"length\", \"toString\"])\n const v173 = 0;\n // v173 = .integer\n const v174 = 5;\n // v174 = .integer\n const v175 = 2937513072;\n // v175 = .integer\n const v176 = Object;\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v177 = v172.constructor;\n // v177 = .unknown\n const v178 = 0;\n // v178 = .integer\n const v179 = 1;\n // v179 = .integer\n try {\n } catch(v180) {\n const v182 = [13.37,13.37,13.37,13.37];\n // v182 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v183 = v182.__proto__;\n // v183 = .object()\n function v185(v186) {\n }\n const v187 = Object >>> v183;\n // v187 = .integer | .bigint\n }\n function v188(v189,v190,v191,v192,...v193) {\n }\n}","transient private internal function m185() {}","test_doNotRetainAnno(){\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.doNotRetainAnno);\n let object1 = translator.decode(text).getRoot();\n let object2 = translator.decode(text).getRoot();\n\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\", object1.constructor.__getClass());\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\", object2.constructor.__getClass());\n Assert.notEquals(object1, object2);\n }","function rekognizeLabels(bucket, key) {\n let params = {\n Image: {\n S3Object: {\n Bucket: bucket,\n Name: key\n }\n },\n MaxLabels: 3,\n MinConfidence: 80\n };\n\n return rekognition.detectLabels(params).promise()\n}","function OOPExample(who) {\n this.me = who;\n}","function LK_likeIt(elem) {\n var likeGroup = elem.getAttribute(LK_LIKEGROUP);\n var likeValue = elem.getAttribute(LK_LIKEVALUE);\n localStorage[likeGroup] = likeValue;\n\n // Change the style of the liker nodes\n var siblings = elem.parentNode.childNodes;\n for (var i = 0; i < siblings.length; i++) {\n if (siblings[i].style) { \n LK_applyNormalStyle(siblings[i]);\n }\n }\n LK_applySelectedStyle(elem, likeValue);\n\n // Change the value of any mini likers\n var allSpans = document.getElementsByTagName('span');\n for (var i = 0; i < allSpans.length; i++) {\n var span = allSpans[i];\n if (span.getAttribute(LK_LIKEGROUP) == likeGroup) {\n if (span.getAttribute(LK_LIKETYPE) == 'mini') {\n span.innerHTML = LK_MAPPINGS[likeValue].label;\n LK_applySelectedStyle(allSpans[i], likeValue);\n }\n }\n }\n}","function _isAlternativeRecognitionResult(obj) {\r\n return obj && typeof obj === 'object';\r\n}","getLikes(state, data) {\n state.likes = data\n }","function LiteralObject() {\r\n}","function addLikes() {\n if (propLike?.includes(user.username)) {\n let index = propLike.indexOf(user.username);\n let removeLike = [\n ...propLike.slice(0, index),\n ...propLike.slice(index + 1),\n ];\n setLikeGet(removeLike);\n setPropLike(removeLike);\n setRedLike(\"\");\n\n addToLike(eventid, removeLike);\n } else {\n let likesArr = [...propLike, `${user.username}`];\n\n setLikeGet(likesArr);\n setPropLike(likesArr);\n setRedLike(\"red\");\n addToLike(eventid, likesArr);\n }\n }","function Komunalne() {}","function Bevy() {}","function Prediction() {\n this.score = {};\n}","function Object() {}","function Object() {}","function canEnumPub(obj, name) {\n if (obj === null) { return false; }\n if (obj === void 0) { return false; }\n name = String(name);\n if (obj[name + '_canEnum___']) { return true; }\n if (endsWith__.test(name)) { return false; }\n if (!isJSONContainer(obj)) { return false; }\n if (!myOriginalHOP.call(obj, name)) { return false; }\n fastpathEnum(obj, name);\n if (name === 'toString') { return true; }\n fastpathRead(obj, name);\n return true;\n }","function Obj(){ return Literal.apply(this,arguments) }","test_primitives() {\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.primitives);\n let object = translator.decode(text).getRoot();\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.Primitives\", object.constructor.__getClass());\n Assert.equals(\"alpha9\", object.string);\n }","function hello()\n{\n /* ATTRIBUTES */\n this.coolbeans = 'class';\n this.something = 'hello-class';\n\n}","function test_cluster_tagged_crosshair_op_vsphere65() {}","function classifyVideo() {\n classifier.classify(gotResult);\n}","function classifyVideo() {\n classifier.classify(gotResult);\n}","function v8(v9,v10) {\n const v16 = [1337,1337];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v17 = [\"536870912\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\n // v17 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = {constructor:13.37,e:v16};\n // v18 = .object(ofGroup: Object, withProperties: [\"constructor\", \"e\", \"__proto__\"])\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\n // v19 = .object(ofGroup: Object, withProperties: [\"d\", \"b\", \"a\", \"__proto__\", \"e\", \"constructor\", \"length\"])\n const v21 = new Float64Array(v19);\n // v21 = .object(ofGroup: Float64Array, withProperties: [\"byteOffset\", \"constructor\", \"buffer\", \"__proto__\", \"byteLength\", \"length\"], withMethods: [\"map\", \"values\", \"subarray\", \"find\", \"fill\", \"set\", \"findIndex\", \"some\", \"reduceRight\", \"reverse\", \"join\", \"includes\", \"entries\", \"reduce\", \"every\", \"copyWithin\", \"sort\", \"forEach\", \"lastIndexOf\", \"indexOf\", \"filter\", \"slice\", \"keys\"])\n v6[6] = v7;\n v7.toString = v9;\n }","constructor(papa,mummy,sivlings,belongs,loving_bro,favs_bro){\n super(papa,mummy,sivlings,belongs)\n this.loving_bro=loving_bro\n this.favs_bro=favs_bro\n }","function defineInspect(classObject) {\n var fn = classObject.prototype.toJSON;\n typeof fn === 'function' || invariant(0);\n classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n if (nodejsCustomInspectSymbol[\"a\" /* default */]) {\n classObject.prototype[nodejsCustomInspectSymbol[\"a\" /* default */]] = fn;\n }\n}","annotate(message: string, data: Object) {\n this.message = message;\n this.data = assign(this.data, data);\n }","function encodeObject(o) {\n if (_.isNumber(o)) {\n if (_.isNaN(o)) {\n return ['SPECIAL_FLOAT', 'NaN'];\n } else if (o === Infinity) {\n return ['SPECIAL_FLOAT', 'Infinity'];\n } else if (o === -Infinity) {\n return ['SPECIAL_FLOAT', '-Infinity'];\n } else {\n return o;\n }\n } else if (_.isString(o)) {\n return o;\n } else if (_.isBoolean(o) || _.isNull(o) || _.isUndefined(o)) {\n return ['JS_SPECIAL_VAL', String(o)];\n } else if (typeof o === 'symbol') {\n // ES6 symbol\n return ['JS_SPECIAL_VAL', String(o)];\n } else {\n // render these as heap objects\n\n // very important to use _.has since we don't want to\n // grab the property in your prototype, only in YOURSELF ... SUBTLE!\n if (!_.has(o, 'smallObjId_hidden_')) {\n // make this non-enumerable so that it doesn't show up in\n // console.log() or other inspector functions\n Object.defineProperty(o, 'smallObjId_hidden_', { value: smallObjId,\n enumerable: false });\n smallObjId++;\n }\n assert(o.smallObjId_hidden_ > 0);\n\n var ret = ['REF', o.smallObjId_hidden_];\n\n if (encodedHeapObjects[String(o.smallObjId_hidden_)] !== undefined) {\n return ret;\n }\n else {\n assert(_.isObject(o));\n\n var newEncodedObj = [];\n encodedHeapObjects[String(o.smallObjId_hidden_)] = newEncodedObj;\n\n var i;\n\n if (_.isFunction(o)) {\n var funcProperties = []; // each element is a pair of [name, encoded value]\n\n var encodedProto = null;\n if (_.isObject(o.prototype)) {\n // TRICKY TRICKY! for inheritance to be displayed properly, we\n // want to find the prototype of o.prototype and see if it's\n // non-empty. if that's true, then even if o.prototype is\n // empty (i.e., has no properties of its own), then we should\n // still encode it since its 'prototype' \"uber-hidden\n // property\" is non-empty\n var prototypeOfPrototype = Object.getPrototypeOf(o.prototype);\n if (!_.isEmpty(o.prototype) ||\n (_.isObject(prototypeOfPrototype) && !_.isEmpty(prototypeOfPrototype))) {\n encodedProto = encodeObject(o.prototype);\n }\n }\n\n if (encodedProto) {\n funcProperties.push(['prototype', encodedProto]);\n }\n\n // now get all of the normal properties out of this function\n // object (it's unusual to put properties in a function object,\n // but it's still legal!)\n var funcPropPairs = _.pairs(o);\n for (i = 0; i < funcPropPairs.length; i++) {\n funcProperties.push([funcPropPairs[i][0], encodeObject(funcPropPairs[i][1])]);\n }\n\n var funcCodeString = o.toString();\n\n /*\n\n #craftsmanship -- make nested functions look better by indenting\n the first line of a nested function definition by however much\n the LAST line is indented, ONLY if the last line is simply a\n single ending '}'. otherwise it will look ugly since the\n function definition doesn't start out indented, like so:\n\nfunction bar(x) {\n globalZ += 100;\n return x + y + globalZ;\n }\n\n */\n var codeLines = funcCodeString.split('\\n');\n if (codeLines.length > 1) {\n var lastLine = _.last(codeLines);\n if (lastLine.trim() === '}') {\n var lastLinePrefix = lastLine.slice(0, lastLine.indexOf('}'));\n funcCodeString = lastLinePrefix + funcCodeString; // prepend!\n }\n }\n\n newEncodedObj.push('JS_FUNCTION',\n o.name,\n funcCodeString, /* code string*/\n funcProperties.length ? funcProperties : null, /* OPTIONAL */\n null /* parent frame */);\n } else if (_.isArray(o)) {\n newEncodedObj.push('LIST');\n for (i = 0; i < o.length; i++) {\n newEncodedObj.push(encodeObject(o[i]));\n }\n } else if (o.__proto__.toString() === canonicalSet.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\n newEncodedObj.push('SET');\n // ES6 Set (TODO: add WeakSet)\n for (let item of o) {\n newEncodedObj.push(encodeObject(item));\n }\n } else if (o.__proto__.toString() === canonicalMap.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\n // ES6 Map (TODO: add WeakMap)\n newEncodedObj.push('DICT'); // use the Python 'DICT' type since it's close enough; adjust display in frontend\n for (let [key, value] of o) {\n newEncodedObj.push([encodeObject(key), encodeObject(value)]);\n }\n } else {\n // a true object\n\n // if there's a custom toString() function (note that a truly\n // prototypeless object won't have toString method, so check first to\n // see if toString is *anywhere* up the prototype chain)\n var s = (o.toString !== undefined) ? o.toString() : '';\n if (s !== '' && s !== '[object Object]') {\n newEncodedObj.push('INSTANCE_PPRINT', 'object', s);\n } else {\n newEncodedObj.push('INSTANCE', '');\n var pairs = _.pairs(o);\n for (i = 0; i < pairs.length; i++) {\n var e = pairs[i];\n newEncodedObj.push([encodeObject(e[0]), encodeObject(e[1])]);\n }\n\n var proto = Object.getPrototypeOf(o);\n if (_.isObject(proto) && !_.isEmpty(proto)) {\n //log('obj.prototype', proto, proto.smallObjId_hidden_);\n // I think __proto__ is the official term for this field,\n // *not* 'prototype'\n newEncodedObj.push(['__proto__', encodeObject(proto)]);\n }\n }\n }\n\n return ret;\n }\n\n }\n assert(false);\n}","function dist_index_esm_contains(obj,key){return Object.prototype.hasOwnProperty.call(obj,key);}","function isRawPostcodeObject(o, additionalAttr, blackListedAttr) {\n\tif (!additionalAttr) additionalAttr = [];\n\tif (!blackListedAttr) blackListedAttr = [];\n\tisSomeObject(o, rawPostcodeAttributes, additionalAttr, blackListedAttr);\n}","function _meta_(v,m){var ms=v['__meta__']||{};for(var k in m){ms[k]=m[k]};v['__meta__']=ms;return v}","function Animal() {\n this.kind = \"Dog\"\n}","function Kitten(name, photo, interests, isGoodWithKids, isGoodWithDogs, isGoodWithCats) {\n this.name = name;\n this.photo = photo;\n this.interests = interests;\n this.isGoodWithKids = isGoodWithKids;\n this.isGoodWithCats = isGoodWithCats;\n this.isGoodWithDogs = isGoodWithDogs;\n}","getMeta () {\n }","function np(e){return\"[object Object]\"===Object.prototype.toString.call(e)}","function Obj() {}","function test_fail_hole_prototype() {\n var obj = Object.create({ stuff: \"in prototype\" });\n obj.foo = \"bar\";\n\n function f1() {\n bidar.serialize(obj);\n }\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\n}","function Person(saying) {\n this.saying = saying;\n /*\n return {\n dumbObject: true\n }\n */\n}","function isFriend(name, object) {\n//use hasWord function to check object names array\n// console.log(object);\n// console.log(name);\n//conditional to check for property\nif (object['friends'] !== undefined) {\nreturn hasWord(object.friends.join(' '), name);\n}\nelse {return false};\n \n}","transient private protected internal function m182() {}","function kotlin(hljs) {\n const KEYWORDS = {\n keyword:\n 'abstract as val var vararg get set class object open private protected public noinline ' +\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\n 'import package is in fun override companion reified inline lateinit init ' +\n 'interface annotation data sealed internal infix operator out by constructor super ' +\n 'tailrec where const inner suspend typealias external expect actual',\n built_in:\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\n literal:\n 'true false null'\n };\n const KEYWORDS_WITH_LABEL = {\n className: 'keyword',\n begin: /\\b(break|continue|return|this)\\b/,\n starts: {\n contains: [\n {\n className: 'symbol',\n begin: /@\\w+/\n }\n ]\n }\n };\n const LABEL = {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\n };\n\n // for string templates\n const SUBST = {\n className: 'subst',\n begin: /\\$\\{/,\n end: /\\}/,\n contains: [ hljs.C_NUMBER_MODE ]\n };\n const VARIABLE = {\n className: 'variable',\n begin: '\\\\$' + hljs.UNDERSCORE_IDENT_RE\n };\n const STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"\"\"',\n end: '\"\"\"(?=[^\"])',\n contains: [\n VARIABLE,\n SUBST\n ]\n },\n // Can't use built-in modes easily, as we want to use STRING in the meta\n // context as 'meta-string' and there's no syntax to remove explicitly set\n // classNames in built-in modes.\n {\n begin: '\\'',\n end: '\\'',\n illegal: /\\n/,\n contains: [ hljs.BACKSLASH_ESCAPE ]\n },\n {\n begin: '\"',\n end: '\"',\n illegal: /\\n/,\n contains: [\n hljs.BACKSLASH_ESCAPE,\n VARIABLE,\n SUBST\n ]\n }\n ]\n };\n SUBST.contains.push(STRING);\n\n const ANNOTATION_USE_SITE = {\n className: 'meta',\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\s*:(?:\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\n };\n const ANNOTATION = {\n className: 'meta',\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\n contains: [\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [\n hljs.inherit(STRING, {\n className: 'meta-string'\n })\n ]\n }\n ]\n };\n\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\n // According to the doc above, the number mode of kotlin is the same as java 8,\n // so the code below is copied from java.js\n const KOTLIN_NUMBER_MODE = NUMERIC;\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\n '/\\\\*', '\\\\*/',\n {\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\n }\n );\n const KOTLIN_PAREN_TYPE = {\n variants: [\n {\n className: 'type',\n begin: hljs.UNDERSCORE_IDENT_RE\n },\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [] // defined later\n }\n ]\n };\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\n\n return {\n name: 'Kotlin',\n aliases: [ 'kt' ],\n keywords: KEYWORDS,\n contains: [\n hljs.COMMENT(\n '/\\\\*\\\\*',\n '\\\\*/',\n {\n relevance: 0,\n contains: [\n {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n }\n ]\n }\n ),\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n KEYWORDS_WITH_LABEL,\n LABEL,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n {\n className: 'function',\n beginKeywords: 'fun',\n end: '[(]|$',\n returnBegin: true,\n excludeEnd: true,\n keywords: KEYWORDS,\n relevance: 5,\n contains: [\n {\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\s*\\\\(',\n returnBegin: true,\n relevance: 0,\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\n },\n {\n className: 'type',\n begin: /</,\n end: />/,\n keywords: 'reified',\n relevance: 0\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n endsParent: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n begin: /:/,\n end: /[=,\\/]/,\n endsWithParent: true,\n contains: [\n KOTLIN_PAREN_TYPE,\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT\n ],\n relevance: 0\n },\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n STRING,\n hljs.C_NUMBER_MODE\n ]\n },\n KOTLIN_NESTED_COMMENT\n ]\n },\n {\n className: 'class',\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\n end: /[:\\{(]|$/,\n excludeEnd: true,\n illegal: 'extends implements',\n contains: [\n {\n beginKeywords: 'public protected internal private constructor'\n },\n hljs.UNDERSCORE_TITLE_MODE,\n {\n className: 'type',\n begin: /</,\n end: />/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0\n },\n {\n className: 'type',\n begin: /[,:]\\s*/,\n end: /[<\\(,]|$/,\n excludeBegin: true,\n returnEnd: true\n },\n ANNOTATION_USE_SITE,\n ANNOTATION\n ]\n },\n STRING,\n {\n className: 'meta',\n begin: \"^#!/usr/bin/env\",\n end: '$',\n illegal: '\\n'\n },\n KOTLIN_NUMBER_MODE\n ]\n };\n}","function kotlin(hljs) {\n const KEYWORDS = {\n keyword:\n 'abstract as val var vararg get set class object open private protected public noinline ' +\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\n 'import package is in fun override companion reified inline lateinit init ' +\n 'interface annotation data sealed internal infix operator out by constructor super ' +\n 'tailrec where const inner suspend typealias external expect actual',\n built_in:\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\n literal:\n 'true false null'\n };\n const KEYWORDS_WITH_LABEL = {\n className: 'keyword',\n begin: /\\b(break|continue|return|this)\\b/,\n starts: {\n contains: [\n {\n className: 'symbol',\n begin: /@\\w+/\n }\n ]\n }\n };\n const LABEL = {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\n };\n\n // for string templates\n const SUBST = {\n className: 'subst',\n begin: /\\$\\{/,\n end: /\\}/,\n contains: [ hljs.C_NUMBER_MODE ]\n };\n const VARIABLE = {\n className: 'variable',\n begin: '\\\\$' + hljs.UNDERSCORE_IDENT_RE\n };\n const STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"\"\"',\n end: '\"\"\"(?=[^\"])',\n contains: [\n VARIABLE,\n SUBST\n ]\n },\n // Can't use built-in modes easily, as we want to use STRING in the meta\n // context as 'meta-string' and there's no syntax to remove explicitly set\n // classNames in built-in modes.\n {\n begin: '\\'',\n end: '\\'',\n illegal: /\\n/,\n contains: [ hljs.BACKSLASH_ESCAPE ]\n },\n {\n begin: '\"',\n end: '\"',\n illegal: /\\n/,\n contains: [\n hljs.BACKSLASH_ESCAPE,\n VARIABLE,\n SUBST\n ]\n }\n ]\n };\n SUBST.contains.push(STRING);\n\n const ANNOTATION_USE_SITE = {\n className: 'meta',\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\s*:(?:\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\n };\n const ANNOTATION = {\n className: 'meta',\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\n contains: [\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [\n hljs.inherit(STRING, {\n className: 'meta-string'\n })\n ]\n }\n ]\n };\n\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\n // According to the doc above, the number mode of kotlin is the same as java 8,\n // so the code below is copied from java.js\n const KOTLIN_NUMBER_MODE = NUMERIC;\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\n '/\\\\*', '\\\\*/',\n {\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\n }\n );\n const KOTLIN_PAREN_TYPE = {\n variants: [\n {\n className: 'type',\n begin: hljs.UNDERSCORE_IDENT_RE\n },\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [] // defined later\n }\n ]\n };\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\n\n return {\n name: 'Kotlin',\n aliases: [ 'kt' ],\n keywords: KEYWORDS,\n contains: [\n hljs.COMMENT(\n '/\\\\*\\\\*',\n '\\\\*/',\n {\n relevance: 0,\n contains: [\n {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n }\n ]\n }\n ),\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n KEYWORDS_WITH_LABEL,\n LABEL,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n {\n className: 'function',\n beginKeywords: 'fun',\n end: '[(]|$',\n returnBegin: true,\n excludeEnd: true,\n keywords: KEYWORDS,\n relevance: 5,\n contains: [\n {\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\s*\\\\(',\n returnBegin: true,\n relevance: 0,\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\n },\n {\n className: 'type',\n begin: /</,\n end: />/,\n keywords: 'reified',\n relevance: 0\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n endsParent: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n begin: /:/,\n end: /[=,\\/]/,\n endsWithParent: true,\n contains: [\n KOTLIN_PAREN_TYPE,\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT\n ],\n relevance: 0\n },\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n STRING,\n hljs.C_NUMBER_MODE\n ]\n },\n KOTLIN_NESTED_COMMENT\n ]\n },\n {\n className: 'class',\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\n end: /[:\\{(]|$/,\n excludeEnd: true,\n illegal: 'extends implements',\n contains: [\n {\n beginKeywords: 'public protected internal private constructor'\n },\n hljs.UNDERSCORE_TITLE_MODE,\n {\n className: 'type',\n begin: /</,\n end: />/,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0\n },\n {\n className: 'type',\n begin: /[,:]\\s*/,\n end: /[<\\(,]|$/,\n excludeBegin: true,\n returnEnd: true\n },\n ANNOTATION_USE_SITE,\n ANNOTATION\n ]\n },\n STRING,\n {\n className: 'meta',\n begin: \"^#!/usr/bin/env\",\n end: '$',\n illegal: '\\n'\n },\n KOTLIN_NUMBER_MODE\n ]\n };\n}","static serialize(obj, allowPrimitives, fallbackToJson, requireJsonType = false) {\n if (allowPrimitives) {\n if (typeof obj === \"string\") {\n return this.serializePrimitive(obj, \"string\");\n } else if (typeof obj === \"number\") {\n return this.serializePrimitive(obj, \"double\");\n } else if (Buffer.isBuffer(obj)) {\n return this.serializePrimitive(obj, \"bytes\");\n } else if (typeof obj === \"boolean\") {\n return this.serializePrimitive(obj, \"bool\");\n } else if (Long.isLong(obj)) {\n return this.serializePrimitive(obj, \"int64\");\n }\n }\n if (obj.constructor && typeof obj.constructor.encode === \"function\" && obj.constructor.$type) {\n return Any.create({\n // I have *no* idea why it's type_url and not typeUrl, but it is.\n type_url: \"type.googleapis.com/\" + AnySupport.fullNameOf(obj.constructor.$type),\n value: obj.constructor.encode(obj).finish()\n });\n } else if (fallbackToJson && typeof obj === \"object\") {\n let type = obj.type;\n if (type === undefined) {\n if (requireJsonType) {\n throw new Error(util.format(\"Fallback to JSON serialization supported, but object does not define a type property: %o\", obj));\n } else {\n type = \"object\";\n }\n }\n return Any.create({\n type_url: CloudStateJson + type,\n value: this.serializePrimitiveValue(stableJsonStringify(obj), \"string\")\n });\n } else {\n throw new Error(util.format(\"Object %o is not a protobuf object, and hence can't be dynamically \" +\n \"serialized. Try passing the object to the protobuf classes create function.\", obj));\n }\n }","function Surrogate(){}","function Surrogate(){}","function Surrogate(){}"],"string":"[\n \"function compareLike(a,b){\\n var al = a.idLikesProp.length;\\n var bl = b.idLikesProp.length;\\n if(al > bl) return -1;\\n if(bl > al) return 1;\\n return 0;\\n}\",\n \"function lookAround() {\\n var objectDescription = \\\"\\\"\\n tj.see().then(function(objects) {\\n objects.forEach(function(each) {\\n if (each.score >= 0.4) {\\n objectDescription = objectDescription + \\\", \\\" + each.class\\n }\\n })\\n tj.speak(\\\"The objects I see are: \\\" + objectDescription)\\n });\\n}\",\n \"function recommendNewPosts() {\\n model.loadModel();\\n getNewPosts(function (err, posts) {\\n var label\\n ;\\n posts.forEach(function (post) {\\n label = model.classifyPost(post);\\n if (label == 'like') {\\n console.log(post);\\n }\\n });\\n });\\n }\",\n \"function BOT_onLike() {\\r\\n\\tBOT_traceString += \\\"GOTO command judge\\\" + \\\"\\\\n\\\"; // change performative\\r\\n\\tBOT_theReqJudgement = \\\"likeable\\\";\\r\\n\\tBOT_onJudge(); \\t\\r\\n\\tif(BOT_reqSuccess) {\\r\\n\\t\\tvar ta = [BOT_theReqTopic,BOT_theReqAttribute]; \\r\\n\\t\\tBOT_del(BOT_theUserTopicId,\\\"distaste\\\",\\\"VAL\\\",ta);\\r\\n\\t\\tBOT_add(BOT_theUserTopicId,\\\"preference\\\",\\\"VAL\\\",ta);\\r\\n\\t}\\r\\n}\",\n \"function like (data, archetype) {\\n var name;\\n\\n for (name in archetype) {\\n if (archetype.hasOwnProperty(name)) {\\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof archetype[name]) {\\n return false;\\n }\\n\\n if (object(data[name]) && like(data[name], archetype[name]) === false) {\\n return false;\\n }\\n }\\n }\\n\\n return true;\\n }\",\n \"function LanguageUnderstandingModel() {\\n }\",\n \"function guess() {\\n classifier.predict(video.elt, 5, gotResult);\\n}\",\n \"function theBigBang() {\\n\\t\\tinitLibs();\\n\\t\\tinitFuncs();\\n\\t\\tObject.setPrototypeOf(Universe.prototype, universe.kjsclasses._primitive_prototype);\\n\\t\\tObject.setPrototypeOf(Object.prototype, universe); // [0]\\n\\t}\",\n \"function readOwn(obj, name, pumpkin) {\\n if (typeof obj !== 'object' || !obj) {\\n if (typeOf(obj) !== 'object') {\\n return pumpkin;\\n }\\n }\\n if (typeof name === 'number' && name >= 0) {\\n if (myOriginalHOP.call(obj, name)) { return obj[name]; }\\n return pumpkin;\\n }\\n name = String(name);\\n if (obj[name + '_canRead___'] === obj) { return obj[name]; }\\n if (!myOriginalHOP.call(obj, name)) { return pumpkin; }\\n // inline remaining relevant cases from canReadPub\\n if (endsWith__.test(name)) { return pumpkin; }\\n if (name === 'toString') { return pumpkin; }\\n if (!isJSONContainer(obj)) { return pumpkin; }\\n fastpathRead(obj, name);\\n return obj[name];\\n }\",\n \"function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach(function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)})}\",\n \"function NXObject() {}\",\n \"function isPrimative(val) { return (typeof val !== 'object') }\",\n \"function like (data, duck) {\\n var name;\\n\\n assert.object(data);\\n assert.object(duck);\\n\\n for (name in duck) {\\n if (duck.hasOwnProperty(name)) {\\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof duck[name]) {\\n return false;\\n }\\n\\n if (object(data[name]) && like(data[name], duck[name]) === false) {\\n return false;\\n }\\n }\\n }\\n\\n return true;\\n }\",\n \"static get observedAttributes() {\\n return ['rainbow', 'lang'];\\n }\",\n \"function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach((function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)}))}\",\n \"function testSimpleHole_prototype() {\\n var theHole = Object.create({ x: \\\"in proto\\\" });\\n var theReplacement = \\\"yay\\\";\\n var serialized = bidar.serialize(theHole, holeFilter);\\n var parsed = bidar.parse(serialized, holeFiller);\\n\\n assert.equal(parsed, theReplacement);\\n\\n function holeFilter(x) {\\n assert.equal(x, theHole);\\n return { data: \\\"blort\\\" };\\n }\\n\\n function holeFiller(x) {\\n assert.equal(x, \\\"blort\\\");\\n return theReplacement;\\n }\\n}\",\n \"function test() {\\n\\t// \\\"ex nihilo\\\" object creation using the literal\\n\\t// object notation {}.\\n\\tvar foo = {\\n\\t\\tname : \\\"foo\\\",\\n\\t\\tone : 1,\\n\\t\\ttwo : 2\\n\\t};\\n\\n\\t// Another \\\"ex nihilo\\\" object.\\n\\tvar bar = {\\n\\t\\ttwo : \\\"two\\\",\\n\\t\\tthree : 3\\n\\t};\\n\\n\\t// Gecko and Webkit JavaScript engines can directly\\n\\t// manipulate the internal prototype link.\\n\\t// For the sake of simplicity, let us pretend\\n\\t// that the following line works regardless of the\\n\\t// engine used:\\n\\tbar.__proto__ = foo; // foo is now the prototype of bar.\\n\\n\\t// If we try to access foo's properties from bar\\n\\t// from now on, we'll succeed.\\n\\tlog(bar.one) // Resolves to 1.\\n\\n\\t// The child object's properties are also accessible.\\n\\tlog(bar.three) // Resolves to 3.\\n\\n\\t// Own properties shadow prototype properties\\n\\tlog(bar.two); // Resolves to \\\"two\\\"\\n\\tlog(foo.name); // unaffected, resolves to \\\"foo\\\"\\n\\tlog(bar.name); // Resolves to \\\"foo\\\"\\n log(foo.__proto__);\\n}\",\n \"function wrappedPrimitivePreviewer(className, classObj, objectActor, grip) {\\r\\n let {_obj} = objectActor;\\r\\n\\r\\n if (!_obj.proto || _obj.proto.class != className) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n let raw = _obj.unsafeDereference();\\r\\n let v = null;\\r\\n try {\\r\\n v = classObj.prototype.valueOf.call(raw);\\r\\n } catch (ex) {\\r\\n // valueOf() can throw if the raw JS object is \\\"misbehaved\\\".\\r\\n return false;\\r\\n }\\r\\n\\r\\n if (v === null) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n let canHandle = GenericObject(objectActor, grip, className === \\\"String\\\");\\r\\n if (!canHandle) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n grip.preview.wrappedValue = objectActor.getGrip(makeDebuggeeValueIfNeeded(_obj, v));\\r\\n return true;\\r\\n}\",\n \"function DartObject(o) {\\n this.o = o;\\n}\",\n \"function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}\",\n \"function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}\",\n \"function likeVsLikes(toyLikeCount){\\n\\t\\tif (toyLikeCount == 1){\\n\\t\\t\\treturn 'Like';\\n\\t\\t} else {\\n\\t\\t\\treturn 'Likes';\\n\\t\\t}\\n\\t}\",\n \"wordClass(word) {\\r\\n return {\\r\\n der: word.artikel == \\\"der\\\",\\r\\n die: word.artikel == \\\"die\\\",\\r\\n das: word.artikel == \\\"das\\\",\\r\\n marked: word.marker\\r\\n }\\r\\n }\",\n \"constructor(spec) {\\n this.cached = /* @__PURE__ */ Object.create(null);\\n let instanceSpec = this.spec = {};\\n for (let prop in spec)\\n instanceSpec[prop] = spec[prop];\\n instanceSpec.nodes = OrderedMap.from(spec.nodes), instanceSpec.marks = OrderedMap.from(spec.marks || {}), this.nodes = NodeType$1.compile(this.spec.nodes, this);\\n this.marks = MarkType.compile(this.spec.marks, this);\\n let contentExprCache = /* @__PURE__ */ Object.create(null);\\n for (let prop in this.nodes) {\\n if (prop in this.marks)\\n throw new RangeError(prop + \\\" can not be both a node and a mark\\\");\\n let type = this.nodes[prop], contentExpr = type.spec.content || \\\"\\\", markExpr = type.spec.marks;\\n type.contentMatch = contentExprCache[contentExpr] || (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\\n type.inlineContent = type.contentMatch.inlineContent;\\n type.markSet = markExpr == \\\"_\\\" ? null : markExpr ? gatherMarks(this, markExpr.split(\\\" \\\")) : markExpr == \\\"\\\" || !type.inlineContent ? [] : null;\\n }\\n for (let prop in this.marks) {\\n let type = this.marks[prop], excl = type.spec.excludes;\\n type.excluded = excl == null ? [type] : excl == \\\"\\\" ? [] : gatherMarks(this, excl.split(\\\" \\\"));\\n }\\n this.nodeFromJSON = this.nodeFromJSON.bind(this);\\n this.markFromJSON = this.markFromJSON.bind(this);\\n this.topNodeType = this.nodes[this.spec.topNode || \\\"doc\\\"];\\n this.cached.wrappings = /* @__PURE__ */ Object.create(null);\\n }\",\n \"function dummyObjects(name, age){\\n this.name = name\\n this.age = age\\n}\",\n \"function handleLikes() {\\n // Get a random number\\n let randomNumber = Math.random();\\n // To make it unpredictable, only change the likes if =>\\n if (randomNumber < REVEAL_PROBABILITY) {\\n defineLikes();\\n }\\n}\",\n \"constructor() { \\n \\n Like.initialize(this);\\n }\",\n \"like() {\\r\\n return this.clone(Comment, \\\"Like\\\").postCore();\\r\\n }\",\n \"like() {\\r\\n return this.getItem().then(i => {\\r\\n return i.like();\\r\\n });\\r\\n }\",\n \"added(vrobject){}\",\n \"classify(phrase) { return this.clf.classify(phrase) }\",\n \"function badIdea(){\\n this.idea = \\\"bad\\\";\\n}\",\n \"static get observedAttributes(){this.finalize();const e=[];// Use forEach so this works even if for/of loops are compiled to for loops\\n// expecting arrays\\nreturn this._classProperties.forEach((t,n)=>{const r=this._attributeNameForProperty(n,t);void 0!==r&&(this._attributeToPropertyMap.set(r,n),e.push(r))}),e}\",\n \"shouldSerialize(prop, dataKey) {\\n const contains = (str, re) => (str.match(re) || []).length > 0;\\n const a = contains(dataKey, /\\\\./g);\\n const b = contains(dataKey, /\\\\[/g);\\n return !!prop.object && !(a || b);\\n }\",\n \"function oldAndLoud(object){\\n\\tobject.age++;\\n\\tobject.name = object.name.toUpperCase();\\n}\",\n \"function classifyPose() {\\n if (pose && working) {\\n inputs = [];\\n for (let i = 0; i < pose.landmarks.length; i++) {\\n inputs.push(pose.landmarks[i][0]);\\n inputs.push(pose.landmarks[i][1]);\\n inputs.push(pose.landmarks[i][2]);\\n }\\n brain.classify(inputs, gotResult)\\n }\\n }\",\n \"function PropertyDetection() {}\",\n \"constructor()\\n {\\n this.likes = [];\\n }\",\n \"like() {\\r\\n return this.clone(Item, \\\"like\\\").postCore();\\r\\n }\",\n \"function classifyVideo() {\\n classifier.predict(gotResult);\\n}\",\n \"function classifyVideo() {\\n classifier.predict(gotResult);\\n}\",\n \"function classifyVideo() {\\n classifier.predict(gotResult);\\n}\",\n \"async TestLikeDoctorPost(){\\n var response = await entity.Likes(6,28,true,true);\\n //console.log(response)\\n if(response != null){\\n console.log(\\\"\\\\x1b[32m%s\\\\x1b[0m\\\",\\\"TestDOctorRating Passed\\\");\\n }else{\\n console.log(\\\"\\\\x1b[31m%s\\\\x1b[0m\\\",\\\"TestDOctorRating Failed\\\");\\n }\\n\\n }\",\n \"function showLikes(likes) {\\n\\tconsole.log(`THINGS I LIKE:\\\\n`);\\n\\tfor(let like of likes) {\\n\\t\\tconsole.log(like);\\n\\t}\\n}\",\n \"function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}\",\n \"function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}\",\n \"function Nevis() {}\",\n \"function Nevis() {}\",\n \"function Nevis() {}\",\n \"test_primitivesExtended() {\\n let translator = new Translator();\\n translator.registerPackage(PackageFile);\\n let text = JSON.stringify(this.json.primitivesExtended);\\n let object = translator.decode(text).getRoot();\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.PrimitivesExtended\\\", object.constructor.__getClass());\\n Assert.equals(\\\"alpha16\\\", object.string);\\n }\",\n \"function buildObjectsObj(gCloudV, azureCV, minScore = 0.0){\\n let objects = [];\\n\\n if(gCloudV) {// gcloud vision results are available\\n let gCloudObjects = gCloudV['localizedObjectAnnotations'];\\n\\n //apply standard bounding box to all the detected objects\\n if(azureCV)// azure computer vision results are available\\n gCloudVObjsToCogniBoundingBox(gCloudObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\\n\\n else//need to retrieve image sizes from gcloud (already done and put in the metadata tag of gcloudv with appropriate calls)\\n gCloudVObjsToCogniBoundingBox(gCloudObjects, gCloudV['metadata']['width'], gCloudV['metadata']['height']);\\n\\n for (let gCloudObj of gCloudObjects) {\\n if (gCloudObj['score'] > minScore) { //filter out unwanted tags\\n objects.push({\\n name: gCloudObj['name'],\\n mid: (gCloudObj['mid'] && gCloudObj['mid']!= '')? gCloudObj['mid']: undefined,\\n confidence: gCloudObj['score'],\\n boundingBox: gCloudObj['boundingBox']\\n });\\n }\\n }\\n }\\n\\n if(azureCV){// azure computer vision results are available\\n let azureObjects = azureCV['objects'];\\n //apply standard bounding box to all the detected objects\\n azureCVObjsToCogniBoundingBox(azureObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\\n for(let aObj of azureObjects){\\n if(aObj['confidence'] > minScore) { //filter out unwanted tags\\n objects.push({\\n name: aObj['object'],\\n confidence: aObj['confidence'],\\n boundingBox: aObj['boundingBox']\\n });\\n }\\n }\\n }\\n\\n objects = combineObjectsArray(objects);// build an array where labels regarding the same exact object are combined with averaged confidence\\n\\n objects.sort((a, b) => {\\n if(a['confidence']>b['confidence'])\\n return -1;\\n else if(a['confidence']==b['confidence'])\\n return 0;\\n else\\n return 1;\\n });\\n\\n return objects;\\n}\",\n \"function V(e){if(null===e||\\\"[object Object]\\\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}\",\n \"function classifyVideo() {\\r\\n classifier.classify(vid, gotResult);\\r\\n\\r\\n}\",\n \"function test_nountag_does_not_think_it_has_watch_tag_when_it_does_not() {\\n Assert.equal(TagNoun.fromJSON(\\\"watch\\\"), undefined);\\n}\",\n \"function markRaw(obj) {\\r\\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\\r\\n return obj;\\r\\n }\\r\\n // set the vue observable flag at obj\\r\\n var ob = createObserver();\\r\\n ob.__raw__ = true;\\r\\n def(obj, '__ob__', ob);\\r\\n // mark as Raw\\r\\n rawSet.set(obj, true);\\r\\n return obj;\\r\\n}\",\n \"function markRaw(obj) {\\r\\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\\r\\n return obj;\\r\\n }\\r\\n // set the vue observable flag at obj\\r\\n var ob = createObserver();\\r\\n ob.__raw__ = true;\\r\\n def(obj, '__ob__', ob);\\r\\n // mark as Raw\\r\\n rawSet.set(obj, true);\\r\\n return obj;\\r\\n}\",\n \"function v11(v12,v13) {\\n const v15 = v11(Object,Function);\\n // v15 = .unknown\\n const v16 = Object(v13,v8,0,v6);\\n // v16 = .object()\\n const v17 = 0;\\n // v17 = .integer\\n const v18 = 1;\\n // v18 = .integer\\n const v19 = 512;\\n // v19 = .integer\\n const v20 = \\\"-1024\\\";\\n // v20 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v21 = isFinite;\\n // v21 = .function([.anything] => .boolean)\\n const v23 = [1337];\\n // v23 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v24 = {};\\n // v24 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n let v25 = v23;\\n const v26 = -29897853;\\n // v26 = .integer\\n const v27 = \\\"replace\\\";\\n // v27 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v28 = Boolean;\\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\\\"prototype\\\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\\n const v30 = [13.37,13.37];\\n // v30 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v31 = 1337;\\n // v31 = .integer\\n let v32 = 13.37;\\n const v36 = [13.37,13.37,13.37];\\n // v36 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v38 = [1337,1337];\\n // v38 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v39 = [13.37,1337,v38,1337,\\\"-128\\\",13.37,\\\"-128\\\",\\\"-128\\\",2147483647,1337];\\n // v39 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v40 = {__proto__:v36,length:v39};\\n // v40 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\", \\\"length\\\"])\\n const v41 = \\\"0\\\";\\n // v41 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v42 = -4130093409;\\n // v42 = .integer\\n const v44 = {b:2147483647,e:v38,valueOf:v36};\\n // v44 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\", \\\"b\\\", \\\"valueOf\\\", \\\"e\\\"])\\n const v45 = \\\"k**baeaDif\\\";\\n // v45 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v46 = 65536;\\n // v46 = .integer\\n const v47 = \\\"k**baeaDif\\\";\\n // v47 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v48 = 13.37;\\n // v48 = .float\\n const v50 = [13.37,13.37];\\n // v50 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v51 = ~v50;\\n // v51 = .boolean\\n const v53 = [13.37];\\n // v53 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n let v54 = v53;\\n const v55 = gc;\\n // v55 = .function([] => .undefined)\\n const v58 = [13.37,13.37,13.37,13.37];\\n // v58 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v60 = [1337,1337,1337,1337];\\n // v60 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v61 = [3697200800,v58,v60];\\n // v61 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\\n // v62 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"__proto__\\\", \\\"length\\\", \\\"constructor\\\", \\\"toString\\\", \\\"valueOf\\\"])\\n const v65 = [13.37,13.37,13.37,13.37];\\n // v65 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v67 = [1337,1337,1337,1337];\\n // v67 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v68 = [3697200800,v65,v67];\\n // v68 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\\n // v69 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\", \\\"toString\\\", \\\"valueOf\\\"])\\n const v70 = Object;\\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n function v71(v72) {\\n }\\n const v74 = [13.37];\\n // v74 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v75 = 1337;\\n // v75 = .integer\\n const v76 = v44 ** 13.37;\\n // v76 = .integer | .float | .bigint\\n function v77(v78,v79,v80,v81,v82) {\\n }\\n let v83 = v74;\\n const v84 = \\\"2\\\";\\n // v84 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v85 = \\\"2\\\";\\n // v85 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v88 = [13.37,13.37,1337,13.37];\\n // v88 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n function v89(v90,v91,v92) {\\n }\\n const v94 = [1337,1337,1337,1337];\\n // v94 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v95 = [3697200800,v88,v94];\\n // v95 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n function v96(v97,v98) {\\n }\\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\\n // v99 = .object(ofGroup: Object, withProperties: [\\\"toString\\\", \\\"length\\\", \\\"constructor\\\", \\\"__proto__\\\", \\\"e\\\", \\\"d\\\"])\\n let v100 = 13.37;\\n const v101 = typeof v74;\\n // v101 = .string\\n const v102 = \\\"symbol\\\";\\n // v102 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v103 = 3697200800;\\n // v103 = .integer\\n const v104 = \\\"2\\\";\\n // v104 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v105 = Boolean;\\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\\\"prototype\\\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\\n const v106 = Function;\\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v107 = 13.37;\\n // v107 = .float\\n const v108 = 1337;\\n // v108 = .integer\\n const v109 = \\\"2\\\";\\n // v109 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v110 = Function;\\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v112 = [13.37,13.37,13.37,13.37];\\n // v112 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v113 = 1337;\\n // v113 = .integer\\n let v114 = 13.37;\\n const v116 = {...3697200800,...3697200800};\\n // v116 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n const v117 = Object;\\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v118 = Function;\\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v119 = {};\\n // v119 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n let v120 = v119;\\n const v121 = (3697200800).constructor;\\n // v121 = .unknown\\n function v122(v123,v124) {\\n }\\n const v125 = Promise;\\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"race\\\", \\\"allSettled\\\", \\\"reject\\\", \\\"all\\\", \\\"resolve\\\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\\\"__proto__\\\"], withMethods: [\\\"finally\\\", \\\"then\\\", \\\"catch\\\"]))\\n const v128 = 4;\\n // v128 = .integer\\n let v129 = 0;\\n const v131 = [13.37,13.37,13.37,13.37];\\n // v131 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v133 = [1337,1337,1337,1337];\\n // v133 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v134 = [3697200800,v131,v133];\\n // v134 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v135 = Object;\\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v136 = -944747134;\\n // v136 = .integer\\n const v139 = [13.37,13.37,13.37,13.37];\\n // v139 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v141 = [1337,1337,1337,1337];\\n // v141 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v142 = [3697200800,v139,v141];\\n // v142 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\\n // v143 = .object(ofGroup: Object, withProperties: [\\\"toString\\\", \\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\", \\\"valueOf\\\", \\\"length\\\"])\\n let v144 = v143;\\n const v145 = gc;\\n // v145 = .function([] => .undefined)\\n let v146 = 13.37;\\n const v150 = [13.37,13.37,13.37,Function];\\n // v150 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v152 = [1337,1337,1337,1337];\\n // v152 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v153 = [3697200800,v150,v152];\\n // v153 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v154 = v153 + 1;\\n // v154 = .primitive\\n let v155 = 0;\\n const v156 = v155 + 1;\\n // v156 = .primitive\\n const v158 = \\\"2\\\";\\n // v158 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v160 = [13.37,13.37,13.37,13.37];\\n // v160 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v162 = 0;\\n // v162 = .integer\\n const v163 = [1337,1337,1337,1337];\\n // v163 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v164 = [3697200800,1337,v163];\\n // v164 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v166 = 1337;\\n // v166 = .integer\\n let v167 = 2594067260;\\n const v169 = 4;\\n // v169 = .integer\\n let v170 = 0;\\n const v171 = v167 + 1;\\n // v171 = .primitive\\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\\n // v172 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"__proto__\\\", \\\"constructor\\\", \\\"valueOf\\\", \\\"length\\\", \\\"toString\\\"])\\n const v173 = 0;\\n // v173 = .integer\\n const v174 = 5;\\n // v174 = .integer\\n const v175 = 2937513072;\\n // v175 = .integer\\n const v176 = Object;\\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v177 = v172.constructor;\\n // v177 = .unknown\\n const v178 = 0;\\n // v178 = .integer\\n const v179 = 1;\\n // v179 = .integer\\n try {\\n } catch(v180) {\\n const v182 = [13.37,13.37,13.37,13.37];\\n // v182 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v183 = v182.__proto__;\\n // v183 = .object()\\n function v185(v186) {\\n }\\n const v187 = Object >>> v183;\\n // v187 = .integer | .bigint\\n }\\n function v188(v189,v190,v191,v192,...v193) {\\n }\\n}\",\n \"transient private internal function m185() {}\",\n \"test_doNotRetainAnno(){\\n let translator = new Translator();\\n translator.registerPackage(PackageFile);\\n let text = JSON.stringify(this.json.doNotRetainAnno);\\n let object1 = translator.decode(text).getRoot();\\n let object2 = translator.decode(text).getRoot();\\n\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\\\", object1.constructor.__getClass());\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\\\", object2.constructor.__getClass());\\n Assert.notEquals(object1, object2);\\n }\",\n \"function rekognizeLabels(bucket, key) {\\n let params = {\\n Image: {\\n S3Object: {\\n Bucket: bucket,\\n Name: key\\n }\\n },\\n MaxLabels: 3,\\n MinConfidence: 80\\n };\\n\\n return rekognition.detectLabels(params).promise()\\n}\",\n \"function OOPExample(who) {\\n this.me = who;\\n}\",\n \"function LK_likeIt(elem) {\\n var likeGroup = elem.getAttribute(LK_LIKEGROUP);\\n var likeValue = elem.getAttribute(LK_LIKEVALUE);\\n localStorage[likeGroup] = likeValue;\\n\\n // Change the style of the liker nodes\\n var siblings = elem.parentNode.childNodes;\\n for (var i = 0; i < siblings.length; i++) {\\n if (siblings[i].style) { \\n LK_applyNormalStyle(siblings[i]);\\n }\\n }\\n LK_applySelectedStyle(elem, likeValue);\\n\\n // Change the value of any mini likers\\n var allSpans = document.getElementsByTagName('span');\\n for (var i = 0; i < allSpans.length; i++) {\\n var span = allSpans[i];\\n if (span.getAttribute(LK_LIKEGROUP) == likeGroup) {\\n if (span.getAttribute(LK_LIKETYPE) == 'mini') {\\n span.innerHTML = LK_MAPPINGS[likeValue].label;\\n LK_applySelectedStyle(allSpans[i], likeValue);\\n }\\n }\\n }\\n}\",\n \"function _isAlternativeRecognitionResult(obj) {\\r\\n return obj && typeof obj === 'object';\\r\\n}\",\n \"getLikes(state, data) {\\n state.likes = data\\n }\",\n \"function LiteralObject() {\\r\\n}\",\n \"function addLikes() {\\n if (propLike?.includes(user.username)) {\\n let index = propLike.indexOf(user.username);\\n let removeLike = [\\n ...propLike.slice(0, index),\\n ...propLike.slice(index + 1),\\n ];\\n setLikeGet(removeLike);\\n setPropLike(removeLike);\\n setRedLike(\\\"\\\");\\n\\n addToLike(eventid, removeLike);\\n } else {\\n let likesArr = [...propLike, `${user.username}`];\\n\\n setLikeGet(likesArr);\\n setPropLike(likesArr);\\n setRedLike(\\\"red\\\");\\n addToLike(eventid, likesArr);\\n }\\n }\",\n \"function Komunalne() {}\",\n \"function Bevy() {}\",\n \"function Prediction() {\\n this.score = {};\\n}\",\n \"function Object() {}\",\n \"function Object() {}\",\n \"function canEnumPub(obj, name) {\\n if (obj === null) { return false; }\\n if (obj === void 0) { return false; }\\n name = String(name);\\n if (obj[name + '_canEnum___']) { return true; }\\n if (endsWith__.test(name)) { return false; }\\n if (!isJSONContainer(obj)) { return false; }\\n if (!myOriginalHOP.call(obj, name)) { return false; }\\n fastpathEnum(obj, name);\\n if (name === 'toString') { return true; }\\n fastpathRead(obj, name);\\n return true;\\n }\",\n \"function Obj(){ return Literal.apply(this,arguments) }\",\n \"test_primitives() {\\n let translator = new Translator();\\n translator.registerPackage(PackageFile);\\n let text = JSON.stringify(this.json.primitives);\\n let object = translator.decode(text).getRoot();\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.Primitives\\\", object.constructor.__getClass());\\n Assert.equals(\\\"alpha9\\\", object.string);\\n }\",\n \"function hello()\\n{\\n /* ATTRIBUTES */\\n this.coolbeans = 'class';\\n this.something = 'hello-class';\\n\\n}\",\n \"function test_cluster_tagged_crosshair_op_vsphere65() {}\",\n \"function classifyVideo() {\\n classifier.classify(gotResult);\\n}\",\n \"function classifyVideo() {\\n classifier.classify(gotResult);\\n}\",\n \"function v8(v9,v10) {\\n const v16 = [1337,1337];\\n // v16 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v17 = [\\\"536870912\\\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\\n // v17 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v18 = {constructor:13.37,e:v16};\\n // v18 = .object(ofGroup: Object, withProperties: [\\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\"])\\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\\n // v19 = .object(ofGroup: Object, withProperties: [\\\"d\\\", \\\"b\\\", \\\"a\\\", \\\"__proto__\\\", \\\"e\\\", \\\"constructor\\\", \\\"length\\\"])\\n const v21 = new Float64Array(v19);\\n // v21 = .object(ofGroup: Float64Array, withProperties: [\\\"byteOffset\\\", \\\"constructor\\\", \\\"buffer\\\", \\\"__proto__\\\", \\\"byteLength\\\", \\\"length\\\"], withMethods: [\\\"map\\\", \\\"values\\\", \\\"subarray\\\", \\\"find\\\", \\\"fill\\\", \\\"set\\\", \\\"findIndex\\\", \\\"some\\\", \\\"reduceRight\\\", \\\"reverse\\\", \\\"join\\\", \\\"includes\\\", \\\"entries\\\", \\\"reduce\\\", \\\"every\\\", \\\"copyWithin\\\", \\\"sort\\\", \\\"forEach\\\", \\\"lastIndexOf\\\", \\\"indexOf\\\", \\\"filter\\\", \\\"slice\\\", \\\"keys\\\"])\\n v6[6] = v7;\\n v7.toString = v9;\\n }\",\n \"constructor(papa,mummy,sivlings,belongs,loving_bro,favs_bro){\\n super(papa,mummy,sivlings,belongs)\\n this.loving_bro=loving_bro\\n this.favs_bro=favs_bro\\n }\",\n \"function defineInspect(classObject) {\\n var fn = classObject.prototype.toJSON;\\n typeof fn === 'function' || invariant(0);\\n classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\\n\\n if (nodejsCustomInspectSymbol[\\\"a\\\" /* default */]) {\\n classObject.prototype[nodejsCustomInspectSymbol[\\\"a\\\" /* default */]] = fn;\\n }\\n}\",\n \"annotate(message: string, data: Object) {\\n this.message = message;\\n this.data = assign(this.data, data);\\n }\",\n \"function encodeObject(o) {\\n if (_.isNumber(o)) {\\n if (_.isNaN(o)) {\\n return ['SPECIAL_FLOAT', 'NaN'];\\n } else if (o === Infinity) {\\n return ['SPECIAL_FLOAT', 'Infinity'];\\n } else if (o === -Infinity) {\\n return ['SPECIAL_FLOAT', '-Infinity'];\\n } else {\\n return o;\\n }\\n } else if (_.isString(o)) {\\n return o;\\n } else if (_.isBoolean(o) || _.isNull(o) || _.isUndefined(o)) {\\n return ['JS_SPECIAL_VAL', String(o)];\\n } else if (typeof o === 'symbol') {\\n // ES6 symbol\\n return ['JS_SPECIAL_VAL', String(o)];\\n } else {\\n // render these as heap objects\\n\\n // very important to use _.has since we don't want to\\n // grab the property in your prototype, only in YOURSELF ... SUBTLE!\\n if (!_.has(o, 'smallObjId_hidden_')) {\\n // make this non-enumerable so that it doesn't show up in\\n // console.log() or other inspector functions\\n Object.defineProperty(o, 'smallObjId_hidden_', { value: smallObjId,\\n enumerable: false });\\n smallObjId++;\\n }\\n assert(o.smallObjId_hidden_ > 0);\\n\\n var ret = ['REF', o.smallObjId_hidden_];\\n\\n if (encodedHeapObjects[String(o.smallObjId_hidden_)] !== undefined) {\\n return ret;\\n }\\n else {\\n assert(_.isObject(o));\\n\\n var newEncodedObj = [];\\n encodedHeapObjects[String(o.smallObjId_hidden_)] = newEncodedObj;\\n\\n var i;\\n\\n if (_.isFunction(o)) {\\n var funcProperties = []; // each element is a pair of [name, encoded value]\\n\\n var encodedProto = null;\\n if (_.isObject(o.prototype)) {\\n // TRICKY TRICKY! for inheritance to be displayed properly, we\\n // want to find the prototype of o.prototype and see if it's\\n // non-empty. if that's true, then even if o.prototype is\\n // empty (i.e., has no properties of its own), then we should\\n // still encode it since its 'prototype' \\\"uber-hidden\\n // property\\\" is non-empty\\n var prototypeOfPrototype = Object.getPrototypeOf(o.prototype);\\n if (!_.isEmpty(o.prototype) ||\\n (_.isObject(prototypeOfPrototype) && !_.isEmpty(prototypeOfPrototype))) {\\n encodedProto = encodeObject(o.prototype);\\n }\\n }\\n\\n if (encodedProto) {\\n funcProperties.push(['prototype', encodedProto]);\\n }\\n\\n // now get all of the normal properties out of this function\\n // object (it's unusual to put properties in a function object,\\n // but it's still legal!)\\n var funcPropPairs = _.pairs(o);\\n for (i = 0; i < funcPropPairs.length; i++) {\\n funcProperties.push([funcPropPairs[i][0], encodeObject(funcPropPairs[i][1])]);\\n }\\n\\n var funcCodeString = o.toString();\\n\\n /*\\n\\n #craftsmanship -- make nested functions look better by indenting\\n the first line of a nested function definition by however much\\n the LAST line is indented, ONLY if the last line is simply a\\n single ending '}'. otherwise it will look ugly since the\\n function definition doesn't start out indented, like so:\\n\\nfunction bar(x) {\\n globalZ += 100;\\n return x + y + globalZ;\\n }\\n\\n */\\n var codeLines = funcCodeString.split('\\\\n');\\n if (codeLines.length > 1) {\\n var lastLine = _.last(codeLines);\\n if (lastLine.trim() === '}') {\\n var lastLinePrefix = lastLine.slice(0, lastLine.indexOf('}'));\\n funcCodeString = lastLinePrefix + funcCodeString; // prepend!\\n }\\n }\\n\\n newEncodedObj.push('JS_FUNCTION',\\n o.name,\\n funcCodeString, /* code string*/\\n funcProperties.length ? funcProperties : null, /* OPTIONAL */\\n null /* parent frame */);\\n } else if (_.isArray(o)) {\\n newEncodedObj.push('LIST');\\n for (i = 0; i < o.length; i++) {\\n newEncodedObj.push(encodeObject(o[i]));\\n }\\n } else if (o.__proto__.toString() === canonicalSet.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\\n newEncodedObj.push('SET');\\n // ES6 Set (TODO: add WeakSet)\\n for (let item of o) {\\n newEncodedObj.push(encodeObject(item));\\n }\\n } else if (o.__proto__.toString() === canonicalMap.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\\n // ES6 Map (TODO: add WeakMap)\\n newEncodedObj.push('DICT'); // use the Python 'DICT' type since it's close enough; adjust display in frontend\\n for (let [key, value] of o) {\\n newEncodedObj.push([encodeObject(key), encodeObject(value)]);\\n }\\n } else {\\n // a true object\\n\\n // if there's a custom toString() function (note that a truly\\n // prototypeless object won't have toString method, so check first to\\n // see if toString is *anywhere* up the prototype chain)\\n var s = (o.toString !== undefined) ? o.toString() : '';\\n if (s !== '' && s !== '[object Object]') {\\n newEncodedObj.push('INSTANCE_PPRINT', 'object', s);\\n } else {\\n newEncodedObj.push('INSTANCE', '');\\n var pairs = _.pairs(o);\\n for (i = 0; i < pairs.length; i++) {\\n var e = pairs[i];\\n newEncodedObj.push([encodeObject(e[0]), encodeObject(e[1])]);\\n }\\n\\n var proto = Object.getPrototypeOf(o);\\n if (_.isObject(proto) && !_.isEmpty(proto)) {\\n //log('obj.prototype', proto, proto.smallObjId_hidden_);\\n // I think __proto__ is the official term for this field,\\n // *not* 'prototype'\\n newEncodedObj.push(['__proto__', encodeObject(proto)]);\\n }\\n }\\n }\\n\\n return ret;\\n }\\n\\n }\\n assert(false);\\n}\",\n \"function dist_index_esm_contains(obj,key){return Object.prototype.hasOwnProperty.call(obj,key);}\",\n \"function isRawPostcodeObject(o, additionalAttr, blackListedAttr) {\\n\\tif (!additionalAttr) additionalAttr = [];\\n\\tif (!blackListedAttr) blackListedAttr = [];\\n\\tisSomeObject(o, rawPostcodeAttributes, additionalAttr, blackListedAttr);\\n}\",\n \"function _meta_(v,m){var ms=v['__meta__']||{};for(var k in m){ms[k]=m[k]};v['__meta__']=ms;return v}\",\n \"function Animal() {\\n this.kind = \\\"Dog\\\"\\n}\",\n \"function Kitten(name, photo, interests, isGoodWithKids, isGoodWithDogs, isGoodWithCats) {\\n this.name = name;\\n this.photo = photo;\\n this.interests = interests;\\n this.isGoodWithKids = isGoodWithKids;\\n this.isGoodWithCats = isGoodWithCats;\\n this.isGoodWithDogs = isGoodWithDogs;\\n}\",\n \"getMeta () {\\n }\",\n \"function np(e){return\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function Obj() {}\",\n \"function test_fail_hole_prototype() {\\n var obj = Object.create({ stuff: \\\"in prototype\\\" });\\n obj.foo = \\\"bar\\\";\\n\\n function f1() {\\n bidar.serialize(obj);\\n }\\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\\n}\",\n \"function Person(saying) {\\n this.saying = saying;\\n /*\\n return {\\n dumbObject: true\\n }\\n */\\n}\",\n \"function isFriend(name, object) {\\n//use hasWord function to check object names array\\n// console.log(object);\\n// console.log(name);\\n//conditional to check for property\\nif (object['friends'] !== undefined) {\\nreturn hasWord(object.friends.join(' '), name);\\n}\\nelse {return false};\\n \\n}\",\n \"transient private protected internal function m182() {}\",\n \"function kotlin(hljs) {\\n const KEYWORDS = {\\n keyword:\\n 'abstract as val var vararg get set class object open private protected public noinline ' +\\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\\n 'import package is in fun override companion reified inline lateinit init ' +\\n 'interface annotation data sealed internal infix operator out by constructor super ' +\\n 'tailrec where const inner suspend typealias external expect actual',\\n built_in:\\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\\n literal:\\n 'true false null'\\n };\\n const KEYWORDS_WITH_LABEL = {\\n className: 'keyword',\\n begin: /\\\\b(break|continue|return|this)\\\\b/,\\n starts: {\\n contains: [\\n {\\n className: 'symbol',\\n begin: /@\\\\w+/\\n }\\n ]\\n }\\n };\\n const LABEL = {\\n className: 'symbol',\\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\\n };\\n\\n // for string templates\\n const SUBST = {\\n className: 'subst',\\n begin: /\\\\$\\\\{/,\\n end: /\\\\}/,\\n contains: [ hljs.C_NUMBER_MODE ]\\n };\\n const VARIABLE = {\\n className: 'variable',\\n begin: '\\\\\\\\$' + hljs.UNDERSCORE_IDENT_RE\\n };\\n const STRING = {\\n className: 'string',\\n variants: [\\n {\\n begin: '\\\"\\\"\\\"',\\n end: '\\\"\\\"\\\"(?=[^\\\"])',\\n contains: [\\n VARIABLE,\\n SUBST\\n ]\\n },\\n // Can't use built-in modes easily, as we want to use STRING in the meta\\n // context as 'meta-string' and there's no syntax to remove explicitly set\\n // classNames in built-in modes.\\n {\\n begin: '\\\\'',\\n end: '\\\\'',\\n illegal: /\\\\n/,\\n contains: [ hljs.BACKSLASH_ESCAPE ]\\n },\\n {\\n begin: '\\\"',\\n end: '\\\"',\\n illegal: /\\\\n/,\\n contains: [\\n hljs.BACKSLASH_ESCAPE,\\n VARIABLE,\\n SUBST\\n ]\\n }\\n ]\\n };\\n SUBST.contains.push(STRING);\\n\\n const ANNOTATION_USE_SITE = {\\n className: 'meta',\\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\\\\\s*:(?:\\\\\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\\n };\\n const ANNOTATION = {\\n className: 'meta',\\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\\n contains: [\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [\\n hljs.inherit(STRING, {\\n className: 'meta-string'\\n })\\n ]\\n }\\n ]\\n };\\n\\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\\n // According to the doc above, the number mode of kotlin is the same as java 8,\\n // so the code below is copied from java.js\\n const KOTLIN_NUMBER_MODE = NUMERIC;\\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\\n '/\\\\\\\\*', '\\\\\\\\*/',\\n {\\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\\n }\\n );\\n const KOTLIN_PAREN_TYPE = {\\n variants: [\\n {\\n className: 'type',\\n begin: hljs.UNDERSCORE_IDENT_RE\\n },\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [] // defined later\\n }\\n ]\\n };\\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\\n\\n return {\\n name: 'Kotlin',\\n aliases: [ 'kt' ],\\n keywords: KEYWORDS,\\n contains: [\\n hljs.COMMENT(\\n '/\\\\\\\\*\\\\\\\\*',\\n '\\\\\\\\*/',\\n {\\n relevance: 0,\\n contains: [\\n {\\n className: 'doctag',\\n begin: '@[A-Za-z]+'\\n }\\n ]\\n }\\n ),\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n KEYWORDS_WITH_LABEL,\\n LABEL,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n {\\n className: 'function',\\n beginKeywords: 'fun',\\n end: '[(]|$',\\n returnBegin: true,\\n excludeEnd: true,\\n keywords: KEYWORDS,\\n relevance: 5,\\n contains: [\\n {\\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\\\\\s*\\\\\\\\(',\\n returnBegin: true,\\n relevance: 0,\\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\\n },\\n {\\n className: 'type',\\n begin: /</,\\n end: />/,\\n keywords: 'reified',\\n relevance: 0\\n },\\n {\\n className: 'params',\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n endsParent: true,\\n keywords: KEYWORDS,\\n relevance: 0,\\n contains: [\\n {\\n begin: /:/,\\n end: /[=,\\\\/]/,\\n endsWithParent: true,\\n contains: [\\n KOTLIN_PAREN_TYPE,\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT\\n ],\\n relevance: 0\\n },\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n STRING,\\n hljs.C_NUMBER_MODE\\n ]\\n },\\n KOTLIN_NESTED_COMMENT\\n ]\\n },\\n {\\n className: 'class',\\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\\n end: /[:\\\\{(]|$/,\\n excludeEnd: true,\\n illegal: 'extends implements',\\n contains: [\\n {\\n beginKeywords: 'public protected internal private constructor'\\n },\\n hljs.UNDERSCORE_TITLE_MODE,\\n {\\n className: 'type',\\n begin: /</,\\n end: />/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0\\n },\\n {\\n className: 'type',\\n begin: /[,:]\\\\s*/,\\n end: /[<\\\\(,]|$/,\\n excludeBegin: true,\\n returnEnd: true\\n },\\n ANNOTATION_USE_SITE,\\n ANNOTATION\\n ]\\n },\\n STRING,\\n {\\n className: 'meta',\\n begin: \\\"^#!/usr/bin/env\\\",\\n end: '$',\\n illegal: '\\\\n'\\n },\\n KOTLIN_NUMBER_MODE\\n ]\\n };\\n}\",\n \"function kotlin(hljs) {\\n const KEYWORDS = {\\n keyword:\\n 'abstract as val var vararg get set class object open private protected public noinline ' +\\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\\n 'import package is in fun override companion reified inline lateinit init ' +\\n 'interface annotation data sealed internal infix operator out by constructor super ' +\\n 'tailrec where const inner suspend typealias external expect actual',\\n built_in:\\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\\n literal:\\n 'true false null'\\n };\\n const KEYWORDS_WITH_LABEL = {\\n className: 'keyword',\\n begin: /\\\\b(break|continue|return|this)\\\\b/,\\n starts: {\\n contains: [\\n {\\n className: 'symbol',\\n begin: /@\\\\w+/\\n }\\n ]\\n }\\n };\\n const LABEL = {\\n className: 'symbol',\\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\\n };\\n\\n // for string templates\\n const SUBST = {\\n className: 'subst',\\n begin: /\\\\$\\\\{/,\\n end: /\\\\}/,\\n contains: [ hljs.C_NUMBER_MODE ]\\n };\\n const VARIABLE = {\\n className: 'variable',\\n begin: '\\\\\\\\$' + hljs.UNDERSCORE_IDENT_RE\\n };\\n const STRING = {\\n className: 'string',\\n variants: [\\n {\\n begin: '\\\"\\\"\\\"',\\n end: '\\\"\\\"\\\"(?=[^\\\"])',\\n contains: [\\n VARIABLE,\\n SUBST\\n ]\\n },\\n // Can't use built-in modes easily, as we want to use STRING in the meta\\n // context as 'meta-string' and there's no syntax to remove explicitly set\\n // classNames in built-in modes.\\n {\\n begin: '\\\\'',\\n end: '\\\\'',\\n illegal: /\\\\n/,\\n contains: [ hljs.BACKSLASH_ESCAPE ]\\n },\\n {\\n begin: '\\\"',\\n end: '\\\"',\\n illegal: /\\\\n/,\\n contains: [\\n hljs.BACKSLASH_ESCAPE,\\n VARIABLE,\\n SUBST\\n ]\\n }\\n ]\\n };\\n SUBST.contains.push(STRING);\\n\\n const ANNOTATION_USE_SITE = {\\n className: 'meta',\\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\\\\\s*:(?:\\\\\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\\n };\\n const ANNOTATION = {\\n className: 'meta',\\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\\n contains: [\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [\\n hljs.inherit(STRING, {\\n className: 'meta-string'\\n })\\n ]\\n }\\n ]\\n };\\n\\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\\n // According to the doc above, the number mode of kotlin is the same as java 8,\\n // so the code below is copied from java.js\\n const KOTLIN_NUMBER_MODE = NUMERIC;\\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\\n '/\\\\\\\\*', '\\\\\\\\*/',\\n {\\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\\n }\\n );\\n const KOTLIN_PAREN_TYPE = {\\n variants: [\\n {\\n className: 'type',\\n begin: hljs.UNDERSCORE_IDENT_RE\\n },\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [] // defined later\\n }\\n ]\\n };\\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\\n\\n return {\\n name: 'Kotlin',\\n aliases: [ 'kt' ],\\n keywords: KEYWORDS,\\n contains: [\\n hljs.COMMENT(\\n '/\\\\\\\\*\\\\\\\\*',\\n '\\\\\\\\*/',\\n {\\n relevance: 0,\\n contains: [\\n {\\n className: 'doctag',\\n begin: '@[A-Za-z]+'\\n }\\n ]\\n }\\n ),\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n KEYWORDS_WITH_LABEL,\\n LABEL,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n {\\n className: 'function',\\n beginKeywords: 'fun',\\n end: '[(]|$',\\n returnBegin: true,\\n excludeEnd: true,\\n keywords: KEYWORDS,\\n relevance: 5,\\n contains: [\\n {\\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\\\\\s*\\\\\\\\(',\\n returnBegin: true,\\n relevance: 0,\\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\\n },\\n {\\n className: 'type',\\n begin: /</,\\n end: />/,\\n keywords: 'reified',\\n relevance: 0\\n },\\n {\\n className: 'params',\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n endsParent: true,\\n keywords: KEYWORDS,\\n relevance: 0,\\n contains: [\\n {\\n begin: /:/,\\n end: /[=,\\\\/]/,\\n endsWithParent: true,\\n contains: [\\n KOTLIN_PAREN_TYPE,\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT\\n ],\\n relevance: 0\\n },\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n STRING,\\n hljs.C_NUMBER_MODE\\n ]\\n },\\n KOTLIN_NESTED_COMMENT\\n ]\\n },\\n {\\n className: 'class',\\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\\n end: /[:\\\\{(]|$/,\\n excludeEnd: true,\\n illegal: 'extends implements',\\n contains: [\\n {\\n beginKeywords: 'public protected internal private constructor'\\n },\\n hljs.UNDERSCORE_TITLE_MODE,\\n {\\n className: 'type',\\n begin: /</,\\n end: />/,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0\\n },\\n {\\n className: 'type',\\n begin: /[,:]\\\\s*/,\\n end: /[<\\\\(,]|$/,\\n excludeBegin: true,\\n returnEnd: true\\n },\\n ANNOTATION_USE_SITE,\\n ANNOTATION\\n ]\\n },\\n STRING,\\n {\\n className: 'meta',\\n begin: \\\"^#!/usr/bin/env\\\",\\n end: '$',\\n illegal: '\\\\n'\\n },\\n KOTLIN_NUMBER_MODE\\n ]\\n };\\n}\",\n \"static serialize(obj, allowPrimitives, fallbackToJson, requireJsonType = false) {\\n if (allowPrimitives) {\\n if (typeof obj === \\\"string\\\") {\\n return this.serializePrimitive(obj, \\\"string\\\");\\n } else if (typeof obj === \\\"number\\\") {\\n return this.serializePrimitive(obj, \\\"double\\\");\\n } else if (Buffer.isBuffer(obj)) {\\n return this.serializePrimitive(obj, \\\"bytes\\\");\\n } else if (typeof obj === \\\"boolean\\\") {\\n return this.serializePrimitive(obj, \\\"bool\\\");\\n } else if (Long.isLong(obj)) {\\n return this.serializePrimitive(obj, \\\"int64\\\");\\n }\\n }\\n if (obj.constructor && typeof obj.constructor.encode === \\\"function\\\" && obj.constructor.$type) {\\n return Any.create({\\n // I have *no* idea why it's type_url and not typeUrl, but it is.\\n type_url: \\\"type.googleapis.com/\\\" + AnySupport.fullNameOf(obj.constructor.$type),\\n value: obj.constructor.encode(obj).finish()\\n });\\n } else if (fallbackToJson && typeof obj === \\\"object\\\") {\\n let type = obj.type;\\n if (type === undefined) {\\n if (requireJsonType) {\\n throw new Error(util.format(\\\"Fallback to JSON serialization supported, but object does not define a type property: %o\\\", obj));\\n } else {\\n type = \\\"object\\\";\\n }\\n }\\n return Any.create({\\n type_url: CloudStateJson + type,\\n value: this.serializePrimitiveValue(stableJsonStringify(obj), \\\"string\\\")\\n });\\n } else {\\n throw new Error(util.format(\\\"Object %o is not a protobuf object, and hence can't be dynamically \\\" +\\n \\\"serialized. Try passing the object to the protobuf classes create function.\\\", obj));\\n }\\n }\",\n \"function Surrogate(){}\",\n \"function Surrogate(){}\",\n \"function Surrogate(){}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.52765024","0.5259989","0.5191908","0.5185475","0.5126739","0.5045062","0.4894077","0.4859557","0.4840031","0.48308602","0.48213598","0.48129985","0.48068723","0.47867215","0.4783404","0.47590926","0.4750297","0.47395125","0.47262868","0.47044972","0.47044972","0.46951544","0.46903944","0.469036","0.46882057","0.46685544","0.46643713","0.46479693","0.4631229","0.4607393","0.45995632","0.45931837","0.45899883","0.45893827","0.45862082","0.45850316","0.45849803","0.45817357","0.45812583","0.457647","0.457647","0.457647","0.45739856","0.4568857","0.45661232","0.45661232","0.4558207","0.4558207","0.4558207","0.45506155","0.453823","0.45350957","0.45337877","0.45323858","0.45237136","0.45237136","0.45232755","0.45175558","0.45116183","0.45084187","0.45059195","0.4502858","0.45010653","0.45004973","0.44982514","0.44969717","0.4486188","0.4478461","0.4475107","0.44722384","0.44722384","0.44699332","0.4461626","0.4456836","0.44552526","0.44519946","0.4446745","0.4446745","0.4444956","0.444456","0.44430515","0.44382852","0.4437338","0.4429806","0.44288862","0.44287312","0.44265378","0.44205824","0.4414446","0.44129986","0.4408074","0.44023204","0.4400793","0.440048","0.43962485","0.4383952","0.4383952","0.43839452","0.43831858","0.43831858","0.43831858"],"string":"[\n \"0.52765024\",\n \"0.5259989\",\n \"0.5191908\",\n \"0.5185475\",\n \"0.5126739\",\n \"0.5045062\",\n \"0.4894077\",\n \"0.4859557\",\n \"0.4840031\",\n \"0.48308602\",\n \"0.48213598\",\n \"0.48129985\",\n \"0.48068723\",\n \"0.47867215\",\n \"0.4783404\",\n \"0.47590926\",\n \"0.4750297\",\n \"0.47395125\",\n \"0.47262868\",\n \"0.47044972\",\n \"0.47044972\",\n \"0.46951544\",\n \"0.46903944\",\n \"0.469036\",\n \"0.46882057\",\n \"0.46685544\",\n \"0.46643713\",\n \"0.46479693\",\n \"0.4631229\",\n \"0.4607393\",\n \"0.45995632\",\n \"0.45931837\",\n \"0.45899883\",\n \"0.45893827\",\n \"0.45862082\",\n \"0.45850316\",\n \"0.45849803\",\n \"0.45817357\",\n \"0.45812583\",\n \"0.457647\",\n \"0.457647\",\n \"0.457647\",\n \"0.45739856\",\n \"0.4568857\",\n \"0.45661232\",\n \"0.45661232\",\n \"0.4558207\",\n \"0.4558207\",\n \"0.4558207\",\n \"0.45506155\",\n \"0.453823\",\n \"0.45350957\",\n \"0.45337877\",\n \"0.45323858\",\n \"0.45237136\",\n \"0.45237136\",\n \"0.45232755\",\n \"0.45175558\",\n \"0.45116183\",\n \"0.45084187\",\n \"0.45059195\",\n \"0.4502858\",\n \"0.45010653\",\n \"0.45004973\",\n \"0.44982514\",\n \"0.44969717\",\n \"0.4486188\",\n \"0.4478461\",\n \"0.4475107\",\n \"0.44722384\",\n \"0.44722384\",\n \"0.44699332\",\n \"0.4461626\",\n \"0.4456836\",\n \"0.44552526\",\n \"0.44519946\",\n \"0.4446745\",\n \"0.4446745\",\n \"0.4444956\",\n \"0.444456\",\n \"0.44430515\",\n \"0.44382852\",\n \"0.4437338\",\n \"0.4429806\",\n \"0.44288862\",\n \"0.44287312\",\n \"0.44265378\",\n \"0.44205824\",\n \"0.4414446\",\n \"0.44129986\",\n \"0.4408074\",\n \"0.44023204\",\n \"0.4400793\",\n \"0.440048\",\n \"0.43962485\",\n \"0.4383952\",\n \"0.4383952\",\n \"0.43839452\",\n \"0.43831858\",\n \"0.43831858\",\n \"0.43831858\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74179,"cells":{"query":{"kind":"string","value":"inlined Object.is polyfill to avoid requiring consumers ship their own /eslintdisable noselfcompare"},"document":{"kind":"string","value":"function is(x, y) {\n // SameValue algorithm\n if (x === y) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n return x !== 0 || 1 / x === 1 / y;\n } else {\n // Step 6.a: NaN == NaN\n return x !== x && y !== y;\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function u(e){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}","function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray$1(obj);\n}","function i(e){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}","function is(obj) {\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\"c\" /* default */];\n}","function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function _isPlainObject(obj) {\n return (obj && obj.constructor.prototype === Object.prototype);\n}","__is_object(value) {\n return value && typeof value === 'object' && value.constructor === Object;\n }","function isObject(obj) { // 71\n\t\treturn toString.call(obj) === '[object Object]'; // 72\n\t} // 73","isPlainObject(obj) {\n return _toString.call(obj) === '[object Object]'\n }","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject$1(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","isObject(obj) {\n return obj !== null && typeof obj === 'object'\n }","function isObject(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }","function isObjectLike(value) {\n return _typeof$1(value) == 'object' && value !== null;\n }","function isObjectLike$a(value) {\n return typeof value == 'object' && value !== null;\n}","function isObject(o) { return typeof o === 'object'; }","function isObject(o) { return typeof o === 'object'; }","function isObject(o) { return typeof o === 'object'; }","static hasObjectify(object) {\n return isObjectAssigned(object) && isFunction(object.objectify);\n }","function isObjectLike(value) {\n return typeof value === \"object\" && !!value;\n}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObjectObject(o){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction isObject(val){return null!=val&&\"object\"==typeof val&&!1===Array.isArray(val)}(o)&&\"[object Object]\"===Object.prototype.toString.call(o)}","function isObject(obj) {\n return obj === Object(obj);\n}","function isObject(entry) {\n return entry.constructor === Object;\n}","function isObject(obj) {\n return obj === Object(obj);\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}","__key_in_object(object, key) {\n if (Object.prototype.hasOwnProperty.call(object, key)) {\n return true\n } else {\n return false\n }\n }","function utilIsIterable(obj) {\n\t\treturn obj != null && typeof obj[Symbol.iterator] === 'function'; // lazy equality for null\n\t}","function isObjectLike(value) {\n return value != null && (typeof value === \"function\" || typeof value === \"object\");\n}","function isObjectLike(obj) {\n return typeof obj === \"object\" && obj !== null;\n}","function isObject (o) { return o && typeof o === 'object' }","function isObject (o) { return o && typeof o === 'object' }","function isObject$8(val) {\n return kindOf$3(val) === 'object' || typeof val === 'function';\n}","function isObject(obj){\n return Object.prototype.toString.call(obj) == '[object Object]';\n }","function isObject$1(e){return\"[object Object]\"===Object.prototype.toString.call(e)}","function isObject(value) { return typeof value === \"object\" && value !== null; }","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function _isObject(v) {\n return (Object.prototype.toString.call(v) === '[object Object]');\n}","function isObj$1(something) {\n return typeDetect(something) === 'Object';\n}","function isObject(a) {\n return (!!a) && (a.constructor === Object);\n}","function isObject(o){ return typeof o === 'object' && o !== null; }","function isObject$2556(x$2572) {\n return function isObject$2556(x$2573) {\n return function (a0$2574) {\n if (Object.prototype.toString.call(a0$2574) === '[object Object]') {\n return true;\n }\n return false;\n }.call(this, x$2573);\n }.curry().apply(null, arguments);\n }","function isObject(obj) {\n\n return obj && typeof obj === \"object\";\n}","isObjectEqual(a, b) {\n return a && b && a.foo === b.foo;\n }","function objectHasEnumerableKeys(value) {\n for (const _ in value) return true;\n return false;\n}","function isObject(x) {\n return x != null && typeof x === 'object';\n}","function isObject(o) {\n return o === Object(o);\n}","function isObject( x ) {\n return typeof x === \"object\" && x !== null;\n }","function isFrozen(obj) {\n if (!obj) { return true; }\n // TODO(erights): Object(<primitive>) wrappers should also be\n // considered frozen.\n if (obj.FROZEN___ === obj) { return true; }\n var t = typeof obj;\n return t !== 'object' && t !== 'function';\n }","function isIterableObject(obj) {\n if (obj === undefined || obj === null) {\n return false;\n }\n var t = typeof(obj);\n var types = {'string': 0, 'function': 0, 'number': 0, 'undefined': 0, 'boolean': 0};\n return types[t] === undefined;\n}","function isObject(value) {\n return typeof value === 'object' && !!value;\n}","function isObject$1(value) {\n return _typeof_1(value) === \"object\" && value !== null;\n}","function isObject$1(value) {\n return _typeof_1(value) === \"object\" && value !== null;\n}","function isObject(x) {\n return typeof x === \"object\" && x !== null;\n}","function isObject$1(value) {\n return typeof value === 'object' && value !== null || typeof value === 'function';\n }","function isObject(obj) {\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\n}","function isObject(e){return Object.prototype.toString.call(e)===\"[object Object]\"}","function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}","function isObject(obj){return obj!==null&&(typeof obj===\"undefined\"?\"undefined\":_typeof2(obj))==='object';}","function isObject(obj) {\n return Object.prototype.toString.call(obj) === '[object Object]';\n}","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function isObject$1(obj) {\n return obj !== null && _typeof(obj) === 'object' && 'constructor' in obj && obj.constructor === Object;\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function IsObject(x) {\r\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\r\n }","function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }","function isObject(value) {\n return value && typeof value === 'object';\n}","function isObject$2(value) {\n return (\n typeof value === \"object\" &&\n value !== null &&\n // none of these are collection objects, so we can return false\n !(value instanceof Boolean) &&\n !(value instanceof Date) &&\n !(value instanceof Error) &&\n !(value instanceof Number) &&\n !(value instanceof RegExp) &&\n !(value instanceof String)\n );\n}","function isObject$2(value) {\n return (\n typeof value === \"object\" &&\n value !== null &&\n // none of these are collection objects, so we can return false\n !(value instanceof Boolean) &&\n !(value instanceof Date) &&\n !(value instanceof Error) &&\n !(value instanceof Number) &&\n !(value instanceof RegExp) &&\n !(value instanceof String)\n );\n}","function checkIfObject(obj) {\n if (obj === null || typeof obj === \"function\") return false;\n return typeof obj === \"object\";\n}"],"string":"[\n \"function isObject$1(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function isObject$1(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function u(e){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction(e){return null!=e&&\\\"object\\\"==typeof e&&!1===Array.isArray(e)}(e)&&\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function isObject$1(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray$1(obj);\\n}\",\n \"function i(e){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction(e){return null!=e&&\\\"object\\\"==typeof e&&!1===Array.isArray(e)}(e)&&\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function is(obj) {\\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\\\"c\\\" /* default */];\\n}\",\n \"function isObject(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function _isPlainObject(obj) {\\n return (obj && obj.constructor.prototype === Object.prototype);\\n}\",\n \"__is_object(value) {\\n return value && typeof value === 'object' && value.constructor === Object;\\n }\",\n \"function isObject(obj) { // 71\\n\\t\\treturn toString.call(obj) === '[object Object]'; // 72\\n\\t} // 73\",\n \"isPlainObject(obj) {\\n return _toString.call(obj) === '[object Object]'\\n }\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject$1(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"isObject(obj) {\\n return obj !== null && typeof obj === 'object'\\n }\",\n \"function isObject(obj) {\\n // incase of arrow function and array\\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\\n }\",\n \"function isObjectLike(value) {\\n return _typeof$1(value) == 'object' && value !== null;\\n }\",\n \"function isObjectLike$a(value) {\\n return typeof value == 'object' && value !== null;\\n}\",\n \"function isObject(o) { return typeof o === 'object'; }\",\n \"function isObject(o) { return typeof o === 'object'; }\",\n \"function isObject(o) { return typeof o === 'object'; }\",\n \"static hasObjectify(object) {\\n return isObjectAssigned(object) && isFunction(object.objectify);\\n }\",\n \"function isObjectLike(value) {\\n return typeof value === \\\"object\\\" && !!value;\\n}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObjectObject(o){return!0===\\n/*!\\n * isobject <https://github.com/jonschlinkert/isobject>\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction isObject(val){return null!=val&&\\\"object\\\"==typeof val&&!1===Array.isArray(val)}(o)&&\\\"[object Object]\\\"===Object.prototype.toString.call(o)}\",\n \"function isObject(obj) {\\n return obj === Object(obj);\\n}\",\n \"function isObject(entry) {\\n return entry.constructor === Object;\\n}\",\n \"function isObject(obj) {\\n return obj === Object(obj);\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"function isObjectLike(value) {\\n return _typeof(value) == 'object' && value !== null;\\n}\",\n \"__key_in_object(object, key) {\\n if (Object.prototype.hasOwnProperty.call(object, key)) {\\n return true\\n } else {\\n return false\\n }\\n }\",\n \"function utilIsIterable(obj) {\\n\\t\\treturn obj != null && typeof obj[Symbol.iterator] === 'function'; // lazy equality for null\\n\\t}\",\n \"function isObjectLike(value) {\\n return value != null && (typeof value === \\\"function\\\" || typeof value === \\\"object\\\");\\n}\",\n \"function isObjectLike(obj) {\\n return typeof obj === \\\"object\\\" && obj !== null;\\n}\",\n \"function isObject (o) { return o && typeof o === 'object' }\",\n \"function isObject (o) { return o && typeof o === 'object' }\",\n \"function isObject$8(val) {\\n return kindOf$3(val) === 'object' || typeof val === 'function';\\n}\",\n \"function isObject(obj){\\n return Object.prototype.toString.call(obj) == '[object Object]';\\n }\",\n \"function isObject$1(e){return\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function isObject(value) { return typeof value === \\\"object\\\" && value !== null; }\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function _isObject(v) {\\n return (Object.prototype.toString.call(v) === '[object Object]');\\n}\",\n \"function isObj$1(something) {\\n return typeDetect(something) === 'Object';\\n}\",\n \"function isObject(a) {\\n return (!!a) && (a.constructor === Object);\\n}\",\n \"function isObject(o){ return typeof o === 'object' && o !== null; }\",\n \"function isObject$2556(x$2572) {\\n return function isObject$2556(x$2573) {\\n return function (a0$2574) {\\n if (Object.prototype.toString.call(a0$2574) === '[object Object]') {\\n return true;\\n }\\n return false;\\n }.call(this, x$2573);\\n }.curry().apply(null, arguments);\\n }\",\n \"function isObject(obj) {\\n\\n return obj && typeof obj === \\\"object\\\";\\n}\",\n \"isObjectEqual(a, b) {\\n return a && b && a.foo === b.foo;\\n }\",\n \"function objectHasEnumerableKeys(value) {\\n for (const _ in value) return true;\\n return false;\\n}\",\n \"function isObject(x) {\\n return x != null && typeof x === 'object';\\n}\",\n \"function isObject(o) {\\n return o === Object(o);\\n}\",\n \"function isObject( x ) {\\n return typeof x === \\\"object\\\" && x !== null;\\n }\",\n \"function isFrozen(obj) {\\n if (!obj) { return true; }\\n // TODO(erights): Object(<primitive>) wrappers should also be\\n // considered frozen.\\n if (obj.FROZEN___ === obj) { return true; }\\n var t = typeof obj;\\n return t !== 'object' && t !== 'function';\\n }\",\n \"function isIterableObject(obj) {\\n if (obj === undefined || obj === null) {\\n return false;\\n }\\n var t = typeof(obj);\\n var types = {'string': 0, 'function': 0, 'number': 0, 'undefined': 0, 'boolean': 0};\\n return types[t] === undefined;\\n}\",\n \"function isObject(value) {\\n return typeof value === 'object' && !!value;\\n}\",\n \"function isObject$1(value) {\\n return _typeof_1(value) === \\\"object\\\" && value !== null;\\n}\",\n \"function isObject$1(value) {\\n return _typeof_1(value) === \\\"object\\\" && value !== null;\\n}\",\n \"function isObject(x) {\\n return typeof x === \\\"object\\\" && x !== null;\\n}\",\n \"function isObject$1(value) {\\n return typeof value === 'object' && value !== null || typeof value === 'function';\\n }\",\n \"function isObject(obj) {\\n return kindOf(obj) === 'object' || kindOf(obj) === 'function';\\n}\",\n \"function isObject(e){return Object.prototype.toString.call(e)===\\\"[object Object]\\\"}\",\n \"function isObject(obj){return obj!==null&&(typeof obj===\\\"undefined\\\"?\\\"undefined\\\":_typeof2(obj))==='object';}\",\n \"function isObject(obj){return obj!==null&&(typeof obj===\\\"undefined\\\"?\\\"undefined\\\":_typeof2(obj))==='object';}\",\n \"function isObject(obj) {\\n return Object.prototype.toString.call(obj) === '[object Object]';\\n}\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function isObject$1(obj) {\\n return obj !== null && _typeof(obj) === 'object' && 'constructor' in obj && obj.constructor === Object;\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function IsObject(x) {\\r\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\r\\n }\",\n \"function isObject_(test) {\\r\\n return Object.prototype.toString.call(test) === '[object Object]';\\r\\n}\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function IsObject(x) {\\n return typeof x === \\\"object\\\" ? x !== null : typeof x === \\\"function\\\";\\n }\",\n \"function isObject(value) {\\n return value && typeof value === 'object';\\n}\",\n \"function isObject$2(value) {\\n return (\\n typeof value === \\\"object\\\" &&\\n value !== null &&\\n // none of these are collection objects, so we can return false\\n !(value instanceof Boolean) &&\\n !(value instanceof Date) &&\\n !(value instanceof Error) &&\\n !(value instanceof Number) &&\\n !(value instanceof RegExp) &&\\n !(value instanceof String)\\n );\\n}\",\n \"function isObject$2(value) {\\n return (\\n typeof value === \\\"object\\\" &&\\n value !== null &&\\n // none of these are collection objects, so we can return false\\n !(value instanceof Boolean) &&\\n !(value instanceof Date) &&\\n !(value instanceof Error) &&\\n !(value instanceof Number) &&\\n !(value instanceof RegExp) &&\\n !(value instanceof String)\\n );\\n}\",\n \"function checkIfObject(obj) {\\n if (obj === null || typeof obj === \\\"function\\\") return false;\\n return typeof obj === \\\"object\\\";\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6731362","0.6633782","0.6609513","0.6599949","0.6599775","0.6565226","0.6506394","0.64681304","0.6463561","0.641157","0.6370518","0.63660806","0.63660806","0.63660806","0.63660806","0.6357975","0.6327474","0.6323051","0.63226765","0.6296809","0.6296809","0.6296809","0.6292406","0.6291816","0.62856334","0.62856334","0.62856334","0.62856334","0.62856334","0.62856334","0.62856334","0.627117","0.6251391","0.62458056","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.6242117","0.62397945","0.62385625","0.6237889","0.62338805","0.6231932","0.6231932","0.6229546","0.6220085","0.61984694","0.6195188","0.6190361","0.6190361","0.6190361","0.6190361","0.6190361","0.61852396","0.61561424","0.61534894","0.614573","0.6142319","0.6137426","0.6126935","0.61263925","0.6111836","0.6107993","0.60972226","0.6086568","0.6084742","0.608419","0.608419","0.6083688","0.60792947","0.60771865","0.60662735","0.6060351","0.6060351","0.6056818","0.6055101","0.6055101","0.6055101","0.6055101","0.6055101","0.6055101","0.6055101","0.605148","0.6050018","0.6050018","0.6050018","0.6043482","0.60420245","0.60420245","0.6040061","0.6035797","0.6035797","0.6033562"],"string":"[\n \"0.6731362\",\n \"0.6633782\",\n \"0.6609513\",\n \"0.6599949\",\n \"0.6599775\",\n \"0.6565226\",\n \"0.6506394\",\n \"0.64681304\",\n \"0.6463561\",\n \"0.641157\",\n \"0.6370518\",\n \"0.63660806\",\n \"0.63660806\",\n \"0.63660806\",\n \"0.63660806\",\n \"0.6357975\",\n \"0.6327474\",\n \"0.6323051\",\n \"0.63226765\",\n \"0.6296809\",\n \"0.6296809\",\n \"0.6296809\",\n \"0.6292406\",\n \"0.6291816\",\n \"0.62856334\",\n \"0.62856334\",\n \"0.62856334\",\n \"0.62856334\",\n \"0.62856334\",\n \"0.62856334\",\n \"0.62856334\",\n \"0.627117\",\n \"0.6251391\",\n \"0.62458056\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.6242117\",\n \"0.62397945\",\n \"0.62385625\",\n \"0.6237889\",\n \"0.62338805\",\n \"0.6231932\",\n \"0.6231932\",\n \"0.6229546\",\n \"0.6220085\",\n \"0.61984694\",\n \"0.6195188\",\n \"0.6190361\",\n \"0.6190361\",\n \"0.6190361\",\n \"0.6190361\",\n \"0.6190361\",\n \"0.61852396\",\n \"0.61561424\",\n \"0.61534894\",\n \"0.614573\",\n \"0.6142319\",\n \"0.6137426\",\n \"0.6126935\",\n \"0.61263925\",\n \"0.6111836\",\n \"0.6107993\",\n \"0.60972226\",\n \"0.6086568\",\n \"0.6084742\",\n \"0.608419\",\n \"0.608419\",\n \"0.6083688\",\n \"0.60792947\",\n \"0.60771865\",\n \"0.60662735\",\n \"0.6060351\",\n \"0.6060351\",\n \"0.6056818\",\n \"0.6055101\",\n \"0.6055101\",\n \"0.6055101\",\n \"0.6055101\",\n \"0.6055101\",\n \"0.6055101\",\n \"0.6055101\",\n \"0.605148\",\n \"0.6050018\",\n \"0.6050018\",\n \"0.6050018\",\n \"0.6043482\",\n \"0.60420245\",\n \"0.60420245\",\n \"0.6040061\",\n \"0.6035797\",\n \"0.6035797\",\n \"0.6033562\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74180,"cells":{"query":{"kind":"string","value":"Equivalent of `typeof` but with special handling for array and regexp."},"document":{"kind":"string","value":"function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }"},"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 sc_typeof( x ) {\n return typeof x;\n}","static type(arg)\n {\n const types = [\n 'array', 'boolean', 'function', 'number',\n 'null', 'object', 'regexp', 'symbol', 'string',\n 'undefined'\n ]\n\n var type = Object.prototype.toString.call(arg),\n type = type.match(/^\\[.+ (.+)\\]$/),\n type = type[1],\n type = type.toLowerCase()\n\n if (types.indexOf(type) !== -1) {\n return type\n }\n\n return typeof arg\n }","function AsYouType_typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { AsYouType_typeof = function _typeof(obj) { return typeof obj; }; } else { AsYouType_typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return AsYouType_typeof(obj); }","function type(input) {\n \treturn typeof input\n}","function _typeof$1(obj) {\n\t \"@babel/helpers - typeof\";\n\n\t return _typeof$1 = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n\t return typeof obj;\n\t } : function (obj) {\n\t return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n\t }, _typeof$1(obj);\n\t}","function _typeOf ( value )\n\t{\n\t\tvar type;\n\n\t\ttype = typeof value;\n\t\tif ( type === \"number\" )\n\t\t{\n\t\t\tif ( isNaN( value ) )\n\t\t\t{\n\t\t\t\ttype = \"NaN\";\n\t\t\t}\n\t\t}\n\t\telse if ( type === \"object\" )\n\t\t{\n\t\t\tif ( value )\n\t\t\t{\n\t\t\t\tif ( value instanceof Array )\n\t\t\t\t{\n\t\t\t\t\ttype = \"array\";\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttype = \"null\";\n\t\t\t}\n\t\t}\n\n\t\treturn type;\n\t}","function _typeOf ( value )\n\t{\n\t\tvar type;\n\n\t\ttype = typeof value;\n\t\tif ( type === \"number\" )\n\t\t{\n\t\t\tif ( isNaN( value ) )\n\t\t\t{\n\t\t\t\ttype = \"NaN\";\n\t\t\t}\n\t\t}\n\t\telse if ( type === \"object\" )\n\t\t{\n\t\t\tif ( value )\n\t\t\t{\n\t\t\t\tif ( value instanceof Array )\n\t\t\t\t{\n\t\t\t\t\ttype = \"array\";\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttype = \"null\";\n\t\t\t}\n\t\t}\n\n\t\treturn type;\n\t}","function typeStr (obj) {\n\t return isArray(obj) ? 'array' : typeof obj;\n\t }","function typeStr (obj) {\n\t return isArray(obj) ? 'array' : typeof obj;\n\t }","function getType(data) {\n return typeof data;\n}","function $type(obj) {\n if (obj == undefined) return false;\n\n if (obj.$family) return (obj.$family.name == 'number' && !isFinite(obj)) ? false : obj.$family.name;\n if (obj.nodeName){\n switch (obj.nodeType) {\n case 1: return 'element';\n case 9: return 'window';\n case 3: return (/\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\n }\n } else if (obj.window) {\n return 'element';\n } else if (typeof obj.length == 'number') {\n if (obj.callee) {\n return 'arguments';\n } else if (obj.item) {\n return 'collection';\n }\n }\n return typeof obj;\n}","function _typeof(t){return(_typeof=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\"function\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\"symbol\":typeof t})(t)}","function _typeof(t){return(_typeof=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\"function\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\"symbol\":typeof t})(t)}","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function $type(obj) {\r\n\t\tif (obj.nodeType) {\r\n\t\t\tswitch(obj.nodeType) {\r\n\t\t\t\tcase 1: return \"element\"; break;\r\n\t\t\t\tcase 3: return \"textnode\"; break;\r\n\t\t\t\tcase 9: return \"document\"; break;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (obj.item && obj.length) return \"collection\";\r\n\t\tif (obj.nodeName) return obj.nodeName;\r\n\t\tif (obj.sort) return \"array\";\r\n\t\treturn typeof(obj);\r\n\t}","function getType(arg) {\n return typeof arg;\n}","function whatDatatype(arg){\n return typeof(arg);\n}","function typeOf(b){var a=typeof b;if(a===\"object\"){if(b){if(typeof b.length===\"number\"&&!(b.propertyIsEnumerable(\"length\"))&&typeof b.splice===\"function\"){a=\"array\"}}else{a=\"null\"}}return a}","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\n return isArray(obj) ? 'array' : typeof obj;\n }","function typeStr (obj) {\r\n return isArray(obj) ? 'array' : typeof obj;\r\n }","function typeOf(value) {\n\tvar s = typeof value;\n\tif (s === 'object') {\n\t\tif (value) {\n\t\t\tif (typeof value.length === 'number' &&\n\t\t\t\t\t!(value.propertyIsEnumerable('length')) &&\n\t\t\t\t\ttypeof value.splice === 'function') {\n\t\t\t\ts = 'array';\n\t\t\t}\n\t\t} else {\n\t\t\ts = 'null';\n\t\t}\n\t}\n\treturn s;\n}","function whatsTheTypeOf(input) {\n return typeof input ; //returns the type information as a string\n}","function type(value){\n return (\n Array.isArray(value) ? \"array\" :\n value instanceof Date ? \"date\" :\n typeof value\n );\n}","function Type(){\n\t\t\tthis.array='Array';\n\t\t\tthis.object='object';\n\t\t\tthis.string='string';\n\t\t\tthis.fn='function';\n\t\t\tthis.number='number';\n\t\t}","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }","function x(e) {\n var t = typeof e;\n return Array.isArray(e) ? \"array\" : e instanceof RegExp ? \"object\" : b(t, e) ? \"symbol\" : t;\n }","function $type(obj){\n if (obj == undefined) \n return false;\n if (obj.htmlElement) \n return 'element';\n var type = typeof obj;\n if (type == 'object' && obj.nodeName) {\n switch (obj.nodeType) {\n case 1:\n return 'element';\n case 3:\n return (/\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\n }\n }\n if (type == 'object' || type == 'function') {\n switch (obj.constructor) {\n case Array:\n return 'array';\n case RegExp:\n return 'regexp';\n }\n if (typeof obj.length == 'number') {\n if (obj.item) \n return 'collection';\n if (obj.callee) \n return 'arguments';\n }\n }\n return type;\n}","function typeOf(value) {\n var s = typeof value;\n if (s == 'object') {\n if (!value) {\n return 'null';\n } else if (value instanceof Array) {\n return 'array';\n }\n }\n return s;\n}","function x(e) {\n var t = typeof e;\n return Array.isArray(e) ? \"array\" : e instanceof RegExp ? \"object\" : b(t, e) ? \"symbol\" : t;\n }","function getTypeOf (input) {\n\n\tif (input === null) {\n\t\treturn 'null';\n\t}\n\n\telse if (typeof input === 'undefined') {\n\t\treturn 'undefined';\n\t}\n\n\telse if (typeof input === 'object') {\n\t\treturn (Array.isArray(input) ? 'array' : 'object');\n\t}\n\n\treturn typeof input;\n\n}","function _typeof( o ) {\r\n return typeof o ;\r\n }","function getType(o)\n{\n\tif (o === null)\n\t\treturn \"null\";\n\t\n\tif (Array.isArray(o))\n\t\treturn \"array\";\n\t\n\treturn typeof o;\n}","function _typeof2(e){return _typeof2=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&\"function\"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?\"symbol\":typeof e},_typeof2(e)}","function $type(obj){\r\n if (!$defined(obj)) \r\n return false;\r\n if (obj.htmlElement) \r\n return 'element';\r\n var type = typeof obj;\r\n if (type == 'object' && obj.nodeName) {\r\n switch (obj.nodeType) {\r\n case 1:\r\n return 'element';\r\n case 3:\r\n return (/\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\r\n }\r\n }\r\n if (type == 'object' || type == 'function') {\r\n switch (obj.constructor) {\r\n case Array:\r\n return 'array';\r\n case RegExp:\r\n return 'regexp';\r\n case Class:\r\n return 'class';\r\n }\r\n if (typeof obj.length == 'number') {\r\n if (obj.item) \r\n return 'collection';\r\n if (obj.callee) \r\n return 'arguments';\r\n }\r\n }\r\n return type;\r\n }"],"string":"[\n \"function sc_typeof( x ) {\\n return typeof x;\\n}\",\n \"static type(arg)\\n {\\n const types = [\\n 'array', 'boolean', 'function', 'number',\\n 'null', 'object', 'regexp', 'symbol', 'string',\\n 'undefined'\\n ]\\n\\n var type = Object.prototype.toString.call(arg),\\n type = type.match(/^\\\\[.+ (.+)\\\\]$/),\\n type = type[1],\\n type = type.toLowerCase()\\n\\n if (types.indexOf(type) !== -1) {\\n return type\\n }\\n\\n return typeof arg\\n }\",\n \"function AsYouType_typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { AsYouType_typeof = function _typeof(obj) { return typeof obj; }; } else { AsYouType_typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return AsYouType_typeof(obj); }\",\n \"function type(input) {\\n \\treturn typeof input\\n}\",\n \"function _typeof$1(obj) {\\n\\t \\\"@babel/helpers - typeof\\\";\\n\\n\\t return _typeof$1 = \\\"function\\\" == typeof Symbol && \\\"symbol\\\" == typeof Symbol.iterator ? function (obj) {\\n\\t return typeof obj;\\n\\t } : function (obj) {\\n\\t return obj && \\\"function\\\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj;\\n\\t }, _typeof$1(obj);\\n\\t}\",\n \"function _typeOf ( value )\\n\\t{\\n\\t\\tvar type;\\n\\n\\t\\ttype = typeof value;\\n\\t\\tif ( type === \\\"number\\\" )\\n\\t\\t{\\n\\t\\t\\tif ( isNaN( value ) )\\n\\t\\t\\t{\\n\\t\\t\\t\\ttype = \\\"NaN\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if ( type === \\\"object\\\" )\\n\\t\\t{\\n\\t\\t\\tif ( value )\\n\\t\\t\\t{\\n\\t\\t\\t\\tif ( value instanceof Array )\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttype = \\\"array\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\ttype = \\\"null\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn type;\\n\\t}\",\n \"function _typeOf ( value )\\n\\t{\\n\\t\\tvar type;\\n\\n\\t\\ttype = typeof value;\\n\\t\\tif ( type === \\\"number\\\" )\\n\\t\\t{\\n\\t\\t\\tif ( isNaN( value ) )\\n\\t\\t\\t{\\n\\t\\t\\t\\ttype = \\\"NaN\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if ( type === \\\"object\\\" )\\n\\t\\t{\\n\\t\\t\\tif ( value )\\n\\t\\t\\t{\\n\\t\\t\\t\\tif ( value instanceof Array )\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttype = \\\"array\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\ttype = \\\"null\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn type;\\n\\t}\",\n \"function typeStr (obj) {\\n\\t return isArray(obj) ? 'array' : typeof obj;\\n\\t }\",\n \"function typeStr (obj) {\\n\\t return isArray(obj) ? 'array' : typeof obj;\\n\\t }\",\n \"function getType(data) {\\n return typeof data;\\n}\",\n \"function $type(obj) {\\n if (obj == undefined) return false;\\n\\n if (obj.$family) return (obj.$family.name == 'number' && !isFinite(obj)) ? false : obj.$family.name;\\n if (obj.nodeName){\\n switch (obj.nodeType) {\\n case 1: return 'element';\\n case 9: return 'window';\\n case 3: return (/\\\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\\n }\\n } else if (obj.window) {\\n return 'element';\\n } else if (typeof obj.length == 'number') {\\n if (obj.callee) {\\n return 'arguments';\\n } else if (obj.item) {\\n return 'collection';\\n }\\n }\\n return typeof obj;\\n}\",\n \"function _typeof(t){return(_typeof=\\\"function\\\"==typeof Symbol&&\\\"symbol\\\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\\\"function\\\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\\\"symbol\\\":typeof t})(t)}\",\n \"function _typeof(t){return(_typeof=\\\"function\\\"==typeof Symbol&&\\\"symbol\\\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\\\"function\\\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\\\"symbol\\\":typeof t})(t)}\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function $type(obj) {\\r\\n\\t\\tif (obj.nodeType) {\\r\\n\\t\\t\\tswitch(obj.nodeType) {\\r\\n\\t\\t\\t\\tcase 1: return \\\"element\\\"; break;\\r\\n\\t\\t\\t\\tcase 3: return \\\"textnode\\\"; break;\\r\\n\\t\\t\\t\\tcase 9: return \\\"document\\\"; break;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tif (obj.item && obj.length) return \\\"collection\\\";\\r\\n\\t\\tif (obj.nodeName) return obj.nodeName;\\r\\n\\t\\tif (obj.sort) return \\\"array\\\";\\r\\n\\t\\treturn typeof(obj);\\r\\n\\t}\",\n \"function getType(arg) {\\n return typeof arg;\\n}\",\n \"function whatDatatype(arg){\\n return typeof(arg);\\n}\",\n \"function typeOf(b){var a=typeof b;if(a===\\\"object\\\"){if(b){if(typeof b.length===\\\"number\\\"&&!(b.propertyIsEnumerable(\\\"length\\\"))&&typeof b.splice===\\\"function\\\"){a=\\\"array\\\"}}else{a=\\\"null\\\"}}return a}\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\n return isArray(obj) ? 'array' : typeof obj;\\n }\",\n \"function typeStr (obj) {\\r\\n return isArray(obj) ? 'array' : typeof obj;\\r\\n }\",\n \"function typeOf(value) {\\n\\tvar s = typeof value;\\n\\tif (s === 'object') {\\n\\t\\tif (value) {\\n\\t\\t\\tif (typeof value.length === 'number' &&\\n\\t\\t\\t\\t\\t!(value.propertyIsEnumerable('length')) &&\\n\\t\\t\\t\\t\\ttypeof value.splice === 'function') {\\n\\t\\t\\t\\ts = 'array';\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\ts = 'null';\\n\\t\\t}\\n\\t}\\n\\treturn s;\\n}\",\n \"function whatsTheTypeOf(input) {\\n return typeof input ; //returns the type information as a string\\n}\",\n \"function type(value){\\n return (\\n Array.isArray(value) ? \\\"array\\\" :\\n value instanceof Date ? \\\"date\\\" :\\n typeof value\\n );\\n}\",\n \"function Type(){\\n\\t\\t\\tthis.array='Array';\\n\\t\\t\\tthis.object='object';\\n\\t\\t\\tthis.string='string';\\n\\t\\t\\tthis.fn='function';\\n\\t\\t\\tthis.number='number';\\n\\t\\t}\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function _typeof(obj) { \\\"@babel/helpers - typeof\\\"; if (typeof Symbol === \\\"function\\\" && typeof Symbol.iterator === \\\"symbol\\\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \\\"function\\\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \\\"symbol\\\" : typeof obj; }; } return _typeof(obj); }\",\n \"function x(e) {\\n var t = typeof e;\\n return Array.isArray(e) ? \\\"array\\\" : e instanceof RegExp ? \\\"object\\\" : b(t, e) ? \\\"symbol\\\" : t;\\n }\",\n \"function $type(obj){\\n if (obj == undefined) \\n return false;\\n if (obj.htmlElement) \\n return 'element';\\n var type = typeof obj;\\n if (type == 'object' && obj.nodeName) {\\n switch (obj.nodeType) {\\n case 1:\\n return 'element';\\n case 3:\\n return (/\\\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\\n }\\n }\\n if (type == 'object' || type == 'function') {\\n switch (obj.constructor) {\\n case Array:\\n return 'array';\\n case RegExp:\\n return 'regexp';\\n }\\n if (typeof obj.length == 'number') {\\n if (obj.item) \\n return 'collection';\\n if (obj.callee) \\n return 'arguments';\\n }\\n }\\n return type;\\n}\",\n \"function typeOf(value) {\\n var s = typeof value;\\n if (s == 'object') {\\n if (!value) {\\n return 'null';\\n } else if (value instanceof Array) {\\n return 'array';\\n }\\n }\\n return s;\\n}\",\n \"function x(e) {\\n var t = typeof e;\\n return Array.isArray(e) ? \\\"array\\\" : e instanceof RegExp ? \\\"object\\\" : b(t, e) ? \\\"symbol\\\" : t;\\n }\",\n \"function getTypeOf (input) {\\n\\n\\tif (input === null) {\\n\\t\\treturn 'null';\\n\\t}\\n\\n\\telse if (typeof input === 'undefined') {\\n\\t\\treturn 'undefined';\\n\\t}\\n\\n\\telse if (typeof input === 'object') {\\n\\t\\treturn (Array.isArray(input) ? 'array' : 'object');\\n\\t}\\n\\n\\treturn typeof input;\\n\\n}\",\n \"function _typeof( o ) {\\r\\n return typeof o ;\\r\\n }\",\n \"function getType(o)\\n{\\n\\tif (o === null)\\n\\t\\treturn \\\"null\\\";\\n\\t\\n\\tif (Array.isArray(o))\\n\\t\\treturn \\\"array\\\";\\n\\t\\n\\treturn typeof o;\\n}\",\n \"function _typeof2(e){return _typeof2=\\\"function\\\"==typeof Symbol&&\\\"symbol\\\"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&\\\"function\\\"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?\\\"symbol\\\":typeof e},_typeof2(e)}\",\n \"function $type(obj){\\r\\n if (!$defined(obj)) \\r\\n return false;\\r\\n if (obj.htmlElement) \\r\\n return 'element';\\r\\n var type = typeof obj;\\r\\n if (type == 'object' && obj.nodeName) {\\r\\n switch (obj.nodeType) {\\r\\n case 1:\\r\\n return 'element';\\r\\n case 3:\\r\\n return (/\\\\S/).test(obj.nodeValue) ? 'textnode' : 'whitespace';\\r\\n }\\r\\n }\\r\\n if (type == 'object' || type == 'function') {\\r\\n switch (obj.constructor) {\\r\\n case Array:\\r\\n return 'array';\\r\\n case RegExp:\\r\\n return 'regexp';\\r\\n case Class:\\r\\n return 'class';\\r\\n }\\r\\n if (typeof obj.length == 'number') {\\r\\n if (obj.item) \\r\\n return 'collection';\\r\\n if (obj.callee) \\r\\n return 'arguments';\\r\\n }\\r\\n }\\r\\n return type;\\r\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6908362","0.6774889","0.6606997","0.65384954","0.64926404","0.6489072","0.6489072","0.6449892","0.6449892","0.6428727","0.64280385","0.6402795","0.6402795","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.63939744","0.6377059","0.63737583","0.6369853","0.63499665","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.630787","0.6303671","0.62983316","0.6288858","0.6285146","0.6261454","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.6251852","0.62473583","0.62338287","0.623085","0.62243843","0.6221748","0.6207376","0.61969","0.6168919","0.6168876"],"string":"[\n \"0.6908362\",\n \"0.6774889\",\n \"0.6606997\",\n \"0.65384954\",\n \"0.64926404\",\n \"0.6489072\",\n \"0.6489072\",\n \"0.6449892\",\n \"0.6449892\",\n \"0.6428727\",\n \"0.64280385\",\n \"0.6402795\",\n \"0.6402795\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.63939744\",\n \"0.6377059\",\n \"0.63737583\",\n \"0.6369853\",\n \"0.63499665\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.630787\",\n \"0.6303671\",\n \"0.62983316\",\n \"0.6288858\",\n \"0.6285146\",\n \"0.6261454\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.6251852\",\n \"0.62473583\",\n \"0.62338287\",\n \"0.623085\",\n \"0.62243843\",\n \"0.6221748\",\n \"0.6207376\",\n \"0.61969\",\n \"0.6168919\",\n \"0.6168876\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74181,"cells":{"query":{"kind":"string","value":"This handles more types than `getPropType`. Only used for error messages. See `createPrimitiveTypeChecker`."},"document":{"kind":"string","value":"function getPreciseType(propValue) {\n if (typeof propValue === 'undefined' || propValue === null) {\n return '' + propValue;\n }\n var propType = getPropType(propValue);\n if (propType === 'object') {\n if (propValue instanceof Date) {\n return 'date';\n } else if (propValue instanceof RegExp) {\n return 'regexp';\n }\n }\n return propType;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t if (isSymbol(propType, propValue)) {\n\t\t return 'symbol';\n\t\t }\n\t\t return propType;\n\t\t }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t return propType;\n\t\t}","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t var propType = typeof propValue;\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t if (isSymbol(propType, propValue)) {\n\t\t return 'symbol';\n\t\t }\n\t\t return propType;\n\t\t}","function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t\t // passes PropTypes.object.\n\t\t return 'object';\n\t\t }\n\t\t if (isSymbol(propType, propValue)) {\n\t\t return 'symbol';\n\t\t }\n\t\t return propType;\n\t\t}","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return \"array\";\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return \"object\";\n }\n if (isSymbol(propType, propValue)) {\n return \"symbol\";\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n\t var propType = typeof propValue === 'undefined' ? 'undefined' : _typeof(propValue);\n\t if (Array.isArray(propValue)) {\n\t return 'array';\n\t }\n\t if (propValue instanceof RegExp) {\n\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n\t // passes PropTypes.object.\n\t return 'object';\n\t }\n\t if (isSymbol(propType, propValue)) {\n\t return 'symbol';\n\t }\n\t return propType;\n\t }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }","function getPropType(propValue) {\n var propType = typeof propValue;\n if (Array.isArray(propValue)) {\n return 'array';\n }\n if (propValue instanceof RegExp) {\n // Old webkits (at least until Android 4.0) return 'function' rather than\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n // passes PropTypes.object.\n return 'object';\n }\n if (isSymbol(propType, propValue)) {\n return 'symbol';\n }\n return propType;\n }"],"string":"[\n \"function getPropType(propValue) {\\n\\t\\t var propType = typeof propValue;\\n\\t\\t if (Array.isArray(propValue)) {\\n\\t\\t return 'array';\\n\\t\\t }\\n\\t\\t if (propValue instanceof RegExp) {\\n\\t\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t\\t // passes PropTypes.object.\\n\\t\\t return 'object';\\n\\t\\t }\\n\\t\\t if (isSymbol(propType, propValue)) {\\n\\t\\t return 'symbol';\\n\\t\\t }\\n\\t\\t return propType;\\n\\t\\t }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n\\t\\t var propType = typeof propValue;\\n\\t\\t if (Array.isArray(propValue)) {\\n\\t\\t return 'array';\\n\\t\\t }\\n\\t\\t if (propValue instanceof RegExp) {\\n\\t\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t\\t // passes PropTypes.object.\\n\\t\\t return 'object';\\n\\t\\t }\\n\\t\\t return propType;\\n\\t\\t}\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue;\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n\\t\\t var propType = typeof propValue;\\n\\t\\t if (Array.isArray(propValue)) {\\n\\t\\t return 'array';\\n\\t\\t }\\n\\t\\t if (propValue instanceof RegExp) {\\n\\t\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t\\t // passes PropTypes.object.\\n\\t\\t return 'object';\\n\\t\\t }\\n\\t\\t if (isSymbol(propType, propValue)) {\\n\\t\\t return 'symbol';\\n\\t\\t }\\n\\t\\t return propType;\\n\\t\\t}\",\n \"function getPropType(propValue) {\\n\\t\\t var propType = typeof propValue;\\n\\t\\t if (Array.isArray(propValue)) {\\n\\t\\t return 'array';\\n\\t\\t }\\n\\t\\t if (propValue instanceof RegExp) {\\n\\t\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t\\t // passes PropTypes.object.\\n\\t\\t return 'object';\\n\\t\\t }\\n\\t\\t if (isSymbol(propType, propValue)) {\\n\\t\\t return 'symbol';\\n\\t\\t }\\n\\t\\t return propType;\\n\\t\\t}\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return \\\"array\\\";\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return \\\"object\\\";\\n }\\n if (isSymbol(propType, propValue)) {\\n return \\\"symbol\\\";\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n\\t var propType = typeof propValue === 'undefined' ? 'undefined' : _typeof(propValue);\\n\\t if (Array.isArray(propValue)) {\\n\\t return 'array';\\n\\t }\\n\\t if (propValue instanceof RegExp) {\\n\\t // Old webkits (at least until Android 4.0) return 'function' rather than\\n\\t // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n\\t // passes PropTypes.object.\\n\\t return 'object';\\n\\t }\\n\\t if (isSymbol(propType, propValue)) {\\n\\t return 'symbol';\\n\\t }\\n\\t return propType;\\n\\t }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\",\n \"function getPropType(propValue) {\\n var propType = typeof propValue;\\n if (Array.isArray(propValue)) {\\n return 'array';\\n }\\n if (propValue instanceof RegExp) {\\n // Old webkits (at least until Android 4.0) return 'function' rather than\\n // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\\n // passes PropTypes.object.\\n return 'object';\\n }\\n if (isSymbol(propType, propValue)) {\\n return 'symbol';\\n }\\n return propType;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.68776417","0.68541825","0.68541825","0.68541825","0.68541825","0.6853198","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68475336","0.68389475","0.68389475","0.6837019","0.6818691","0.68155605","0.68155605","0.68155605","0.68155605","0.68155605","0.6801036","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657","0.67816657"],"string":"[\n \"0.68776417\",\n \"0.68541825\",\n \"0.68541825\",\n \"0.68541825\",\n \"0.68541825\",\n \"0.6853198\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68475336\",\n \"0.68389475\",\n \"0.68389475\",\n \"0.6837019\",\n \"0.6818691\",\n \"0.68155605\",\n \"0.68155605\",\n \"0.68155605\",\n \"0.68155605\",\n \"0.68155605\",\n \"0.6801036\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\",\n \"0.67816657\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74182,"cells":{"query":{"kind":"string","value":"Returns a string that is postfixed to a warning about an invalid type. For example, \"undefined\" or \"of type array\""},"document":{"kind":"string","value":"function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }"},"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 _undefinedCoerce() {\n return '';\n}","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case \"array\":\n case \"object\":\n return \"an \" + type;\n case \"boolean\":\n case \"date\":\n case \"regexp\":\n return \"a \" + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n\t\t var type = getPreciseType(value);\n\t\t switch (type) {\n\t\t case 'array':\n\t\t case 'object':\n\t\t return 'an ' + type;\n\t\t case 'boolean':\n\t\t case 'date':\n\t\t case 'regexp':\n\t\t return 'a ' + type;\n\t\t default:\n\t\t return type;\n\t\t }\n\t\t }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch(type){\n case 'array':\n case 'object':\n return 'an ' + type;\n case 'boolean':\n case 'date':\n case 'regexp':\n return 'a ' + type;\n default:\n return type;\n }\n }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }","function getPostfixForTypeWarning(value) {\n\t var type = getPreciseType(value);\n\t switch (type) {\n\t case 'array':\n\t case 'object':\n\t return 'an ' + type;\n\t case 'boolean':\n\t case 'date':\n\t case 'regexp':\n\t return 'a ' + type;\n\t default:\n\t return type;\n\t }\n\t }"],"string":"[\n \"function _undefinedCoerce() {\\n return '';\\n}\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case \\\"array\\\":\\n case \\\"object\\\":\\n return \\\"an \\\" + type;\\n case \\\"boolean\\\":\\n case \\\"date\\\":\\n case \\\"regexp\\\":\\n return \\\"a \\\" + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t\\t var type = getPreciseType(value);\\n\\t\\t switch (type) {\\n\\t\\t case 'array':\\n\\t\\t case 'object':\\n\\t\\t return 'an ' + type;\\n\\t\\t case 'boolean':\\n\\t\\t case 'date':\\n\\t\\t case 'regexp':\\n\\t\\t return 'a ' + type;\\n\\t\\t default:\\n\\t\\t return type;\\n\\t\\t }\\n\\t\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch (type) {\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n var type = getPreciseType(value);\\n switch(type){\\n case 'array':\\n case 'object':\\n return 'an ' + type;\\n case 'boolean':\\n case 'date':\\n case 'regexp':\\n return 'a ' + type;\\n default:\\n return type;\\n }\\n }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\",\n \"function getPostfixForTypeWarning(value) {\\n\\t var type = getPreciseType(value);\\n\\t switch (type) {\\n\\t case 'array':\\n\\t case 'object':\\n\\t return 'an ' + type;\\n\\t case 'boolean':\\n\\t case 'date':\\n\\t case 'regexp':\\n\\t return 'a ' + type;\\n\\t default:\\n\\t return type;\\n\\t }\\n\\t }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6599196","0.6566137","0.6560382","0.6560382","0.6560382","0.6560382","0.6523208","0.6522379","0.6506975","0.6506975","0.6506975","0.6506975","0.6506975","0.65022165","0.64905936","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573","0.6478573"],"string":"[\n \"0.6599196\",\n \"0.6566137\",\n \"0.6560382\",\n \"0.6560382\",\n \"0.6560382\",\n \"0.6560382\",\n \"0.6523208\",\n \"0.6522379\",\n \"0.6506975\",\n \"0.6506975\",\n \"0.6506975\",\n \"0.6506975\",\n \"0.6506975\",\n \"0.65022165\",\n \"0.64905936\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\",\n \"0.6478573\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74183,"cells":{"query":{"kind":"string","value":"Returns class name of the object, if any."},"document":{"kind":"string","value":"function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function getClassName(obj) {\n var funcNameRegex = /function\\s+(.+?)\\s*\\(/;\n var results = funcNameRegex.exec(obj['constructor'].toString());\n return (results && results.length > 1) ? results[1] : '';\n }","getClassName() {\n return this.constructor\n .className;\n }","getClassName() {\n return this.constructor\n .className;\n }","function getClassName(obj)\n{\n if (obj === null) {\n return 'null';\n }\n if (obj === undefined) {\n return 'undefined';\n }\n var c = obj.constructor.toString();\n return c.substring(9, c.indexOf('(', 10));\n}","function getClass(o) {\n\n\tif (o === null || o === undefined) return \"Object\";\n\treturn OP_toString.call(o).slice(\"[object \".length, -1);\n}","getClassName() {\n return this.constructor.name\n }","function getClass(obj) {\r\n return Object.prototype.toString.call(obj);\r\n}","function getClass(obj) {\n return {}.toString.call(obj).slice(8, -1);\n}","static getClassName() {\n return \"Object\";\n }","function classOf(o){\n if(o === null) return \"Null\";\n if(o === undefined) return \"Undefined\";\n return Object.prototype.toString.call(o).slice(8, -1);\n}","function get$className()/* : String*/\n {\n return flash.utils.getQualifiedClassName(this).replace(/::/, \".\");\n }","function get_class_name(current_obj) {\n\t\t\tvar id = current_obj.attr('id');\n\t\t\tvar name = id.substring(6,id.length);\n\t\t\treturn name;\n\t\t}","function getObjectName(object) {\n if (object === undefined) {\n return '';\n }\n if (object === null) {\n return 'Object';\n }\n if (typeof object === 'object' && !object.constructor) {\n return 'Object';\n }\n var funcNameRegex = /function ([^(]*)/;\n var results = (funcNameRegex).exec((object).constructor.toString());\n if (results && results.length > 1) {\n return results[1];\n }\n else {\n return '';\n }\n }","function _getClazz() {\r\n\t\tvar n = clz = this.vj$._class, idx = n.lastIndexOf('.');\r\n\t\tif (idx != -1) clz = n.substring(idx+1); \r\n\t\tif (this.vj$[clz]) return this.vj$[clz].clazz;\r\n\r\n\t\t//Error case...\r\n\t\treturn null;\r\n\t}","getClassName() {\n return this.statesTable.getString(this.currentState, 'ClassName');\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }","function getClassName(propValue) {\n if (!propValue.constructor || !propValue.constructor.name) {\n return ANONYMOUS;\n }\n return propValue.constructor.name;\n }"],"string":"[\n \"function getClassName(obj) {\\n var funcNameRegex = /function\\\\s+(.+?)\\\\s*\\\\(/;\\n var results = funcNameRegex.exec(obj['constructor'].toString());\\n return (results && results.length > 1) ? results[1] : '';\\n }\",\n \"getClassName() {\\n return this.constructor\\n .className;\\n }\",\n \"getClassName() {\\n return this.constructor\\n .className;\\n }\",\n \"function getClassName(obj)\\n{\\n if (obj === null) {\\n return 'null';\\n }\\n if (obj === undefined) {\\n return 'undefined';\\n }\\n var c = obj.constructor.toString();\\n return c.substring(9, c.indexOf('(', 10));\\n}\",\n \"function getClass(o) {\\n\\n\\tif (o === null || o === undefined) return \\\"Object\\\";\\n\\treturn OP_toString.call(o).slice(\\\"[object \\\".length, -1);\\n}\",\n \"getClassName() {\\n return this.constructor.name\\n }\",\n \"function getClass(obj) {\\r\\n return Object.prototype.toString.call(obj);\\r\\n}\",\n \"function getClass(obj) {\\n return {}.toString.call(obj).slice(8, -1);\\n}\",\n \"static getClassName() {\\n return \\\"Object\\\";\\n }\",\n \"function classOf(o){\\n if(o === null) return \\\"Null\\\";\\n if(o === undefined) return \\\"Undefined\\\";\\n return Object.prototype.toString.call(o).slice(8, -1);\\n}\",\n \"function get$className()/* : String*/\\n {\\n return flash.utils.getQualifiedClassName(this).replace(/::/, \\\".\\\");\\n }\",\n \"function get_class_name(current_obj) {\\n\\t\\t\\tvar id = current_obj.attr('id');\\n\\t\\t\\tvar name = id.substring(6,id.length);\\n\\t\\t\\treturn name;\\n\\t\\t}\",\n \"function getObjectName(object) {\\n if (object === undefined) {\\n return '';\\n }\\n if (object === null) {\\n return 'Object';\\n }\\n if (typeof object === 'object' && !object.constructor) {\\n return 'Object';\\n }\\n var funcNameRegex = /function ([^(]*)/;\\n var results = (funcNameRegex).exec((object).constructor.toString());\\n if (results && results.length > 1) {\\n return results[1];\\n }\\n else {\\n return '';\\n }\\n }\",\n \"function _getClazz() {\\r\\n\\t\\tvar n = clz = this.vj$._class, idx = n.lastIndexOf('.');\\r\\n\\t\\tif (idx != -1) clz = n.substring(idx+1); \\r\\n\\t\\tif (this.vj$[clz]) return this.vj$[clz].clazz;\\r\\n\\r\\n\\t\\t//Error case...\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"getClassName() {\\n return this.statesTable.getString(this.currentState, 'ClassName');\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\",\n \"function getClassName(propValue) {\\n if (!propValue.constructor || !propValue.constructor.name) {\\n return ANONYMOUS;\\n }\\n return propValue.constructor.name;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7730571","0.74697196","0.74697196","0.74258965","0.7164231","0.71448183","0.7083163","0.7080694","0.6995368","0.6971116","0.6901662","0.6883398","0.67147285","0.66557264","0.6639163","0.6611592","0.6611592","0.6611592","0.6611592","0.6600893","0.6599787","0.6599787","0.6599787","0.6599787","0.6599787","0.6582472","0.6582472"],"string":"[\n \"0.7730571\",\n \"0.74697196\",\n \"0.74697196\",\n \"0.74258965\",\n \"0.7164231\",\n \"0.71448183\",\n \"0.7083163\",\n \"0.7080694\",\n \"0.6995368\",\n \"0.6971116\",\n \"0.6901662\",\n \"0.6883398\",\n \"0.67147285\",\n \"0.66557264\",\n \"0.6639163\",\n \"0.6611592\",\n \"0.6611592\",\n \"0.6611592\",\n \"0.6611592\",\n \"0.6600893\",\n \"0.6599787\",\n \"0.6599787\",\n \"0.6599787\",\n \"0.6599787\",\n \"0.6599787\",\n \"0.6582472\",\n \"0.6582472\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74184,"cells":{"query":{"kind":"string","value":"Recomputes the plugin list using the injected plugins and plugin ordering."},"document":{"kind":"string","value":"function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n}"},"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":["orderPlugins() {\r\n debug('orderPlugins:before', this.pluginNames);\r\n const runLast = this._plugins\r\n .filter(p => p.requirements.has('runLast'))\r\n .map(p => p.name);\r\n for (const name of runLast) {\r\n const index = this._plugins.findIndex(p => p.name === name);\r\n this._plugins.push(this._plugins.splice(index, 1)[0]);\r\n }\r\n debug('orderPlugins:after', this.pluginNames);\r\n }","order() {\n debug('order:before', this.names);\n const runLast = this._plugins\n .filter(p => p.requirements.has('runLast'))\n .map(p => p.name);\n for (const name of runLast) {\n const index = this._plugins.findIndex(p => p.name === name);\n this._plugins.push(this._plugins.splice(index, 1)[0]);\n }\n debug('order:after', this.names);\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\"));\n }\n }\n })();\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\"));\n }\n }\n })();\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\"));\n }\n }\n })();\n }\n }\n }","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\"+pluginName+\"`.\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\"+pluginName+\"` does not.\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\"EventPluginRegistry: Failed to publish event `\"+eventName+\"` for plugin `\"+pluginName+\"`.\");}}}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\"+pluginName+\"`.\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\"+pluginName+\"` does not.\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\"EventPluginRegistry: Failed to publish event `\"+eventName+\"` for plugin `\"+pluginName+\"`.\");}}}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\"+pluginName+\"`.\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\"+pluginName+\"` does not.\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\"EventPluginRegistry: Failed to publish event `\"+eventName+\"` for plugin `\"+pluginName+\"`.\");}}}}}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\n 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' +\n pluginName +\n '`.',\n );\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\n 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' +\n pluginName +\n '` does not.',\n );\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (\n !publishEventForPlugin(\n publishedEvents[eventName],\n pluginModule,\n eventName,\n )\n ) {\n {\n throw Error(\n 'EventPluginRegistry: Failed to publish event `' +\n eventName +\n '` for plugin `' +\n pluginName +\n '`.',\n );\n }\n }\n }\n }\n }","function recomputePluginOrdering() {\n\t if (!eventPluginOrder) {\n\t // Wait until an `eventPluginOrder` is injected.\n\t return;\n\t }\n\t for (var pluginName in namesToPlugins) {\n\t var pluginModule = namesToPlugins[pluginName];\n\t var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\t !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\t if (plugins[pluginIndex]) {\n\t continue;\n\t }\n\t !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n\t plugins[pluginIndex] = pluginModule;\n\t var publishedEvents = pluginModule.eventTypes;\n\t for (var eventName in publishedEvents) {\n\t !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n\t }\n\t }\n\t}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n if (plugins[pluginIndex]) {\n continue;\n }\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\n }\n }\n }","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\"));\n }\n }\n })();\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\"));\n }\n }\n })();\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\"));\n }\n }\n })();\n }\n }\n}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\"));\n }\n }\n })();\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\"));\n }\n }\n })();\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\"));\n }\n }\n })();\n }\n }\n}","function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\n\treturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error('EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' + pluginName + '`.'));\n }\n }\n })();\n if (plugins[pluginIndex]) {\n continue;\n }\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error('EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' + pluginName + '` does not.'));\n }\n }\n })();\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error('EventPluginRegistry: Failed to publish event `' + eventName + '` for plugin `' + pluginName + '`.'));\n }\n }\n })();\n }\n }\n}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n (function () {\n if (!(pluginIndex > -1)) {\n {\n throw ReactError(Error('EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' + pluginName + '`.'));\n }\n }\n })();\n if (plugins[pluginIndex]) {\n continue;\n }\n (function () {\n if (!pluginModule.extractEvents) {\n {\n throw ReactError(Error('EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' + pluginName + '` does not.'));\n }\n }\n })();\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n for (var eventName in publishedEvents) {\n (function () {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw ReactError(Error('EventPluginRegistry: Failed to publish event `' + eventName + '` for plugin `' + pluginName + '`.'));\n }\n }\n })();\n }\n }\n}","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }","function recomputePluginOrdering() {\n if (!eventPluginOrder) {\n // Wait until an `eventPluginOrder` is injected.\n return;\n }\n\n for (var pluginName in namesToPlugins) {\n var pluginModule = namesToPlugins[pluginName];\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\n\n if (!(pluginIndex > -1)) {\n {\n throw Error(\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\" + pluginName + \"`.\");\n }\n }\n\n if (plugins[pluginIndex]) {\n continue;\n }\n\n if (!pluginModule.extractEvents) {\n {\n throw Error(\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\" + pluginName + \"` does not.\");\n }\n }\n\n plugins[pluginIndex] = pluginModule;\n var publishedEvents = pluginModule.eventTypes;\n\n for (var eventName in publishedEvents) {\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\n {\n throw Error(\"EventPluginRegistry: Failed to publish event `\" + eventName + \"` for plugin `\" + pluginName + \"`.\");\n }\n }\n }\n }\n }"],"string":"[\n \"orderPlugins() {\\r\\n debug('orderPlugins:before', this.pluginNames);\\r\\n const runLast = this._plugins\\r\\n .filter(p => p.requirements.has('runLast'))\\r\\n .map(p => p.name);\\r\\n for (const name of runLast) {\\r\\n const index = this._plugins.findIndex(p => p.name === name);\\r\\n this._plugins.push(this._plugins.splice(index, 1)[0]);\\r\\n }\\r\\n debug('orderPlugins:after', this.pluginNames);\\r\\n }\",\n \"order() {\\n debug('order:before', this.names);\\n const runLast = this._plugins\\n .filter(p => p.requirements.has('runLast'))\\n .map(p => p.name);\\n for (const name of runLast) {\\n const index = this._plugins.findIndex(p => p.name === name);\\n this._plugins.push(this._plugins.splice(index, 1)[0]);\\n }\\n debug('order:after', this.names);\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n (function () {\\n if (!(pluginIndex > -1)) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\"));\\n }\\n }\\n })();\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n (function () {\\n if (!pluginModule.extractEvents) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\"));\\n }\\n }\\n })();\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n (function () {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\"));\\n }\\n }\\n })();\\n }\\n }\\n }\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\"+pluginName+\\\"`.\\\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\"+pluginName+\\\"` does not.\\\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\"+eventName+\\\"` for plugin `\\\"+pluginName+\\\"`.\\\");}}}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\"+pluginName+\\\"`.\\\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\"+pluginName+\\\"` does not.\\\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\"+eventName+\\\"` for plugin `\\\"+pluginName+\\\"`.\\\");}}}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);if(!(pluginIndex>-1)){{throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\"+pluginName+\\\"`.\\\");}}if(plugins[pluginIndex]){continue;}if(!pluginModule.extractEvents){{throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\"+pluginName+\\\"` does not.\\\");}}plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){if(!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)){{throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\"+eventName+\\\"` for plugin `\\\"+pluginName+\\\"`.\\\");}}}}}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n if (!(pluginIndex > -1)) {\\n {\\n throw Error(\\n 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' +\\n pluginName +\\n '`.',\\n );\\n }\\n }\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n if (!pluginModule.extractEvents) {\\n {\\n throw Error(\\n 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' +\\n pluginName +\\n '` does not.',\\n );\\n }\\n }\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n if (\\n !publishEventForPlugin(\\n publishedEvents[eventName],\\n pluginModule,\\n eventName,\\n )\\n ) {\\n {\\n throw Error(\\n 'EventPluginRegistry: Failed to publish event `' +\\n eventName +\\n '` for plugin `' +\\n pluginName +\\n '`.',\\n );\\n }\\n }\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n\\t if (!eventPluginOrder) {\\n\\t // Wait until an `eventPluginOrder` is injected.\\n\\t return;\\n\\t }\\n\\t for (var pluginName in namesToPlugins) {\\n\\t var pluginModule = namesToPlugins[pluginName];\\n\\t var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\t !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n\\t if (plugins[pluginIndex]) {\\n\\t continue;\\n\\t }\\n\\t !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n\\t plugins[pluginIndex] = pluginModule;\\n\\t var publishedEvents = pluginModule.eventTypes;\\n\\t for (var eventName in publishedEvents) {\\n\\t !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n\\t }\\n\\t }\\n\\t}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n !(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n !pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;\\n }\\n }\\n }\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\nreturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n (function () {\\n if (!(pluginIndex > -1)) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\"));\\n }\\n }\\n })();\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n (function () {\\n if (!pluginModule.extractEvents) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\"));\\n }\\n }\\n })();\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n (function () {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\"));\\n }\\n }\\n })();\\n }\\n }\\n}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n (function () {\\n if (!(pluginIndex > -1)) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\"));\\n }\\n }\\n })();\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n (function () {\\n if (!pluginModule.extractEvents) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\"));\\n }\\n }\\n })();\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n (function () {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw ReactError(Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\"));\\n }\\n }\\n })();\\n }\\n }\\n}\",\n \"function recomputePluginOrdering(){if(!eventPluginOrder){// Wait until an `eventPluginOrder` is injected.\\n\\treturn;}for(var pluginName in namesToPlugins){var pluginModule=namesToPlugins[pluginName];var pluginIndex=eventPluginOrder.indexOf(pluginName);!(pluginIndex>-1)?invariant(false,'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.',pluginName):void 0;if(plugins[pluginIndex]){continue;}!pluginModule.extractEvents?invariant(false,'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.',pluginName):void 0;plugins[pluginIndex]=pluginModule;var publishedEvents=pluginModule.eventTypes;for(var eventName in publishedEvents){!publishEventForPlugin(publishedEvents[eventName],pluginModule,eventName)?invariant(false,'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.',eventName,pluginName):void 0;}}}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n (function () {\\n if (!(pluginIndex > -1)) {\\n {\\n throw ReactError(Error('EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' + pluginName + '`.'));\\n }\\n }\\n })();\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n (function () {\\n if (!pluginModule.extractEvents) {\\n {\\n throw ReactError(Error('EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' + pluginName + '` does not.'));\\n }\\n }\\n })();\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n for (var eventName in publishedEvents) {\\n (function () {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw ReactError(Error('EventPluginRegistry: Failed to publish event `' + eventName + '` for plugin `' + pluginName + '`.'));\\n }\\n }\\n })();\\n }\\n }\\n}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n (function () {\\n if (!(pluginIndex > -1)) {\\n {\\n throw ReactError(Error('EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `' + pluginName + '`.'));\\n }\\n }\\n })();\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n (function () {\\n if (!pluginModule.extractEvents) {\\n {\\n throw ReactError(Error('EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `' + pluginName + '` does not.'));\\n }\\n }\\n })();\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n for (var eventName in publishedEvents) {\\n (function () {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw ReactError(Error('EventPluginRegistry: Failed to publish event `' + eventName + '` for plugin `' + pluginName + '`.'));\\n }\\n }\\n })();\\n }\\n }\\n}\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n if (!(pluginIndex > -1)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n if (!pluginModule.extractEvents) {\\n {\\n throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\");\\n }\\n }\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n if (!(pluginIndex > -1)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n if (!pluginModule.extractEvents) {\\n {\\n throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\");\\n }\\n }\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n if (!(pluginIndex > -1)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n if (!pluginModule.extractEvents) {\\n {\\n throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\");\\n }\\n }\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n if (!(pluginIndex > -1)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n if (!pluginModule.extractEvents) {\\n {\\n throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\");\\n }\\n }\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n }\\n }\\n }\",\n \"function recomputePluginOrdering() {\\n if (!eventPluginOrder) {\\n // Wait until an `eventPluginOrder` is injected.\\n return;\\n }\\n\\n for (var pluginName in namesToPlugins) {\\n var pluginModule = namesToPlugins[pluginName];\\n var pluginIndex = eventPluginOrder.indexOf(pluginName);\\n\\n if (!(pluginIndex > -1)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n\\n if (plugins[pluginIndex]) {\\n continue;\\n }\\n\\n if (!pluginModule.extractEvents) {\\n {\\n throw Error(\\\"EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `\\\" + pluginName + \\\"` does not.\\\");\\n }\\n }\\n\\n plugins[pluginIndex] = pluginModule;\\n var publishedEvents = pluginModule.eventTypes;\\n\\n for (var eventName in publishedEvents) {\\n if (!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName)) {\\n {\\n throw Error(\\\"EventPluginRegistry: Failed to publish event `\\\" + eventName + \\\"` for plugin `\\\" + pluginName + \\\"`.\\\");\\n }\\n }\\n }\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7994548","0.74701035","0.7169167","0.71361053","0.71361053","0.71361053","0.7128741","0.7122665","0.71187073","0.7117351","0.7117351","0.7117351","0.71010214","0.71010214","0.71010214","0.709135","0.709135","0.709135","0.709135","0.709135","0.709135","0.7091044","0.7091044","0.7079425","0.70746076","0.70746076","0.70659184","0.70659184","0.70659184","0.70659184","0.70659184"],"string":"[\n \"0.7994548\",\n \"0.74701035\",\n \"0.7169167\",\n \"0.71361053\",\n \"0.71361053\",\n \"0.71361053\",\n \"0.7128741\",\n \"0.7122665\",\n \"0.71187073\",\n \"0.7117351\",\n \"0.7117351\",\n \"0.7117351\",\n \"0.71010214\",\n \"0.71010214\",\n \"0.71010214\",\n \"0.709135\",\n \"0.709135\",\n \"0.709135\",\n \"0.709135\",\n \"0.709135\",\n \"0.709135\",\n \"0.7091044\",\n \"0.7091044\",\n \"0.7079425\",\n \"0.70746076\",\n \"0.70746076\",\n \"0.70659184\",\n \"0.70659184\",\n \"0.70659184\",\n \"0.70659184\",\n \"0.70659184\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74185,"cells":{"query":{"kind":"string","value":"Standard/simple iteration through an event's collected dispatches."},"document":{"kind":"string","value":"function executeDispatchesInOrder(event, simulated) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and Instances are two parallel arrays that are always in sync.\n executeDispatch(event, simulated, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, simulated, dispatchListeners, dispatchInstances);\n }\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(\"production\"!==process.env.NODE_ENV){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;} // Listeners and IDs are two parallel arrays that are always in sync.\ncb(event,dispatchListeners[i],dispatchIDs[i]);}}else if(dispatchListeners){cb(event,dispatchListeners,dispatchIDs);}}","function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(true){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i < dispatchListeners.length;i++) {if(event.isPropagationStopped()){break;} // Listeners and IDs are two parallel arrays that are always in sync.\n\tcb(event,dispatchListeners[i],dispatchIDs[i]);}}else if(dispatchListeners){cb(event,dispatchListeners,dispatchIDs);}}","function forEach(event, each, disposable) {\n return snapshot((listener, thisArgs = null, disposables) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);\n }","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (false) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"development\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"production\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== \"production\") {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (true) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n\t var dispatchListeners = event._dispatchListeners;\n\t var dispatchIDs = event._dispatchIDs;\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t validateEventDispatches(event);\n\t }\n\t if (Array.isArray(dispatchListeners)) {\n\t for (var i = 0; i < dispatchListeners.length; i++) {\n\t if (event.isPropagationStopped()) {\n\t break;\n\t }\n\t // Listeners and IDs are two parallel arrays that are always in sync.\n\t cb(event, dispatchListeners[i], dispatchIDs[i]);\n\t }\n\t } else if (dispatchListeners) {\n\t cb(event, dispatchListeners, dispatchIDs);\n\t }\n\t}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function forEachEventDispatch(event, cb) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchIDs = event._dispatchIDs;\n if (\"production\" !== process.env.NODE_ENV) {\n validateEventDispatches(event);\n }\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n }\n // Listeners and IDs are two parallel arrays that are always in sync.\n cb(event, dispatchListeners[i], dispatchIDs[i]);\n }\n } else if (dispatchListeners) {\n cb(event, dispatchListeners, dispatchIDs);\n }\n}","function _forEach(event, each) {\n return snapshot(function (listener) {\n var thisArgs = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n var disposables = arguments.length > 2 ? arguments[2] : undefined;\n return event(function (i) {\n each(i);\n listener.call(thisArgs, i);\n }, null, disposables);\n });\n}","function patchViaCapturingAllTheEvents() {\n var _loop_1 = function (i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = wrapWithCurrentZone(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n}","function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners=null;event._dispatchIDs=null;}","function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners = null;event._dispatchIDs = null;}","function eventFunction(e){\n\t getSlot([q.id], allEvents).push(e);\n\t eventDurForeach(e, drawfn);\n\t}","function patchViaCapturingAllTheEvents() {\n var _loop_1 = function _loop_1(i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target,\n bound,\n source;\n\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n } else {\n source = 'unknown.' + onproperty;\n }\n\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = wrapWithCurrentZone(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n\n elt = elt.parentElement;\n }\n }, true);\n };\n\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n }","trigger (eventName) {\n if (this.events[eventName]) {\n for (let cb of this.events[eventName]) {\n cb();\n }\n }\n }","trigger(eventName) {\n if (this.events[eventName]) {\n for (let cb of this.events[eventName]) {\n cb();\n }\n }\n }","each(action) {\n for (const element of this)\n action(element);\n }","function patchViaCapturingAllTheEvents() {\n var _loop_1 = function(i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = Zone.current.wrap(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n \n}","function patchViaCapturingAllTheEvents() {\n var _loop_1 = function(i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = Zone.current.wrap(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n \n}","function patchViaCapturingAllTheEvents() {\n var _loop_1 = function (i) {\n var property = eventNames[i];\n var onproperty = 'on' + property;\n self.addEventListener(property, function (event) {\n var elt = event.target, bound, source;\n if (elt) {\n source = elt.constructor['name'] + '.' + onproperty;\n }\n else {\n source = 'unknown.' + onproperty;\n }\n while (elt) {\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\n bound = Zone.current.wrap(elt[onproperty], source);\n bound[unboundKey] = elt[onproperty];\n elt[onproperty] = bound;\n }\n elt = elt.parentElement;\n }\n }, true);\n };\n for (var i = 0; i < eventNames.length; i++) {\n _loop_1(i);\n }\n \n}","function accumulateDispatches(inst, ignoredDirection, event) {\n if (inst && event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(inst, registrationName);\n\n if (listener) {\n event._dispatchListeners = accumulateInto(\n event._dispatchListeners,\n listener,\n );\n event._dispatchInstances = accumulateInto(\n event._dispatchInstances,\n inst,\n );\n }\n }\n }","trigger(eventName) {\n if (this.events[eventName]) {\n for (let cb of this.events[eventName]) {\n cb();\n }\n }\n }","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (inst && event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}"],"string":"[\n \"function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(\\\"production\\\"!==process.env.NODE_ENV){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;} // Listeners and IDs are two parallel arrays that are always in sync.\\ncb(event,dispatchListeners[i],dispatchIDs[i]);}}else if(dispatchListeners){cb(event,dispatchListeners,dispatchIDs);}}\",\n \"function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(true){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i < dispatchListeners.length;i++) {if(event.isPropagationStopped()){break;} // Listeners and IDs are two parallel arrays that are always in sync.\\n\\tcb(event,dispatchListeners[i],dispatchIDs[i]);}}else if(dispatchListeners){cb(event,dispatchListeners,dispatchIDs);}}\",\n \"function forEach(event, each, disposable) {\\n return snapshot((listener, thisArgs = null, disposables) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);\\n }\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (false) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"development\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"production\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== \\\"production\\\") {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (true) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n\\t var dispatchListeners = event._dispatchListeners;\\n\\t var dispatchIDs = event._dispatchIDs;\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t validateEventDispatches(event);\\n\\t }\\n\\t if (Array.isArray(dispatchListeners)) {\\n\\t for (var i = 0; i < dispatchListeners.length; i++) {\\n\\t if (event.isPropagationStopped()) {\\n\\t break;\\n\\t }\\n\\t // Listeners and IDs are two parallel arrays that are always in sync.\\n\\t cb(event, dispatchListeners[i], dispatchIDs[i]);\\n\\t }\\n\\t } else if (dispatchListeners) {\\n\\t cb(event, dispatchListeners, dispatchIDs);\\n\\t }\\n\\t}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function forEachEventDispatch(event, cb) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchIDs = event._dispatchIDs;\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n validateEventDispatches(event);\\n }\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n }\\n // Listeners and IDs are two parallel arrays that are always in sync.\\n cb(event, dispatchListeners[i], dispatchIDs[i]);\\n }\\n } else if (dispatchListeners) {\\n cb(event, dispatchListeners, dispatchIDs);\\n }\\n}\",\n \"function _forEach(event, each) {\\n return snapshot(function (listener) {\\n var thisArgs = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\\n var disposables = arguments.length > 2 ? arguments[2] : undefined;\\n return event(function (i) {\\n each(i);\\n listener.call(thisArgs, i);\\n }, null, disposables);\\n });\\n}\",\n \"function patchViaCapturingAllTheEvents() {\\n var _loop_1 = function (i) {\\n var property = eventNames[i];\\n var onproperty = 'on' + property;\\n self.addEventListener(property, function (event) {\\n var elt = event.target, bound, source;\\n if (elt) {\\n source = elt.constructor['name'] + '.' + onproperty;\\n }\\n else {\\n source = 'unknown.' + onproperty;\\n }\\n while (elt) {\\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\\n bound = wrapWithCurrentZone(elt[onproperty], source);\\n bound[unboundKey] = elt[onproperty];\\n elt[onproperty] = bound;\\n }\\n elt = elt.parentElement;\\n }\\n }, true);\\n };\\n for (var i = 0; i < eventNames.length; i++) {\\n _loop_1(i);\\n }\\n}\",\n \"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners=null;event._dispatchIDs=null;}\",\n \"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners = null;event._dispatchIDs = null;}\",\n \"function eventFunction(e){\\n\\t getSlot([q.id], allEvents).push(e);\\n\\t eventDurForeach(e, drawfn);\\n\\t}\",\n \"function patchViaCapturingAllTheEvents() {\\n var _loop_1 = function _loop_1(i) {\\n var property = eventNames[i];\\n var onproperty = 'on' + property;\\n self.addEventListener(property, function (event) {\\n var elt = event.target,\\n bound,\\n source;\\n\\n if (elt) {\\n source = elt.constructor['name'] + '.' + onproperty;\\n } else {\\n source = 'unknown.' + onproperty;\\n }\\n\\n while (elt) {\\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\\n bound = wrapWithCurrentZone(elt[onproperty], source);\\n bound[unboundKey] = elt[onproperty];\\n elt[onproperty] = bound;\\n }\\n\\n elt = elt.parentElement;\\n }\\n }, true);\\n };\\n\\n for (var i = 0; i < eventNames.length; i++) {\\n _loop_1(i);\\n }\\n }\",\n \"trigger (eventName) {\\n if (this.events[eventName]) {\\n for (let cb of this.events[eventName]) {\\n cb();\\n }\\n }\\n }\",\n \"trigger(eventName) {\\n if (this.events[eventName]) {\\n for (let cb of this.events[eventName]) {\\n cb();\\n }\\n }\\n }\",\n \"each(action) {\\n for (const element of this)\\n action(element);\\n }\",\n \"function patchViaCapturingAllTheEvents() {\\n var _loop_1 = function(i) {\\n var property = eventNames[i];\\n var onproperty = 'on' + property;\\n self.addEventListener(property, function (event) {\\n var elt = event.target, bound, source;\\n if (elt) {\\n source = elt.constructor['name'] + '.' + onproperty;\\n }\\n else {\\n source = 'unknown.' + onproperty;\\n }\\n while (elt) {\\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\\n bound = Zone.current.wrap(elt[onproperty], source);\\n bound[unboundKey] = elt[onproperty];\\n elt[onproperty] = bound;\\n }\\n elt = elt.parentElement;\\n }\\n }, true);\\n };\\n for (var i = 0; i < eventNames.length; i++) {\\n _loop_1(i);\\n }\\n \\n}\",\n \"function patchViaCapturingAllTheEvents() {\\n var _loop_1 = function(i) {\\n var property = eventNames[i];\\n var onproperty = 'on' + property;\\n self.addEventListener(property, function (event) {\\n var elt = event.target, bound, source;\\n if (elt) {\\n source = elt.constructor['name'] + '.' + onproperty;\\n }\\n else {\\n source = 'unknown.' + onproperty;\\n }\\n while (elt) {\\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\\n bound = Zone.current.wrap(elt[onproperty], source);\\n bound[unboundKey] = elt[onproperty];\\n elt[onproperty] = bound;\\n }\\n elt = elt.parentElement;\\n }\\n }, true);\\n };\\n for (var i = 0; i < eventNames.length; i++) {\\n _loop_1(i);\\n }\\n \\n}\",\n \"function patchViaCapturingAllTheEvents() {\\n var _loop_1 = function (i) {\\n var property = eventNames[i];\\n var onproperty = 'on' + property;\\n self.addEventListener(property, function (event) {\\n var elt = event.target, bound, source;\\n if (elt) {\\n source = elt.constructor['name'] + '.' + onproperty;\\n }\\n else {\\n source = 'unknown.' + onproperty;\\n }\\n while (elt) {\\n if (elt[onproperty] && !elt[onproperty][unboundKey]) {\\n bound = Zone.current.wrap(elt[onproperty], source);\\n bound[unboundKey] = elt[onproperty];\\n elt[onproperty] = bound;\\n }\\n elt = elt.parentElement;\\n }\\n }, true);\\n };\\n for (var i = 0; i < eventNames.length; i++) {\\n _loop_1(i);\\n }\\n \\n}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n if (inst && event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(inst, registrationName);\\n\\n if (listener) {\\n event._dispatchListeners = accumulateInto(\\n event._dispatchListeners,\\n listener,\\n );\\n event._dispatchInstances = accumulateInto(\\n event._dispatchInstances,\\n inst,\\n );\\n }\\n }\\n }\",\n \"trigger(eventName) {\\n if (this.events[eventName]) {\\n for (let cb of this.events[eventName]) {\\n cb();\\n }\\n }\\n }\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (inst && event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t\\t if (event && event.dispatchConfig.registrationName) {\\n\\t\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t\\t var listener = getListener(inst, registrationName);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t\\t if (event && event.dispatchConfig.registrationName) {\\n\\t\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t\\t var listener = getListener(inst, registrationName);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.63397396","0.6318108","0.6217002","0.6128669","0.61218345","0.61218345","0.61218345","0.61218345","0.61218345","0.61218345","0.61218345","0.61218345","0.61186224","0.61186224","0.61148316","0.60777354","0.60777354","0.60777354","0.60777354","0.60777354","0.60777354","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.60720116","0.6041401","0.576675","0.5738329","0.5724951","0.57087463","0.5708683","0.56720334","0.5572131","0.555525","0.55036515","0.55036515","0.5501392","0.5492434","0.5490973","0.5490368","0.548263","0.548263","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449","0.5468449"],"string":"[\n \"0.63397396\",\n \"0.6318108\",\n \"0.6217002\",\n \"0.6128669\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61218345\",\n \"0.61186224\",\n \"0.61186224\",\n \"0.61148316\",\n \"0.60777354\",\n \"0.60777354\",\n \"0.60777354\",\n \"0.60777354\",\n \"0.60777354\",\n \"0.60777354\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.60720116\",\n \"0.6041401\",\n \"0.576675\",\n \"0.5738329\",\n \"0.5724951\",\n \"0.57087463\",\n \"0.5708683\",\n \"0.56720334\",\n \"0.5572131\",\n \"0.555525\",\n \"0.55036515\",\n \"0.55036515\",\n \"0.5501392\",\n \"0.5492434\",\n \"0.5490973\",\n \"0.5490368\",\n \"0.548263\",\n \"0.548263\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\",\n \"0.5468449\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74186,"cells":{"query":{"kind":"string","value":"Given a DOM node, return the closest ReactDOMComponent or ReactDOMTextComponent instance ancestor."},"document":{"kind":"string","value":"function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function getClosestInstanceFromNode(node){if(node[internalInstanceKey]){return node[internalInstanceKey];}while(!node[internalInstanceKey]){if(node.parentNode){node=node.parentNode;}else{// Top of the tree. This node must not be part of a React tree (or is\n// unmounted, potentially).\nreturn null;}}var inst=node[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}","function getClosestInstanceFromNode(node){if(node[internalInstanceKey]){return node[internalInstanceKey];}while(!node[internalInstanceKey]){if(node.parentNode){node=node.parentNode;}else{// Top of the tree. This node must not be part of a React tree (or is\n// unmounted, potentially).\nreturn null;}}var inst=node[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}","function getClosestInstanceFromNode(node){if(node[internalInstanceKey]){return node[internalInstanceKey];}while(!node[internalInstanceKey]){if(node.parentNode){node=node.parentNode;}else{// Top of the tree. This node must not be part of a React tree (or is\n// unmounted, potentially).\nreturn null;}}var inst=node[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}","function getClosestInstanceFromNode(node){if(node[internalInstanceKey]){return node[internalInstanceKey];}while(!node[internalInstanceKey]){if(node.parentNode){node=node.parentNode;}else{// Top of the tree. This node must not be part of a React tree (or is\n// unmounted, potentially).\nreturn null;}}var inst=node[internalInstanceKey];if(inst.tag===HostComponent||inst.tag===HostText){// In Fiber, this will always be the deepest root.\nreturn inst;}return null;}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\n }\n return null;\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }","function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }","function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\n}","function getClosestInstanceFromNode(node) {\n if (node[internalInstanceKey]) {\n return node[internalInstanceKey];\n }\n\n while (!node[internalInstanceKey]) {\n if (node.parentNode) {\n node = node.parentNode;\n } else {\n // Top of the tree. This node must not be part of a React tree (or is\n // unmounted, potentially).\n return null;\n }\n }\n\n var inst = node[internalInstanceKey];\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber, this will always be the deepest root.\n return inst;\n }\n\n return null;\n }","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findFirstReactDOMImpl(node) {\n\t\t // This node might be from another React instance, so we make sure not to\n\t\t // examine the node cache here\n\t\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t\t if (node.nodeType !== 1) {\n\t\t // Not a DOMElement, therefore not a React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}"],"string":"[\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 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 findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\\n }\\n return null;\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\\n}\",\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) {\\n if (node[internalInstanceKey]) {\\n return node[internalInstanceKey];\\n }\\n\\n while (!node[internalInstanceKey]) {\\n if (node.parentNode) {\\n node = node.parentNode;\\n } else {\\n // Top of the tree. This node must 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 findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\\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 findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\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]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7370951","0.7370951","0.7370951","0.7370951","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.73246175","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.7308554","0.72994673","0.7286418","0.7286418","0.7280088","0.7280088","0.7280088","0.7280088","0.7280088","0.7280088","0.7280088","0.72675353","0.72675353","0.72675353","0.72596437","0.72556794","0.7252304","0.7235935","0.72322655"],"string":"[\n \"0.7370951\",\n \"0.7370951\",\n \"0.7370951\",\n \"0.7370951\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.73246175\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.7308554\",\n \"0.72994673\",\n \"0.7286418\",\n \"0.7286418\",\n \"0.7280088\",\n \"0.7280088\",\n \"0.7280088\",\n \"0.7280088\",\n \"0.7280088\",\n \"0.7280088\",\n \"0.7280088\",\n \"0.72675353\",\n \"0.72675353\",\n \"0.72675353\",\n \"0.72596437\",\n \"0.72556794\",\n \"0.7252304\",\n \"0.7235935\",\n \"0.72322655\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7227235"},"document_rank":{"kind":"string","value":"100"}}},{"rowIdx":74187,"cells":{"query":{"kind":"string","value":"Given a DOM node, return the ReactDOMComponent or ReactDOMTextComponent instance, or null if the node was not rendered by this React."},"document":{"kind":"string","value":"function getInstanceFromNode$1(node) {\n var inst = node[internalInstanceKey];\n if (inst) {\n if (inst.tag === HostComponent || inst.tag === HostText) {\n return inst;\n } else {\n return null;\n }\n }\n return null;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n\t\t // This node might be from another React instance, so we make sure not to\n\t\t // examine the node cache here\n\t\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t\t if (node.nodeType !== 1) {\n\t\t // Not a DOMElement, therefore not a React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\t\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(\n node,\n );\n }","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findDOMNode$2(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findDOMNode$1(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return external_ReactDOM_default.a.findDOMNode(node);\n}","toDOMNode(editor, node) {\n var domNode = Editor.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }","function ReactDOMComponent(element) {\r\n\t var tag = element.type;\r\n\t validateDangerousTag(tag);\r\n\t this._currentElement = element;\r\n\t this._tag = tag.toLowerCase();\r\n\t this._namespaceURI = null;\r\n\t this._renderedChildren = null;\r\n\t this._previousStyle = null;\r\n\t this._previousStyleCopy = null;\r\n\t this._hostNode = null;\r\n\t this._hostParent = null;\r\n\t this._rootNodeID = 0;\r\n\t this._domID = 0;\r\n\t this._hostContainerInfo = null;\r\n\t this._wrapperState = null;\r\n\t this._topLevelWrapper = null;\r\n\t this._flags = 0;\r\n\t if (process.env.NODE_ENV !== 'production') {\r\n\t this._ancestorInfo = null;\r\n\t setAndValidateContentChildDev.call(this, null);\r\n\t }\r\n\t}","toDOMNode(editor, node) {\n var domNode = __WEBPACK_IMPORTED_MODULE_1_slate__[\"Editor\"].isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}"],"string":"[\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\\n }\\n return null;\\n}\",\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 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 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 findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(\\n node,\\n );\\n }\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\n}\",\n \"function findDOMNode$2(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\n}\",\n \"function findDOMNode$1(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return external_ReactDOM_default.a.findDOMNode(node);\\n}\",\n \"toDOMNode(editor, node) {\\n var domNode = Editor.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\\n\\n if (!domNode) {\\n throw new Error(\\\"Cannot resolve a DOM node from Slate node: \\\".concat(JSON.stringify(node)));\\n }\\n\\n return domNode;\\n }\",\n \"function ReactDOMComponent(element) {\\r\\n\\t var tag = element.type;\\r\\n\\t validateDangerousTag(tag);\\r\\n\\t this._currentElement = element;\\r\\n\\t this._tag = tag.toLowerCase();\\r\\n\\t this._namespaceURI = null;\\r\\n\\t this._renderedChildren = null;\\r\\n\\t this._previousStyle = null;\\r\\n\\t this._previousStyleCopy = null;\\r\\n\\t this._hostNode = null;\\r\\n\\t this._hostParent = null;\\r\\n\\t this._rootNodeID = 0;\\r\\n\\t this._domID = 0;\\r\\n\\t this._hostContainerInfo = null;\\r\\n\\t this._wrapperState = null;\\r\\n\\t this._topLevelWrapper = null;\\r\\n\\t this._flags = 0;\\r\\n\\t if (process.env.NODE_ENV !== 'production') {\\r\\n\\t this._ancestorInfo = null;\\r\\n\\t setAndValidateContentChildDev.call(this, null);\\r\\n\\t }\\r\\n\\t}\",\n \"toDOMNode(editor, node) {\\n var domNode = __WEBPACK_IMPORTED_MODULE_1_slate__[\\\"Editor\\\"].isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\\n\\n if (!domNode) {\\n throw new Error(\\\"Cannot resolve a DOM node from Slate node: \\\".concat(JSON.stringify(node)));\\n }\\n\\n return domNode;\\n }\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7596669","0.7380082","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73496497","0.73296285","0.73296285","0.73296285","0.73296285","0.73296285","0.73296285","0.73296285","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7291068","0.7208278","0.7164413","0.7164413","0.7154964","0.7154964","0.7154964","0.7154964","0.7154964","0.7154964","0.715007","0.7107199","0.7107199","0.70594466","0.7046418","0.68976444","0.68047386","0.6793221","0.63803375","0.63119173","0.6299216","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133","0.62923133"],"string":"[\n \"0.7596669\",\n \"0.7380082\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73496497\",\n \"0.73296285\",\n \"0.73296285\",\n \"0.73296285\",\n \"0.73296285\",\n \"0.73296285\",\n \"0.73296285\",\n \"0.73296285\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7291068\",\n \"0.7208278\",\n \"0.7164413\",\n \"0.7164413\",\n \"0.7154964\",\n \"0.7154964\",\n \"0.7154964\",\n \"0.7154964\",\n \"0.7154964\",\n \"0.7154964\",\n \"0.715007\",\n \"0.7107199\",\n \"0.7107199\",\n \"0.70594466\",\n \"0.7046418\",\n \"0.68976444\",\n \"0.68047386\",\n \"0.6793221\",\n \"0.63803375\",\n \"0.63119173\",\n \"0.6299216\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\",\n \"0.62923133\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74188,"cells":{"query":{"kind":"string","value":"Given a ReactDOMComponent or ReactDOMTextComponent, return the corresponding DOM node."},"document":{"kind":"string","value":"function getNodeFromInstance$1(inst) {\n if (inst.tag === HostComponent || inst.tag === HostText) {\n // In Fiber this, is just the state node right now. We assume it will be\n // a host component or host text.\n return inst.stateNode;\n }\n\n // Without this first invariant, passing a non-DOM-component triggers the next\n // invariant for a missing parent, which is super confusing.\n invariant(false, 'getNodeFromInstance: Invalid argument.');\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function findFirstReactDOMImpl(node) {\n\t\t // This node might be from another React instance, so we make sure not to\n\t\t // examine the node cache here\n\t\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t\t if (node.nodeType !== 1) {\n\t\t // Not a DOMElement, therefore not a React component\n\t\t continue;\n\t\t }\n\t\t var nodeID = internalGetID(node);\n\t\t if (!nodeID) {\n\t\t continue;\n\t\t }\n\t\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\t\t\n\t\t // If containersByReactRootID contains the container we find by crawling up\n\t\t // the tree, we know that this instance of React rendered the node.\n\t\t // nb. isValid's strategy (with containsNode) does not work because render\n\t\t // trees may be nested and we don't want a false positive in that case.\n\t\t var current = node;\n\t\t var lastID;\n\t\t do {\n\t\t lastID = internalGetID(current);\n\t\t current = current.parentNode;\n\t\t if (current == null) {\n\t\t // The passed-in node has been detached from the container it was\n\t\t // originally rendered into.\n\t\t return null;\n\t\t }\n\t\t } while (lastID !== reactRootID);\n\t\t\n\t\t if (current === containersByReactRootID[reactRootID]) {\n\t\t return node;\n\t\t }\n\t\t }\n\t\t return null;\n\t\t}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\n }\n return null;\n}","function 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 findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return _reactDom.default.findDOMNode(node);\n}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n\t // This node might be from another React instance, so we make sure not to\n\t // examine the node cache here\n\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t if (node.nodeType !== 1) {\n\t // Not a DOMElement, therefore not a React component\n\t continue;\n\t }\n\t var nodeID = internalGetID(node);\n\t if (!nodeID) {\n\t continue;\n\t }\n\t var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n\t // If containersByReactRootID contains the container we find by crawling up\n\t // the tree, we know that this instance of React rendered the node.\n\t // nb. isValid's strategy (with containsNode) does not work because render\n\t // trees may be nested and we don't want a false positive in that case.\n\t var current = node;\n\t var lastID;\n\t do {\n\t lastID = internalGetID(current);\n\t current = current.parentNode;\n\t if (current == null) {\n\t // The passed-in node has been detached from the container it was\n\t // originally rendered into.\n\t return null;\n\t }\n\t } while (lastID !== reactRootID);\n\n\t if (current === containersByReactRootID[reactRootID]) {\n\t return node;\n\t }\n\t }\n\t return null;\n\t}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n continue;\n }\n var nodeID = internalGetID(node);\n if (!nodeID) {\n continue;\n }\n var reactRootID = ReactInstanceHandles.getReactRootIDFromNodeID(nodeID);\n\n // If containersByReactRootID contains the container we find by crawling up\n // the tree, we know that this instance of React rendered the node.\n // nb. isValid's strategy (with containsNode) does not work because render\n // trees may be nested and we don't want a false positive in that case.\n var current = node;\n var lastID;\n do {\n lastID = internalGetID(current);\n current = current.parentNode;\n if (current == null) {\n // The passed-in node has been detached from the container it was\n // originally rendered into.\n return null;\n }\n } while (lastID !== reactRootID);\n\n if (current === containersByReactRootID[reactRootID]) {\n return node;\n }\n }\n return null;\n}","function findDOMNode$2(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(\n node,\n );\n }","function findDOMNode$1(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return ReactDOM.default.findDOMNode(node);\n}","function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n\n return external_ReactDOM_default.a.findDOMNode(node);\n}","toDOMNode(editor, node) {\n var domNode = Editor.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }","function getRenderedNativeOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}","function getRenderedNativeOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}","toDOMNode(editor, node) {\n var domNode = __WEBPACK_IMPORTED_MODULE_1_slate__[\"Editor\"].isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }","function getRenderedHostOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}","toDOMNode(editor, node) {\n var KEY_TO_ELEMENT = EDITOR_TO_KEY_TO_ELEMENT.get(editor);\n var domNode = index_es/* Editor.isEditor */.ML.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT === null || KEY_TO_ELEMENT === void 0 ? void 0 : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\n\n if (!domNode) {\n throw new Error(\"Cannot resolve a DOM node from Slate node: \".concat(JSON.stringify(node)));\n }\n\n return domNode;\n }","function getRenderedNativeOrTextFromComponent(component) {\n var rendered;\n while (rendered = component._renderedComponent) {\n component = rendered;\n }\n return component;\n}","function render(node) {\n switch (nodeType(node)) {\n case \"text\":\n return document.createTextNode(node);\n case \"element\":\n return renderElement(node);\n case \"component\":\n return renderComponent(node);\n }\n}","function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}","function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}","function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}","function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}","function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}","function getRenderedNativeOrTextFromComponent(component) {\n\t var rendered;\n\t while (rendered = component._renderedComponent) {\n\t component = rendered;\n\t }\n\t return component;\n\t}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (true) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\r\n\t var tag = element.type;\r\n\t validateDangerousTag(tag);\r\n\t this._currentElement = element;\r\n\t this._tag = tag.toLowerCase();\r\n\t this._namespaceURI = null;\r\n\t this._renderedChildren = null;\r\n\t this._previousStyle = null;\r\n\t this._previousStyleCopy = null;\r\n\t this._hostNode = null;\r\n\t this._hostParent = null;\r\n\t this._rootNodeID = 0;\r\n\t this._domID = 0;\r\n\t this._hostContainerInfo = null;\r\n\t this._wrapperState = null;\r\n\t this._topLevelWrapper = null;\r\n\t this._flags = 0;\r\n\t if (process.env.NODE_ENV !== 'production') {\r\n\t this._ancestorInfo = null;\r\n\t setAndValidateContentChildDev.call(this, null);\r\n\t }\r\n\t}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (false) {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}","function ReactDOMComponent(element) {\n var tag = element.type;\n validateDangerousTag(tag);\n this._currentElement = element;\n this._tag = tag.toLowerCase();\n this._namespaceURI = null;\n this._renderedChildren = null;\n this._previousStyle = null;\n this._previousStyleCopy = null;\n this._hostNode = null;\n this._hostParent = null;\n this._rootNodeID = 0;\n this._domID = 0;\n this._hostContainerInfo = null;\n this._wrapperState = null;\n this._topLevelWrapper = null;\n this._flags = 0;\n if (process.env.NODE_ENV !== 'production') {\n this._ancestorInfo = null;\n setAndValidateContentChildDev.call(this, null);\n }\n}"],"string":"[\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 findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0__.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default().findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\\n }\\n return null;\\n}\",\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 findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return _reactDom.default.findDOMNode(node);\\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 // 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 findDOMNode$2(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return __WEBPACK_IMPORTED_MODULE_0_react_dom___default.a.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return react_dom__WEBPACK_IMPORTED_MODULE_0___default.a.findDOMNode(\\n node,\\n );\\n }\",\n \"function findDOMNode$1(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return ReactDOM.default.findDOMNode(node);\\n}\",\n \"function findDOMNode(node) {\\n if (node instanceof HTMLElement) {\\n return node;\\n }\\n\\n return external_ReactDOM_default.a.findDOMNode(node);\\n}\",\n \"toDOMNode(editor, node) {\\n var domNode = Editor.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\\n\\n if (!domNode) {\\n throw new Error(\\\"Cannot resolve a DOM node from Slate node: \\\".concat(JSON.stringify(node)));\\n }\\n\\n return domNode;\\n }\",\n \"function getRenderedNativeOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}\",\n \"function getRenderedNativeOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}\",\n \"toDOMNode(editor, node) {\\n var domNode = __WEBPACK_IMPORTED_MODULE_1_slate__[\\\"Editor\\\"].isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\\n\\n if (!domNode) {\\n throw new Error(\\\"Cannot resolve a DOM node from Slate node: \\\".concat(JSON.stringify(node)));\\n }\\n\\n return domNode;\\n }\",\n \"function getRenderedHostOrTextFromComponent(component){var rendered;while(rendered=component._renderedComponent){component=rendered;}return component;}\",\n \"toDOMNode(editor, node) {\\n var KEY_TO_ELEMENT = EDITOR_TO_KEY_TO_ELEMENT.get(editor);\\n var domNode = index_es/* Editor.isEditor */.ML.isEditor(node) ? EDITOR_TO_ELEMENT.get(editor) : KEY_TO_ELEMENT === null || KEY_TO_ELEMENT === void 0 ? void 0 : KEY_TO_ELEMENT.get(ReactEditor.findKey(editor, node));\\n\\n if (!domNode) {\\n throw new Error(\\\"Cannot resolve a DOM node from Slate node: \\\".concat(JSON.stringify(node)));\\n }\\n\\n return domNode;\\n }\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n var rendered;\\n while (rendered = component._renderedComponent) {\\n component = rendered;\\n }\\n return component;\\n}\",\n \"function render(node) {\\n switch (nodeType(node)) {\\n case \\\"text\\\":\\n return document.createTextNode(node);\\n case \\\"element\\\":\\n return renderElement(node);\\n case \\\"component\\\":\\n return renderComponent(node);\\n }\\n}\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n\\t var rendered;\\n\\t while (rendered = component._renderedComponent) {\\n\\t component = rendered;\\n\\t }\\n\\t return component;\\n\\t}\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n\\t var rendered;\\n\\t while (rendered = component._renderedComponent) {\\n\\t component = rendered;\\n\\t }\\n\\t return component;\\n\\t}\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n\\t var rendered;\\n\\t while (rendered = component._renderedComponent) {\\n\\t component = rendered;\\n\\t }\\n\\t return component;\\n\\t}\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n\\t var rendered;\\n\\t while (rendered = component._renderedComponent) {\\n\\t component = rendered;\\n\\t }\\n\\t return component;\\n\\t}\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n\\t var rendered;\\n\\t while (rendered = component._renderedComponent) {\\n\\t component = rendered;\\n\\t }\\n\\t return component;\\n\\t}\",\n \"function getRenderedNativeOrTextFromComponent(component) {\\n\\t var rendered;\\n\\t while (rendered = component._renderedComponent) {\\n\\t component = rendered;\\n\\t }\\n\\t return component;\\n\\t}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (true) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\r\\n\\t var tag = element.type;\\r\\n\\t validateDangerousTag(tag);\\r\\n\\t this._currentElement = element;\\r\\n\\t this._tag = tag.toLowerCase();\\r\\n\\t this._namespaceURI = null;\\r\\n\\t this._renderedChildren = null;\\r\\n\\t this._previousStyle = null;\\r\\n\\t this._previousStyleCopy = null;\\r\\n\\t this._hostNode = null;\\r\\n\\t this._hostParent = null;\\r\\n\\t this._rootNodeID = 0;\\r\\n\\t this._domID = 0;\\r\\n\\t this._hostContainerInfo = null;\\r\\n\\t this._wrapperState = null;\\r\\n\\t this._topLevelWrapper = null;\\r\\n\\t this._flags = 0;\\r\\n\\t if (process.env.NODE_ENV !== 'production') {\\r\\n\\t this._ancestorInfo = null;\\r\\n\\t setAndValidateContentChildDev.call(this, null);\\r\\n\\t }\\r\\n\\t}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (false) {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\",\n \"function ReactDOMComponent(element) {\\n var tag = element.type;\\n validateDangerousTag(tag);\\n this._currentElement = element;\\n this._tag = tag.toLowerCase();\\n this._namespaceURI = null;\\n this._renderedChildren = null;\\n this._previousStyle = null;\\n this._previousStyleCopy = null;\\n this._hostNode = null;\\n this._hostParent = null;\\n this._rootNodeID = 0;\\n this._domID = 0;\\n this._hostContainerInfo = null;\\n this._wrapperState = null;\\n this._topLevelWrapper = null;\\n this._flags = 0;\\n if (process.env.NODE_ENV !== 'production') {\\n this._ancestorInfo = null;\\n setAndValidateContentChildDev.call(this, null);\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.67850256","0.67771465","0.6770746","0.67658514","0.67658514","0.6751226","0.6741835","0.6741215","0.6741215","0.6741215","0.6741215","0.6741215","0.6741215","0.6741215","0.6739783","0.6739783","0.6739783","0.6739783","0.6739783","0.6739783","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.6732065","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.67167735","0.6711829","0.6696927","0.6696927","0.663756","0.6631462","0.65678287","0.6488908","0.64074665","0.64074665","0.6309658","0.6273155","0.6205626","0.6156533","0.6146663","0.61049587","0.61049587","0.61049587","0.61049587","0.61049587","0.61049587","0.6094559","0.6094559","0.6094559","0.6094559","0.6094559","0.6094559","0.6094559","0.6094559","0.6088739","0.60875607","0.60875607","0.60875607","0.60875607","0.60875607","0.60875607","0.60875607","0.60875607","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525","0.6075525"],"string":"[\n \"0.67850256\",\n \"0.67771465\",\n \"0.6770746\",\n \"0.67658514\",\n \"0.67658514\",\n \"0.6751226\",\n \"0.6741835\",\n \"0.6741215\",\n \"0.6741215\",\n \"0.6741215\",\n \"0.6741215\",\n \"0.6741215\",\n \"0.6741215\",\n \"0.6741215\",\n \"0.6739783\",\n \"0.6739783\",\n \"0.6739783\",\n \"0.6739783\",\n \"0.6739783\",\n \"0.6739783\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.6732065\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.67167735\",\n \"0.6711829\",\n \"0.6696927\",\n \"0.6696927\",\n \"0.663756\",\n \"0.6631462\",\n \"0.65678287\",\n \"0.6488908\",\n \"0.64074665\",\n \"0.64074665\",\n \"0.6309658\",\n \"0.6273155\",\n \"0.6205626\",\n \"0.6156533\",\n \"0.6146663\",\n \"0.61049587\",\n \"0.61049587\",\n \"0.61049587\",\n \"0.61049587\",\n \"0.61049587\",\n \"0.61049587\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6094559\",\n \"0.6088739\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.60875607\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\",\n \"0.6075525\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74189,"cells":{"query":{"kind":"string","value":"Return the lowest common ancestor of A and B, or null if they are in different trees."},"document":{"kind":"string","value":"function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n}"},"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 getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = instA._nativeParent;\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = instB._nativeParent;\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB) {\n\t return instA;\n\t }\n\t instA = instA._nativeParent;\n\t instB = instB._nativeParent;\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA, instB) {\n !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = instA._nativeParent;\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = instB._nativeParent;\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB) {\n return instA;\n }\n instA = instA._nativeParent;\n instB = instB._nativeParent;\n }\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n }\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n }\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n for(var tempA = nodeA; tempA; tempA = getParent(tempA))depthA++;\n var depthB = 0;\n for(var tempB = nodeB; tempB; tempB = getParent(tempB))depthB++;\n // If A is deeper, crawl up.\n while(depthA - depthB > 0){\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n while(depthB - depthA > 0){\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n var depth = depthA;\n while(depth--){\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) return nodeA;\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var nodeA = instA;\n var nodeB = instB;\n var depthA = 0;\n\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n nodeA = getParent(nodeA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n nodeB = getParent(nodeB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n return nodeA;\n }\n\n nodeA = getParent(nodeA);\n nodeB = getParent(nodeB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\n\twhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\n\twhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\n\tvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n var depthB = 0;\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n }\n // If A is deeper, crawl up.\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n }\n // If B is deeper, crawl up.\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n }\n // Walk in lockstep until we find a match.\n var depth = depthA;\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n instA = getParent(instA);\n instB = getParent(instB);\n }\n return null;\n }","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n var depthA = 0;\n\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n depthA++;\n }\n\n var depthB = 0;\n\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n depthB++;\n } // If A is deeper, crawl up.\n\n\n while (depthA - depthB > 0) {\n instA = getParent(instA);\n depthA--;\n } // If B is deeper, crawl up.\n\n\n while (depthB - depthA > 0) {\n instB = getParent(instB);\n depthB--;\n } // Walk in lockstep until we find a match.\n\n\n var depth = depthA;\n\n while (depth--) {\n if (instA === instB || instA === instB.alternate) {\n return instA;\n }\n\n instA = getParent(instA);\n instB = getParent(instB);\n }\n\n return null;\n}","function getLowestCommonAncestor(instA, instB) {\n\t var depthA = 0;\n\t for (var tempA = instA; tempA; tempA = getParent(tempA)) {\n\t depthA++;\n\t }\n\t var depthB = 0;\n\t for (var tempB = instB; tempB; tempB = getParent(tempB)) {\n\t depthB++;\n\t }\n\t\n\t // If A is deeper, crawl up.\n\t while (depthA - depthB > 0) {\n\t instA = getParent(instA);\n\t depthA--;\n\t }\n\t\n\t // If B is deeper, crawl up.\n\t while (depthB - depthA > 0) {\n\t instB = getParent(instB);\n\t depthB--;\n\t }\n\t\n\t // Walk in lockstep until we find a match.\n\t var depth = depthA;\n\t while (depth--) {\n\t if (instA === instB || instA === instB.alternate) {\n\t return instA;\n\t }\n\t instA = getParent(instA);\n\t instB = getParent(instB);\n\t }\n\t return null;\n\t}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}","function getLowestCommonAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;var depthA=0;for(var tempA=instA;tempA;tempA=tempA._nativeParent){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=tempB._nativeParent){depthB++;} // If A is deeper, crawl up.\n\twhile(depthA-depthB>0){instA=instA._nativeParent;depthA--;} // If B is deeper, crawl up.\n\twhile(depthB-depthA>0){instB=instB._nativeParent;depthB--;} // Walk in lockstep until we find a match.\n\tvar depth=depthA;while(depth--){if(instA===instB){return instA;}instA=instA._nativeParent;instB=instB._nativeParent;}return null;}","function getLowestCommonAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;var depthA=0;for(var tempA=instA;tempA;tempA=tempA._nativeParent){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=tempB._nativeParent){depthB++;} // If A is deeper, crawl up.\n\twhile(depthA-depthB>0){instA=instA._nativeParent;depthA--;} // If B is deeper, crawl up.\n\twhile(depthB-depthA>0){instB=instB._nativeParent;depthB--;} // Walk in lockstep until we find a match.\n\tvar depth=depthA;while(depth--){if(instA===instB){return instA;}instA=instA._nativeParent;instB=instB._nativeParent;}return null;}"],"string":"[\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n\\t depthB++;\\n\\t }\\n\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = instA._nativeParent;\\n\\t depthA--;\\n\\t }\\n\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = instB._nativeParent;\\n\\t depthB--;\\n\\t }\\n\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB) {\\n\\t return instA;\\n\\t }\\n\\t instA = instA._nativeParent;\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n\\t depthB++;\\n\\t }\\n\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = instA._nativeParent;\\n\\t depthA--;\\n\\t }\\n\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = instB._nativeParent;\\n\\t depthB--;\\n\\t }\\n\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB) {\\n\\t return instA;\\n\\t }\\n\\t instA = instA._nativeParent;\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n\\t depthB++;\\n\\t }\\n\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = instA._nativeParent;\\n\\t depthA--;\\n\\t }\\n\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = instB._nativeParent;\\n\\t depthB--;\\n\\t }\\n\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB) {\\n\\t return instA;\\n\\t }\\n\\t instA = instA._nativeParent;\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n\\t depthB++;\\n\\t }\\n\\t\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = instA._nativeParent;\\n\\t depthA--;\\n\\t }\\n\\t\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = instB._nativeParent;\\n\\t depthB--;\\n\\t }\\n\\t\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB) {\\n\\t return instA;\\n\\t }\\n\\t instA = instA._nativeParent;\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n\\t depthB++;\\n\\t }\\n\\t\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = instA._nativeParent;\\n\\t depthA--;\\n\\t }\\n\\t\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = instB._nativeParent;\\n\\t depthB--;\\n\\t }\\n\\t\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB) {\\n\\t return instA;\\n\\t }\\n\\t instA = instA._nativeParent;\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\t\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n\\t depthB++;\\n\\t }\\n\\t\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = instA._nativeParent;\\n\\t depthA--;\\n\\t }\\n\\t\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = instB._nativeParent;\\n\\t depthB--;\\n\\t }\\n\\t\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB) {\\n\\t return instA;\\n\\t }\\n\\t instA = instA._nativeParent;\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\\n\\n var depthA = 0;\\n for (var tempA = instA; tempA; tempA = tempA._nativeParent) {\\n depthA++;\\n }\\n var depthB = 0;\\n for (var tempB = instB; tempB; tempB = tempB._nativeParent) {\\n depthB++;\\n }\\n\\n // If A is deeper, crawl up.\\n while (depthA - depthB > 0) {\\n instA = instA._nativeParent;\\n depthA--;\\n }\\n\\n // If B is deeper, crawl up.\\n while (depthB - depthA > 0) {\\n instB = instB._nativeParent;\\n depthB--;\\n }\\n\\n // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while (depth--) {\\n if (instA === instB) {\\n return instA;\\n }\\n instA = instA._nativeParent;\\n instB = instB._nativeParent;\\n }\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n var depthB = 0;\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n }\\n // If A is deeper, crawl up.\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n }\\n // If B is deeper, crawl up.\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n }\\n // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n for(var tempA = nodeA; tempA; tempA = getParent(tempA))depthA++;\\n var depthB = 0;\\n for(var tempB = nodeB; tempB; tempB = getParent(tempB))depthB++;\\n // If A is deeper, crawl up.\\n while(depthA - depthB > 0){\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n while(depthB - depthA > 0){\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while(depth--){\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) return nodeA;\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var nodeA = instA;\\n var nodeB = instB;\\n var depthA = 0;\\n\\n for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n nodeA = getParent(nodeA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n nodeB = getParent(nodeB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\\n return nodeA;\\n }\\n\\n nodeA = getParent(nodeA);\\n nodeB = getParent(nodeB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n var depthB = 0;\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n }\\n\\n // If A is deeper, crawl up.\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n }\\n\\n // If B is deeper, crawl up.\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n }\\n\\n // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n var depthB = 0;\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n }\\n\\n // If A is deeper, crawl up.\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n }\\n\\n // If B is deeper, crawl up.\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n }\\n\\n // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n var depthB = 0;\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n }\\n\\n // If A is deeper, crawl up.\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n }\\n\\n // If B is deeper, crawl up.\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n }\\n\\n // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\n\\twhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\n\\twhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\n\\tvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n var depthB = 0;\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n }\\n // If A is deeper, crawl up.\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n }\\n // If B is deeper, crawl up.\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n }\\n // Walk in lockstep until we find a match.\\n var depth = depthA;\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n return null;\\n }\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n var depthA = 0;\\n\\n for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n depthA++;\\n }\\n\\n var depthB = 0;\\n\\n for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n depthB++;\\n } // If A is deeper, crawl up.\\n\\n\\n while (depthA - depthB > 0) {\\n instA = getParent(instA);\\n depthA--;\\n } // If B is deeper, crawl up.\\n\\n\\n while (depthB - depthA > 0) {\\n instB = getParent(instB);\\n depthB--;\\n } // Walk in lockstep until we find a match.\\n\\n\\n var depth = depthA;\\n\\n while (depth--) {\\n if (instA === instB || instA === instB.alternate) {\\n return instA;\\n }\\n\\n instA = getParent(instA);\\n instB = getParent(instB);\\n }\\n\\n return null;\\n}\",\n \"function getLowestCommonAncestor(instA, instB) {\\n\\t var depthA = 0;\\n\\t for (var tempA = instA; tempA; tempA = getParent(tempA)) {\\n\\t depthA++;\\n\\t }\\n\\t var depthB = 0;\\n\\t for (var tempB = instB; tempB; tempB = getParent(tempB)) {\\n\\t depthB++;\\n\\t }\\n\\t\\n\\t // If A is deeper, crawl up.\\n\\t while (depthA - depthB > 0) {\\n\\t instA = getParent(instA);\\n\\t depthA--;\\n\\t }\\n\\t\\n\\t // If B is deeper, crawl up.\\n\\t while (depthB - depthA > 0) {\\n\\t instB = getParent(instB);\\n\\t depthB--;\\n\\t }\\n\\t\\n\\t // Walk in lockstep until we find a match.\\n\\t var depth = depthA;\\n\\t while (depth--) {\\n\\t if (instA === instB || instA === instB.alternate) {\\n\\t return instA;\\n\\t }\\n\\t instA = getParent(instA);\\n\\t instB = getParent(instB);\\n\\t }\\n\\t return null;\\n\\t}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){var depthA=0;for(var tempA=instA;tempA;tempA=getParent(tempA)){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=getParent(tempB)){depthB++;}// If A is deeper, crawl up.\\nwhile(depthA-depthB>0){instA=getParent(instA);depthA--;}// If B is deeper, crawl up.\\nwhile(depthB-depthA>0){instB=getParent(instB);depthB--;}// Walk in lockstep until we find a match.\\nvar depth=depthA;while(depth--){if(instA===instB||instA===instB.alternate){return instA;}instA=getParent(instA);instB=getParent(instB);}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;var depthA=0;for(var tempA=instA;tempA;tempA=tempA._nativeParent){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=tempB._nativeParent){depthB++;} // If A is deeper, crawl up.\\n\\twhile(depthA-depthB>0){instA=instA._nativeParent;depthA--;} // If B is deeper, crawl up.\\n\\twhile(depthB-depthA>0){instB=instB._nativeParent;depthB--;} // Walk in lockstep until we find a match.\\n\\tvar depth=depthA;while(depth--){if(instA===instB){return instA;}instA=instA._nativeParent;instB=instB._nativeParent;}return null;}\",\n \"function getLowestCommonAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'getNodeFromInstance: Invalid argument.'):invariant(false):void 0;var depthA=0;for(var tempA=instA;tempA;tempA=tempA._nativeParent){depthA++;}var depthB=0;for(var tempB=instB;tempB;tempB=tempB._nativeParent){depthB++;} // If A is deeper, crawl up.\\n\\twhile(depthA-depthB>0){instA=instA._nativeParent;depthA--;} // If B is deeper, crawl up.\\n\\twhile(depthB-depthA>0){instB=instB._nativeParent;depthB--;} // Walk in lockstep until we find a match.\\n\\tvar depth=depthA;while(depth--){if(instA===instB){return instA;}instA=instA._nativeParent;instB=instB._nativeParent;}return null;}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8277217","0.8277217","0.8277217","0.8272759","0.8272759","0.8272759","0.82544667","0.8228844","0.8228844","0.8228844","0.8228844","0.81996197","0.81990045","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.8184163","0.81782436","0.81782436","0.81782436","0.81782436","0.81782436","0.81782436","0.81782436","0.81782436","0.81782436","0.81678665","0.8165306","0.8165306","0.8165306","0.8148946","0.81466365","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.81390405","0.8114097","0.81068397","0.81068397","0.81068397","0.81068397","0.81068397","0.81068397","0.81068397","0.81068397","0.81068397","0.80960363","0.80960363"],"string":"[\n \"0.8277217\",\n \"0.8277217\",\n \"0.8277217\",\n \"0.8272759\",\n \"0.8272759\",\n \"0.8272759\",\n \"0.82544667\",\n \"0.8228844\",\n \"0.8228844\",\n \"0.8228844\",\n \"0.8228844\",\n \"0.81996197\",\n \"0.81990045\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.8184163\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81782436\",\n \"0.81678665\",\n \"0.8165306\",\n \"0.8165306\",\n \"0.8165306\",\n \"0.8148946\",\n \"0.81466365\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.81390405\",\n \"0.8114097\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.81068397\",\n \"0.80960363\",\n \"0.80960363\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74190,"cells":{"query":{"kind":"string","value":"Return if A is an ancestor of B. Return the parent instance of the passedin instance."},"document":{"kind":"string","value":"function getParentInstance(inst) {\n return getParent(inst);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}","function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._nativeParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._nativeParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n for (;instB; ) {\n if (instA === instB || instA === instB.alternate) return !0;\n instB = getParent(instB);\n }\n return !1;\n}","function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}","function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}","function isAncestor(instA, instB) {\n\t\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t\t while (instB) {\n\t\t if (instB === instA) {\n\t\t return true;\n\t\t }\n\t\t instB = instB._hostParent;\n\t\t }\n\t\t return false;\n\t\t}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n\t\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\t\n\t\t while (instB) {\n\t\t if (instB === instA) {\n\t\t return true;\n\t\t }\n\t\t instB = instB._hostParent;\n\t\t }\n\t\t return false;\n\t\t}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : undefined : void 0;\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : undefined : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? (undefined) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? (undefined) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? \"production\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? \"production\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","function isAncestor(instA, instB) {\n\t !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\t !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n\t while (instB) {\n\t if (instB === instA) {\n\t return true;\n\t }\n\t instB = instB._hostParent;\n\t }\n\t return false;\n\t}"],"string":"[\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n while (instB) {\\n if (instA === instB || instA === instB.alternate) {\\n return true;\\n }\\n instB = getParent(instB);\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._nativeParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._nativeParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n for (;instB; ) {\\n if (instA === instB || instA === instB.alternate) return !0;\\n instB = getParent(instB);\\n }\\n return !1;\\n}\",\n \"function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}\",\n \"function isAncestor(instA,instB){!('_nativeNode' in instA)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;!('_nativeNode' in instB)?process.env.NODE_ENV!=='production'?invariant(false,'isAncestor: Invalid argument.'):invariant(false):void 0;while(instB){if(instB===instA){return true;}instB=instB._nativeParent;}return false;}\",\n \"function isAncestor(instA, instB) {\\n\\t\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t\\t while (instB) {\\n\\t\\t if (instB === instA) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t instB = instB._hostParent;\\n\\t\\t }\\n\\t\\t return false;\\n\\t\\t}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n\\t\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\t\\n\\t\\t while (instB) {\\n\\t\\t if (instB === instA) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t instB = instB._hostParent;\\n\\t\\t }\\n\\t\\t return false;\\n\\t\\t}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : undefined : void 0;\\n !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : undefined : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? true ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? false ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? (undefined) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? (undefined) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? (null) !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? \\\"production\\\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? \\\"production\\\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"function isAncestor(instA, instB) {\\n\\t !('_hostNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\t !('_hostNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n\\t while (instB) {\\n\\t if (instB === instA) {\\n\\t return true;\\n\\t }\\n\\t instB = instB._hostParent;\\n\\t }\\n\\t return false;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.731162","0.731162","0.731162","0.731162","0.731162","0.731162","0.731162","0.731162","0.731162","0.73110485","0.73110485","0.73110485","0.7308105","0.7305062","0.7305062","0.7305062","0.71668565","0.7036531","0.7036531","0.7022194","0.70153147","0.70153147","0.70153147","0.70153147","0.70153147","0.70153147","0.70153147","0.70152706","0.70152706","0.70152706","0.70152706","0.70152706","0.70152706","0.70152706","0.70152706","0.70145327","0.7010205","0.6984695","0.6984695","0.6984695","0.6983642","0.6983642","0.6983642","0.6970538","0.6970538","0.6970538","0.6970538","0.6956845","0.6919223","0.6919223","0.6872198","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.6848111","0.68171155"],"string":"[\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.731162\",\n \"0.73110485\",\n \"0.73110485\",\n \"0.73110485\",\n \"0.7308105\",\n \"0.7305062\",\n \"0.7305062\",\n \"0.7305062\",\n \"0.71668565\",\n \"0.7036531\",\n \"0.7036531\",\n \"0.7022194\",\n \"0.70153147\",\n \"0.70153147\",\n \"0.70153147\",\n \"0.70153147\",\n \"0.70153147\",\n \"0.70153147\",\n \"0.70153147\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70152706\",\n \"0.70145327\",\n \"0.7010205\",\n \"0.6984695\",\n \"0.6984695\",\n \"0.6984695\",\n \"0.6983642\",\n \"0.6983642\",\n \"0.6983642\",\n \"0.6970538\",\n \"0.6970538\",\n \"0.6970538\",\n \"0.6970538\",\n \"0.6956845\",\n \"0.6919223\",\n \"0.6919223\",\n \"0.6872198\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.6848111\",\n \"0.68171155\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74191,"cells":{"query":{"kind":"string","value":"Simulates the traversal of a twophase, capture/bubble event dispatch."},"document":{"kind":"string","value":"function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i = void 0;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}"},"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 traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=inst._hostParent;}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0; ) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","traverse() {\n this.root.visit(this.root);\n }","function traverseTwoPhase(inst, fn, arg) {\n for (var path = []; inst; ) path.push(inst), inst = getParent(inst);\n var i;\n for (i = path.length; i-- > 0; ) fn(path[i], \"captured\", arg);\n for (i = 0; i < path.length; i++) fn(path[i], \"bubbled\", arg);\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i = void 0;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i = void 0;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n var i;\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n}","function traverseTwoPhase(inst, fn, arg) {\r\n\t var path = [];\r\n\t while (inst) {\r\n\t path.push(inst);\r\n\t inst = inst._hostParent;\r\n\t }\r\n\t var i;\r\n\t for (i = path.length; i-- > 0;) {\r\n\t fn(path[i], 'captured', arg);\r\n\t }\r\n\t for (i = 0; i < path.length; i++) {\r\n\t fn(path[i], 'bubbled', arg);\r\n\t }\r\n\t}","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i = void 0;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i = void 0;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }","function traverseTwoPhase(inst, fn, arg) {\n var path = [];\n\n while (inst) {\n path.push(inst);\n inst = getParent(inst);\n }\n\n var i = void 0;\n\n for (i = path.length; i-- > 0;) {\n fn(path[i], 'captured', arg);\n }\n\n for (i = 0; i < path.length; i++) {\n fn(path[i], 'bubbled', arg);\n }\n }"],"string":"[\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=inst._hostParent;}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i=void 0;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0; ) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"traverse() {\\n this.root.visit(this.root);\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n for (var path = []; inst; ) path.push(inst), inst = getParent(inst);\\n var i;\\n for (i = path.length; i-- > 0; ) fn(path[i], \\\"captured\\\", arg);\\n for (i = 0; i < path.length; i++) fn(path[i], \\\"bubbled\\\", arg);\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i = void 0;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i = void 0;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n var i;\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\r\\n\\t var path = [];\\r\\n\\t while (inst) {\\r\\n\\t path.push(inst);\\r\\n\\t inst = inst._hostParent;\\r\\n\\t }\\r\\n\\t var i;\\r\\n\\t for (i = path.length; i-- > 0;) {\\r\\n\\t fn(path[i], 'captured', arg);\\r\\n\\t }\\r\\n\\t for (i = 0; i < path.length; i++) {\\r\\n\\t fn(path[i], 'bubbled', arg);\\r\\n\\t }\\r\\n\\t}\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i = void 0;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i = void 0;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\",\n \"function traverseTwoPhase(inst, fn, arg) {\\n var path = [];\\n\\n while (inst) {\\n path.push(inst);\\n inst = getParent(inst);\\n }\\n\\n var i = void 0;\\n\\n for (i = path.length; i-- > 0;) {\\n fn(path[i], 'captured', arg);\\n }\\n\\n for (i = 0; i < path.length; i++) {\\n fn(path[i], 'bubbled', arg);\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5877933","0.5877933","0.5877933","0.5877933","0.5877933","0.5877933","0.5859051","0.5857623","0.5857623","0.5857623","0.5857623","0.56623036","0.56271553","0.5586392","0.5568177","0.5568177","0.5561298","0.5547649","0.5547649","0.5547649","0.5547649","0.5547649","0.5547649","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.55459166","0.5540024","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.5536436","0.55321234","0.5523745","0.5523745","0.5523745"],"string":"[\n \"0.5877933\",\n \"0.5877933\",\n \"0.5877933\",\n \"0.5877933\",\n \"0.5877933\",\n \"0.5877933\",\n \"0.5859051\",\n \"0.5857623\",\n \"0.5857623\",\n \"0.5857623\",\n \"0.5857623\",\n \"0.56623036\",\n \"0.56271553\",\n \"0.5586392\",\n \"0.5568177\",\n \"0.5568177\",\n \"0.5561298\",\n \"0.5547649\",\n \"0.5547649\",\n \"0.5547649\",\n \"0.5547649\",\n \"0.5547649\",\n \"0.5547649\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.55459166\",\n \"0.5540024\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.5536436\",\n \"0.55321234\",\n \"0.5523745\",\n \"0.5523745\",\n \"0.5523745\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74192,"cells":{"query":{"kind":"string","value":"Traverses the ID hierarchy and invokes the supplied `cb` on any IDs that should would receive a `mouseEnter` or `mouseLeave` event. Does not invoke the callback on the nearest common ancestor because nothing \"entered\" or \"left\" that element."},"document":{"kind":"string","value":"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (true) {\n if (!from) {\n break;\n }\n if (from === common) {\n break;\n }\n var alternate = from.alternate;\n if (alternate !== null && alternate === common) {\n break;\n }\n pathFrom.push(from);\n from = getParent(from);\n }\n var pathTo = [];\n while (true) {\n if (!to) {\n break;\n }\n if (to === common) {\n break;\n }\n var _alternate = to.alternate;\n if (_alternate !== null && _alternate === common) {\n break;\n }\n pathTo.push(to);\n to = getParent(to);\n }\n for (var i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (var _i = pathTo.length; _i-- > 0;) {\n fn(pathTo[_i], 'captured', argTo);\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["_handleMouseEnter() {\n this._hovered.next(this);\n }","_elementMouseEnterHandler() {\n const that = this;\n\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\n that._handleMouseInteraction();\n }\n }","_elementMouseEnterHandler() {\n const that = this;\n\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\n that._handleMouseInteraction();\n }\n }","function hover(parentSelector, childSelector, mouseEnter, mouseLeave) {\n $(parentSelector).on({\n mouseenter: function() {\n if(mouseEnter != null) {\n mouseEnter(this);\n }\n },\n mouseleave: function() {\n if(mouseLeave != null) {\n mouseLeave(this);\n }\n }\n }, childSelector);\n}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._nativeParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._nativeParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],true,argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],false,argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._nativeParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._nativeParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],true,argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],false,argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._hostParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._hostParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],'captured',argTo);}}","function itoolPreviewMouseOver(className, callback) {\n var iframeJQuery = window.frames[0].jQuery;\n var iframeContents = _iframe.contents();\n var selElems = iframeJQuery(\".perc-itool-selected-elem\");\n //As this function gets fired on mouse over which can happen more than once as user moves the mouse on the menu\n //The following code is put in to detect whether we already handled the mouse over if yes then returns\n //If the selected elements length is zero return from here or\n //if selected element is only one and if it is div and if it has perc-itools-wrapper return from here\n //if the selected element's parent has a perc-itools-wrapper return from here.\n if(selElems.length === 0 ||\n (selElems.length === 1 && selElems.is(\"div\") && iframeJQuery(selElems).hasClass(\"perc-itools-wrapper\")) ||\n (iframeJQuery(selElems[0]).parent().hasClass(\"perc-itools-wrapper\")))\n return;\n\n selElems.siblings(\":not('.perc-itool-selected-elem')\").each(function(){\n if(iframeJQuery(this).is(\"div\"))\n {\n iframeJQuery(this).addClass('perc-itools-wrapper perc-make-me-region').addClass(className);\n }\n else\n {\n iframeJQuery(this).wrap(\"<div class='perc-widget perc-itool-nov-div-wrapper perc-itools-wrapper perc-itool-region-puff'></div>\");\n }\n });\n\n iframeContents.find('.perc-sibling-div').remove();\n if(selElems.length === 1 && selElems.is(\"div\"))\n {\n selElems.addClass('perc-itool-region-puff-self perc-make-me-region perc-self-wrapper perc-itools-wrapper').addClass(className);\n highlightSiblings(selElems);\n }\n else\n {\n selElems.wrapAll(\"<div class='perc-widget perc-itool-multi-wrapper perc-itool-nov-div-wrapper perc-itool-region-puff-self perc-self-wrapper perc-itools-wrapper \" + className + \"'></div>\");\n highlightSiblings(iframeJQuery(selElems[0]).parent());\n }\n //Change border color of all siblings to blue from grey.\n iframeContents.find('.perc-sibling-div').css({'border-color':'#00afea'});\n iframeJQuery('.perc-itool-selected-green-border').remove();\n iframeJQuery(selElems).each(function()\n {\n highlightSelectedElements(iframeJQuery(this), false);\n });\n\n // If user performs 'Side by Side' action - add the overflow:auto and height 100% to its parent so that below content don't overlap on columns\n if(className === 'perc-col') {\n if(selElems.length === 1) {\n\n selElems.parent().addClass('perc-clear');\n }\n\n else {\n\n selElems.parent().parent().addClass('perc-clear');\n }\n\n }\n\n // If there is only one selected element,turn its border into blue. If there are mulitple selected element keep their border green but turn its wrapper div border to blue\n if(selElems.length === 1) {\n iframeJQuery('.perc-itool-selected-green-border').css('border-color', '#00afea');\n }\n else {\n highlightSelectedElements(iframeJQuery('.perc-itool-multi-wrapper'), true);\n iframeJQuery('.perc-itool-selected-green-border').parent('.perc-itool-selected-green-border').css('border-color', '#00afea');\n }\n\n if (callback) {\n callback();\n }\n }","function isMouseLeaveOrEnter(e, handler) {\r\n\t if (e.type != 'mouseout' && e.type != 'mouseover')\r\n\t\t return false;\r\n\t var reltg = e.relatedTarget ? e.relatedTarget : e.type == 'mouseout' ? e.toElement : e.fromElement;\r\n\t while (reltg && reltg != handler)\r\n\t\t reltg = reltg.parentNode;\r\n\t return (reltg != handler);\r\n}","function handlerFn(ev) {\n if (ev.animationName !== 'muiNodeInserted') return;\n processLabel(ev.target);\n }","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}","function setCallBacks(){\n var children = parentDIV.childNodes;\n for(var i = 0; i < children.length; i++){\n children[i].onclick = params.callBack || \n function(){alert(\"Default callback\");};\n } \n }","function mouseEnterAnchor(obj, idVal, event) {\n\tvar position = obj.position();\n\n\tvar p = obj.position();\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('position', \"absolute\");\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('display', \"\");\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('left', ( p.left - 160 +'px'));\n\t$(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\").css('z-index', \"99999\");\n\n//\tvar topVal = obj.offset().top+32;\n//\tvar leftVal = obj.offset().left - 190;\n//\tshowOverlay($(\"span[id='taxesAndFeesPopUp-\" + idVal + \"']\"), leftVal, topVal,9000);\n}","function highlighter() {\n\n\tvar areas = $(\".highlight_area\");\n\n\t// in case of ajax reloading and other dynamics\n\t// remove the old mouseover/mouseout events and attach them new\n\tareas.off(\"mouseover\");\n\tareas.off(\"mouseout\");\n\tareas.mouseover(function() {\n\t\tvar itemId = parseId(jQuery(this).attr('class'));\n\t\tvar prntId = parseId(jQuery(this).attr('class'), 'parent_');\n\t\thighlight(itemId); // highlight the current element\n\t\tcheckForChilds(itemId);// highlight the child elements - recursive\n\t\t// - of the current item, if it's given\n\t\tif (prntId) { // check if the current item is a child of another\n\t\t\thighlight(prntId, 'id_'); // hightlight the next parent item,\n\t\t\t// if the current item is a child\n\t\t}\n\t}).mouseout(function() {\n\t\treset_highlight();\n\t});\n\n}","function mouseMovedOnListItem(hashId) {\n\t return function (dispatch, getState) {\n\t if (getState().Search.Map.BalloonState.MouseIsOnListItem)\n\t return;\n\t mouseEnteredListItem(hashId)(dispatch, getState);\n\t };\n\t}","function mouseoverIDs(str){\n svg.selectAll(\".node\")\n .attr(\"fill-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.02; })\n .attr(\"stroke-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.02; });\n svg.selectAll(\".nodeText\") \n .attr(\"fill-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.05; });\n svg.selectAll(\".lineNodes\")\n .attr(\"stroke-opacity\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0; });\n checkVisibility();\n}","function handleHover(e) {\r\n\t\t\t// Check if mouse(over|out) are still within the same parent element\r\n\t\t\tvar p = (e.type == \"mouseover\" ? e.fromElement : e.toElement) || e.relatedTarget;\r\n\t\r\n\t\t\t// Traverse up the tree\r\n\t\t\twhile ( p && p != this ) p = p.parentNode;\r\n\t\t\t\r\n\t\t\t// If we actually just moused on to a sub-element, ignore it\r\n\t\t\tif ( p == this ) return false;\r\n\t\t\t\r\n\t\t\t// Execute the right function\r\n\t\t\treturn (e.type == \"mouseover\" ? f : g).apply(this, [e]);\r\n\t\t}","_mouseEnterHandler() {\n const that = this;\n\n that._isElementHovered = true;\n\n if (that.dropDownOpenMode === 'auto' && !that.disabled && !that.readonly) {\n that.open();\n }\n }","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t\t var pathFrom = [];\n\t\t while (from && from !== common) {\n\t\t pathFrom.push(from);\n\t\t from = from._hostParent;\n\t\t }\n\t\t var pathTo = [];\n\t\t while (to && to !== common) {\n\t\t pathTo.push(to);\n\t\t to = to._hostParent;\n\t\t }\n\t\t var i;\n\t\t for (i = 0; i < pathFrom.length; i++) {\n\t\t fn(pathFrom[i], true, argFrom);\n\t\t }\n\t\t for (i = pathTo.length; i-- > 0;) {\n\t\t fn(pathTo[i], false, argTo);\n\t\t }\n\t\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t\t var pathFrom = [];\n\t\t while (from && from !== common) {\n\t\t pathFrom.push(from);\n\t\t from = from._hostParent;\n\t\t }\n\t\t var pathTo = [];\n\t\t while (to && to !== common) {\n\t\t pathTo.push(to);\n\t\t to = to._hostParent;\n\t\t }\n\t\t var i;\n\t\t for (i = 0; i < pathFrom.length; i++) {\n\t\t fn(pathFrom[i], true, argFrom);\n\t\t }\n\t\t for (i = pathTo.length; i-- > 0;) {\n\t\t fn(pathTo[i], false, argTo);\n\t\t }\n\t\t}","_mouseEnterHandler() {\n const that = this;\n\n that._isElementHovered = true;\n\n if (that.tagName.indexOf('JQX-DROP-DOWN-') > -1 && that.dropDownOpenMode === 'auto' && !that.disabled && !that.readonly) {\n that.open();\n }\n }","function mouseOver(elem) {\n let place = (elem.id);\n console.log(place);\n addColor(place);\n return place;\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._nativeParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._nativeParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], true, argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], false, argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\r\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\r\n\t var pathFrom = [];\r\n\t while (from && from !== common) {\r\n\t pathFrom.push(from);\r\n\t from = from._hostParent;\r\n\t }\r\n\t var pathTo = [];\r\n\t while (to && to !== common) {\r\n\t pathTo.push(to);\r\n\t to = to._hostParent;\r\n\t }\r\n\t var i;\r\n\t for (i = 0; i < pathFrom.length; i++) {\r\n\t fn(pathFrom[i], 'bubbled', argFrom);\r\n\t }\r\n\t for (i = pathTo.length; i-- > 0;) {\r\n\t fn(pathTo[i], 'captured', argTo);\r\n\t }\r\n\t}","function handleMouseEnterFix() {\n !mouseEntered.current && handleMouseEnter();\n }","function mouseEntered(e) {\r\n DoHover(this, true, e);\r\n e.stopPropagation();\r\n }","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\t var pathFrom = [];\n\t while (from && from !== common) {\n\t pathFrom.push(from);\n\t from = from._hostParent;\n\t }\n\t var pathTo = [];\n\t while (to && to !== common) {\n\t pathTo.push(to);\n\t to = to._hostParent;\n\t }\n\t var i;\n\t for (i = 0; i < pathFrom.length; i++) {\n\t fn(pathFrom[i], 'bubbled', argFrom);\n\t }\n\t for (i = pathTo.length; i-- > 0;) {\n\t fn(pathTo[i], 'captured', argTo);\n\t }\n\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._nativeParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._nativeParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], true, argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], false, argTo);\n }\n}","function the_click_callback(){\n\t\t\t\tif(typeof click_callback == 'function'){\n\t\t\t\t\tvar id = $container.attr('id');\n\t\t\t\t\tif(id==undefined || !id){\n\t\t\t\t\t\tid = '[no id]';\n\t\t\t\t\t}\n\t\t\t\t\tclick_callback(id, activenode);\n\t\t\t\t}\n\t\t\t}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}","function traverseEnterLeave(from, to, fn, argFrom, argTo) {\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\n var pathFrom = [];\n while (from && from !== common) {\n pathFrom.push(from);\n from = from._hostParent;\n }\n var pathTo = [];\n while (to && to !== common) {\n pathTo.push(to);\n to = to._hostParent;\n }\n var i;\n for (i = 0; i < pathFrom.length; i++) {\n fn(pathFrom[i], 'bubbled', argFrom);\n }\n for (i = pathTo.length; i-- > 0;) {\n fn(pathTo[i], 'captured', argTo);\n }\n}"],"string":"[\n \"_handleMouseEnter() {\\n this._hovered.next(this);\\n }\",\n \"_elementMouseEnterHandler() {\\n const that = this;\\n\\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\\n that._handleMouseInteraction();\\n }\\n }\",\n \"_elementMouseEnterHandler() {\\n const that = this;\\n\\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\\n that._handleMouseInteraction();\\n }\\n }\",\n \"function hover(parentSelector, childSelector, mouseEnter, mouseLeave) {\\n $(parentSelector).on({\\n mouseenter: function() {\\n if(mouseEnter != null) {\\n mouseEnter(this);\\n }\\n },\\n mouseleave: function() {\\n if(mouseLeave != null) {\\n mouseLeave(this);\\n }\\n }\\n }, childSelector);\\n}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._nativeParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._nativeParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],true,argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],false,argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._nativeParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._nativeParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],true,argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],false,argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(from&&from!==common){pathFrom.push(from);from=from._hostParent;}var pathTo=[];while(to&&to!==common){pathTo.push(to);to=to._hostParent;}var i;for(i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(i=pathTo.length;i-->0;){fn(pathTo[i],'captured',argTo);}}\",\n \"function itoolPreviewMouseOver(className, callback) {\\n var iframeJQuery = window.frames[0].jQuery;\\n var iframeContents = _iframe.contents();\\n var selElems = iframeJQuery(\\\".perc-itool-selected-elem\\\");\\n //As this function gets fired on mouse over which can happen more than once as user moves the mouse on the menu\\n //The following code is put in to detect whether we already handled the mouse over if yes then returns\\n //If the selected elements length is zero return from here or\\n //if selected element is only one and if it is div and if it has perc-itools-wrapper return from here\\n //if the selected element's parent has a perc-itools-wrapper return from here.\\n if(selElems.length === 0 ||\\n (selElems.length === 1 && selElems.is(\\\"div\\\") && iframeJQuery(selElems).hasClass(\\\"perc-itools-wrapper\\\")) ||\\n (iframeJQuery(selElems[0]).parent().hasClass(\\\"perc-itools-wrapper\\\")))\\n return;\\n\\n selElems.siblings(\\\":not('.perc-itool-selected-elem')\\\").each(function(){\\n if(iframeJQuery(this).is(\\\"div\\\"))\\n {\\n iframeJQuery(this).addClass('perc-itools-wrapper perc-make-me-region').addClass(className);\\n }\\n else\\n {\\n iframeJQuery(this).wrap(\\\"<div class='perc-widget perc-itool-nov-div-wrapper perc-itools-wrapper perc-itool-region-puff'></div>\\\");\\n }\\n });\\n\\n iframeContents.find('.perc-sibling-div').remove();\\n if(selElems.length === 1 && selElems.is(\\\"div\\\"))\\n {\\n selElems.addClass('perc-itool-region-puff-self perc-make-me-region perc-self-wrapper perc-itools-wrapper').addClass(className);\\n highlightSiblings(selElems);\\n }\\n else\\n {\\n selElems.wrapAll(\\\"<div class='perc-widget perc-itool-multi-wrapper perc-itool-nov-div-wrapper perc-itool-region-puff-self perc-self-wrapper perc-itools-wrapper \\\" + className + \\\"'></div>\\\");\\n highlightSiblings(iframeJQuery(selElems[0]).parent());\\n }\\n //Change border color of all siblings to blue from grey.\\n iframeContents.find('.perc-sibling-div').css({'border-color':'#00afea'});\\n iframeJQuery('.perc-itool-selected-green-border').remove();\\n iframeJQuery(selElems).each(function()\\n {\\n highlightSelectedElements(iframeJQuery(this), false);\\n });\\n\\n // If user performs 'Side by Side' action - add the overflow:auto and height 100% to its parent so that below content don't overlap on columns\\n if(className === 'perc-col') {\\n if(selElems.length === 1) {\\n\\n selElems.parent().addClass('perc-clear');\\n }\\n\\n else {\\n\\n selElems.parent().parent().addClass('perc-clear');\\n }\\n\\n }\\n\\n // If there is only one selected element,turn its border into blue. If there are mulitple selected element keep their border green but turn its wrapper div border to blue\\n if(selElems.length === 1) {\\n iframeJQuery('.perc-itool-selected-green-border').css('border-color', '#00afea');\\n }\\n else {\\n highlightSelectedElements(iframeJQuery('.perc-itool-multi-wrapper'), true);\\n iframeJQuery('.perc-itool-selected-green-border').parent('.perc-itool-selected-green-border').css('border-color', '#00afea');\\n }\\n\\n if (callback) {\\n callback();\\n }\\n }\",\n \"function isMouseLeaveOrEnter(e, handler) {\\r\\n\\t if (e.type != 'mouseout' && e.type != 'mouseover')\\r\\n\\t\\t return false;\\r\\n\\t var reltg = e.relatedTarget ? e.relatedTarget : e.type == 'mouseout' ? e.toElement : e.fromElement;\\r\\n\\t while (reltg && reltg != handler)\\r\\n\\t\\t reltg = reltg.parentNode;\\r\\n\\t return (reltg != handler);\\r\\n}\",\n \"function handlerFn(ev) {\\n if (ev.animationName !== 'muiNodeInserted') return;\\n processLabel(ev.target);\\n }\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function traverseEnterLeave(from,to,fn,argFrom,argTo){var common=from&&to?getLowestCommonAncestor(from,to):null;var pathFrom=[];while(true){if(!from){break;}if(from===common){break;}var alternate=from.alternate;if(alternate!==null&&alternate===common){break;}pathFrom.push(from);from=getParent(from);}var pathTo=[];while(true){if(!to){break;}if(to===common){break;}var _alternate=to.alternate;if(_alternate!==null&&_alternate===common){break;}pathTo.push(to);to=getParent(to);}for(var i=0;i<pathFrom.length;i++){fn(pathFrom[i],'bubbled',argFrom);}for(var _i=pathTo.length;_i-->0;){fn(pathTo[_i],'captured',argTo);}}\",\n \"function setCallBacks(){\\n var children = parentDIV.childNodes;\\n for(var i = 0; i < children.length; i++){\\n children[i].onclick = params.callBack || \\n function(){alert(\\\"Default callback\\\");};\\n } \\n }\",\n \"function mouseEnterAnchor(obj, idVal, event) {\\n\\tvar position = obj.position();\\n\\n\\tvar p = obj.position();\\n\\t$(\\\"span[id='taxesAndFeesPopUp-\\\" + idVal + \\\"']\\\").css('position', \\\"absolute\\\");\\n\\t$(\\\"span[id='taxesAndFeesPopUp-\\\" + idVal + \\\"']\\\").css('display', \\\"\\\");\\n\\t$(\\\"span[id='taxesAndFeesPopUp-\\\" + idVal + \\\"']\\\").css('left', ( p.left - 160 +'px'));\\n\\t$(\\\"span[id='taxesAndFeesPopUp-\\\" + idVal + \\\"']\\\").css('z-index', \\\"99999\\\");\\n\\n//\\tvar topVal = obj.offset().top+32;\\n//\\tvar leftVal = obj.offset().left - 190;\\n//\\tshowOverlay($(\\\"span[id='taxesAndFeesPopUp-\\\" + idVal + \\\"']\\\"), leftVal, topVal,9000);\\n}\",\n \"function highlighter() {\\n\\n\\tvar areas = $(\\\".highlight_area\\\");\\n\\n\\t// in case of ajax reloading and other dynamics\\n\\t// remove the old mouseover/mouseout events and attach them new\\n\\tareas.off(\\\"mouseover\\\");\\n\\tareas.off(\\\"mouseout\\\");\\n\\tareas.mouseover(function() {\\n\\t\\tvar itemId = parseId(jQuery(this).attr('class'));\\n\\t\\tvar prntId = parseId(jQuery(this).attr('class'), 'parent_');\\n\\t\\thighlight(itemId); // highlight the current element\\n\\t\\tcheckForChilds(itemId);// highlight the child elements - recursive\\n\\t\\t// - of the current item, if it's given\\n\\t\\tif (prntId) { // check if the current item is a child of another\\n\\t\\t\\thighlight(prntId, 'id_'); // hightlight the next parent item,\\n\\t\\t\\t// if the current item is a child\\n\\t\\t}\\n\\t}).mouseout(function() {\\n\\t\\treset_highlight();\\n\\t});\\n\\n}\",\n \"function mouseMovedOnListItem(hashId) {\\n\\t return function (dispatch, getState) {\\n\\t if (getState().Search.Map.BalloonState.MouseIsOnListItem)\\n\\t return;\\n\\t mouseEnteredListItem(hashId)(dispatch, getState);\\n\\t };\\n\\t}\",\n \"function mouseoverIDs(str){\\n svg.selectAll(\\\".node\\\")\\n .attr(\\\"fill-opacity\\\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.02; })\\n .attr(\\\"stroke-opacity\\\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.02; });\\n svg.selectAll(\\\".nodeText\\\") \\n .attr(\\\"fill-opacity\\\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0.05; });\\n svg.selectAll(\\\".lineNodes\\\")\\n .attr(\\\"stroke-opacity\\\", function(d2){ return (str.indexOf(d2.id) >=0) ? 1 : 0; });\\n checkVisibility();\\n}\",\n \"function handleHover(e) {\\r\\n\\t\\t\\t// Check if mouse(over|out) are still within the same parent element\\r\\n\\t\\t\\tvar p = (e.type == \\\"mouseover\\\" ? e.fromElement : e.toElement) || e.relatedTarget;\\r\\n\\t\\r\\n\\t\\t\\t// Traverse up the tree\\r\\n\\t\\t\\twhile ( p && p != this ) p = p.parentNode;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// If we actually just moused on to a sub-element, ignore it\\r\\n\\t\\t\\tif ( p == this ) return false;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Execute the right function\\r\\n\\t\\t\\treturn (e.type == \\\"mouseover\\\" ? f : g).apply(this, [e]);\\r\\n\\t\\t}\",\n \"_mouseEnterHandler() {\\n const that = this;\\n\\n that._isElementHovered = true;\\n\\n if (that.dropDownOpenMode === 'auto' && !that.disabled && !that.readonly) {\\n that.open();\\n }\\n }\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t\\t var pathFrom = [];\\n\\t\\t while (from && from !== common) {\\n\\t\\t pathFrom.push(from);\\n\\t\\t from = from._hostParent;\\n\\t\\t }\\n\\t\\t var pathTo = [];\\n\\t\\t while (to && to !== common) {\\n\\t\\t pathTo.push(to);\\n\\t\\t to = to._hostParent;\\n\\t\\t }\\n\\t\\t var i;\\n\\t\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t\\t fn(pathFrom[i], true, argFrom);\\n\\t\\t }\\n\\t\\t for (i = pathTo.length; i-- > 0;) {\\n\\t\\t fn(pathTo[i], false, argTo);\\n\\t\\t }\\n\\t\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t\\t var pathFrom = [];\\n\\t\\t while (from && from !== common) {\\n\\t\\t pathFrom.push(from);\\n\\t\\t from = from._hostParent;\\n\\t\\t }\\n\\t\\t var pathTo = [];\\n\\t\\t while (to && to !== common) {\\n\\t\\t pathTo.push(to);\\n\\t\\t to = to._hostParent;\\n\\t\\t }\\n\\t\\t var i;\\n\\t\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t\\t fn(pathFrom[i], true, argFrom);\\n\\t\\t }\\n\\t\\t for (i = pathTo.length; i-- > 0;) {\\n\\t\\t fn(pathTo[i], false, argTo);\\n\\t\\t }\\n\\t\\t}\",\n \"_mouseEnterHandler() {\\n const that = this;\\n\\n that._isElementHovered = true;\\n\\n if (that.tagName.indexOf('JQX-DROP-DOWN-') > -1 && that.dropDownOpenMode === 'auto' && !that.disabled && !that.readonly) {\\n that.open();\\n }\\n }\",\n \"function mouseOver(elem) {\\n let place = (elem.id);\\n console.log(place);\\n addColor(place);\\n return place;\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._nativeParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._nativeParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._nativeParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._nativeParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._nativeParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._nativeParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._nativeParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._nativeParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._nativeParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._nativeParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._nativeParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._nativeParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], true, argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], false, argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\r\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\r\\n\\t var pathFrom = [];\\r\\n\\t while (from && from !== common) {\\r\\n\\t pathFrom.push(from);\\r\\n\\t from = from._hostParent;\\r\\n\\t }\\r\\n\\t var pathTo = [];\\r\\n\\t while (to && to !== common) {\\r\\n\\t pathTo.push(to);\\r\\n\\t to = to._hostParent;\\r\\n\\t }\\r\\n\\t var i;\\r\\n\\t for (i = 0; i < pathFrom.length; i++) {\\r\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\r\\n\\t }\\r\\n\\t for (i = pathTo.length; i-- > 0;) {\\r\\n\\t fn(pathTo[i], 'captured', argTo);\\r\\n\\t }\\r\\n\\t}\",\n \"function handleMouseEnterFix() {\\n !mouseEntered.current && handleMouseEnter();\\n }\",\n \"function mouseEntered(e) {\\r\\n DoHover(this, true, e);\\r\\n e.stopPropagation();\\r\\n }\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n\\t var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n\\t var pathFrom = [];\\n\\t while (from && from !== common) {\\n\\t pathFrom.push(from);\\n\\t from = from._hostParent;\\n\\t }\\n\\t var pathTo = [];\\n\\t while (to && to !== common) {\\n\\t pathTo.push(to);\\n\\t to = to._hostParent;\\n\\t }\\n\\t var i;\\n\\t for (i = 0; i < pathFrom.length; i++) {\\n\\t fn(pathFrom[i], 'bubbled', argFrom);\\n\\t }\\n\\t for (i = pathTo.length; i-- > 0;) {\\n\\t fn(pathTo[i], 'captured', argTo);\\n\\t }\\n\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._nativeParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._nativeParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], true, argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], false, argTo);\\n }\\n}\",\n \"function the_click_callback(){\\n\\t\\t\\t\\tif(typeof click_callback == 'function'){\\n\\t\\t\\t\\t\\tvar id = $container.attr('id');\\n\\t\\t\\t\\t\\tif(id==undefined || !id){\\n\\t\\t\\t\\t\\t\\tid = '[no id]';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tclick_callback(id, activenode);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\",\n \"function traverseEnterLeave(from, to, fn, argFrom, argTo) {\\n var common = from && to ? getLowestCommonAncestor(from, to) : null;\\n var pathFrom = [];\\n while (from && from !== common) {\\n pathFrom.push(from);\\n from = from._hostParent;\\n }\\n var pathTo = [];\\n while (to && to !== common) {\\n pathTo.push(to);\\n to = to._hostParent;\\n }\\n var i;\\n for (i = 0; i < pathFrom.length; i++) {\\n fn(pathFrom[i], 'bubbled', argFrom);\\n }\\n for (i = pathTo.length; i-- > 0;) {\\n fn(pathTo[i], 'captured', argTo);\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5092577","0.49209234","0.49209234","0.4881742","0.48802367","0.48802367","0.4870479","0.48648864","0.4797949","0.4775619","0.47356582","0.47356582","0.47356582","0.47356582","0.47356582","0.47356582","0.47356582","0.47356582","0.47356582","0.47356582","0.47289172","0.47231197","0.47161663","0.4708721","0.47015142","0.46625197","0.46451855","0.46352634","0.46352634","0.46345252","0.4593752","0.45883778","0.45883778","0.45883778","0.45883778","0.45883778","0.45883778","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.4573742","0.45562163","0.45547926","0.45343348","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.453165","0.45285386","0.4523477","0.4523477","0.4523477","0.4523477","0.4523477","0.4523477","0.4523477","0.45176074","0.45073026","0.45073026","0.45073026","0.45073026","0.45073026","0.45073026","0.45073026","0.45073026","0.45073026","0.45073026"],"string":"[\n \"0.5092577\",\n \"0.49209234\",\n \"0.49209234\",\n \"0.4881742\",\n \"0.48802367\",\n \"0.48802367\",\n \"0.4870479\",\n \"0.48648864\",\n \"0.4797949\",\n \"0.4775619\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47356582\",\n \"0.47289172\",\n \"0.47231197\",\n \"0.47161663\",\n \"0.4708721\",\n \"0.47015142\",\n \"0.46625197\",\n \"0.46451855\",\n \"0.46352634\",\n \"0.46352634\",\n \"0.46345252\",\n \"0.4593752\",\n \"0.45883778\",\n \"0.45883778\",\n \"0.45883778\",\n \"0.45883778\",\n \"0.45883778\",\n \"0.45883778\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.4573742\",\n \"0.45562163\",\n \"0.45547926\",\n \"0.45343348\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.453165\",\n \"0.45285386\",\n \"0.4523477\",\n \"0.4523477\",\n \"0.4523477\",\n \"0.4523477\",\n \"0.4523477\",\n \"0.4523477\",\n \"0.4523477\",\n \"0.45176074\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\",\n \"0.45073026\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74193,"cells":{"query":{"kind":"string","value":"Some event types have a notion of different registration names for different \"phases\" of propagation. This finds listeners by a given phase."},"document":{"kind":"string","value":"function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function listenerAtPhase(inst, event, propagationPhase) {\n\t\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t\t return getListener(inst, registrationName);\n\t\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t\t return getListener(inst, registrationName);\n\t\t}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}","function listenerAtPhase(id,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(id,registrationName);}","function listenerAtPhase(id,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(id,registrationName);}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t return getListener(inst, registrationName);\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\r\n\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\r\n\t return getListener(inst, registrationName);\r\n\t}","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n }","function listenerAtPhase(inst, event, propagationPhase) {\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n}","function listenerAtPhase(inst, event, propagationPhase: PropagationPhases) {\n const registrationName =\n event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n return getListener(inst, registrationName);\n}"],"string":"[\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t\\t return getListener(inst, registrationName);\\n\\t\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t\\t return getListener(inst, registrationName);\\n\\t\\t}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(inst,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(inst,registrationName);}\",\n \"function listenerAtPhase(id,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(id,registrationName);}\",\n \"function listenerAtPhase(id,event,propagationPhase){var registrationName=event.dispatchConfig.phasedRegistrationNames[propagationPhase];return getListener(id,registrationName);}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n\\t return getListener(inst, registrationName);\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\r\\n\\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\r\\n\\t return getListener(inst, registrationName);\\r\\n\\t}\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n }\",\n \"function listenerAtPhase(inst, event, propagationPhase) {\\n var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n}\",\n \"function listenerAtPhase(inst, event, propagationPhase: PropagationPhases) {\\n const registrationName =\\n event.dispatchConfig.phasedRegistrationNames[propagationPhase];\\n return getListener(inst, registrationName);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6933187","0.6933187","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.6932316","0.69260776","0.69260776","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.690148","0.6893367","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.68219084","0.6754393","0.6730326","0.6726215"],"string":"[\n \"0.6933187\",\n \"0.6933187\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.6932316\",\n \"0.69260776\",\n \"0.69260776\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.690148\",\n \"0.6893367\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.68219084\",\n \"0.6754393\",\n \"0.6730326\",\n \"0.6726215\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74194,"cells":{"query":{"kind":"string","value":"A small set of propagation patterns, each of which will accept a small amount of information, and generate a set of \"dispatch ready event objects\" which are sets of events that have already been annotated with a set of dispatched listener functions/ids. The API is designed this way to discourage these propagation strategies from actually executing the dispatches, since we always want to collect the entire set of dispatches before executing even a single one. Tags a `SyntheticEvent` with dispatched listeners. Creating this function here, allows us to not have to bind or create functions for each event. Mutating the event's members allows us to not have to create a wrapping \"dispatch\" object that pairs the event with the listener."},"document":{"kind":"string","value":"function accumulateDirectionalDispatches(inst, phase, event) {\n {\n !inst ? warning(false, 'Dispatching inst must not be null') : void 0;\n }\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}"},"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 accumulateDirectionalDispatches(inst,upwards,event){if(process.env.NODE_ENV!=='production'){process.env.NODE_ENV!=='production'?warning(inst,'Dispatching inst must not be null'):void 0;}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(inst,upwards,event){if(process.env.NODE_ENV!=='production'){process.env.NODE_ENV!=='production'?warning(inst,'Dispatching inst must not be null'):void 0;}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(domID,upwards,event){if(true){if(!domID){throw new Error('Dispatching id must not be null');}}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(domID,event,phase);if(listener){event._dispatchListeners = accumulateInto(event._dispatchListeners,listener);event._dispatchIDs = accumulateInto(event._dispatchIDs,domID);}}","function accumulateDirectionalDispatches(domID,upwards,event){if(\"production\"!==process.env.NODE_ENV){if(!domID){throw new Error('Dispatching id must not be null');}}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(domID,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchIDs=accumulateInto(event._dispatchIDs,domID);}}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function accumulateDirectionalDispatches(inst,phase,event){{!inst?warning(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(inst,phase,event){{!inst?warning(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDispatches(id,ignoredDirection,event){if(event && event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(id,registrationName);if(listener){event._dispatchListeners = accumulateInto(event._dispatchListeners,listener);event._dispatchIDs = accumulateInto(event._dispatchIDs,id);}}}","function accumulateDirectionalDispatches(inst,phase,event){{!inst?warningWithoutStack$1(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(inst,phase,event){{!inst?warningWithoutStack$1(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t\t if (false) {\n\t\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t\t }\n\t\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t\t var listener = listenerAtPhase(inst, event, phase);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t\t if (false) {\n\t\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t\t }\n\t\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t\t var listener = listenerAtPhase(inst, event, phase);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t\t if (process.env.NODE_ENV !== 'production') {\n\t\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t\t }\n\t\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t\t var listener = listenerAtPhase(domID, event, phase);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t\t }\n\t\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (\"production\" !== process.env.NODE_ENV) {\n\t if (!domID) {\n\t throw new Error('Dispatching id must not be null');\n\t }\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n\t if (process.env.NODE_ENV !== 'production') {\n\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(domID, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n\t }\n\t}","function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"development\" !== 'production') {\n \"development\" !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDirectionalDispatches(inst, upwards, event) {\n if (\"development\" !== 'production') {\n \"development\" !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(inst, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n}","function accumulateDispatches(inst,ignoredDirection,event){if(event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDispatches(inst,ignoredDirection,event){if(event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (false) {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(inst, upwards, event) {\n\t if (false) {\n\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\n\t }\n\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n\t var listener = listenerAtPhase(inst, event, phase);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (process.env.NODE_ENV !== 'production') {\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}","function accumulateDirectionalDispatches(domID, upwards, event) {\n if (\"production\" !== process.env.NODE_ENV) {\n if (!domID) {\n throw new Error('Dispatching id must not be null');\n }\n }\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\n var listener = listenerAtPhase(domID, event, phase);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\n }\n}"],"string":"[\n \"function accumulateDirectionalDispatches(inst,upwards,event){if(process.env.NODE_ENV!=='production'){process.env.NODE_ENV!=='production'?warning(inst,'Dispatching inst must not be null'):void 0;}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(inst,upwards,event){if(process.env.NODE_ENV!=='production'){process.env.NODE_ENV!=='production'?warning(inst,'Dispatching inst must not be null'):void 0;}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(domID,upwards,event){if(true){if(!domID){throw new Error('Dispatching id must not be null');}}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(domID,event,phase);if(listener){event._dispatchListeners = accumulateInto(event._dispatchListeners,listener);event._dispatchIDs = accumulateInto(event._dispatchIDs,domID);}}\",\n \"function accumulateDirectionalDispatches(domID,upwards,event){if(\\\"production\\\"!==process.env.NODE_ENV){if(!domID){throw new Error('Dispatching id must not be null');}}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(domID,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchIDs=accumulateInto(event._dispatchIDs,domID);}}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{!inst?warning(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{!inst?warning(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDispatches(id,ignoredDirection,event){if(event && event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(id,registrationName);if(listener){event._dispatchListeners = accumulateInto(event._dispatchListeners,listener);event._dispatchIDs = accumulateInto(event._dispatchIDs,id);}}}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{!inst?warningWithoutStack$1(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{!inst?warningWithoutStack$1(false,'Dispatching inst must not be null'):void 0;}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t\\t if (false) {\\n\\t\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t\\t }\\n\\t\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t\\t if (false) {\\n\\t\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t\\t }\\n\\t\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(inst&&event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t\\t if (process.env.NODE_ENV !== 'production') {\\n\\t\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t\\t }\\n\\t\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t if (!domID) {\\n\\t throw new Error('Dispatching id must not be null');\\n\\t }\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t if (!domID) {\\n\\t throw new Error('Dispatching id must not be null');\\n\\t }\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t if (!domID) {\\n\\t throw new Error('Dispatching id must not be null');\\n\\t }\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t if (!domID) {\\n\\t throw new Error('Dispatching id must not be null');\\n\\t }\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t if (!domID) {\\n\\t throw new Error('Dispatching id must not be null');\\n\\t }\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (\\\"production\\\" !== process.env.NODE_ENV) {\\n\\t if (!domID) {\\n\\t throw new Error('Dispatching id must not be null');\\n\\t }\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n\\t if (process.env.NODE_ENV !== 'production') {\\n\\t process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(domID, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(inst,phase,event){{if(!inst){error('Dispatching inst must not be null');}}var listener=listenerAtPhase(inst,event,phase);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"development\\\" !== 'production') {\\n \\\"development\\\" !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n if (\\\"development\\\" !== 'production') {\\n \\\"development\\\" !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(inst, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n }\\n}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDispatches(inst,ignoredDirection,event){if(event&&event.dispatchConfig.registrationName){var registrationName=event.dispatchConfig.registrationName;var listener=getListener(inst,registrationName);if(listener){event._dispatchListeners=accumulateInto(event._dispatchListeners,listener);event._dispatchInstances=accumulateInto(event._dispatchInstances,inst);}}}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (false) {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(inst, upwards, event) {\\n\\t if (false) {\\n\\t process.env.NODE_ENV !== 'production' ? warning(inst, 'Dispatching inst must not be null') : void 0;\\n\\t }\\n\\t var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n\\t var listener = listenerAtPhase(inst, event, phase);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (process.env.NODE_ENV !== 'production') {\\n process.env.NODE_ENV !== 'production' ? warning(domID, 'Dispatching id must not be null') : undefined;\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n if (!domID) {\\n throw new Error('Dispatching id must not be null');\\n }\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n if (!domID) {\\n throw new Error('Dispatching id must not be null');\\n }\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n if (!domID) {\\n throw new Error('Dispatching id must not be null');\\n }\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n if (!domID) {\\n throw new Error('Dispatching id must not be null');\\n }\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n if (!domID) {\\n throw new Error('Dispatching id must not be null');\\n }\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\\n }\\n}\",\n \"function accumulateDirectionalDispatches(domID, upwards, event) {\\n if (\\\"production\\\" !== process.env.NODE_ENV) {\\n if (!domID) {\\n throw new Error('Dispatching id must not be null');\\n }\\n }\\n var phase = upwards ? PropagationPhases.bubbled : PropagationPhases.captured;\\n var listener = listenerAtPhase(domID, event, phase);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, domID);\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6351668","0.6351668","0.6248267","0.6233495","0.60864395","0.60864395","0.60864395","0.60864395","0.60864395","0.5959494","0.5959494","0.5951498","0.5945181","0.5945181","0.5928652","0.5928652","0.59271216","0.59271216","0.59271216","0.59271216","0.59271216","0.59271216","0.59271216","0.59271216","0.59271216","0.59271216","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.592033","0.591362","0.59090656","0.59090656","0.59090656","0.59090656","0.59090656","0.59090656","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5904507","0.5901052","0.5901052","0.5901052","0.5891454","0.58858836","0.58858836","0.58858836","0.58858836","0.58858836","0.58858836","0.58858836","0.5884786","0.58841723","0.58841723","0.58841723","0.58834904","0.58834904","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58821434","0.58762026","0.58762026","0.58762026","0.58762026","0.58762026","0.58762026"],"string":"[\n \"0.6351668\",\n \"0.6351668\",\n \"0.6248267\",\n \"0.6233495\",\n \"0.60864395\",\n \"0.60864395\",\n \"0.60864395\",\n \"0.60864395\",\n \"0.60864395\",\n \"0.5959494\",\n \"0.5959494\",\n \"0.5951498\",\n \"0.5945181\",\n \"0.5945181\",\n \"0.5928652\",\n \"0.5928652\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.59271216\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.592033\",\n \"0.591362\",\n \"0.59090656\",\n \"0.59090656\",\n \"0.59090656\",\n \"0.59090656\",\n \"0.59090656\",\n \"0.59090656\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5904507\",\n \"0.5901052\",\n \"0.5901052\",\n \"0.5901052\",\n \"0.5891454\",\n \"0.58858836\",\n \"0.58858836\",\n \"0.58858836\",\n \"0.58858836\",\n \"0.58858836\",\n \"0.58858836\",\n \"0.58858836\",\n \"0.5884786\",\n \"0.58841723\",\n \"0.58841723\",\n \"0.58841723\",\n \"0.58834904\",\n \"0.58834904\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58821434\",\n \"0.58762026\",\n \"0.58762026\",\n \"0.58762026\",\n \"0.58762026\",\n \"0.58762026\",\n \"0.58762026\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74195,"cells":{"query":{"kind":"string","value":"Collect dispatches (must be entirely collected before dispatching see unit tests). Lazily allocate the array to conserve memory. We must loop through each event and perform the traversal for each one. We cannot perform a single traversal for the entire collection of events because each event may have a different target."},"document":{"kind":"string","value":"function accumulateTwoPhaseDispatchesSingle(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n traverseTwoPhase(event._targetInst, accumulateDirectionalDispatches, event);\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners = null;event._dispatchIDs = null;}","function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners=null;event._dispatchIDs=null;}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n }","function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\n\texecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (inst && event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;if(process.env.NODE_ENV!=='production'){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}","function accumulateDispatches(inst, ignoredDirection, event) {\n if (inst && event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(inst, registrationName);\n\n if (listener) {\n event._dispatchListeners = accumulateInto(\n event._dispatchListeners,\n listener,\n );\n event._dispatchInstances = accumulateInto(\n event._dispatchInstances,\n inst,\n );\n }\n }\n }","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(inst, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t\t }\n\t\t }\n\t\t}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}","function executeDispatchesInOrder(event) {\n var dispatchListeners = event._dispatchListeners;\n var dispatchInstances = event._dispatchInstances;\n\n {\n validateEventDispatches(event);\n }\n\n if (Array.isArray(dispatchListeners)) {\n for (var i = 0; i < dispatchListeners.length; i++) {\n if (event.isPropagationStopped()) {\n break;\n } // Listeners and Instances are two parallel arrays that are always in sync.\n\n\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\n }\n } else if (dispatchListeners) {\n executeDispatch(event, dispatchListeners, dispatchInstances);\n }\n\n event._dispatchListeners = null;\n event._dispatchInstances = null;\n}"],"string":"[\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners = null;event._dispatchIDs = null;}\",\n \"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function executeDispatchesInOrder(event,cb){forEachEventDispatch(event,cb);event._dispatchListeners=null;event._dispatchIDs=null;}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n }\",\n \"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\n\\texecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (inst && event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function executeDispatchesInOrder(event,simulated){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;if(process.env.NODE_ENV!=='production'){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances are two parallel arrays that are always in sync.\\nexecuteDispatch(event,simulated,dispatchListeners[i],dispatchInstances[i]);}}else if(dispatchListeners){executeDispatch(event,simulated,dispatchListeners,dispatchInstances);}event._dispatchListeners=null;event._dispatchInstances=null;}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n if (inst && event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(inst, registrationName);\\n\\n if (listener) {\\n event._dispatchListeners = accumulateInto(\\n event._dispatchListeners,\\n listener,\\n );\\n event._dispatchInstances = accumulateInto(\\n event._dispatchInstances,\\n inst,\\n );\\n }\\n }\\n }\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t\\t if (event && event.dispatchConfig.registrationName) {\\n\\t\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t\\t var listener = getListener(inst, registrationName);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t\\t if (event && event.dispatchConfig.registrationName) {\\n\\t\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t\\t var listener = getListener(inst, registrationName);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\",\n \"function executeDispatchesInOrder(event) {\\n var dispatchListeners = event._dispatchListeners;\\n var dispatchInstances = event._dispatchInstances;\\n\\n {\\n validateEventDispatches(event);\\n }\\n\\n if (Array.isArray(dispatchListeners)) {\\n for (var i = 0; i < dispatchListeners.length; i++) {\\n if (event.isPropagationStopped()) {\\n break;\\n } // Listeners and Instances are two parallel arrays that are always in sync.\\n\\n\\n executeDispatch(event, dispatchListeners[i], dispatchInstances[i]);\\n }\\n } else if (dispatchListeners) {\\n executeDispatch(event, dispatchListeners, dispatchInstances);\\n }\\n\\n event._dispatchListeners = null;\\n event._dispatchInstances = null;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6037257","0.6037257","0.6037257","0.6037257","0.6037257","0.59030503","0.58940506","0.58940506","0.58940506","0.58940506","0.587664","0.5833246","0.5833246","0.5833246","0.5833246","0.5833246","0.5833246","0.5833246","0.5833246","0.5833246","0.5790857","0.5790529","0.5783542","0.5776835","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.57737553","0.5771196","0.5771196","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441","0.5767441"],"string":"[\n \"0.6037257\",\n \"0.6037257\",\n \"0.6037257\",\n \"0.6037257\",\n \"0.6037257\",\n \"0.59030503\",\n \"0.58940506\",\n \"0.58940506\",\n \"0.58940506\",\n \"0.58940506\",\n \"0.587664\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5833246\",\n \"0.5790857\",\n \"0.5790529\",\n \"0.5783542\",\n \"0.5776835\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.57737553\",\n \"0.5771196\",\n \"0.5771196\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\",\n \"0.5767441\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74196,"cells":{"query":{"kind":"string","value":"Same as `accumulateTwoPhaseDispatchesSingle`, but skips over the targetID."},"document":{"kind":"string","value":"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n}"},"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 accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? getParentInstance(targetInst) : null;\n\t traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n if (event && event.dispatchConfig.phasedRegistrationNames) {\n var targetInst = event._targetInst;\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n }\n }","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t\t var targetInst = event._targetInst;\n\t\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t\t }\n\t\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t\t var targetInst = event._targetInst;\n\t\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t\t }\n\t\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t\t EventPluginHub.injection.getInstanceHandle().traverseTwoPhaseSkipTarget(event.dispatchMarker, accumulateDirectionalDispatches, event);\n\t\t }\n\t\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}","function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\n\t if (event && event.dispatchConfig.phasedRegistrationNames) {\n\t var targetInst = event._targetInst;\n\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\n\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\n\t }\n\t}"],"string":"[\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n if (event && event.dispatchConfig.phasedRegistrationNames) {\\n var targetInst = event._targetInst;\\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n }\\n }\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n if (event && event.dispatchConfig.phasedRegistrationNames) {\\n var targetInst = event._targetInst;\\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n }\\n }\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n if (event && event.dispatchConfig.phasedRegistrationNames) {\\n var targetInst = event._targetInst;\\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n }\\n }\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? getParentInstance(targetInst) : null;\\n\\t traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n if (event && event.dispatchConfig.phasedRegistrationNames) {\\n var targetInst = event._targetInst;\\n var parentInst = targetInst ? getParentInstance(targetInst) : null;\\n traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n }\\n }\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t\\t var targetInst = event._targetInst;\\n\\t\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t\\t var targetInst = event._targetInst;\\n\\t\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t\\t EventPluginHub.injection.getInstanceHandle().traverseTwoPhaseSkipTarget(event.dispatchMarker, accumulateDirectionalDispatches, event);\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\",\n \"function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {\\n\\t if (event && event.dispatchConfig.phasedRegistrationNames) {\\n\\t var targetInst = event._targetInst;\\n\\t var parentInst = targetInst ? EventPluginUtils.getParentInstance(targetInst) : null;\\n\\t EventPluginUtils.traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);\\n\\t }\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7414454","0.7414454","0.7414454","0.7414454","0.7414454","0.74034","0.74034","0.74034","0.73782057","0.73656684","0.7320886","0.7320886","0.7300291","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566","0.7285566"],"string":"[\n \"0.7414454\",\n \"0.7414454\",\n \"0.7414454\",\n \"0.7414454\",\n \"0.7414454\",\n \"0.74034\",\n \"0.74034\",\n \"0.74034\",\n \"0.73782057\",\n \"0.73656684\",\n \"0.7320886\",\n \"0.7320886\",\n \"0.7300291\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\",\n \"0.7285566\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7298766"},"document_rank":{"kind":"string","value":"61"}}},{"rowIdx":74197,"cells":{"query":{"kind":"string","value":"Accumulates without regard to direction, does not look for phased registration names. Same as `accumulateDirectDispatchesSingle` but without requiring that the `dispatchMarker` be the same as the dispatched ID."},"document":{"kind":"string","value":"function accumulateDispatches(inst, ignoredDirection, event) {\n if (inst && event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(inst, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners =\n\t accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t }\n\t }\n\t}","function accumulateDispatches(id, ignoredDirection, event) {\n\t\t if (event && event.dispatchConfig.registrationName) {\n\t\t var registrationName = event.dispatchConfig.registrationName;\n\t\t var listener = getListener(id, registrationName);\n\t\t if (listener) {\n\t\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n\t\t }\n\t\t }\n\t\t}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners =\n accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(id, ignoredDirection, event) {\n if (event && event.dispatchConfig.registrationName) {\n var registrationName = event.dispatchConfig.registrationName;\n var listener = getListener(id, registrationName);\n if (listener) {\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\n }\n }\n}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}","function accumulateDispatches(inst, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(inst, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\n\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\n\t }\n\t }\n\t}"],"string":"[\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(id, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners =\\n\\t accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n\\t\\t if (event && event.dispatchConfig.registrationName) {\\n\\t\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t\\t var listener = getListener(id, registrationName);\\n\\t\\t if (listener) {\\n\\t\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t\\t event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulate(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulate(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners =\\n accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(id, ignoredDirection, event) {\\n if (event && event.dispatchConfig.registrationName) {\\n var registrationName = event.dispatchConfig.registrationName;\\n var listener = getListener(id, registrationName);\\n if (listener) {\\n event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n event._dispatchIDs = accumulateInto(event._dispatchIDs, id);\\n }\\n }\\n}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\",\n \"function accumulateDispatches(inst, ignoredDirection, event) {\\n\\t if (event && event.dispatchConfig.registrationName) {\\n\\t var registrationName = event.dispatchConfig.registrationName;\\n\\t var listener = getListener(inst, registrationName);\\n\\t if (listener) {\\n\\t event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);\\n\\t event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);\\n\\t }\\n\\t }\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.7467071","0.74665785","0.74665785","0.74665785","0.74665785","0.74665785","0.74665785","0.74665785","0.745789","0.742125","0.742125","0.742125","0.742125","0.742125","0.742125","0.742125","0.742125","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7401177","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.7397062","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603","0.737603"],"string":"[\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.7467071\",\n \"0.74665785\",\n \"0.74665785\",\n \"0.74665785\",\n \"0.74665785\",\n \"0.74665785\",\n \"0.74665785\",\n \"0.74665785\",\n \"0.745789\",\n \"0.742125\",\n \"0.742125\",\n \"0.742125\",\n \"0.742125\",\n \"0.742125\",\n \"0.742125\",\n \"0.742125\",\n \"0.742125\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7401177\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.7397062\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\",\n \"0.737603\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74198,"cells":{"query":{"kind":"string","value":"Do not uses the below two methods directly! Instead use constants exported from DOMTopLevelEventTypes in ReactDOM. (It is the only module that is allowed to access these methods.)"},"document":{"kind":"string","value":"function unsafeCastStringToDOMTopLevelType(topLevelType) {\n return topLevelType;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}","function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}","function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}","function extractEvents$2(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var isOverEvent=domEventName==='mouseover'||domEventName==='pointerover';var isOutEvent=domEventName==='mouseout'||domEventName==='pointerout';if(isOverEvent&&(eventSystemFlags&IS_REPLAYED)===0){// If this is an over event with a target, we might have already dispatched\n// the event in the out event of the other target. If this is replayed,\n// then it's because we couldn't dispatch against this target previously\n// so we have to do it now instead.\nvar related=nativeEvent.relatedTarget||nativeEvent.fromElement;if(related){// If the related node is managed by React, we can assume that we have\n// already dispatched the corresponding events during its mouseout.\nif(getClosestInstanceFromNode(related)||isContainerMarkedAsRoot(related)){return;}}}if(!isOutEvent&&!isOverEvent){// Must not be a mouse or pointer in or out - ignoring.\nreturn;}var win;// TODO: why is this nullable in the types but we read from it?\nif(nativeEventTarget.window===nativeEventTarget){// `nativeEventTarget` is probably a window object.\nwin=nativeEventTarget;}else{// TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\nvar doc=nativeEventTarget.ownerDocument;if(doc){win=doc.defaultView||doc.parentWindow;}else{win=window;}}var from;var to;if(isOutEvent){var _related=nativeEvent.relatedTarget||nativeEvent.toElement;from=targetInst;to=_related?getClosestInstanceFromNode(_related):null;if(to!==null){var nearestMounted=getNearestMountedFiber(to);if(to!==nearestMounted||to.tag!==HostComponent&&to.tag!==HostText){to=null;}}}else{// Moving to a node from outside the window.\nfrom=null;to=targetInst;}if(from===to){// Nothing pertains to our managed components.\nreturn;}var SyntheticEventCtor=SyntheticMouseEvent;var leaveEventType='onMouseLeave';var enterEventType='onMouseEnter';var eventTypePrefix='mouse';if(domEventName==='pointerout'||domEventName==='pointerover'){SyntheticEventCtor=SyntheticPointerEvent;leaveEventType='onPointerLeave';enterEventType='onPointerEnter';eventTypePrefix='pointer';}var fromNode=from==null?win:getNodeFromInstance(from);var toNode=to==null?win:getNodeFromInstance(to);var leave=new SyntheticEventCtor(leaveEventType,eventTypePrefix+'leave',from,nativeEvent,nativeEventTarget);leave.target=fromNode;leave.relatedTarget=toNode;var enter=null;// We should only process this nativeEvent if we are processing\n// the first ancestor. Next time, we will ignore the event.\nvar nativeTargetInst=getClosestInstanceFromNode(nativeEventTarget);if(nativeTargetInst===targetInst){var enterEvent=new SyntheticEventCtor(enterEventType,eventTypePrefix+'enter',to,nativeEvent,nativeEventTarget);enterEvent.target=toNode;enterEvent.relatedTarget=fromNode;enter=enterEvent;}accumulateEnterLeaveTwoPhaseListeners(dispatchQueue,leave,enter,from,to);}","function extractEvents$2(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var isOverEvent=domEventName==='mouseover'||domEventName==='pointerover';var isOutEvent=domEventName==='mouseout'||domEventName==='pointerout';if(isOverEvent&&(eventSystemFlags&IS_REPLAYED)===0){// If this is an over event with a target, we might have already dispatched\n// the event in the out event of the other target. If this is replayed,\n// then it's because we couldn't dispatch against this target previously\n// so we have to do it now instead.\nvar related=nativeEvent.relatedTarget||nativeEvent.fromElement;if(related){// If the related node is managed by React, we can assume that we have\n// already dispatched the corresponding events during its mouseout.\nif(getClosestInstanceFromNode(related)||isContainerMarkedAsRoot(related)){return;}}}if(!isOutEvent&&!isOverEvent){// Must not be a mouse or pointer in or out - ignoring.\nreturn;}var win;// TODO: why is this nullable in the types but we read from it?\nif(nativeEventTarget.window===nativeEventTarget){// `nativeEventTarget` is probably a window object.\nwin=nativeEventTarget;}else {// TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\nvar doc=nativeEventTarget.ownerDocument;if(doc){win=doc.defaultView||doc.parentWindow;}else {win=window;}}var from;var to;if(isOutEvent){var _related=nativeEvent.relatedTarget||nativeEvent.toElement;from=targetInst;to=_related?getClosestInstanceFromNode(_related):null;if(to!==null){var nearestMounted=getNearestMountedFiber(to);if(to!==nearestMounted||to.tag!==HostComponent&&to.tag!==HostText){to=null;}}}else {// Moving to a node from outside the window.\nfrom=null;to=targetInst;}if(from===to){// Nothing pertains to our managed components.\nreturn;}var SyntheticEventCtor=SyntheticMouseEvent;var leaveEventType='onMouseLeave';var enterEventType='onMouseEnter';var eventTypePrefix='mouse';if(domEventName==='pointerout'||domEventName==='pointerover'){SyntheticEventCtor=SyntheticPointerEvent;leaveEventType='onPointerLeave';enterEventType='onPointerEnter';eventTypePrefix='pointer';}var fromNode=from==null?win:getNodeFromInstance(from);var toNode=to==null?win:getNodeFromInstance(to);var leave=new SyntheticEventCtor(leaveEventType,eventTypePrefix+'leave',from,nativeEvent,nativeEventTarget);leave.target=fromNode;leave.relatedTarget=toNode;var enter=null;// We should only process this nativeEvent if we are processing\n// the first ancestor. Next time, we will ignore the event.\nvar nativeTargetInst=getClosestInstanceFromNode(nativeEventTarget);if(nativeTargetInst===targetInst){var enterEvent=new SyntheticEventCtor(enterEventType,eventTypePrefix+'enter',to,nativeEvent,nativeEventTarget);enterEvent.target=toNode;enterEvent.relatedTarget=fromNode;enter=enterEvent;}accumulateEnterLeaveTwoPhaseListeners(dispatchQueue,leave,enter,from,to);}","function makeNativeSimulator(eventType, topLevelType) {\n return function (domComponentOrNode, nativeEventData) {\n var fakeNativeEvent = new Event(eventType);\n _assign(fakeNativeEvent, nativeEventData);\n if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n simulateNativeEventOnDOMComponent(topLevelType, domComponentOrNode, fakeNativeEvent);\n } else if (domComponentOrNode.tagName) {\n // Will allow on actual dom nodes.\n simulateNativeEventOnNode(topLevelType, domComponentOrNode, fakeNativeEvent);\n }\n };\n}","function makeNativeSimulator(eventType, topLevelType) {\n return function (domComponentOrNode, nativeEventData) {\n var fakeNativeEvent = new Event(eventType);\n\n _assign(fakeNativeEvent, nativeEventData);\n\n if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n simulateNativeEventOnDOMComponent(topLevelType, domComponentOrNode, fakeNativeEvent);\n } else if (domComponentOrNode.tagName) {\n // Will allow on actual dom nodes.\n simulateNativeEventOnNode(topLevelType, domComponentOrNode, fakeNativeEvent);\n }\n };\n}","function InternalEvent() { }","function InternalEvent() { }","function InternalEvent() { }","function InternalEvent() { }","function InternalEvent() { }","function extractEvents(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){extractCompositionEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);extractBeforeInputEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);}","function extractEvents(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){extractCompositionEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);extractBeforeInputEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);}","function InternalEvent() {}","function Browser_GetMouseDownEventType(event)\n{\n\t//switch on event type first\n\tswitch (event.type)\n\t{\n\t\tcase window.__BROWSER_EVENT_MOUSEDOWN:\n\t\t\t//no mouse button?\n\t\t\tif (!event.button)\n\t\t\t{\n\t\t\t\t//return the event directly as it was triggered by the camera\n\t\t\t\treturn event.type;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t//check button\n\t\t\t\tswitch (event.button)\n\t\t\t\t{\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\t//has to be left button\n\t\t\t\t\t\treturn window.__BROWSER_EVENT_MOUSEDOWN;\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\t//switch according to browser\n\t\t\t\t\t\tswitch (window.__BROWSER_TYPE)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase __BROWSER_IE:\n\t\t\t\t\t\t\t\t//has to be left button\n\t\t\t\t\t\t\t\treturn window.__BROWSER_EVENT_MOUSEDOWN;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase __BROWSER_EVENT_CLICK:\n\t\tcase window.__BROWSER_EVENT_MOUSEUP:\n\t\tcase __BROWSER_EVENT_MOUSERIGHT:\n\t\tcase __BROWSER_EVENT_DOUBLECLICK:\n\n\t\t\t//return it\n\t\t\treturn event.type;\n\t}\n\t//failed\n\treturn false;\n}","function Utilities_GetEvent(e)\r\n{\r\n return e || window.event;\r\n}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function handleEventsForInputEventIE(\n\t topLevelType,\n\t topLevelTarget,\n\t topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topFocus) {\n\t // In IE8, we can capture almost all .value changes by adding a\n\t // propertychange handler and looking for events with propertyName\n\t // equal to 'value'\n\t // In IE9, propertychange fires for most input events but is buggy and\n\t // doesn't fire when text is deleted, but conveniently, selectionchange\n\t // appears to fire in all of the remaining cases so we catch those and\n\t // forward the event if the value has changed\n\t // In either case, we don't want to call the event handler if the value\n\t // is changed from JS so we redefine a setter for `.value` that updates\n\t // our activeElementValue variable, allowing us to ignore those changes\n\t //\n\t // stopWatching() should be a noop here but we call it just in case we\n\t // missed a blur event somehow.\n\t stopWatchingForValueChange();\n\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n\t } else if (topLevelType === topLevelTypes.topBlur) {\n\t stopWatchingForValueChange();\n\t }\n\t}","function u(e) {\n return function(t, n) {\n var o = new r(e);\n l(o, n), S.isDOMComponent(t) ? S.simulateNativeEventOnDOMComponent(e, t, o) : t.tagName && // Will allow on actual dom nodes.\n S.simulateNativeEventOnNode(e, t, o);\n };\n }","function extractEvents$3(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;switch(domEventName){// Track the input node that has focus.\ncase'focusin':if(isTextInputElement(targetNode)||targetNode.contentEditable==='true'){activeElement$1=targetNode;activeElementInst$1=targetInst;lastSelection=null;}break;case'focusout':activeElement$1=null;activeElementInst$1=null;lastSelection=null;break;// Don't fire the event while the user is dragging. This matches the\n// semantics of the native select event.\ncase'mousedown':mouseDown=true;break;case'contextmenu':case'mouseup':case'dragend':mouseDown=false;constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);break;// Chrome and IE fire non-standard event when selection is changed (and\n// sometimes when it hasn't). IE's event fires out of order with respect\n// to key and input events on deletion, so we discard it.\n//\n// Firefox doesn't support selectionchange, so check selection status\n// after each key entry. The selection changes after keydown and before\n// keyup, but we check on keydown as well in the case of holding down a\n// key, when multiple keydown events are fired but only one keyup is.\n// This is also our approach for IE handling, for the reason above.\ncase'selectionchange':if(skipSelectionChangeEvent){break;}// falls through\ncase'keydown':case'keyup':constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);}}","function extractEvents$3(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;switch(domEventName){// Track the input node that has focus.\ncase'focusin':if(isTextInputElement(targetNode)||targetNode.contentEditable==='true'){activeElement$1=targetNode;activeElementInst$1=targetInst;lastSelection=null;}break;case'focusout':activeElement$1=null;activeElementInst$1=null;lastSelection=null;break;// Don't fire the event while the user is dragging. This matches the\n// semantics of the native select event.\ncase'mousedown':mouseDown=true;break;case'contextmenu':case'mouseup':case'dragend':mouseDown=false;constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);break;// Chrome and IE fire non-standard event when selection is changed (and\n// sometimes when it hasn't). IE's event fires out of order with respect\n// to key and input events on deletion, so we discard it.\n//\n// Firefox doesn't support selectionchange, so check selection status\n// after each key entry. The selection changes after keydown and before\n// keyup, but we check on keydown as well in the case of holding down a\n// key, when multiple keydown events are fired but only one keyup is.\n// This is also our approach for IE handling, for the reason above.\ncase'selectionchange':if(skipSelectionChangeEvent){break;}// falls through\ncase'keydown':case'keyup':constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);}}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function handleEventsForInputEventIE(\n topLevelType,\n topLevelTarget,\n topLevelTargetID) {\n if (topLevelType === topLevelTypes.topFocus) {\n // In IE8, we can capture almost all .value changes by adding a\n // propertychange handler and looking for events with propertyName\n // equal to 'value'\n // In IE9, propertychange fires for most input events but is buggy and\n // doesn't fire when text is deleted, but conveniently, selectionchange\n // appears to fire in all of the remaining cases so we catch those and\n // forward the event if the value has changed\n // In either case, we don't want to call the event handler if the value\n // is changed from JS so we redefine a setter for `.value` that updates\n // our activeElementValue variable, allowing us to ignore those changes\n //\n // stopWatching() should be a noop here but we call it just in case we\n // missed a blur event somehow.\n stopWatchingForValueChange();\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\n } else if (topLevelType === topLevelTypes.topBlur) {\n stopWatchingForValueChange();\n }\n}","function extractEvents$1(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;var getTargetInstFunc,handleEventFunc;if(shouldUseChangeEvent(targetNode)){getTargetInstFunc=getTargetInstForChangeEvent;}else if(isTextInputElement(targetNode)){if(isInputEventSupported){getTargetInstFunc=getTargetInstForInputOrChangeEvent;}else{getTargetInstFunc=getTargetInstForInputEventPolyfill;handleEventFunc=handleEventsForInputEventPolyfill;}}else if(shouldUseClickEvent(targetNode)){getTargetInstFunc=getTargetInstForClickEvent;}if(getTargetInstFunc){var inst=getTargetInstFunc(domEventName,targetInst);if(inst){createAndAccumulateChangeEvent(dispatchQueue,inst,nativeEvent,nativeEventTarget);return;}}if(handleEventFunc){handleEventFunc(domEventName,targetNode,targetInst);}// When blurring, set the value attribute for number inputs\nif(domEventName==='focusout'){handleControlledInputBlur(targetNode);}}","function extractEvents$1(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;var getTargetInstFunc,handleEventFunc;if(shouldUseChangeEvent(targetNode)){getTargetInstFunc=getTargetInstForChangeEvent;}else if(isTextInputElement(targetNode)){if(isInputEventSupported){getTargetInstFunc=getTargetInstForInputOrChangeEvent;}else {getTargetInstFunc=getTargetInstForInputEventPolyfill;handleEventFunc=handleEventsForInputEventPolyfill;}}else if(shouldUseClickEvent(targetNode)){getTargetInstFunc=getTargetInstForClickEvent;}if(getTargetInstFunc){var inst=getTargetInstFunc(domEventName,targetInst);if(inst){createAndAccumulateChangeEvent(dispatchQueue,inst,nativeEvent,nativeEventTarget);return;}}if(handleEventFunc){handleEventFunc(domEventName,targetNode,targetInst);}// When blurring, set the value attribute for number inputs\nif(domEventName==='focusout'){handleControlledInputBlur(targetNode);}}","function extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;\n switch (domEventName) {\n case 'focusin':\n if (isTextInputElement(targetNode) || targetNode.contentEditable === 'true') {\n activeElement$1 = targetNode;\n activeElementInst$1 = targetInst;\n lastSelection = null;\n }\n break;\n case 'focusout':\n activeElement$1 = null;\n activeElementInst$1 = null;\n lastSelection = null;\n break;\n case 'mousedown':\n mouseDown = true;\n break;\n case 'contextmenu':\n case 'mouseup':\n case 'dragend':\n mouseDown = false;\n constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\n break;\n case 'selectionchange':\n if (skipSelectionChangeEvent) {\n break;\n }\n case 'keydown':\n case 'keyup':\n constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\n }\n }","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\t\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n\t var path = bookKeeping.nativeEvent.path;\n\t var currentNativeTarget = path[0];\n\t var eventsFired = 0;\n\t for (var i = 0; i < path.length; i++) {\n\t var currentPathElement = path[i];\n\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t currentNativeTarget = path[i + 1];\n\t }\n\t // TODO: slow\n\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t if (reactParent === currentPathElement) {\n\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t bookKeeping.ancestors.push(currentPathElement);\n\n\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t eventsFired++;\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n\t // Jump to the root of this React render tree\n\t while (currentPathElementID !== newRootID) {\n\t i++;\n\t currentPathElement = path[i];\n\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t }\n\t }\n\t }\n\t if (eventsFired === 0) {\n\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t }\n\t}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n var path = bookKeeping.nativeEvent.path;\n var currentNativeTarget = path[0];\n var eventsFired = 0;\n for (var i = 0; i < path.length; i++) {\n var currentPathElement = path[i];\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n currentNativeTarget = path[i + 1];\n }\n // TODO: slow\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n if (reactParent === currentPathElement) {\n var currentPathElementID = ReactMount.getID(currentPathElement);\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n bookKeeping.ancestors.push(currentPathElement);\n\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n eventsFired++;\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\n // Jump to the root of this React render tree\n while (currentPathElementID !== newRootID) {\n i++;\n currentPathElement = path[i];\n currentPathElementID = ReactMount.getID(currentPathElement);\n }\n }\n }\n if (eventsFired === 0) {\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n }\n}","function handleTopLevelWithPath(bookKeeping) {\n\t\t var path = bookKeeping.nativeEvent.path;\n\t\t var currentNativeTarget = path[0];\n\t\t var eventsFired = 0;\n\t\t for (var i = 0; i < path.length; i++) {\n\t\t var currentPathElement = path[i];\n\t\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\n\t\t currentNativeTarget = path[i + 1];\n\t\t }\n\t\t // TODO: slow\n\t\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\n\t\t if (reactParent === currentPathElement) {\n\t\t var currentPathElementID = ReactMount.getID(currentPathElement);\n\t\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\n\t\t bookKeeping.ancestors.push(currentPathElement);\n\t\t\n\t\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\n\t\t eventsFired++;\n\t\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\n\t\t\n\t\t // Jump to the root of this React render tree\n\t\t while (currentPathElementID !== newRootID) {\n\t\t i++;\n\t\t currentPathElement = path[i];\n\t\t currentPathElementID = ReactMount.getID(currentPathElement);\n\t\t }\n\t\t }\n\t\t }\n\t\t if (eventsFired === 0) {\n\t\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\n\t\t }\n\t\t}","function nH(e){if (window.event){var e = window.event;var elm = e.srcElement;}else{var elm = e.target;};return elm}","function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}","function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}","function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}","function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t _assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}","function makeNativeSimulator(eventType) {\n\t return function (domComponentOrNode, nativeEventData) {\n\t var fakeNativeEvent = new Event(eventType);\n\t assign(fakeNativeEvent, nativeEventData);\n\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\n\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\n\t } else if (domComponentOrNode.tagName) {\n\t // Will allow on actual dom nodes.\n\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\n\t }\n\t };\n\t}"],"string":"[\n \"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}\",\n \"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}\",\n \"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}\",\n \"function extractEvents$2(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var isOverEvent=domEventName==='mouseover'||domEventName==='pointerover';var isOutEvent=domEventName==='mouseout'||domEventName==='pointerout';if(isOverEvent&&(eventSystemFlags&IS_REPLAYED)===0){// If this is an over event with a target, we might have already dispatched\\n// the event in the out event of the other target. If this is replayed,\\n// then it's because we couldn't dispatch against this target previously\\n// so we have to do it now instead.\\nvar related=nativeEvent.relatedTarget||nativeEvent.fromElement;if(related){// If the related node is managed by React, we can assume that we have\\n// already dispatched the corresponding events during its mouseout.\\nif(getClosestInstanceFromNode(related)||isContainerMarkedAsRoot(related)){return;}}}if(!isOutEvent&&!isOverEvent){// Must not be a mouse or pointer in or out - ignoring.\\nreturn;}var win;// TODO: why is this nullable in the types but we read from it?\\nif(nativeEventTarget.window===nativeEventTarget){// `nativeEventTarget` is probably a window object.\\nwin=nativeEventTarget;}else{// TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\\nvar doc=nativeEventTarget.ownerDocument;if(doc){win=doc.defaultView||doc.parentWindow;}else{win=window;}}var from;var to;if(isOutEvent){var _related=nativeEvent.relatedTarget||nativeEvent.toElement;from=targetInst;to=_related?getClosestInstanceFromNode(_related):null;if(to!==null){var nearestMounted=getNearestMountedFiber(to);if(to!==nearestMounted||to.tag!==HostComponent&&to.tag!==HostText){to=null;}}}else{// Moving to a node from outside the window.\\nfrom=null;to=targetInst;}if(from===to){// Nothing pertains to our managed components.\\nreturn;}var SyntheticEventCtor=SyntheticMouseEvent;var leaveEventType='onMouseLeave';var enterEventType='onMouseEnter';var eventTypePrefix='mouse';if(domEventName==='pointerout'||domEventName==='pointerover'){SyntheticEventCtor=SyntheticPointerEvent;leaveEventType='onPointerLeave';enterEventType='onPointerEnter';eventTypePrefix='pointer';}var fromNode=from==null?win:getNodeFromInstance(from);var toNode=to==null?win:getNodeFromInstance(to);var leave=new SyntheticEventCtor(leaveEventType,eventTypePrefix+'leave',from,nativeEvent,nativeEventTarget);leave.target=fromNode;leave.relatedTarget=toNode;var enter=null;// We should only process this nativeEvent if we are processing\\n// the first ancestor. Next time, we will ignore the event.\\nvar nativeTargetInst=getClosestInstanceFromNode(nativeEventTarget);if(nativeTargetInst===targetInst){var enterEvent=new SyntheticEventCtor(enterEventType,eventTypePrefix+'enter',to,nativeEvent,nativeEventTarget);enterEvent.target=toNode;enterEvent.relatedTarget=fromNode;enter=enterEvent;}accumulateEnterLeaveTwoPhaseListeners(dispatchQueue,leave,enter,from,to);}\",\n \"function extractEvents$2(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var isOverEvent=domEventName==='mouseover'||domEventName==='pointerover';var isOutEvent=domEventName==='mouseout'||domEventName==='pointerout';if(isOverEvent&&(eventSystemFlags&IS_REPLAYED)===0){// If this is an over event with a target, we might have already dispatched\\n// the event in the out event of the other target. If this is replayed,\\n// then it's because we couldn't dispatch against this target previously\\n// so we have to do it now instead.\\nvar related=nativeEvent.relatedTarget||nativeEvent.fromElement;if(related){// If the related node is managed by React, we can assume that we have\\n// already dispatched the corresponding events during its mouseout.\\nif(getClosestInstanceFromNode(related)||isContainerMarkedAsRoot(related)){return;}}}if(!isOutEvent&&!isOverEvent){// Must not be a mouse or pointer in or out - ignoring.\\nreturn;}var win;// TODO: why is this nullable in the types but we read from it?\\nif(nativeEventTarget.window===nativeEventTarget){// `nativeEventTarget` is probably a window object.\\nwin=nativeEventTarget;}else {// TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\\nvar doc=nativeEventTarget.ownerDocument;if(doc){win=doc.defaultView||doc.parentWindow;}else {win=window;}}var from;var to;if(isOutEvent){var _related=nativeEvent.relatedTarget||nativeEvent.toElement;from=targetInst;to=_related?getClosestInstanceFromNode(_related):null;if(to!==null){var nearestMounted=getNearestMountedFiber(to);if(to!==nearestMounted||to.tag!==HostComponent&&to.tag!==HostText){to=null;}}}else {// Moving to a node from outside the window.\\nfrom=null;to=targetInst;}if(from===to){// Nothing pertains to our managed components.\\nreturn;}var SyntheticEventCtor=SyntheticMouseEvent;var leaveEventType='onMouseLeave';var enterEventType='onMouseEnter';var eventTypePrefix='mouse';if(domEventName==='pointerout'||domEventName==='pointerover'){SyntheticEventCtor=SyntheticPointerEvent;leaveEventType='onPointerLeave';enterEventType='onPointerEnter';eventTypePrefix='pointer';}var fromNode=from==null?win:getNodeFromInstance(from);var toNode=to==null?win:getNodeFromInstance(to);var leave=new SyntheticEventCtor(leaveEventType,eventTypePrefix+'leave',from,nativeEvent,nativeEventTarget);leave.target=fromNode;leave.relatedTarget=toNode;var enter=null;// We should only process this nativeEvent if we are processing\\n// the first ancestor. Next time, we will ignore the event.\\nvar nativeTargetInst=getClosestInstanceFromNode(nativeEventTarget);if(nativeTargetInst===targetInst){var enterEvent=new SyntheticEventCtor(enterEventType,eventTypePrefix+'enter',to,nativeEvent,nativeEventTarget);enterEvent.target=toNode;enterEvent.relatedTarget=fromNode;enter=enterEvent;}accumulateEnterLeaveTwoPhaseListeners(dispatchQueue,leave,enter,from,to);}\",\n \"function makeNativeSimulator(eventType, topLevelType) {\\n return function (domComponentOrNode, nativeEventData) {\\n var fakeNativeEvent = new Event(eventType);\\n _assign(fakeNativeEvent, nativeEventData);\\n if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n simulateNativeEventOnDOMComponent(topLevelType, domComponentOrNode, fakeNativeEvent);\\n } else if (domComponentOrNode.tagName) {\\n // Will allow on actual dom nodes.\\n simulateNativeEventOnNode(topLevelType, domComponentOrNode, fakeNativeEvent);\\n }\\n };\\n}\",\n \"function makeNativeSimulator(eventType, topLevelType) {\\n return function (domComponentOrNode, nativeEventData) {\\n var fakeNativeEvent = new Event(eventType);\\n\\n _assign(fakeNativeEvent, nativeEventData);\\n\\n if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n simulateNativeEventOnDOMComponent(topLevelType, domComponentOrNode, fakeNativeEvent);\\n } else if (domComponentOrNode.tagName) {\\n // Will allow on actual dom nodes.\\n simulateNativeEventOnNode(topLevelType, domComponentOrNode, fakeNativeEvent);\\n }\\n };\\n}\",\n \"function InternalEvent() { }\",\n \"function InternalEvent() { }\",\n \"function InternalEvent() { }\",\n \"function InternalEvent() { }\",\n \"function InternalEvent() { }\",\n \"function extractEvents(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){extractCompositionEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);extractBeforeInputEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);}\",\n \"function extractEvents(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){extractCompositionEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);extractBeforeInputEvent(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget);}\",\n \"function InternalEvent() {}\",\n \"function Browser_GetMouseDownEventType(event)\\n{\\n\\t//switch on event type first\\n\\tswitch (event.type)\\n\\t{\\n\\t\\tcase window.__BROWSER_EVENT_MOUSEDOWN:\\n\\t\\t\\t//no mouse button?\\n\\t\\t\\tif (!event.button)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//return the event directly as it was triggered by the camera\\n\\t\\t\\t\\treturn event.type;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\t//check button\\n\\t\\t\\t\\tswitch (event.button)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcase 0:\\n\\t\\t\\t\\t\\t\\t//has to be left button\\n\\t\\t\\t\\t\\t\\treturn window.__BROWSER_EVENT_MOUSEDOWN;\\n\\t\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\t\\t//switch according to browser\\n\\t\\t\\t\\t\\t\\tswitch (window.__BROWSER_TYPE)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tcase __BROWSER_IE:\\n\\t\\t\\t\\t\\t\\t\\t\\t//has to be left button\\n\\t\\t\\t\\t\\t\\t\\t\\treturn window.__BROWSER_EVENT_MOUSEDOWN;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase __BROWSER_EVENT_CLICK:\\n\\t\\tcase window.__BROWSER_EVENT_MOUSEUP:\\n\\t\\tcase __BROWSER_EVENT_MOUSERIGHT:\\n\\t\\tcase __BROWSER_EVENT_DOUBLECLICK:\\n\\n\\t\\t\\t//return it\\n\\t\\t\\treturn event.type;\\n\\t}\\n\\t//failed\\n\\treturn false;\\n}\",\n \"function Utilities_GetEvent(e)\\r\\n{\\r\\n return e || window.event;\\r\\n}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function handleEventsForInputEventIE(\\n\\t topLevelType,\\n\\t topLevelTarget,\\n\\t topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topFocus) {\\n\\t // In IE8, we can capture almost all .value changes by adding a\\n\\t // propertychange handler and looking for events with propertyName\\n\\t // equal to 'value'\\n\\t // In IE9, propertychange fires for most input events but is buggy and\\n\\t // doesn't fire when text is deleted, but conveniently, selectionchange\\n\\t // appears to fire in all of the remaining cases so we catch those and\\n\\t // forward the event if the value has changed\\n\\t // In either case, we don't want to call the event handler if the value\\n\\t // is changed from JS so we redefine a setter for `.value` that updates\\n\\t // our activeElementValue variable, allowing us to ignore those changes\\n\\t //\\n\\t // stopWatching() should be a noop here but we call it just in case we\\n\\t // missed a blur event somehow.\\n\\t stopWatchingForValueChange();\\n\\t startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n\\t } else if (topLevelType === topLevelTypes.topBlur) {\\n\\t stopWatchingForValueChange();\\n\\t }\\n\\t}\",\n \"function u(e) {\\n return function(t, n) {\\n var o = new r(e);\\n l(o, n), S.isDOMComponent(t) ? S.simulateNativeEventOnDOMComponent(e, t, o) : t.tagName && // Will allow on actual dom nodes.\\n S.simulateNativeEventOnNode(e, t, o);\\n };\\n }\",\n \"function extractEvents$3(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;switch(domEventName){// Track the input node that has focus.\\ncase'focusin':if(isTextInputElement(targetNode)||targetNode.contentEditable==='true'){activeElement$1=targetNode;activeElementInst$1=targetInst;lastSelection=null;}break;case'focusout':activeElement$1=null;activeElementInst$1=null;lastSelection=null;break;// Don't fire the event while the user is dragging. This matches the\\n// semantics of the native select event.\\ncase'mousedown':mouseDown=true;break;case'contextmenu':case'mouseup':case'dragend':mouseDown=false;constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);break;// Chrome and IE fire non-standard event when selection is changed (and\\n// sometimes when it hasn't). IE's event fires out of order with respect\\n// to key and input events on deletion, so we discard it.\\n//\\n// Firefox doesn't support selectionchange, so check selection status\\n// after each key entry. The selection changes after keydown and before\\n// keyup, but we check on keydown as well in the case of holding down a\\n// key, when multiple keydown events are fired but only one keyup is.\\n// This is also our approach for IE handling, for the reason above.\\ncase'selectionchange':if(skipSelectionChangeEvent){break;}// falls through\\ncase'keydown':case'keyup':constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);}}\",\n \"function extractEvents$3(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;switch(domEventName){// Track the input node that has focus.\\ncase'focusin':if(isTextInputElement(targetNode)||targetNode.contentEditable==='true'){activeElement$1=targetNode;activeElementInst$1=targetInst;lastSelection=null;}break;case'focusout':activeElement$1=null;activeElementInst$1=null;lastSelection=null;break;// Don't fire the event while the user is dragging. This matches the\\n// semantics of the native select event.\\ncase'mousedown':mouseDown=true;break;case'contextmenu':case'mouseup':case'dragend':mouseDown=false;constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);break;// Chrome and IE fire non-standard event when selection is changed (and\\n// sometimes when it hasn't). IE's event fires out of order with respect\\n// to key and input events on deletion, so we discard it.\\n//\\n// Firefox doesn't support selectionchange, so check selection status\\n// after each key entry. The selection changes after keydown and before\\n// keyup, but we check on keydown as well in the case of holding down a\\n// key, when multiple keydown events are fired but only one keyup is.\\n// This is also our approach for IE handling, for the reason above.\\ncase'selectionchange':if(skipSelectionChangeEvent){break;}// falls through\\ncase'keydown':case'keyup':constructSelectEvent(dispatchQueue,nativeEvent,nativeEventTarget);}}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function handleEventsForInputEventIE(\\n topLevelType,\\n topLevelTarget,\\n topLevelTargetID) {\\n if (topLevelType === topLevelTypes.topFocus) {\\n // In IE8, we can capture almost all .value changes by adding a\\n // propertychange handler and looking for events with propertyName\\n // equal to 'value'\\n // In IE9, propertychange fires for most input events but is buggy and\\n // doesn't fire when text is deleted, but conveniently, selectionchange\\n // appears to fire in all of the remaining cases so we catch those and\\n // forward the event if the value has changed\\n // In either case, we don't want to call the event handler if the value\\n // is changed from JS so we redefine a setter for `.value` that updates\\n // our activeElementValue variable, allowing us to ignore those changes\\n //\\n // stopWatching() should be a noop here but we call it just in case we\\n // missed a blur event somehow.\\n stopWatchingForValueChange();\\n startWatchingForValueChange(topLevelTarget, topLevelTargetID);\\n } else if (topLevelType === topLevelTypes.topBlur) {\\n stopWatchingForValueChange();\\n }\\n}\",\n \"function extractEvents$1(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;var getTargetInstFunc,handleEventFunc;if(shouldUseChangeEvent(targetNode)){getTargetInstFunc=getTargetInstForChangeEvent;}else if(isTextInputElement(targetNode)){if(isInputEventSupported){getTargetInstFunc=getTargetInstForInputOrChangeEvent;}else{getTargetInstFunc=getTargetInstForInputEventPolyfill;handleEventFunc=handleEventsForInputEventPolyfill;}}else if(shouldUseClickEvent(targetNode)){getTargetInstFunc=getTargetInstForClickEvent;}if(getTargetInstFunc){var inst=getTargetInstFunc(domEventName,targetInst);if(inst){createAndAccumulateChangeEvent(dispatchQueue,inst,nativeEvent,nativeEventTarget);return;}}if(handleEventFunc){handleEventFunc(domEventName,targetNode,targetInst);}// When blurring, set the value attribute for number inputs\\nif(domEventName==='focusout'){handleControlledInputBlur(targetNode);}}\",\n \"function extractEvents$1(dispatchQueue,domEventName,targetInst,nativeEvent,nativeEventTarget,eventSystemFlags,targetContainer){var targetNode=targetInst?getNodeFromInstance(targetInst):window;var getTargetInstFunc,handleEventFunc;if(shouldUseChangeEvent(targetNode)){getTargetInstFunc=getTargetInstForChangeEvent;}else if(isTextInputElement(targetNode)){if(isInputEventSupported){getTargetInstFunc=getTargetInstForInputOrChangeEvent;}else {getTargetInstFunc=getTargetInstForInputEventPolyfill;handleEventFunc=handleEventsForInputEventPolyfill;}}else if(shouldUseClickEvent(targetNode)){getTargetInstFunc=getTargetInstForClickEvent;}if(getTargetInstFunc){var inst=getTargetInstFunc(domEventName,targetInst);if(inst){createAndAccumulateChangeEvent(dispatchQueue,inst,nativeEvent,nativeEventTarget);return;}}if(handleEventFunc){handleEventFunc(domEventName,targetNode,targetInst);}// When blurring, set the value attribute for number inputs\\nif(domEventName==='focusout'){handleControlledInputBlur(targetNode);}}\",\n \"function extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\\n var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;\\n switch (domEventName) {\\n case 'focusin':\\n if (isTextInputElement(targetNode) || targetNode.contentEditable === 'true') {\\n activeElement$1 = targetNode;\\n activeElementInst$1 = targetInst;\\n lastSelection = null;\\n }\\n break;\\n case 'focusout':\\n activeElement$1 = null;\\n activeElementInst$1 = null;\\n lastSelection = null;\\n break;\\n case 'mousedown':\\n mouseDown = true;\\n break;\\n case 'contextmenu':\\n case 'mouseup':\\n case 'dragend':\\n mouseDown = false;\\n constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\\n break;\\n case 'selectionchange':\\n if (skipSelectionChangeEvent) {\\n break;\\n }\\n case 'keydown':\\n case 'keyup':\\n constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\\n }\\n }\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t var path = bookKeeping.nativeEvent.path;\\n\\t var currentNativeTarget = path[0];\\n\\t var eventsFired = 0;\\n\\t for (var i = 0; i < path.length; i++) {\\n\\t var currentPathElement = path[i];\\n\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t currentNativeTarget = path[i + 1];\\n\\t }\\n\\t // TODO: slow\\n\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t if (reactParent === currentPathElement) {\\n\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t bookKeeping.ancestors.push(currentPathElement);\\n\\n\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t eventsFired++;\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n\\t // Jump to the root of this React render tree\\n\\t while (currentPathElementID !== newRootID) {\\n\\t i++;\\n\\t currentPathElement = path[i];\\n\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t }\\n\\t }\\n\\t }\\n\\t if (eventsFired === 0) {\\n\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t }\\n\\t}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n var path = bookKeeping.nativeEvent.path;\\n var currentNativeTarget = path[0];\\n var eventsFired = 0;\\n for (var i = 0; i < path.length; i++) {\\n var currentPathElement = path[i];\\n if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n currentNativeTarget = path[i + 1];\\n }\\n // TODO: slow\\n var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n if (reactParent === currentPathElement) {\\n var currentPathElementID = ReactMount.getID(currentPathElement);\\n var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n bookKeeping.ancestors.push(currentPathElement);\\n\\n var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n eventsFired++;\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\n // Jump to the root of this React render tree\\n while (currentPathElementID !== newRootID) {\\n i++;\\n currentPathElement = path[i];\\n currentPathElementID = ReactMount.getID(currentPathElement);\\n }\\n }\\n }\\n if (eventsFired === 0) {\\n ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n }\\n}\",\n \"function handleTopLevelWithPath(bookKeeping) {\\n\\t\\t var path = bookKeeping.nativeEvent.path;\\n\\t\\t var currentNativeTarget = path[0];\\n\\t\\t var eventsFired = 0;\\n\\t\\t for (var i = 0; i < path.length; i++) {\\n\\t\\t var currentPathElement = path[i];\\n\\t\\t if (currentPathElement.nodeType === DOCUMENT_FRAGMENT_NODE_TYPE) {\\n\\t\\t currentNativeTarget = path[i + 1];\\n\\t\\t }\\n\\t\\t // TODO: slow\\n\\t\\t var reactParent = ReactMount.getFirstReactDOM(currentPathElement);\\n\\t\\t if (reactParent === currentPathElement) {\\n\\t\\t var currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t\\t var newRootID = ReactInstanceHandles.getReactRootIDFromNodeID(currentPathElementID);\\n\\t\\t bookKeeping.ancestors.push(currentPathElement);\\n\\t\\t\\n\\t\\t var topLevelTargetID = ReactMount.getID(currentPathElement) || '';\\n\\t\\t eventsFired++;\\n\\t\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, currentPathElement, topLevelTargetID, bookKeeping.nativeEvent, currentNativeTarget);\\n\\t\\t\\n\\t\\t // Jump to the root of this React render tree\\n\\t\\t while (currentPathElementID !== newRootID) {\\n\\t\\t i++;\\n\\t\\t currentPathElement = path[i];\\n\\t\\t currentPathElementID = ReactMount.getID(currentPathElement);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (eventsFired === 0) {\\n\\t\\t ReactEventListener._handleTopLevel(bookKeeping.topLevelType, window, '', bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));\\n\\t\\t }\\n\\t\\t}\",\n \"function nH(e){if (window.event){var e = window.event;var elm = e.srcElement;}else{var elm = e.target;};return elm}\",\n \"function makeNativeSimulator(eventType) {\\n\\t return function (domComponentOrNode, nativeEventData) {\\n\\t var fakeNativeEvent = new Event(eventType);\\n\\t _assign(fakeNativeEvent, nativeEventData);\\n\\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n\\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t } else if (domComponentOrNode.tagName) {\\n\\t // Will allow on actual dom nodes.\\n\\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t }\\n\\t };\\n\\t}\",\n \"function makeNativeSimulator(eventType) {\\n\\t return function (domComponentOrNode, nativeEventData) {\\n\\t var fakeNativeEvent = new Event(eventType);\\n\\t _assign(fakeNativeEvent, nativeEventData);\\n\\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n\\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t } else if (domComponentOrNode.tagName) {\\n\\t // Will allow on actual dom nodes.\\n\\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t }\\n\\t };\\n\\t}\",\n \"function makeNativeSimulator(eventType) {\\n\\t return function (domComponentOrNode, nativeEventData) {\\n\\t var fakeNativeEvent = new Event(eventType);\\n\\t _assign(fakeNativeEvent, nativeEventData);\\n\\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n\\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t } else if (domComponentOrNode.tagName) {\\n\\t // Will allow on actual dom nodes.\\n\\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t }\\n\\t };\\n\\t}\",\n \"function makeNativeSimulator(eventType) {\\n\\t return function (domComponentOrNode, nativeEventData) {\\n\\t var fakeNativeEvent = new Event(eventType);\\n\\t _assign(fakeNativeEvent, nativeEventData);\\n\\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n\\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t } else if (domComponentOrNode.tagName) {\\n\\t // Will allow on actual dom nodes.\\n\\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t }\\n\\t };\\n\\t}\",\n \"function makeNativeSimulator(eventType) {\\n\\t return function (domComponentOrNode, nativeEventData) {\\n\\t var fakeNativeEvent = new Event(eventType);\\n\\t assign(fakeNativeEvent, nativeEventData);\\n\\t if (ReactTestUtils.isDOMComponent(domComponentOrNode)) {\\n\\t ReactTestUtils.simulateNativeEventOnDOMComponent(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t } else if (domComponentOrNode.tagName) {\\n\\t // Will allow on actual dom nodes.\\n\\t ReactTestUtils.simulateNativeEventOnNode(eventType, domComponentOrNode, fakeNativeEvent);\\n\\t }\\n\\t };\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6448155","0.6448155","0.6448155","0.6334827","0.63236046","0.62613595","0.6220223","0.6149863","0.6149863","0.6149863","0.6149863","0.6149863","0.60991025","0.60991025","0.6081894","0.59577334","0.59392864","0.5897346","0.5897346","0.5897346","0.5897346","0.5897346","0.5897346","0.5897346","0.58936983","0.5860765","0.5860765","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.58140564","0.5803405","0.5798378","0.5793863","0.5790576","0.5790576","0.5790576","0.5790576","0.5790576","0.5790576","0.5790576","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.5787424","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.57624465","0.5734145","0.5730016","0.57179475","0.57179475","0.57179475","0.57179475","0.57157725"],"string":"[\n \"0.6448155\",\n \"0.6448155\",\n \"0.6448155\",\n \"0.6334827\",\n \"0.63236046\",\n \"0.62613595\",\n \"0.6220223\",\n \"0.6149863\",\n \"0.6149863\",\n \"0.6149863\",\n \"0.6149863\",\n \"0.6149863\",\n \"0.60991025\",\n \"0.60991025\",\n \"0.6081894\",\n \"0.59577334\",\n \"0.59392864\",\n \"0.5897346\",\n \"0.5897346\",\n \"0.5897346\",\n \"0.5897346\",\n \"0.5897346\",\n \"0.5897346\",\n \"0.5897346\",\n \"0.58936983\",\n \"0.5860765\",\n \"0.5860765\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.58140564\",\n \"0.5803405\",\n \"0.5798378\",\n \"0.5793863\",\n \"0.5790576\",\n \"0.5790576\",\n \"0.5790576\",\n \"0.5790576\",\n \"0.5790576\",\n \"0.5790576\",\n \"0.5790576\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.5787424\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.57624465\",\n \"0.5734145\",\n \"0.5730016\",\n \"0.57179475\",\n \"0.57179475\",\n \"0.57179475\",\n \"0.57179475\",\n \"0.57157725\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":74199,"cells":{"query":{"kind":"string","value":"Return whether a native keypress event is assumed to be a command. This is required because Firefox fires `keypress` events for key commands (cut, copy, selectall, etc.) even though no character is inserted."},"document":{"kind":"string","value":"function isKeypressCommand(nativeEvent) {\n return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}","function isKeypressCommand(nativeEvent) {\r\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\r\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\r\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\r\n\t}","function isKeypressCommand(nativeEvent) {\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) && !(nativeEvent.ctrlKey && nativeEvent.altKey);\n}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\n\t}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}","function isKeypressCommand(nativeEvent) {\n return (\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\n );\n}"],"string":"[\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (\\n\\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n\\t );\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\r\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\r\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\r\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\r\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) && !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n\\t return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n\\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n\\t !(nativeEvent.ctrlKey && nativeEvent.altKey);\\n\\t}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\",\n \"function isKeypressCommand(nativeEvent) {\\n return (\\n (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\\n // ctrlKey && altKey is equivalent to AltGr, and is not a command.\\n !(nativeEvent.ctrlKey && nativeEvent.altKey)\\n );\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.80167186","0.80167186","0.80167186","0.80167186","0.80167186","0.80167186","0.80167186","0.80084205","0.7999546","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7998441","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501","0.7977501"],"string":"[\n \"0.80167186\",\n \"0.80167186\",\n \"0.80167186\",\n \"0.80167186\",\n \"0.80167186\",\n \"0.80167186\",\n \"0.80167186\",\n \"0.80084205\",\n \"0.7999546\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7998441\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\",\n \"0.7977501\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":741,"numItemsPerPage":100,"numTotalItems":82052,"offset":74100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NjEzMDI4NCwianRpIjoiNzZmNWVjNDEtYzhhOC00MDk4LThlYTAtZTEwNjc1MTc4ZWI3Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhc2NyaXB0LXYxIiwiZXhwIjoxNzg2MTMzODg0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.S6KHMCnlmp4HCxkIN0rMROprUA_MOMm1LNF1TH4bcJHmSAdAUHMCuA-neKLNk10EUTPYgPJ5dTxiA4eimfcGAg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":82052,"numBytesParquet":1713312505}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
Search is not available for this dataset
query stringlengths 7 355k | document stringlengths 9 341k | metadata dict | negatives listlengths 0 101 | negative_scores listlengths 0 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
Function to calculate final score | function CalculateScore(score, homeworkCount) {
let submittedHW = homeworkCount / this.presentations.length;
let result = score * 3 + submittedHW;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function calculateFinalScore() {\n finalScore = Crafty(\"Score\")._score; // Accesses the Score entity. This requires there to be only one score entity at a time. \n metrics.set(\"finalScore\", finalScore);\n}",
"function calculateTotalScore () {\r\n /* METHOD STUB */\r\n}",
"function update_final_sco... | [
"0.79352653",
"0.74808806",
"0.7302292",
"0.7284277",
"0.7191067",
"0.70747596",
"0.7069892",
"0.70640916",
"0.70553213",
"0.70511216",
"0.6980357",
"0.6943111",
"0.69063896",
"0.6899175",
"0.6896487",
"0.68811625",
"0.68608224",
"0.67925096",
"0.6772747",
"0.676808",
"0.6761... | 0.6672363 | 26 |
Function to compare objects by property finalscore | function compare(student1, student2) {
if (student1.finalscore < student2.finalscore) {
return -1;
}
if (student1.finalscore > student2.finalscore) {
return 1;
}
return 0
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function compare(a, b) {\n return b.score - a.score;\n}",
"function compareObjs(a, b){\n if (a.score > b.score){\n return -1;\n } else if ( a.score < b.score){\n return 1;\n } else {\n return 0;\n }\n}",
"function compare(x, y){\n return x.score - y.score;\n }",
"function compare(a,... | [
"0.7220038",
"0.7165041",
"0.6810334",
"0.65675545",
"0.65515727",
"0.6471839",
"0.6418349",
"0.63756454",
"0.63416487",
"0.6340064",
"0.6124541",
"0.6084593",
"0.6080678",
"0.6077053",
"0.6067057",
"0.5995857",
"0.5990349",
"0.597821",
"0.5959132",
"0.5920109",
"0.59127915",... | 0.67596674 | 3 |
The "Not" SOLUTION elimiated because allows ANYTHING not listed in the dependent properties. 1) push oneOf onto anyOf and create new empty oneOf array 2) create new 'optional' schema and also push it onto anyOf 3) populate optional schema allOf with a 'not' for each member of the original oneOf | fixOptionalChoiceNot(jsonSchema, node) {
const originalOneOf = new JsonSchemaFile();
originalOneOf.oneOf = jsonSchema.oneOf.slice(0);
jsonSchema.anyOf.push(originalOneOf);
const theOptionalPart = new JsonSchemaFile();
jsonSchema.oneOf.forEach(function(option, index, array) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"fixOptionalChoicePropertyDependency(jsonSchema, node) {\n const originalOneOf = new JsonSchemaFile();\n originalOneOf.oneOf = Array.from(jsonSchema.oneOf);\n jsonSchema.anyOf.push(originalOneOf);\n const theOptionalPart = new JsonSchemaFile();\n jsonSchema.oneOf.forEach(function(... | [
"0.72278905",
"0.6569246",
"0.6534929",
"0.57626754",
"0.57360935",
"0.5575363",
"0.5418899",
"0.5402593",
"0.5338816",
"0.5285391",
"0.5222821",
"0.51388353",
"0.5136812",
"0.5120309",
"0.5096512",
"0.5081625",
"0.5046744",
"0.5037802",
"0.50368506",
"0.5006997",
"0.50051916... | 0.76521164 | 0 |
The "Property Depenency" SOLUTION 1) push oneOf onto anyOf and create new empty oneOf array 2) create new 'optional' schema and also push it onto anyOf 3) populate optional schema allOf with a 'not' for each member of the original oneOf | fixOptionalChoicePropertyDependency(jsonSchema, node) {
const originalOneOf = new JsonSchemaFile();
originalOneOf.oneOf = Array.from(jsonSchema.oneOf);
jsonSchema.anyOf.push(originalOneOf);
const theOptionalPart = new JsonSchemaFile();
jsonSchema.oneOf.forEach(function(option, in... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"fixOptionalChoiceNot(jsonSchema, node) {\n const originalOneOf = new JsonSchemaFile();\n originalOneOf.oneOf = jsonSchema.oneOf.slice(0);\n jsonSchema.anyOf.push(originalOneOf);\n const theOptionalPart = new JsonSchemaFile();\n jsonSchema.oneOf.forEach(function(option, index, arr... | [
"0.7319744",
"0.7117131",
"0.65272176",
"0.60550106",
"0.56520355",
"0.5649956",
"0.5437877",
"0.5339148",
"0.5315379",
"0.529031",
"0.52059853",
"0.51803946",
"0.5155045",
"0.51506424",
"0.51393145",
"0.50344056",
"0.50040984",
"0.49771178",
"0.49434978",
"0.49400032",
"0.49... | 0.7239358 | 1 |
singleBarChart is a function called by drawBarChart to draw the chart area for a single bar chart. The function takes in three parameters: data: object with four properties: values, labels, scale, and title (as defined for drawBarChart) options: object with eight properties: width, height, spacing, colour, labelColour,... | function singleBarChart(data, options, element) {
// extracts needed information from data
var values = data.values;
var scale = data.scale;
// extracts needed information from options
var chartWidth = options.width;
var chartHeight = options.height;
var space = options.spacing;
var colour = options.c... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function singleCharts(array) {\n var wBar, elColor;\n\n // Transforming answers in percentage values for single charts and coloring them\n for( i=0; i<array.length; i++) {\n wBar = array[i]*33.33;\n elColor = assignColor(array[i]);\n $('.result-value[data-answer=\"'+(i+1)+'\"]').find(... | [
"0.6524454",
"0.62346333",
"0.61319315",
"0.608345",
"0.6016062",
"0.5950113",
"0.5916212",
"0.5851982",
"0.5845821",
"0.58424866",
"0.5810507",
"0.57719165",
"0.57687485",
"0.57134056",
"0.5710223",
"0.5689678",
"0.5689102",
"0.5667784",
"0.5666508",
"0.5657772",
"0.5638386"... | 0.8171392 | 0 |
stackedBarChart is a function called by drawBarChart to draw the chart area for a stacked bar chart. The function takes in three parameters: data: object with five properties: values, labels, scale, title, and legend (as defined for drawBarChart) options: object with seven properties: width, height, spacing, labelColou... | function stackedBarChart(data, options, element) {
// extracts needed information from data
var values = data.values;
var scale = data.scale;
var legend = data.legend;
// extracts needed information from options
var chartWidth = options.width;
var chartHeight = options.height;
var space = options.spac... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createStackedBars() {\n //manipulate chart data\n chart.data.forEach(function(d) {\n //set first y value\n var y0 = 0;\n\n //set series\n d.values = axis.serieNames.map(function(name) {\n //set value objec... | [
"0.7348736",
"0.70619696",
"0.67652744",
"0.6759999",
"0.66592455",
"0.6576328",
"0.6548318",
"0.6509565",
"0.64895177",
"0.6407146",
"0.6300988",
"0.62215704",
"0.6205661",
"0.6186884",
"0.6179971",
"0.6116541",
"0.611118",
"0.61039746",
"0.6102327",
"0.6101192",
"0.60309696... | 0.8084221 | 0 |
drawXlabels is a function called by drawBarChart to draw the X axis labels for a bar chart. The function takes in three parameters: labels: array of strings representing the labels associated with each value to be displayed on the Xaxis options: object with eight properties: width, height, spacing, colour, labelColour,... | function drawXlabels(labels, options, element) {
// extracts needed information from options
var chartWidth = options.width;
var chartHeight = options.height;
var space = options.spacing;
// determines the width of the bars displayed
var barWidth = (chartWidth / labels.length) - space;
// creates the l... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function drawXAxis(labels) {\n paper.leonardo.hLine(plotArea.x, plotArea.y + plotArea.height, plotArea.width);\n\n // TODO: Get rid of magic number. Base labelText on font size.\n var labelY = plotArea.y + plotArea.height,\n labelTextY = labelY + (2 * opts.tickSize);\n\n plot... | [
"0.6941435",
"0.68144256",
"0.64335173",
"0.6410791",
"0.6227759",
"0.6153292",
"0.60808617",
"0.60734314",
"0.5860482",
"0.5813109",
"0.5799382",
"0.57330227",
"0.5689548",
"0.56673825",
"0.5614415",
"0.5596643",
"0.5564148",
"0.5540618",
"0.54914796",
"0.54555374",
"0.54474... | 0.8319586 | 0 |
drawYlabels is a function called by drawBarChart to draw the Y axis labels for a bar chart. The function takes in three parameters: data: object with four properties: values, labels, scale, and title (as defined for drawBarChart) chartHeight: positive integer representing the height of the chart area (excluding titles,... | function drawYlabels(data, chartHeight, element) {
// extracts scale from data
var scale = data.scale;
// determines the maximum value to be displayed on the Y axis of the chart
var maxY = findMaxY(data.values, scale);
// creates the label area that the labels are rendered to
var labelArea = $("<div>").a... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function drawYAxis() {\n paper.leonardo.vLine(plotArea.x, plotArea.y, plotArea.height);\n\n // TODO: Get rid of magic number. Base text on font size instead.\n var valueX = plotArea.x - opts.tickSize,\n valueTextX = plotArea.x - (3 * opts.tickSize);\n\n plot(scaleValues, func... | [
"0.6328172",
"0.5990655",
"0.59508246",
"0.5946217",
"0.5908815",
"0.5877695",
"0.58268535",
"0.57933664",
"0.57480985",
"0.57398146",
"0.57336324",
"0.5724476",
"0.57226807",
"0.5703542",
"0.56823653",
"0.56811285",
"0.56704915",
"0.56646746",
"0.56460905",
"0.56331867",
"0.... | 0.80711985 | 0 |
drawTitle is a function called by drawBarChart to draw the title for a bar chart. The function takes in three parameters: text: string representing the title to be displayed on the top of the bar chart options: object with eight properties: width, height, spacing, colour, labelColour, labelAlign, titleColour, and title... | function drawTitle(text, options, element) {
// extracts needed information from options
var chartWidth = options.width;
var colour = options.titleColour;
var size = options.titleSize;
// creates the title area that the text is rendered to
var title = $("<div>").attr("id", "titleArea");
$(element).appen... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function chartTitle(options) {\n var titletext = $(\"<h1></h1>\").text(options.charttitle);\n titletext.attr(\"id\", \"title\");\n $(\"#chartcontainer\").append(titletext);\n $(\"#title\").css({\n \"color\": options.titlefontcolor,\n \"font-size\" : options.titlefontsize,\n ... | [
"0.7256478",
"0.66021353",
"0.6508898",
"0.6492384",
"0.6488951",
"0.64387745",
"0.64301956",
"0.63747346",
"0.6368756",
"0.62814546",
"0.62808037",
"0.6260691",
"0.6250618",
"0.6114404",
"0.6091807",
"0.60602045",
"0.6014662",
"0.5975336",
"0.5951206",
"0.5922305",
"0.588330... | 0.77159745 | 0 |
drawLegend is a function called by drawBarChart to draw the legend for a stacked bar chart. The function takes in three parameters: legend: array of arrays of length two, where the first element is a string representing the key to be displayed in the legend for that stack, and the second element is a string representin... | function drawLegend(legend, options, element) {
// extracts needed information from options
var chartWidth = options.width;
var chartHeight = options.height;
// creates the legend area that the legend keys are rendered to
var legendArea = $("<div>").attr("id", "legendArea");
$(element).append(legendArea);... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_drawLegend() {\n if (this.displayOptions.legend.position !== scada.chart.AreaPosition.NONE) {\n const layout = this._chartLayout;\n const legend = this.displayOptions.legend;\n\n let trendCnt = this.chartData.trends.length;\n let lineCnt = Math.ceil(trendCnt / le... | [
"0.70936537",
"0.6717181",
"0.6473795",
"0.6315697",
"0.62884957",
"0.6273823",
"0.6258947",
"0.62422323",
"0.6214754",
"0.62035894",
"0.6177152",
"0.6161412",
"0.6160108",
"0.61598015",
"0.6055169",
"0.6052139",
"0.6051951",
"0.60513383",
"0.6050245",
"0.6030987",
"0.6020648... | 0.69450855 | 1 |
drawBarChart is the main function called by the user to create the bar chart. The function takes in three parameters: data: object with four to five mandatory properties: values: can be an array of numbers[>=0] representing the values of the bars, or an array of arrays of numbers[>=0] where each array represents a bar ... | function drawBarChart(data, options, element) {
// adds default values to any options that were not specified by the user
if (!("width" in options)) {
options.width = 500;
}
if (!("height" in options)) {
options.height = 300;
}
if (!("spacing" in options)) {
options.spacing = 5;
}
if (!("co... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function stackedBarChart(data, options, element) {\n\n // extracts needed information from data\n var values = data.values;\n var scale = data.scale;\n var legend = data.legend;\n\n // extracts needed information from options\n var chartWidth = options.width;\n var chartHeight = options.height;\n var space... | [
"0.8280014",
"0.81113636",
"0.8036458",
"0.8032903",
"0.800979",
"0.793019",
"0.75704026",
"0.75563854",
"0.75314385",
"0.74991995",
"0.74809635",
"0.7468579",
"0.7443469",
"0.7431311",
"0.74003935",
"0.7373022",
"0.736309",
"0.73491055",
"0.734193",
"0.73372656",
"0.7329105"... | 0.8142126 | 1 |
Create data if it does not exist | async function createItem(itemBody) {
try {
// read the item to see if it exists
const { item } = await client.database(databaseId).container(containerId).item(itemBody.id).read();
console.log(`Item with id ${itemBody.id} already exists\n`);
}
catch (error) {
// create the data... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Create(data) {\n if (data) {\n this.setData(data);\n }\n }",
"function createDataFolder(){\t\n\tif(!fs.existsSync('./data')){\n\tconsole.log('Creating data folder');\n\tfs.mkdirSync('./data');\n\t}\n}",
"addNew(data) {\n\t\tlet db = this.db;\n\n\t\treturn new Promise((resol... | [
"0.6457741",
"0.6352754",
"0.6304419",
"0.6248857",
"0.61062425",
"0.60740745",
"0.60729754",
"0.6040731",
"0.59249145",
"0.5893052",
"0.5892524",
"0.5886107",
"0.5858743",
"0.58276933",
"0.5811416",
"0.5792403",
"0.57917625",
"0.5773008",
"0.5768242",
"0.57578707",
"0.574476... | 0.5302253 | 87 |
Exit the app with a prompt | function exit(message) {
console.log(message);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function onExitAlertOkClick() {\n app.exit();\n }",
"function quit() {\n inquirer.prompt([\n {\n type: \"confirm\",\n name: \"menu\",\n message: \"Would you like to go back to the main menu?\"\n }\n ]).then(function (arg) {\n if (arg.m... | [
"0.7515867",
"0.7274055",
"0.69792604",
"0.69223595",
"0.6917811",
"0.69139224",
"0.6868203",
"0.68517786",
"0.6816754",
"0.6792203",
"0.6790188",
"0.6758237",
"0.6743373",
"0.6724784",
"0.66841507",
"0.66613114",
"0.663064",
"0.661929",
"0.65894586",
"0.6570822",
"0.6570822"... | 0.61252993 | 65 |
create a new array of data | function gotData(incomingData){
let newData = [];
for(let i=0;i<incomingData.length-1;i++){
let datapoint = incomingData[i];
for(let q=0;q<datapoint.timeone+1;q++){
newData.push({date:dateConverter(datapoint.date), app:"WeChat"})
}
for(let j=0;j<datapoint.timetwo+1;j++){
newData.push({da... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createNewData(data){\n var newData = [];\n for (i = 0; i < data.length; i++) {\n for (j = 0; j < data[i].devices.length; j++) {\n newData.push({\n depName: data[i].depname,\n divName: data[i].devices[j].name,\n ip: data[i].devices[j].ip,... | [
"0.69666666",
"0.68432564",
"0.674323",
"0.66326416",
"0.6569593",
"0.6488327",
"0.6418802",
"0.6389963",
"0.6368562",
"0.6269338",
"0.62218344",
"0.61573064",
"0.6144907",
"0.6144907",
"0.61279845",
"0.61279845",
"0.6121644",
"0.6095158",
"0.6068978",
"0.6057279",
"0.6048576... | 0.0 | -1 |
assign positions to the dots | function yPosition(d,i){
return Math.floor(i/100)*11+60
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function initializeDots() {\n return [new Posn(0, 0), new Posn(0, 1), new Posn(0, 3), new Posn(0, 4), new Posn(0, 5), new Posn(0, 6),\n new Posn(0, 7), new Posn(0, 19), new Posn(0, 20), new Posn(0, 21), new Posn(0, 25), new Posn(0, 26),\n new Posn(0, 27), new Posn(0, 28), new Posn(1, 0), new Posn(1, 4), n... | [
"0.76185966",
"0.7376864",
"0.7035323",
"0.68570447",
"0.6757456",
"0.6757456",
"0.6757456",
"0.67453253",
"0.6744592",
"0.6711782",
"0.6709362",
"0.6703391",
"0.66708255",
"0.6624323",
"0.66171247",
"0.6609534",
"0.6563892",
"0.6531351",
"0.6477053",
"0.6455736",
"0.6446774"... | 0.0 | -1 |
GET TESTIMONIES FOR SINGLE USER ===================================== | function getUserTestimonies(options) {
const { authToken, onSuccess, onError } = options;
$.ajax({
type: 'GET',
url: '/api/testimonies/user',
contentType: 'application/json',
dataType: 'json',
data: undefined,
beforeSend: function (xhr) {
xhr.setReques... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getUsers() {\n let url = 'https://itrex-react-lab-files.s3.eu-central-1.amazonaws.com/react-test-api.json';\n return fetch(url)\n .then((resp) => resp.json())\n .then(mainFunc)\n .catch(err => alert('Failed to load data.'));\n }",
"function getUsers() {\... | [
"0.61510074",
"0.6070518",
"0.6070273",
"0.59467876",
"0.5943548",
"0.5855809",
"0.5844485",
"0.5841076",
"0.58386934",
"0.5820112",
"0.5810383",
"0.5761252",
"0.57555485",
"0.57517475",
"0.5739406",
"0.57357895",
"0.57259816",
"0.5725838",
"0.5723641",
"0.5709115",
"0.570514... | 0.6216501 | 0 |
GET ALL TESTIMONIES ========================================= | function getAllTestimonies(options) {
const onSuccess = options.onSuccess;
const onError = options.onError;
$.ajax({
type: 'GET',
url: '/api/testimonies/',
contentType: 'application/json',
dataType: 'json',
data: undefined,
success: onSuccess,
error: e... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static getAllTests() {\n return [\n CalculatorTest.test01,\n CalculatorTest.test02,\n CalculatorTest.test03,\n CalculatorTest.test04,\n CalculatorTest.test05,\n CalculatorTest.test06,\n CalculatorTest.test07,\n CalculatorTest.test08,\n CalculatorTest.test09\n ];\n... | [
"0.7374177",
"0.65604204",
"0.65359867",
"0.6376098",
"0.6376098",
"0.6376098",
"0.6376098",
"0.6376098",
"0.6376098",
"0.63326955",
"0.62825304",
"0.627329",
"0.62562174",
"0.6204884",
"0.62035704",
"0.6175357",
"0.6175357",
"0.6156605",
"0.6142867",
"0.6071675",
"0.5963138"... | 0.6822369 | 1 |
GET SINGLE TESTIMONY ========================================= | function getTestimonyByID(options) {
const { testimonyID, onSuccess } = options;
$.getJSON(`/api/testimonies/${testimonyID}`, onSuccess);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"getTest() {\n return rp({\n method: 'get',\n url: this.url,\n json: true,\n });\n }",
"function get_testimony($http, api_obj) {\n\treturn load_sheet($http, api_obj, \"testimony\")\n\t.then((res) => {\n\t\treturn Promise.resolve(res.data.values)\n\t})\n}",
"static async fetchTestByID(req, ... | [
"0.6450216",
"0.6320264",
"0.58758366",
"0.5730496",
"0.57172054",
"0.5689821",
"0.5659575",
"0.55676585",
"0.5545814",
"0.55324847",
"0.5492024",
"0.54679376",
"0.54654896",
"0.5463894",
"0.54558855",
"0.542995",
"0.5417806",
"0.5417806",
"0.5417806",
"0.5403187",
"0.5398065... | 0.60212314 | 2 |
enable submit button on album form | function enableSubmit() {
$('#submit-album-btn').prop("disabled",false);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function submitClick() {\n updateDBUser(currentUser.email, newName, newCountry, pictureIndex);\n setShowForm(!showForm);\n }",
"enableSubmit() {\n\t\tlet enabled = this.project.name.length > 0 && this.project.id.length > 0 && this.project.platforms.length > 0 && this.state.locationExists === false;\n\t\ti... | [
"0.661437",
"0.6471868",
"0.64616126",
"0.6387481",
"0.6316212",
"0.6275799",
"0.6231636",
"0.6221022",
"0.6196667",
"0.6177707",
"0.6161547",
"0.6149847",
"0.6129447",
"0.6124014",
"0.6118316",
"0.6092078",
"0.6081403",
"0.6068091",
"0.60324377",
"0.6032384",
"0.6017762",
... | 0.7854596 | 0 |
This function draws a point if the element is a polyline or polygon Otherwise it will just stop drawing the shape cause we are done | point(event) {
if (this.point != this.start) return this.start(event);
if (this.pointPlugin) {
return this.pointPlugin(event);
}
// If this function is not overwritten we just call stop
this.stop(event);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"startPoly() {\n if (this.currentPath) {\n var points = this.currentPath.points;\n var len = this.currentPath.points.length;\n if (len > 2) {\n this.drawShape(this.currentPath);\n this.currentPath = new Polygon_1.Polygon();\n this.... | [
"0.6698198",
"0.6615977",
"0.64852315",
"0.6182615",
"0.61352795",
"0.61269295",
"0.6124943",
"0.6091639",
"0.6051183",
"0.5978315",
"0.5892667",
"0.5873334",
"0.5834595",
"0.580118",
"0.5794556",
"0.57808536",
"0.5768684",
"0.5721957",
"0.5684394",
"0.567504",
"0.56207526",
... | 0.0 | -1 |
The stopfunction does the cleanup work | stop(event) {
if (event) {
// console.log('stop after update')
this.update(event);
}
// Plugin may want to clean something
// if (this.clean) { this.clean(); }
// Unbind from all events
off(window, 'mousemove.draw');
this.parent.off('click.draw');
// remove Refernce to Pai... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"stop() {}",
"Stop() {}",
"function stop() {\n\t\tif (!_stopFn) return;\n\t\t_stopFn();\n\t}",
"function stop () {\n stopped = true\n }",
"function stop() {\n\t\trunning = false;\n\t}",
"stop() {\n this.finishAll();\n }",
"function stop(){\r\n\tstopped = 1;\r\n}",
"function stop() {\n ... | [
"0.78866065",
"0.786397",
"0.76721996",
"0.75771487",
"0.75568306",
"0.7537683",
"0.74485254",
"0.7413554",
"0.73702955",
"0.731755",
"0.7296443",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7275388",
"0.7231601",... | 0.0 | -1 |
Updates the element while moving the cursor | update(event) {
if (!event && this.lastUpdateCall) {
event = this.lastUpdateCall;
}
this.lastUpdateCall = event;
// Get the current transform matrix
// it could have been changed since the start or the last update call
this.m = this.el.node.getScreenCTM().inverse();
// Call the calc... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function updateCursor() {\n var start, end, x, y, i, el, cls;\n\n if (typeof cursor === 'undefined') {\n return;\n }\n\n if (cursor.getAttribute('id') !== 'cursor') {\n return;\n }\n\n start = input.selectionStart;\n end = input.selectionEnd;\n... | [
"0.6972675",
"0.68886364",
"0.66630423",
"0.65216756",
"0.6503179",
"0.6451265",
"0.643763",
"0.6423895",
"0.6360906",
"0.63202333",
"0.62920934",
"0.6265541",
"0.6239728",
"0.62364495",
"0.62364495",
"0.62364495",
"0.62364495",
"0.6216527",
"0.6213517",
"0.6192209",
"0.61805... | 0.0 | -1 |
Called from outside. Finishs a polyelement | done() {
this.calc();
this.stop();
this.el.fire('drawdone');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"finishPoly() {\n if (this.currentPath) {\n if (this.currentPath.points.length > 2) {\n this.drawShape(this.currentPath);\n this.currentPath = null;\n }\n else {\n this.currentPath.points.length = 0;\n }\n }\n ... | [
"0.6929323",
"0.57591784",
"0.56620955",
"0.5634908",
"0.56319076",
"0.5442637",
"0.5417457",
"0.5391076",
"0.53871363",
"0.537748",
"0.5274479",
"0.5193413",
"0.5183905",
"0.51766956",
"0.5101",
"0.5100963",
"0.50879025",
"0.5079805",
"0.50612426",
"0.50605536",
"0.5056796",... | 0.0 | -1 |
Called from outside. Cancels a polyelement | cancel() {
// stop drawing and remove the element
this.stop();
this.el.remove();
this.el.fire('drawcancel');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function cancel() {\r\n click(getCancel());\r\n waitForElementToDisappear(getCancel());\r\n }",
"function cancelout() {\n setAddResponse(null);\n setchosenmed(null);\n setExistingPrescription(null);\n }",
"function cancel() {\n\t\t\tfocusedControl.fire('cancel');\n\t\t}",... | [
"0.6505635",
"0.64975923",
"0.6433165",
"0.6433165",
"0.6433165",
"0.6396242",
"0.63938737",
"0.6274279",
"0.62225056",
"0.62104756",
"0.6210074",
"0.6172707",
"0.6172707",
"0.6145023",
"0.6115819",
"0.6088657",
"0.60852784",
"0.60793626",
"0.60571337",
"0.6052543",
"0.603493... | 0.6600604 | 0 |
Calculate the corrected position when using `snapToGrid` | snapToGrid(draw) {
var temp = null;
// An array was given. Loop through every element
if (draw.length) {
temp = [draw[0] % this.options.snapToGrid, draw[1] % this.options.snapToGrid];
draw[0] -= temp[0] < this.options.snapToGrid / 2 ? temp[0] : temp[0] - this.options.snapToGrid;
draw[1] ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_makeRelativeSnap() {\n let [x, y] = this._makeRelative.apply(this, arguments);\n\n let grid = this.context.getGrid();\n if (grid) {\n let roundX = round(this.scale.toStepsX(x), grid);\n let roundY = round(this.scale.toStepsY(y), grid);\n x = this.scale.toDista... | [
"0.71617174",
"0.6600336",
"0.6564821",
"0.65517867",
"0.6373837",
"0.6362052",
"0.6335802",
"0.632046",
"0.6288081",
"0.6271607",
"0.608728",
"0.60575813",
"0.6053469",
"0.6051766",
"0.60367453",
"0.6018786",
"0.6016023",
"0.5982308",
"0.5943089",
"0.5880111",
"0.5873929",
... | 0.6093437 | 10 |
Draw element with mouse | draw(event, options, value) {
// sort the parameters
if (!(event instanceof Event || typeof event === 'string')) {
options = event;
event = null;
}
// get the old Handler or create a new one from event and options
const paintHandler = this.remember('_paintHandler') || new PaintHandler(... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function click(){\n rect = leinwand.getBoundingClientRect();\n mouseX = event.clientX - rect.left;\n mouseY = event.clientY - rect.top;\n //draw();\n //context.fillStyle();\n context.fillRect(mouseX, mouseY, 40, 40);\n }",
"function drawOnMouse(){\n ctx.fillRect(\n mouseX - 5,\n mouseY ... | [
"0.72090214",
"0.71778446",
"0.7174979",
"0.71172184",
"0.7073941",
"0.7019194",
"0.6986255",
"0.6986255",
"0.69264317",
"0.6908139",
"0.6882456",
"0.6882456",
"0.6875656",
"0.6839987",
"0.6783776",
"0.67708814",
"0.67556036",
"0.6753547",
"0.6728096",
"0.6727338",
"0.6724561... | 0.0 | -1 |
Add to list from map info window | function addToList(button){
let locationId = button.getAttribute('data-location-id');
console.log(locationId);
$.post({
url: '/api/add_to_list',
data: {location_id: locationId},
success: function(){
console.log('Add to list returned success code.');
window.location.href = "/adventu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function showOverlays()\n{\n setAllMap(map);\n}",
"function showOverlays() {\n setAllMap(map);\n}",
"function addMarkers() {\r\n map = plugin.google.maps.Map.getMap(div)\r\n $.when(map.clear()).done(function() {\r\n map.clear()\r\n //get map bounds\r\n latLngBounds = map.getVisibleRe... | [
"0.681463",
"0.67648983",
"0.6722684",
"0.6716678",
"0.6696838",
"0.66666",
"0.6655793",
"0.66214323",
"0.6601839",
"0.6601839",
"0.6601839",
"0.65690017",
"0.65632594",
"0.6557657",
"0.6551586",
"0.654298",
"0.6529947",
"0.65159565",
"0.6501827",
"0.6499274",
"0.6499274",
... | 0.0 | -1 |
A function for changing a string to TitleCase | function toTitleCase(str){
return str.replace(/\w+/g, function(txt){return txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase();});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function titlecase(str){\n return str.replace(/\\w\\S*/g, function(txt){return txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase();});\n}",
"function toTitleCase(str)\n{\nreturn str.replace(/\\w\\S*/g, function(txt){ return txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase(); });\n}",
"function ... | [
"0.89270747",
"0.88591623",
"0.8835309",
"0.87953866",
"0.8784959",
"0.8784959",
"0.8784959",
"0.8784959",
"0.8784959",
"0.8784708",
"0.8778871",
"0.8773077",
"0.8764918",
"0.8745826",
"0.8745826",
"0.8745826",
"0.8745826",
"0.87431294",
"0.8734439",
"0.8726667",
"0.87238",
... | 0.8723899 | 20 |
figure out which transitionEnd listener to use by using all of them on a created element and see which one doesn't return undefined. | function transEventEnd(){
var tr;
var elem = document.createElement('tempElement');
var transListener = {
'transition':'transitionend',
'OTransition':'oTransitionEnd',
'MozTransition':'transitionend',
'WebkitTransition':'webkitTransitionEnd'
}
for (... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function transitionEndEventName() {\n\t\tvar i,\n\t\t\tundefined,\n\t\t\tel = document.createElement('div'),\n\t\t\ttransitions = {\n\t\t\t\t'transition':'transitionend',\n\t\t\t\t'OTransition':'otransitionend', // oTransitionEnd in very old Opera\n\t\t\t\t'MozTransition':'transitionend',\n\t\t\t\t'WebkitTransiti... | [
"0.7094879",
"0.6875296",
"0.6875296",
"0.68568057",
"0.680716",
"0.680716",
"0.679403",
"0.6790525",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.67370033",
"0.673... | 0.72229683 | 0 |
Send datas to content script | function Exec( name, content ) {
document.dispatchEvent(
new CustomEvent( name, {
detail: content
} )
);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function sendDataToContentScript(data)\n{\n if(isSecure && secureTabId)\n {\n chrome.tabs.sendMessage(secureTabId, {type: \"submit_data\", data: data});\n }\n}",
"function networkSend(){\nchrome.tabs.executeScript(null, {file: \"content.js\"});\n}",
"function sendData(name, content) {\n localStor... | [
"0.69766515",
"0.65481055",
"0.63401747",
"0.6099733",
"0.60791963",
"0.59164995",
"0.5875897",
"0.58477527",
"0.5798767",
"0.5798287",
"0.5792022",
"0.5773747",
"0.5742457",
"0.5728426",
"0.5696634",
"0.5670924",
"0.56590897",
"0.56287533",
"0.5615986",
"0.56008476",
"0.5585... | 0.0 | -1 |
Modal save current raffle template | function ExecSaveRaffle() {
let obj = {
message: [ CKEDITOR.instances[ "rafflemessage" ].getData(), CKEDITOR.instances[ "puzzle-rafflemessage" ].getData() ],
entmsg: [ CKEDITOR.instances[ "enteredmessage" ].getData(), CKEDITOR.instances[ "puzzle-enteredmessage" ].getData() ]
};
console.log... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function openSave () {\n $('#saveTemplate').modal('show');\n }",
"function openSave () {\n $('#saveTemplate').modal('show');\n }",
"function SaveCustomTemplate( ) {\n\t\t\t\t//get short-codes for current elements\n\t\t\t\tvar content = oxoParser.parseColumnOptions();\n\t\t\t... | [
"0.72853845",
"0.72853845",
"0.676944",
"0.6240794",
"0.62399215",
"0.6238478",
"0.6156985",
"0.61334217",
"0.60300756",
"0.59708136",
"0.59708136",
"0.5925894",
"0.5918717",
"0.5840797",
"0.5808609",
"0.5795438",
"0.578306",
"0.57444304",
"0.5729284",
"0.5694982",
"0.5691898... | 0.0 | -1 |
TODO stream the bigger file, once the Audio DOM interface has `audioSource` | function createNodes(source) {
var nodes = {};
nodes.source = source;
if (context.createBiquadFilter) {
nodes.filter = context.createBiquadFilter();
nodes.filter.type = "lowpass"; // 0 == LOWPASS
}
else {
nodes.filter = context.createLowPass2Filter();
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function AudioInputStream() {\n }",
"function onchangeaudio(selectedaudio) {\n\tvar audio = selectedaudio.files;\n\tvar url = URL.createObjectURL(audio[0]); \n\taudioplayer.src = url;\n}",
"function compressAndStreamWAV() {\n var voiceRequest;\n var reader = new wav.Reader();\n\n reader.on('format', func... | [
"0.63412607",
"0.61945635",
"0.61922216",
"0.61689216",
"0.61461264",
"0.6101655",
"0.59808075",
"0.59500194",
"0.58749175",
"0.58475006",
"0.58404183",
"0.5837052",
"0.5829915",
"0.5818198",
"0.5815721",
"0.58005494",
"0.57959074",
"0.5786718",
"0.57695216",
"0.57680154",
"0... | 0.0 | -1 |
break symbol Array ctor $a(): Build a new array up to the Infinitymarker on the stack. $a(arr): Convert native array to a "view" of the array. $a(len): Create a new array of length `len` | function $a(a) {
if (!arguments.length) {
for (var i = $j - 1; i >= 0 && $k[i] !== Infinity; i--);
if (i < 0) {
throw new Error('array-marker-not-found');
}
a = $k.splice(i + 1, $j - 1 - i);
$j = i;
} else if (!(a instanceof Array)) {
a = new Array(+arguments[0]);
for (var i = 0, l = a.leng... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function myArray(len){\n\tvar a = [];\n\tfor(var i=0; i<len; i++){\n\t\ta[i] = {val:0};\n\t}\n\ta[len-1].val = 1;\n\treturn a;\n}",
"function Array() {}",
"function makeArray(l) {\n var a = new Array(l + 2);\n a[0] = a[1] = 0;\n return a;\n }",
"function makeArray(l) {\n ... | [
"0.61068135",
"0.6050825",
"0.60073775",
"0.5975154",
"0.5955244",
"0.5947218",
"0.59442914",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
"0.5924219",
... | 0.71434546 | 0 |
dict ctor $d() : look for the Infinity marker on the stack | function $d() {
var d = {};
for (var i = $j - 1; i >= 0 && $k[i] !== Infinity; i -= 2) {
if ($k[i - 1] === Infinity) {
throw new Error('dict-malformed-stack');
}
// Unlike javascript, postscript dict keys differentiate between
// numbers and the string representation of a number.
var k = $k[i - 1... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Infinity() {}",
"function hb(a,b,c){G.call(this,c);this.g=a||0;this.f=void 0===b?Infinity:b}",
"Identifier(path) {\n if (path.node.name !== \"Infinity\") {\n return;\n } // It's a referenced identifier\n\n\n if (path.scope.getBinding(\"Infinity\")) {\n return;\n ... | [
"0.66845036",
"0.5664193",
"0.56636924",
"0.5641014",
"0.5457742",
"0.5431911",
"0.5339356",
"0.52993524",
"0.520975",
"0.5194335",
"0.5194335",
"0.5169613",
"0.5169613",
"0.5169613",
"0.5169613",
"0.5169613",
"0.5100667",
"0.50813913",
"0.5071306",
"0.5059214",
"0.5059214",
... | 0.6523777 | 1 |
string ctor s(number): create zerofilled string of numberlength s(string): make a copy of the string s(uint8[]): make a copy of the string Returns a Uint8Arraystring. | function $s(v) {
var t = typeof v;
if (t === 'number') {
return new Uint8Array(v);
}
if (t !== 'string') {
v = '' + v;
}
var s = new Uint8Array(v.length);
for (var i = 0; i < v.length; i++) {
s[i] = v.charCodeAt(i);
}
return s;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function caml_new_string (s) { return new MlString(0,s,s.length); }",
"function String() {}",
"function _String() {}",
"function newString(str) {\n var dataLength = str.length;\n var ptr = memory_allocate(4 + (dataLength << 1));\n var dataOffset = (4 + ptr) >>> 1;\n checkMem();\n U32[ptr >>> 2... | [
"0.65512764",
"0.65384656",
"0.6493352",
"0.6438736",
"0.64310545",
"0.6430638",
"0.62391776",
"0.62244964",
"0.62244964",
"0.62203056",
"0.62049586",
"0.62030005",
"0.61719877",
"0.61667883",
"0.61667883",
"0.61667883",
"0.61667883",
"0.61667883",
"0.61555624",
"0.61544186",
... | 0.6710594 | 0 |
Primarily designed to convert uint8string to string, but will call the the toString() method on any value. | function $z(s) {
if (s instanceof Uint8Array) {
// Postscript treats nul-char as end of string, even if string is
// longer.
for (var i = 0, l = s.length; i < l && s[i]; i++);
if (i < l) {
return String.fromCharCode.apply(null, s.subarray(0, i));
}
return String.fromCharCode.apply(null, s)
}
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function uint8arrayToString(data) {\n return String.fromCharCode.apply(null, data);\n}",
"function getU8str(u)\r\n{\r\n\tvar str = \"\", s;\r\n\tfor(var i=0; i < 4; i++, u >>>= 8) {\r\n\t\ts = (u & 0xff).toString(16);\r\n\t\tif (s.length < 2) s = \"0\" + s;\r\n\t\tstr += s + (i < 3 ? \",\":\"\");\r\n\t}\r\n\t... | [
"0.7569323",
"0.71365",
"0.7008228",
"0.654101",
"0.64673215",
"0.63940585",
"0.63940585",
"0.63940585",
"0.63940585",
"0.63940585",
"0.63940585",
"0.63741857",
"0.63491744",
"0.63378024",
"0.63378024",
"0.63378024",
"0.63378024",
"0.63378024",
"0.63378024",
"0.63378024",
"0.... | 0.0 | -1 |
Copies source to dest and returns a view of just the copied characters | function $strcpy(dst, src) {
if (typeof dst === 'string') {
dst = $s(dst);
}
if (src instanceof Uint8Array) {
for (var i = 0, l = src.length; i < l; i++) {
dst[i] = src[i];
}
} else {
for (var i = 0, l = src.length; i < l; i++) {
dst[i] = src.charCodeAt(i);
}
}
return src.length < dst... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"copyLetterSal() {\n this.clipboard.copy(this.letterSalutation);\n }",
"function _copy(src, dest) {\n\t if (dest)\n\t Object.keys(dest).forEach(function (key) { return delete dest[key]; });\n\t if (!dest)\n\t dest = {};\n\t return exports.extend(dest, src);\n\t}",
"function _cop... | [
"0.59639215",
"0.594906",
"0.594906",
"0.5914447",
"0.576114",
"0.57599235",
"0.57286644",
"0.5718695",
"0.5707153",
"0.5707153",
"0.5697377",
"0.5696367",
"0.5686911",
"0.5686911",
"0.56570417",
"0.56498295",
"0.55930465",
"0.55560344",
"0.55492",
"0.5532383",
"0.55201674",
... | 0.5610363 | 16 |
Copies source to dest and should (but doesn't) return a view of just the copied elements | function $arrcpy(dst, src) {
for (var i = 0, l = src.length; i < l; i++) {
dst[i] = src[i];
}
dst.length = src.length;
return dst;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _copy(src, dest) {\n\t if (dest)\n\t Object.keys(dest).forEach(function (key) { return delete dest[key]; });\n\t if (!dest)\n\t dest = {};\n\t return exports.extend(dest, src);\n\t}",
"function _copy(src, dest) {\n\t if (dest)\n\t Object.keys(dest).forEach(function (key)... | [
"0.6811945",
"0.6811945",
"0.6615521",
"0.65988123",
"0.6549684",
"0.6524196",
"0.6524196",
"0.65083367",
"0.64447826",
"0.6440313",
"0.637702",
"0.63744634",
"0.6369606",
"0.6369606",
"0.63603836",
"0.6359246",
"0.63465035",
"0.62720096",
"0.6262794",
"0.6256337",
"0.6240383... | 0.0 | -1 |
cvs operator convert a value to its string representation s : string to store into v : any value | function $cvs(s, v) {
var t = typeof v;
if (t == 'number' || t == 'boolean' || v === null) {
v = '' + v;
} else if (t !== 'string') {
v = '--nostringval--';
}
for (var i = 0, l = v.length; i < l; i++) {
s[i] = v.charCodeAt(i);
}
$k[$j++] = i < s.length ? s.subarray(0, i) : s;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function caml_output_value_to_string (v, fl) {\n /* ignores flags... */\n return new MlStringFromArray (caml_output_val (v));\n}",
"function getStringValue(v) {\n if (v === null) {\n return;\n }\n switch (typeof v) {\n case \"boolean\":\n return;\n case \"number\":\n ... | [
"0.6314048",
"0.59774506",
"0.5887817",
"0.5887817",
"0.5887817",
"0.5887817",
"0.5887817",
"0.5887817",
"0.5841134",
"0.5794533",
"0.5787345",
"0.5787345",
"0.5787345",
"0.5787345",
"0.5787345",
"0.5787345",
"0.5787345",
"0.5787345",
"0.56799525",
"0.56799525",
"0.56799525",... | 0.77938837 | 0 |
cvrs operator convert a number to a radix string s : string to store into n : number r : radix | function $cvrs(s, n, r) {
return $strcpy(s, (~~n).toString(r).toUpperCase());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function numtoisbn10($n) {\n $n=string($n);\n $d=0;\n $f=2;\n for ($i=strlen($n)-1;$i>=0;$i--) {\n $d += $n[$i]*$f;\n $f++; \n }\n $d = 11-($d % 11);\n if ($d==11) {$d=\"X\";}\n else {$d=string($d);}\n return strcat(str_pad_left(string($n),9,\"0\"),$d);\n}",
"function sc_symbol2number(s, radix) {\n return ... | [
"0.68046933",
"0.6692697",
"0.6611561",
"0.65985525",
"0.6595234",
"0.6592559",
"0.65682274",
"0.6558951",
"0.65052366",
"0.64718866",
"0.64718866",
"0.6464963",
"0.64624906",
"0.6426156",
"0.6413358",
"0.6406859",
"0.63623035",
"0.63429016",
"0.63429016",
"0.63429016",
"0.63... | 0.0 | -1 |
get operator s : source k : key | function $get(s, k) {
if (s instanceof Uint8Array) {
return s[k];
}
if (typeof s === 'string') {
return s.charCodeAt(k);
}
if (s instanceof Array) {
return s.b[s.o + k];
}
// Must be a dict object : with postscript dict objects, a number key
// is differerent than its string representation. po... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get(){return this[key]}",
"get(){return this[key];}",
"function key(kind, key) {\n \n}",
"function op(name) {\n return operators[name] || that.missingOperator(name);\n /*\n if (operators[name]) {\n operators[name].targetData = target;\n return o... | [
"0.601953",
"0.5946954",
"0.59042346",
"0.5863953",
"0.5816787",
"0.58059686",
"0.5677653",
"0.56373286",
"0.5634495",
"0.56173706",
"0.5604258",
"0.5596205",
"0.5581456",
"0.55599964",
"0.55440784",
"0.5497091",
"0.5497091",
"0.5497091",
"0.54965246",
"0.5475657",
"0.5469109... | 0.51666534 | 58 |
put operator d : dest k : key v : value | function $put(d, k, v) {
if (d instanceof Uint8Array) {
d[k] = v;
} else if (d instanceof Array) {
d.b[d.o + k] = v;
} else if (typeof d == 'object') {
if (k instanceof Uint8Array) {
d[$z(k)] = v;
} else {
d[typeof k == 'number' ? '\uffff' + k : k] = v;
}
} else {
throw 'put-not-writab... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"put(key, val){\n let address = this._hash(key)\n if(!this.data[address]) {\n this.data[address] = [] \n this.data[address].push([key,val]) \n }else{\n // check for duplicate key in the bucket\n // if yes, update the value\n for(le... | [
"0.6360237",
"0.62614197",
"0.604064",
"0.586214",
"0.5825173",
"0.56724143",
"0.56195545",
"0.56001455",
"0.558652",
"0.5582887",
"0.55676365",
"0.55676365",
"0.55676365",
"0.5565727",
"0.55637705",
"0.55424154",
"0.55296695",
"0.55296695",
"0.55296695",
"0.5523955",
"0.5495... | 0.6773761 | 0 |
getinterval operator s : src o : offset l : length | function $geti(s, o, l) {
if (s instanceof Uint8Array) {
return s.subarray(o, o + l);
}
if (s instanceof Array) {
var a = new Array(l);
a.b = s.b; // base array
a.o = s.o + o; // offset into base
return a;
}
// Must be a string
return s.substr(o, l);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Interval(data, id, s, e) {\n\t this.id = id;\n\t this.start = data[s];\n\t this.end = data[e];\n\t this.data = data;\n\n\t if (typeof this.start != 'number' || typeof this.end != 'number') {\n\t throw new Error('start, end must be number. start: ' + this.start + ', end: ' + this.end);\n\t }\n\n\t... | [
"0.5794658",
"0.5404819",
"0.5384319",
"0.5355979",
"0.5331174",
"0.53175795",
"0.52867407",
"0.52585286",
"0.52367705",
"0.521788",
"0.5211399",
"0.51505905",
"0.5147845",
"0.508107",
"0.50782794",
"0.50776166",
"0.5066895",
"0.5062996",
"0.5060415",
"0.505529",
"0.50549877"... | 0.58113116 | 0 |
putinterval operator d : dst o : offset s : src | function $puti(d, o, s) {
if (d instanceof Uint8Array) {
if (typeof s == 'string') {
for (var i = 0, l = s.length; i < l; i++) {
d[o + i] = s.charCodeAt(i);
}
} else {
// When both d and s are the same, we want to copy
// backwards, which works for the general case as well.
for (var i =... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function IntervalPacker(lowerBoundToInt, upperBoundToInt, options) {\n options = options || {};\n\n this._lowerBoundToInt = lowerBoundToInt;\n this._upperBoundToInt = upperBoundToInt;\n this._minGap = options.minGap || 0;\n\n}",
"function VersionedInterval(low, high, min, max, delta) {\n this.interv... | [
"0.5296643",
"0.52739185",
"0.5168763",
"0.516556",
"0.5157757",
"0.5143324",
"0.5133635",
"0.5133635",
"0.5115646",
"0.50997126",
"0.50734514",
"0.4983099",
"0.49701676",
"0.487313",
"0.48417455",
"0.48297626",
"0.4818416",
"0.4813001",
"0.47962177",
"0.4792028",
"0.4772105"... | 0.70688415 | 0 |
search operator string seek search suffix match prefix true %iffound string false%ifnotfound | function $search(str, seek) {
if (!(str instanceof Uint8Array)) {
str = $s(str);
}
var ls = str.length;
// Virtually all uses of search in BWIPP are for single-characters.
// Optimize for that case.
if (seek.length == 1) {
var lk = 1;
var cd = seek instanceof Uint8Array ? seek[0] : seek.charCodeAt... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function indexer(str, find) {\n return str.indexOf(find) > 0 ? str.indexOf(find) : false;\n }",
"search(string, startPosition, callback) {\n if (startPosition == null) {\n startPosition = 0;\n }\n if (typeof startPosition === 'function') {\n callback = startPosition... | [
"0.65863985",
"0.6482484",
"0.6482484",
"0.6470229",
"0.6440412",
"0.6329013",
"0.6248321",
"0.6229802",
"0.62089",
"0.61264765",
"0.60535276",
"0.6031425",
"0.6010612",
"0.5979645",
"0.59784263",
"0.5930576",
"0.5928821",
"0.590665",
"0.58824193",
"0.58573496",
"0.58407843",... | 0.6661214 | 0 |
The callback is omitted when forall is being used just to push onto the stack. | function $forall(o, cb) {
if (o instanceof Uint8Array) {
for (var i = 0, l = o.length; i < l; i++) {
$k[$j++] = o[i];
if (cb && cb() == $b) break;
}
} else if (o instanceof Array) {
// The array may be a view.
for (var a = o.b, i = o.o, l = o.o + o.length; i < l; i++) {
$k[$j++] = a[i];
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function processStack() {\n\n if(stack.length === 0) return cb(null, topLevelItem);\n\n // Pop an item off the stack\n var item = stack.pop();\n\n fn.call(null, item, stack, function(err, result) {\n if(err) return cb(err);\n if(!topLevelItem && result) topLevelItem = result;\n processSt... | [
"0.594469",
"0.58966196",
"0.587919",
"0.58005124",
"0.58005124",
"0.5736809",
"0.5698152",
"0.5619487",
"0.5619487",
"0.56116515",
"0.5594221",
"0.55885005",
"0.5523995",
"0.5514898",
"0.5508116",
"0.54764843",
"0.54021704",
"0.537448",
"0.5369803",
"0.5367029",
"0.5367029",... | 0.0 | -1 |
Initialize the component This method is triggered before rendering the component | init() {
this.isUpdating = false;
this.errors = {};
this.copied = null;
this.isLoading = false;
this.tracks = [];
this.einsteinCategories = [];
this.tempUserName = this.user.lastName;
if (!this.user.firstName) {
this.user.firstName = this.use... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"initialize() {\n this.render();\n }",
"init() {\n this.render();\n }",
"init() {\n this.render();\n }",
"init() {\n if (this.initialised) {\n return;\n }\n\n // Set initialise flag\n this.initialised = true;\n // ... | [
"0.7851538",
"0.7618408",
"0.7618408",
"0.7561023",
"0.7538713",
"0.74438614",
"0.744316",
"0.7329309",
"0.7321069",
"0.7305404",
"0.72738177",
"0.71967775",
"0.71847934",
"0.7129993",
"0.70764035",
"0.70509446",
"0.70509446",
"0.70351547",
"0.70351547",
"0.7032474",
"0.70206... | 0.0 | -1 |
Check if user requires to change his/her name | requireNameChange() {
return ! this.user.name.includes(' ');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function checkName() {\n vmEditPermission.formData.role = bzUtilsSvc.textToSlug(vmEditPermission.formData.role);\n }",
"function checkName() {\n vmAddPermission.formData.role = bzUtilsSvc.textToSlug(vmAddPermission.formData.role);\n }",
"processChangeName() {\n let na... | [
"0.73853296",
"0.72680104",
"0.678207",
"0.66277057",
"0.6602764",
"0.66016847",
"0.6583449",
"0.6520816",
"0.6511001",
"0.6492336",
"0.64918935",
"0.6481905",
"0.6438477",
"0.63564414",
"0.6348563",
"0.63444585",
"0.6326387",
"0.6317132",
"0.62932485",
"0.6293233",
"0.627675... | 0.78111297 | 0 |
Get user academy tracks | async loadTracks() {
if (!Is.empty(this.user.tracks)) {
this.tracks = this.user.tracks;
} else {
this.isLoading = true;
}
let response = await this.meService.tracks();
this.tracks = response.records;
this.isLoading = false;
this.user.up... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"getTracks() {\n let results = [];\n\n if (!this.currentArtist && !this.currentName) {\n for (let i = 0; i < this.tracks.length; ++i) {\n results.push(this.tracks[i].title);\n }\n }\n else {\n if (this.currentArtist) {\n let artistId = _getArtistId();\n\n for (let i =... | [
"0.6464878",
"0.6330576",
"0.6116647",
"0.60962766",
"0.5956806",
"0.59198236",
"0.58805615",
"0.5837956",
"0.57967854",
"0.5779682",
"0.5719124",
"0.56757534",
"0.56674504",
"0.5654168",
"0.56509024",
"0.56487954",
"0.5642476",
"0.55865425",
"0.55289936",
"0.55172026",
"0.55... | 0.56493527 | 15 |
Get user einstein categories | async loadEinsteinCategories() {
if (!Is.empty(this.user.einsteinCategories)) {
this.einsteinCategories = this.user.einsteinCategories;
} else {
this.isLoading = true;
}
let response = await this.meService.einsteinCategories();
this.einsteinCategories = ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function disneyCategories(){\n //fetch get index for attractions\n \n byCategory()\n}",
"function getCategories() {\n\trimer.category.find(function(error, value) {\n\t\tif(error) {\n\t\t\tconsole.log(error)\n\t\t}\n\t\telse {\n\t\t\tconsole.log(value)\n\t\t}\n\t})\n}",
"getCategories() {\n retu... | [
"0.622045",
"0.614861",
"0.6053254",
"0.59916574",
"0.591097",
"0.5861789",
"0.58432126",
"0.58243895",
"0.57073474",
"0.5629876",
"0.56033707",
"0.55908394",
"0.5542604",
"0.55351007",
"0.55327827",
"0.5526451",
"0.5504776",
"0.5440496",
"0.54345465",
"0.54280263",
"0.542739... | 0.63651174 | 0 |
no permite ingresar un vacio Funcion para validar la tarjeta de credito | function isValidCard(input){
// Variable que contiene los numeros invertidos
var array=[];
// Contiene los numeros de posiciones impares y pares
var newArr=[];
//Inicializa la suma en 0
var sum=0;
//Se invierte los números del input y lo almacenamos en array
for(var i=input.length-1;i>=0;i--){
array.push(inp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function checkCreds() {\n checkEmail();\n return false;\n }",
"function ActivaEnvioCert() {\n var valid = true;\n if (!Firmado['certificado']) {\n valid = false;\n }\n if (!Firmado['key']) {\n valid = false;\n }\n if (!$('#checkbox_acep_terms').is(':checked')) {\n... | [
"0.65685517",
"0.63559",
"0.6111784",
"0.60449183",
"0.59453946",
"0.5902944",
"0.58379894",
"0.58261424",
"0.5774132",
"0.5749699",
"0.57336074",
"0.5672657",
"0.5665698",
"0.5662288",
"0.5638239",
"0.56190646",
"0.558483",
"0.55740446",
"0.55656654",
"0.5550954",
"0.5479823... | 0.0 | -1 |
Helper method for defining associations. This method is not a part of Sequelize lifecycle. The `models/index` file will call this method automatically. | static associate(models) {
// define association here
expert_listing.belongsTo(models.expert, { foreignKey: 'idexpert' })
expert_listing.belongsTo(models.topic, { foreignKey: 'idTopic' })
expert_listing.belongsTo(models.customer, { foreignKey: 'idCustomer' })
expert_listing.belongsTo(model... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static associate(models) {\n // define association here\n // This is how Sequelize knows to create \"magic methods\"\n // These are functions that can automatically pull\n // related data.\n // For example: If I have a User object\n // I can call `await user.getContacts()` to get an\n... | [
"0.7641476",
"0.7507344",
"0.7312871",
"0.7306175",
"0.7306175",
"0.7306175",
"0.72937477",
"0.7284903",
"0.7277787",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.72586936",
"0.7... | 0.0 | -1 |
sidenav static content example end | function SidenavComponent(docsGenService, router) {
this.docsGenService = docsGenService;
this.router = router;
this.compAPI = null;
this.compSidenavTable = {
columns: ['Name', 'Type', 'Description'],
rows: [],
};
this.compSidenavLinksMenuTable = {... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function defaultsideBarView(){\n\tvar sidebar = document.getElementById('template5');\n\tvar aside = getSideBar();\n\thtml = sidebar.innerHTML;\n\taside.innerHTML = html;\n}",
"function Sidebar() {\n return _structureBuilder.default.list().title(\"Slick's Slices\").items([// create new sub item\n _structureBui... | [
"0.66148055",
"0.661355",
"0.64401275",
"0.64095676",
"0.6394277",
"0.6394157",
"0.6235357",
"0.6190678",
"0.6186729",
"0.617606",
"0.61698806",
"0.61446685",
"0.609236",
"0.6064085",
"0.60437924",
"0.60207605",
"0.599532",
"0.59694207",
"0.5954343",
"0.59410274",
"0.59390146... | 0.6399723 | 4 |
This has a complexity linear to the value of the code. The assumption is that looking up astral identifier characters is rare. | function isInAstralSet(code, set) {
var pos = 0x10000;
for (var i = 0; i < set.length; i += 2) {
pos += set[i];
if (pos > code) { return false }
pos += set[i + 1];
if (pos >= code) { return true }
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isIdentifierChar(code, astral) {\n if (code < 48) return code === 36;\n if (code < 58) return true;\n if (code < 65) return false;\n if (code < 91) return true;\n if (code < 97) return code === 95;\n if (code < 123) return true;\n if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.test(S... | [
"0.6759799",
"0.6749166",
"0.6749166",
"0.6720713",
"0.6720713",
"0.6720713",
"0.67187804",
"0.67187804",
"0.67187804",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0.66870975",
"0... | 0.0 | -1 |
Test whether a given character code starts an identifier. | function isIdentifierStart(code, astral) {
if (code < 65) { return code === 36 }
if (code < 91) { return true }
if (code < 97) { return code === 95 }
if (code < 123) { return true }
if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }
if (astral === false) {... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isIdentifierStart(code) {\n if (code < 65) return code === 36;\n if (code < 91) return true;\n if (code < 97) return code === 95;\n if (code < 123) return true;\n if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code));\n return isInAstralSet(code, astralId... | [
"0.8720698",
"0.8720698",
"0.8720698",
"0.86982656",
"0.86982656",
"0.86982656",
"0.86982656",
"0.86982656",
"0.86982656",
"0.86982656",
"0.86982656",
"0.86982656",
"0.8518157",
"0.8518157",
"0.8518157",
"0.8511877",
"0.8511877",
"0.8494373",
"0.82230717",
"0.82230717",
"0.81... | 0.84857637 | 27 |
Test whether a given character is part of an identifier. | function isIdentifierChar(code, astral) {
if (code < 48) { return code === 36 }
if (code < 58) { return true }
if (code < 65) { return false }
if (code < 91) { return true }
if (code < 97) { return code === 95 }
if (code < 123) { return true }
if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifie... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isIdentifierChar(code) {\n\t if (code < 48) return code === 36;\n\t if (code < 58) return true;\n\t if (code < 65) return false;\n\t if (code < 91) return true;\n\t if (code < 97) return code === 95;\n\t if (code < 123) return true;\n\t if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.... | [
"0.8051218",
"0.8051218",
"0.8051218",
"0.8051218",
"0.8051218",
"0.8051218",
"0.8051218",
"0.8051218",
"0.8051218",
"0.80078155",
"0.80078155",
"0.80078155",
"0.78380007",
"0.78380007",
"0.78380007",
"0.7782578",
"0.7782578",
"0.7769867",
"0.77178866",
"0.76648295",
"0.76620... | 0.77737 | 27 |
Succinct definitions of keyword token types | function kw(name, options) {
if ( options === void 0 ) options = {};
options.keyword = name;
return keywords$1[name] = new TokenType(name, options)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function kw(name, options) {\n if ( options === void 0 ) options = {};\n\n options.keyword = name\n return keywordTypes[name] = new TokenType(name, options)\n}",
"function kw(name, options) {\n if ( options === void 0 ) options = {};\n\n options.keyword = name\n keywordTypes[name] = tt[\"_\" + name] = new ... | [
"0.7119781",
"0.71091473",
"0.705262",
"0.705262",
"0.70280963",
"0.70280963",
"0.70205903",
"0.7000085",
"0.6955209",
"0.6955209",
"0.6955209",
"0.6955209",
"0.6955209",
"0.6944097",
"0.6944097",
"0.6875176",
"0.6791205",
"0.6578073",
"0.64432263",
"0.6387144",
"0.6342707",
... | 0.70212656 | 14 |
Checks if an object has a property. | function has(obj, propName) {
return hasOwnProperty.call(obj, propName)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function hasProperty(obj, prop) {\n return obj.hasOwnProperty(prop);\n}",
"function checkGivenProperty(obj,property){\n return hasOwnProperty.call(obj,property);\n}",
"function hasProperty (obj, propName) {\n return obj != null && typeof obj === 'object' && (propName in obj);\n }",
"function hasPro... | [
"0.8145994",
"0.8020503",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.80004036",
"0.79782695",
... | 0.74653804 | 53 |
The `getLineInfo` function is mostly useful when the `locations` option is off (for performance reasons) and you want to find the line/column position for a given character offset. `input` should be the code string that the offset refers into. | function getLineInfo(input, offset) {
for (var line = 1, cur = 0;;) {
lineBreakG.lastIndex = cur;
var match = lineBreakG.exec(input);
if (match && match.index < offset) {
++line;
cur = match.index + match[0].length;
} else {
return new Position(line, offset - cur)
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getLineInfo(input, offset) {\n for (var line = 1, cur = 0;;) {\n var nextBreak = nextLineBreak(input, cur, offset);\n if (nextBreak < 0) { return new Position(line, offset - cur) }\n ++line;\n cur = nextBreak;\n }\n}",
"function getLineInfo(input, offset) {\n for (var line = 1, cur = 0;... | [
"0.85749483",
"0.85365015",
"0.852915",
"0.852915",
"0.85204524",
"0.85204524",
"0.84591484",
"0.84591484",
"0.8451368",
"0.8451368",
"0.841707",
"0.8349359",
"0.8349359",
"0.6444408",
"0.6140175",
"0.60476404",
"0.5942379",
"0.59302014",
"0.59302014",
"0.59302014",
"0.593020... | 0.85219246 | 13 |
Interpret and default an options object | function getOptions(opts) {
var options = {};
for (var opt in defaultOptions)
{ options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt]; }
if (options.ecmaVersion >= 2015)
{ options.ecmaVersion -= 2009; }
if (options.allowReserved == null)
{ options.allowReserved = options.ecmaVer... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get options() {}",
"set options(value) {}",
"function options(o, k, a, i) {\n o.files = o.files||[];\n if (a[i]==='-h' || a[i]==='--help') o.help = true;\n else if (a[i]==='-o' || a[i]==='--output') o.output = a[++i];\n else if (a[i]==='-i' || a[i]==='--input') o.input = a[++i];\n else if (a[i]==='-s' |... | [
"0.7570844",
"0.71893245",
"0.67991704",
"0.6662725",
"0.65952104",
"0.64926785",
"0.64670914",
"0.6447548",
"0.6391328",
"0.6385957",
"0.6353899",
"0.6312276",
"0.6303747",
"0.62941635",
"0.6266218",
"0.6266218",
"0.62437254",
"0.62333316",
"0.62333316",
"0.6226142",
"0.6225... | 0.0 | -1 |
Finish an AST node, adding `type` and `end` properties. | function finishNodeAt(node, type, pos, loc) {
node.type = type;
node.end = pos;
if (this.options.locations)
{ node.loc.end = loc; }
if (this.options.ranges)
{ node.range[1] = pos; }
return node
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function finishNode(node, type) {\n node.type = type;\n node.end = lastEnd;\n if (options.locations)\n node.loc.end = lastEndLoc;\n if (options.ranges)\n node.range[1] = lastEnd;\n return node;\n ... | [
"0.7520146",
"0.63963157",
"0.6272652",
"0.6182319",
"0.6182319",
"0.6182319",
"0.61174476",
"0.58955485",
"0.5865197",
"0.5640883",
"0.550494",
"0.541169",
"0.54019",
"0.53866416",
"0.53593165",
"0.528267",
"0.5258403",
"0.5217955",
"0.5162242",
"0.51038045",
"0.5065633",
... | 0.60903645 | 17 |
The main exported interface (under `self.acorn` when in the browser) is a `parse` function that takes a code string and returns an abstract syntax tree as specified by [Mozilla parser API][api]. [api]: | function parse(input, options) {
return new Parser(options, input).parse()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Parse (code) {\n this.code = code\n}",
"function acorn_parse(input, options) {\n return Parser.parse(input, options)\n}",
"function Parser() {\n\n}",
"function Parser() {\n}",
"function Parser() {\n}",
"function parseAndRun(code, state, callback) {\n const program = acorn.parse(code);\n re... | [
"0.67119986",
"0.6690774",
"0.65997356",
"0.65765244",
"0.65765244",
"0.6445344",
"0.6387944",
"0.6341534",
"0.63335156",
"0.6221938",
"0.6217722",
"0.6207885",
"0.6164724",
"0.6164724",
"0.6163323",
"0.6155838",
"0.6155838",
"0.6155838",
"0.6155838",
"0.61416996",
"0.6128019... | 0.0 | -1 |
This function tries to parse a single expression at a given offset in a string. Useful for parsing mixedlanguage formats that embed JavaScript expressions. | function parseExpressionAt(input, pos, options) {
var p = new Parser(options, input, pos);
p.nextToken();
return p.parseExpression()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function parseExpressionAt(input, pos, options) {\n var p = new _state.Parser(options, input, pos);\n p.nextToken();\n return p.parseExpression();\n}",
"function parseExpressionAt(input, pos, options) {\n return Parser.parseExpressionAt(input, pos, options)\n }",
"function parseExpressionAt(input, pos, ... | [
"0.65490544",
"0.6409869",
"0.6409869",
"0.6409869",
"0.63582426",
"0.63582426",
"0.63582426",
"0.63582426",
"0.63582426",
"0.63582426",
"0.63582426",
"0.6298877",
"0.6298877",
"0.6298877",
"0.6271992",
"0.62124014",
"0.6052556",
"0.60300666",
"0.60293186",
"0.57912886",
"0.5... | 0.6569268 | 1 |
Acorn is organized as a tokenizer and a recursivedescent parser. The `tokenizer` export provides an interface to the tokenizer. | function tokenizer(input, options) {
return new Parser(options, input)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"tokenizer(token , isEndOfInput , previousTokens , terminal , config){\n }",
"function tokenizer(input, options) {\n return Parser.tokenizer(input, options)\n }",
"function tokenizer(input, options) {\n return Parser.tokenizer(input, options)\n }",
"function tokenizer(input, options) {\n return ... | [
"0.6870337",
"0.612609",
"0.612609",
"0.612609",
"0.6061759",
"0.5991088",
"0.5930039",
"0.5930039",
"0.5930039",
"0.5930039",
"0.5930039",
"0.5930039",
"0.5930039",
"0.58479244",
"0.57659376",
"0.5742563",
"0.57264364",
"0.56815356",
"0.5660489",
"0.56511545",
"0.5629506",
... | 0.5765628 | 16 |
Currently only WebKitbased Web Inspectors, Firefox >= v31, and the Firebug extension (any Firefox version) are known to support "%c" CSS customizations. TODO: add a `localStorage` variable to explicitly enable/disable colors | function useColors() {
// NB: In an Electron preload script, document will be defined but not fully
// initialized. Since we know we're in Chrome, we'll just detect this case
// explicitly
if (typeof window !== 'undefined' && window.process && window.process.type === 'renderer') {
return true;
}
// is ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function useColors(){ // is webkit? http://stackoverflow.com/a/16459606/376773\nreturn 'WebkitAppearance' in document.documentElement.style || // is firebug? http://stackoverflow.com/a/398120/376773\nwindow.console && (console.firebug || console.exception && console.table) || // is firefox >= v31?\n// https://de... | [
"0.6763227",
"0.6297334",
"0.6297334",
"0.6297334",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
"0.62520415",
... | 0.0 | -1 |
Colorize log arguments if enabled. | function formatArgs(args) {
var useColors = this.useColors;
args[0] = (useColors ? '%c' : '')
+ this.namespace
+ (useColors ? ' %c' : ' ')
+ args[0]
+ (useColors ? '%c ' : ' ')
+ '+' + exports.humanize(this.diff);
if (!useColors) return;
var c = 'color: ' + this.color;
args.splice(1, 0,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"log(...args) {\n console.log(this.getColorOn() + args.join(\" \"));\n }",
"function writelnColor(){\n\t\tfor(var i=0; i<arguments.length; i=i+2)\n\t\t\tgrunt.log.write(arguments[i][arguments[i+1]]);\n\t\tgrunt.log.writeln('');\n\t}",
"function formatArgs(){var args=arguments;var useColors=this.useColor... | [
"0.67609656",
"0.6711765",
"0.65309334",
"0.65309334",
"0.65309334",
"0.6530865",
"0.64773405",
"0.6475821",
"0.6474954",
"0.64640945",
"0.6459552",
"0.64579946",
"0.64556366",
"0.64440036",
"0.6435409",
"0.64320284",
"0.64305735",
"0.64207786",
"0.64207786",
"0.64207786",
"0... | 0.0 | -1 |
Invokes `console.log()` when available. Noop when `console.log` is not a "function". | function log() {
// this hackery is required for IE8/9, where
// the `console.log` function doesn't have 'apply'
return 'object' === typeof console
&& console.log
&& Function.prototype.apply.call(console.log, console, arguments);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function log() {\n if (window.console) console.log.apply(console,arguments);\n}",
"function consoleLog() {\n if (typeof(console) == 'object' && typeof(console[\"log\"]) != \"undefined\") {\n console.log.apply(console, arguments);\n }\n}",
"function L() {\n if (window.console && console.log) {\n ... | [
"0.7741708",
"0.77197784",
"0.77089596",
"0.76121753",
"0.7569351",
"0.7569351",
"0.7534096",
"0.7491283",
"0.7415948",
"0.73375124",
"0.7332072",
"0.73312855",
"0.732567",
"0.7314221",
"0.73112816",
"0.73112816",
"0.73112816",
"0.73112816",
"0.73112816",
"0.7306911",
"0.7306... | 0.0 | -1 |
Add properties to a lookup table | function addToSet(set, array) {
if (setPrototypeOf) {
// Make 'in' and truthy checks like Boolean(set.constructor)
// independent of any properties defined on Object.prototype.
// Prevent prototype setters from intercepting set as a this value.
setPrototypeOf(set, null);
}
var l = a... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"createLookupTable() {\n this.__lookupTable = (s => { let a = []; while (s-- > 0)\n a.push(null); return a; })(LookupEntityMap.LOOKUP_TABLE_SIZE);\n for (let i = 0; i < LookupEntityMap.LOOKUP_TABLE_SIZE; ++i) {\n ... | [
"0.6388783",
"0.58908904",
"0.58104223",
"0.5642019",
"0.54143965",
"0.5363305",
"0.5344816",
"0.53297573",
"0.5326513",
"0.5306491",
"0.52701485",
"0.52366316",
"0.5200222",
"0.5176164",
"0.51686496",
"0.5157748",
"0.5080467",
"0.5056776",
"0.5047965",
"0.50112146",
"0.50107... | 0.0 | -1 |
Shallow clone an object | function clone(object) {
var newObject = create(null);
var property = void 0;
for (property in object) {
if (apply(hasOwnProperty, object, [property])) {
newObject[property] = object[property];
}
}
return newObject;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function clone(object) { return JSON.parse(JSON.stringify(object))}",
"function clone(obj) {\n return JSON.parse(JSON.stringify(obj));\n }",
"function clone (obj) {\n // return JSON.parse(JSON.stringify(obj))\n return Object.assign({}, obj)\n}",
"function clone(obj) { \n\n return JSON.parse(JSON.... | [
"0.7950295",
"0.7771218",
"0.7767527",
"0.7745556",
"0.77392215",
"0.77375495",
"0.7701222",
"0.76927173",
"0.76927173",
"0.76739347",
"0.76729304",
"0.7664262",
"0.765706",
"0.765706",
"0.76522565",
"0.7634367",
"0.76317",
"0.76313007",
"0.76130205",
"0.76105267",
"0.7586748... | 0.0 | -1 |
eslintdisable nobitwise Checks if a given DOM node contains or is another DOM node. | function containsNode(outerNode, innerNode) {
if (!outerNode || !innerNode) {
return false;
} else if (outerNode === innerNode) {
return true;
} else if (isTextNode(outerNode)) {
return false;
} else if (isTextNode(innerNode)) {
return containsNode(outerNode, innerNode.parentNode);
} else if (... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isNodeInDOM(node) {\n var ancestor = node;\n while (ancestor.parentNode) {\n ancestor = ancestor.parentNode;\n }\n // ancestor should be a document\n return !!ancestor.body;\n }",
"function isElement(domNode) {\n return domNode.nodeType !== undefined;\... | [
"0.7321315",
"0.70696926",
"0.69971675",
"0.69971675",
"0.69794345",
"0.68798107",
"0.6824134",
"0.67892087",
"0.67592525",
"0.6703224",
"0.66813034",
"0.66813034",
"0.66813034",
"0.66813034",
"0.66813034",
"0.66813034",
"0.6668626",
"0.6650006",
"0.66424525",
"0.6638982",
"0... | 0.0 | -1 |
Copyright (c) 2013present, Facebook, Inc. This source code is licensed under the MIT license found in the LICENSE file in the root directory of this source tree. | function makeEmptyFunction(arg) {
return function () {
return arg;
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"componentDidMount() {\n // if this is the first time the home screen is loading\n // we must initialize Facebook\n if (!window.FB) {\n window.fbAsyncInit = function() {\n window.FB.init({\n appId : '280945375708713',\n cookie : true, // enable cookies to allow the s... | [
"0.582302",
"0.56352496",
"0.55549705",
"0.54886013",
"0.5398446",
"0.5384924",
"0.53627056",
"0.53269863",
"0.5322178",
"0.53158647",
"0.53158647",
"0.5293647",
"0.5266638",
"0.52168524",
"0.5198115",
"0.51917535",
"0.5191675",
"0.5155282",
"0.5140739",
"0.5130987",
"0.51252... | 0.0 | -1 |
inlined Object.is polyfill to avoid requiring consumers ship their own | function is(x, y) {
// SameValue algorithm
if (x === y) {
// Steps 1-5, 7-10
// Steps 6.b-6.e: +0 != -0
// Added the nonzero y check to make Flow happy, but it is redundant
return x !== 0 || y !== 0 || 1 / x === 1 / y;
} else {
// Step 6.a: NaN == NaN
return x !== x && y !== y;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function i(e){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}",
... | [
"0.7044135",
"0.6979357",
"0.68574303",
"0.6821805",
"0.68029666",
"0.67803156",
"0.6729492",
"0.67206",
"0.6709456",
"0.66839457",
"0.6676559",
"0.6676559",
"0.6676559",
"0.66488636",
"0.6640003",
"0.6640003",
"0.6640003",
"0.6640003",
"0.6625777",
"0.6623136",
"0.6623136",
... | 0.0 | -1 |
Performs equality by iterating through keys on an object and returning false when any key has values which are not strictly equal between the arguments. Returns true when the values of all keys are strictly equal. | function shallowEqual(objA, objB) {
if (is(objA, objB)) {
return true;
}
if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) {
return false;
}
var keysA = Object.keys(objA);
var keysB = Object.keys(objB);
if (keysA.length !== keysB.length) {
return fa... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function equalForKeys(a, b, keys) {\n if (!angular.isArray(keys) && angular.isObject(keys)) {\n keys = protoKeys(keys, [\"$$keys\", \"$$values\", \"$$equals\", \"$$validates\", \"$$new\", \"$$parent\"]);\n }\n if (!keys) {\n keys = [];\n for (var n in a) keys.push(n)... | [
"0.65748584",
"0.65748584",
"0.6467961",
"0.6456548",
"0.6434612",
"0.6336349",
"0.62969005",
"0.62725157",
"0.6241628",
"0.62246656",
"0.6215161",
"0.6184088",
"0.6158581",
"0.61305773",
"0.6127149",
"0.60750496",
"0.60350895",
"0.60153687",
"0.60050756",
"0.5978841",
"0.597... | 0.0 | -1 |
Generated by PEG.js 0.9.0. | function peg$subclass(child, parent) {
function ctor() { this.constructor = child; }
ctor.prototype = parent.prototype;
child.prototype = new ctor();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"constructor() { super(new GeneratorParser(true)) }",
"function generate (p) {\n // Type\n if (typeof p === 'string' && node.type === null) {\n node.type = p.replace(/^./, ch => ch.toUpperCase())\n return\n }\n\n // Type\n if (typeof p === 'function') {\n node.type = p\n return\... | [
"0.62169564",
"0.5706019",
"0.5684357",
"0.5656814",
"0.554739",
"0.5442892",
"0.54246783",
"0.53784406",
"0.533806",
"0.53049433",
"0.52785397",
"0.52753025",
"0.52733904",
"0.52694523",
"0.5256397",
"0.5236033",
"0.52267605",
"0.52171594",
"0.5213136",
"0.52108103",
"0.5204... | 0.0 | -1 |
Removes all keyvalue entries from the hash. | function hashClear() {
this.__data__ = nativeCreate ? nativeCreate(null) : {};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }",
"function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}",
... | [
"0.67325383",
"0.66216296",
"0.6511944",
"0.6454195",
"0.6214277",
"0.6200593",
"0.61385626",
"0.61101323",
"0.6029097",
"0.5966128",
"0.5934792",
"0.5905935",
"0.5905935",
"0.5905935",
"0.5903774",
"0.5899288",
"0.5899288",
"0.5899288",
"0.58634514",
"0.58634514",
"0.5863451... | 0.0 | -1 |
Removes all keyvalue entries from the list cache. | function listCacheClear() {
this.__data__ = [];
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t this.size = 0;\n\t\t}",
"function listCacheClear() ... | [
"0.7357779",
"0.7357779",
"0.7357779",
"0.7357779",
"0.7317932",
"0.72645503",
"0.72645503",
"0.7262977",
"0.72569066",
"0.72569066",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7234546",... | 0.0 | -1 |
Removes all keyvalue entries from the map. | function mapCacheClear() {
this.__data__ = {
'hash': new Hash,
'map': new (Map || ListCache),
'string': new Hash
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }",
"clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }",
"function multiMapRemo... | [
"0.7590112",
"0.70694387",
"0.6735414",
"0.6652174",
"0.6530006",
"0.6267597",
"0.62582785",
"0.62582785",
"0.62582785",
"0.617115",
"0.617115",
"0.617115",
"0.6166302",
"0.61519635",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614... | 0.0 | -1 |
Implements a subset of Node's stream.Transform in a crossplatform manner. | function Transform() {} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static transform() {}",
"get transform() {}",
"get transform() {}",
"get transform() {}",
"get transform() {}",
"function pipeTransforms (stream, transforms) {\n var head, rest;\n if (!Array.isArray(transforms) || !transforms.length) {\n return stream;\n }\n head = transforms[0];\n rest = transfo... | [
"0.72023124",
"0.6511461",
"0.6511461",
"0.6511461",
"0.6511461",
"0.6387618",
"0.6365295",
"0.6328733",
"0.6328733",
"0.6328733",
"0.6328733",
"0.6131349",
"0.60108596",
"0.5802047",
"0.58001786",
"0.5791837",
"0.5763781",
"0.5761768",
"0.5692121",
"0.56904036",
"0.56904036"... | 0.74456626 | 3 |
v8 likes predictible objects | function Item(fun, array) {
this.fun = fun;
this.array = array;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function compareLike(a,b){\n var al = a.idLikesProp.length;\n var bl = b.idLikesProp.length;\n if(al > bl) return -1;\n if(bl > al) return 1;\n return 0;\n}",
"function lookAround() {\n var objectDescription = \"\"\n tj.see().then(function(objects) {\n objects.forEach(function(each) {\n ... | [
"0.52765024",
"0.5259989",
"0.5191908",
"0.5185475",
"0.5126739",
"0.5045062",
"0.4894077",
"0.4859557",
"0.4840031",
"0.48308602",
"0.48213598",
"0.48129985",
"0.48068723",
"0.47867215",
"0.4783404",
"0.47590926",
"0.4750297",
"0.47395125",
"0.47262868",
"0.47044972",
"0.470... | 0.0 | -1 |
inlined Object.is polyfill to avoid requiring consumers ship their own /eslintdisable noselfcompare | function is(x, y) {
// SameValue algorithm
if (x === y) {
// Steps 1-5, 7-10
// Steps 6.b-6.e: +0 != -0
return x !== 0 || 1 / x === 1 / y;
} else {
// Step 6.a: NaN == NaN
return x !== x && y !== y;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function isObject$1(obj) {\n ... | [
"0.6731362",
"0.6633782",
"0.6609513",
"0.6599949",
"0.6599775",
"0.6565226",
"0.6506394",
"0.64681304",
"0.6463561",
"0.641157",
"0.6370518",
"0.63660806",
"0.63660806",
"0.63660806",
"0.63660806",
"0.6357975",
"0.6327474",
"0.6323051",
"0.63226765",
"0.6296809",
"0.6296809"... | 0.0 | -1 |
Equivalent of `typeof` but with special handling for array and regexp. | function getPropType(propValue) {
var propType = typeof propValue;
if (Array.isArray(propValue)) {
return 'array';
}
if (propValue instanceof RegExp) {
// Old webkits (at least until Android 4.0) return 'function' rather than
// 'object' for typeof a RegExp. We'll normalize this here s... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function sc_typeof( x ) {\n return typeof x;\n}",
"static type(arg)\n {\n const types = [\n 'array', 'boolean', 'function', 'number',\n 'null', 'object', 'regexp', 'symbol', 'string',\n 'undefined'\n ]\n\n var type = Object.prototype.toString.call(arg),\... | [
"0.6908362",
"0.6774889",
"0.6606997",
"0.65384954",
"0.64926404",
"0.6489072",
"0.6489072",
"0.6449892",
"0.6449892",
"0.6428727",
"0.64280385",
"0.6402795",
"0.6402795",
"0.63939744",
"0.63939744",
"0.63939744",
"0.63939744",
"0.63939744",
"0.63939744",
"0.63939744",
"0.639... | 0.0 | -1 |
This handles more types than `getPropType`. Only used for error messages. See `createPrimitiveTypeChecker`. | function getPreciseType(propValue) {
if (typeof propValue === 'undefined' || propValue === null) {
return '' + propValue;
}
var propType = getPropType(propValue);
if (propType === 'object') {
if (propValue instanceof Date) {
return 'date';
} else if (propValue instanceof RegExp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for type... | [
"0.68776417",
"0.68541825",
"0.68541825",
"0.68541825",
"0.68541825",
"0.6853198",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",
"0.68475336",... | 0.0 | -1 |
Returns a string that is postfixed to a warning about an invalid type. For example, "undefined" or "of type array" | function getPostfixForTypeWarning(value) {
var type = getPreciseType(value);
switch (type) {
case 'array':
case 'object':
return 'an ' + type;
case 'boolean':
case 'date':
case 'regexp':
return 'a ' + type;
default:
return type;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _undefinedCoerce() {\n return '';\n}",
"function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case \"array\":\n case \"object\":\n return \"an \" + type;\n case \"boolean\":\n ... | [
"0.6599196",
"0.6566137",
"0.6560382",
"0.6560382",
"0.6560382",
"0.6560382",
"0.6523208",
"0.6522379",
"0.6506975",
"0.6506975",
"0.6506975",
"0.6506975",
"0.6506975",
"0.65022165",
"0.64905936",
"0.6478573",
"0.6478573",
"0.6478573",
"0.6478573",
"0.6478573",
"0.6478573",
... | 0.0 | -1 |
Returns class name of the object, if any. | function getClassName(propValue) {
if (!propValue.constructor || !propValue.constructor.name) {
return ANONYMOUS;
}
return propValue.constructor.name;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getClassName(obj) {\n var funcNameRegex = /function\\s+(.+?)\\s*\\(/;\n var results = funcNameRegex.exec(obj['constructor'].toString());\n return (results && results.length > 1) ? results[1] : '';\n }",
"getClassName() {\n return this.constructor\n .className;\n... | [
"0.7730571",
"0.74697196",
"0.74697196",
"0.74258965",
"0.7164231",
"0.71448183",
"0.7083163",
"0.7080694",
"0.6995368",
"0.6971116",
"0.6901662",
"0.6883398",
"0.67147285",
"0.66557264",
"0.6639163",
"0.6611592",
"0.6611592",
"0.6611592",
"0.6611592",
"0.6600893",
"0.6599787... | 0.0 | -1 |
Recomputes the plugin list using the injected plugins and plugin ordering. | function recomputePluginOrdering() {
if (!eventPluginOrder) {
// Wait until an `eventPluginOrder` is injected.
return;
}
for (var pluginName in namesToPlugins) {
var pluginModule = namesToPlugins[pluginName];
var pluginIndex = eventPluginOrder.indexOf(pluginName);
!(pluginIndex > -1) ? invaria... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"orderPlugins() {\r\n debug('orderPlugins:before', this.pluginNames);\r\n const runLast = this._plugins\r\n .filter(p => p.requirements.has('runLast'))\r\n .map(p => p.name);\r\n for (const name of runLast) {\r\n const index = this._plugins.findIndex(p => p.name... | [
"0.7994548",
"0.74701035",
"0.7169167",
"0.71361053",
"0.71361053",
"0.71361053",
"0.7128741",
"0.7122665",
"0.71187073",
"0.7117351",
"0.7117351",
"0.7117351",
"0.71010214",
"0.71010214",
"0.71010214",
"0.709135",
"0.709135",
"0.709135",
"0.709135",
"0.709135",
"0.709135",
... | 0.0 | -1 |
Standard/simple iteration through an event's collected dispatches. | function executeDispatchesInOrder(event, simulated) {
var dispatchListeners = event._dispatchListeners;
var dispatchInstances = event._dispatchInstances;
{
validateEventDispatches(event);
}
if (Array.isArray(dispatchListeners)) {
for (var i = 0; i < dispatchListeners.length; i++) {
if (event.isP... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(\"production\"!==process.env.NODE_ENV){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break... | [
"0.63397396",
"0.6318108",
"0.6217002",
"0.6128669",
"0.61218345",
"0.61218345",
"0.61218345",
"0.61218345",
"0.61218345",
"0.61218345",
"0.61218345",
"0.61218345",
"0.61186224",
"0.61186224",
"0.61148316",
"0.60777354",
"0.60777354",
"0.60777354",
"0.60777354",
"0.60777354",
... | 0.0 | -1 |
Given a DOM node, return the closest ReactDOMComponent or ReactDOMTextComponent instance ancestor. | function getClosestInstanceFromNode(node) {
if (node[internalInstanceKey]) {
return node[internalInstanceKey];
}
while (!node[internalInstanceKey]) {
if (node.parentNode) {
node = node.parentNode;
} else {
// Top of the tree. This node must not be part of a React tree (or is
// unmo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getClosestInstanceFromNode(node){if(node[internalInstanceKey]){return node[internalInstanceKey];}while(!node[internalInstanceKey]){if(node.parentNode){node=node.parentNode;}else{// Top of the tree. This node must not be part of a React tree (or is\n// unmounted, potentially).\nreturn null;}}var inst=node[... | [
"0.7370951",
"0.7370951",
"0.7370951",
"0.7370951",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.73246175",
"0.7308554",
"0.7308554",
"0... | 0.7227235 | 100 |
Given a DOM node, return the ReactDOMComponent or ReactDOMTextComponent instance, or null if the node was not rendered by this React. | function getInstanceFromNode$1(node) {
var inst = node[internalInstanceKey];
if (inst) {
if (inst.tag === HostComponent || inst.tag === HostText) {
return inst;
} else {
return null;
}
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\n }\n return null;\n}",
"function findFirstReactDOMImpl(node) {\n\t\t // This n... | [
"0.7596669",
"0.7380082",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73496497",
"0.73296285",
"0.73296285",
... | 0.0 | -1 |
Given a ReactDOMComponent or ReactDOMTextComponent, return the corresponding DOM node. | function getNodeFromInstance$1(inst) {
if (inst.tag === HostComponent || inst.tag === HostText) {
// In Fiber this, is just the state node right now. We assume it will be
// a host component or host text.
return inst.stateNode;
}
// Without this first invariant, passing a non-DOM-component triggers t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function findFirstReactDOMImpl(node) {\n\t\t // This node might be from another React instance, so we make sure not to\n\t\t // examine the node cache here\n\t\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t\t if (node.nodeType !== 1) {\n\t\t // Not a DOMElement, therefore not a... | [
"0.67850256",
"0.67771465",
"0.6770746",
"0.67658514",
"0.67658514",
"0.6751226",
"0.6741835",
"0.6741215",
"0.6741215",
"0.6741215",
"0.6741215",
"0.6741215",
"0.6741215",
"0.6741215",
"0.6739783",
"0.6739783",
"0.6739783",
"0.6739783",
"0.6739783",
"0.6739783",
"0.6732065",... | 0.0 | -1 |
Return the lowest common ancestor of A and B, or null if they are in different trees. | function getLowestCommonAncestor(instA, instB) {
var depthA = 0;
for (var tempA = instA; tempA; tempA = getParent(tempA)) {
depthA++;
}
var depthB = 0;
for (var tempB = instB; tempB; tempB = getParent(tempB)) {
depthB++;
}
// If A is deeper, crawl up.
while (depthA - depthB > 0) {
instA = g... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromIns... | [
"0.8277217",
"0.8277217",
"0.8277217",
"0.8272759",
"0.8272759",
"0.8272759",
"0.82544667",
"0.8228844",
"0.8228844",
"0.8228844",
"0.8228844",
"0.81996197",
"0.81990045",
"0.8184163",
"0.8184163",
"0.8184163",
"0.8184163",
"0.8184163",
"0.8184163",
"0.8184163",
"0.8184163",
... | 0.0 | -1 |
Return if A is an ancestor of B. Return the parent instance of the passedin instance. | function getParentInstance(inst) {
return getParent(inst);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n return true;\n }\n instB = getParent(instB);\n }\n return false;\n}",
"function isAncestor(instA, instB) {\n while (instB) {\n if (instA === instB || instA === instB.alternate) {\n ... | [
"0.731162",
"0.731162",
"0.731162",
"0.731162",
"0.731162",
"0.731162",
"0.731162",
"0.731162",
"0.731162",
"0.73110485",
"0.73110485",
"0.73110485",
"0.7308105",
"0.7305062",
"0.7305062",
"0.7305062",
"0.71668565",
"0.7036531",
"0.7036531",
"0.7022194",
"0.70153147",
"0.70... | 0.0 | -1 |
Simulates the traversal of a twophase, capture/bubble event dispatch. | function traverseTwoPhase(inst, fn, arg) {
var path = [];
while (inst) {
path.push(inst);
inst = getParent(inst);
}
var i = void 0;
for (i = path.length; i-- > 0;) {
fn(path[i], 'captured', arg);
}
for (i = 0; i < path.length; i++) {
fn(path[i], 'bubbled', arg);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}",
"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent... | [
"0.5877933",
"0.5877933",
"0.5877933",
"0.5877933",
"0.5877933",
"0.5877933",
"0.5859051",
"0.5857623",
"0.5857623",
"0.5857623",
"0.5857623",
"0.56623036",
"0.56271553",
"0.5586392",
"0.5568177",
"0.5568177",
"0.5561298",
"0.5547649",
"0.5547649",
"0.5547649",
"0.5547649",
... | 0.0 | -1 |
Traverses the ID hierarchy and invokes the supplied `cb` on any IDs that should would receive a `mouseEnter` or `mouseLeave` event. Does not invoke the callback on the nearest common ancestor because nothing "entered" or "left" that element. | function traverseEnterLeave(from, to, fn, argFrom, argTo) {
var common = from && to ? getLowestCommonAncestor(from, to) : null;
var pathFrom = [];
while (true) {
if (!from) {
break;
}
if (from === common) {
break;
}
var alternate = from.alternate;
if (alternate !== null && alte... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_handleMouseEnter() {\n this._hovered.next(this);\n }",
"_elementMouseEnterHandler() {\n const that = this;\n\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\n that._handleMouseInteraction();\n }\n }",
"_elementMouseEnterHandler() {\n ... | [
"0.5092577",
"0.49209234",
"0.49209234",
"0.4881742",
"0.48802367",
"0.48802367",
"0.4870479",
"0.48648864",
"0.4797949",
"0.4775619",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"0.47356582",
"... | 0.0 | -1 |
Some event types have a notion of different registration names for different "phases" of propagation. This finds listeners by a given phase. | function listenerAtPhase(inst, event, propagationPhase) {
var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];
return getListener(inst, registrationName);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function listenerAtPhase(inst, event, propagationPhase) {\n\t\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t\t return getListener(inst, registrationName);\n\t\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t\t var registrationName = event.dispat... | [
"0.6933187",
"0.6933187",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.6932316",
"0.69260776",
"0.69260776",
"0.690148",
"0.690148",
"0.690148",
"0.690148",
"0.... | 0.0 | -1 |
A small set of propagation patterns, each of which will accept a small amount of information, and generate a set of "dispatch ready event objects" which are sets of events that have already been annotated with a set of dispatched listener functions/ids. The API is designed this way to discourage these propagation strat... | function accumulateDirectionalDispatches(inst, phase, event) {
{
!inst ? warning(false, 'Dispatching inst must not be null') : void 0;
}
var listener = listenerAtPhase(inst, event, phase);
if (listener) {
event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);
event._dispatchI... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function accumulateDirectionalDispatches(inst,upwards,event){if(process.env.NODE_ENV!=='production'){process.env.NODE_ENV!=='production'?warning(inst,'Dispatching inst must not be null'):void 0;}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(inst,event,phase);if... | [
"0.6351668",
"0.6351668",
"0.6248267",
"0.6233495",
"0.60864395",
"0.60864395",
"0.60864395",
"0.60864395",
"0.60864395",
"0.5959494",
"0.5959494",
"0.5951498",
"0.5945181",
"0.5945181",
"0.5928652",
"0.5928652",
"0.59271216",
"0.59271216",
"0.59271216",
"0.59271216",
"0.5927... | 0.0 | -1 |
Collect dispatches (must be entirely collected before dispatching see unit tests). Lazily allocate the array to conserve memory. We must loop through each event and perform the traversal for each one. We cannot perform a single traversal for the entire collection of events because each event may have a different target... | function accumulateTwoPhaseDispatchesSingle(event) {
if (event && event.dispatchConfig.phasedRegistrationNames) {
traverseTwoPhase(event._targetInst, accumulateDirectionalDispatches, event);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances... | [
"0.6037257",
"0.6037257",
"0.6037257",
"0.6037257",
"0.6037257",
"0.59030503",
"0.58940506",
"0.58940506",
"0.58940506",
"0.58940506",
"0.587664",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5833246",
"0.5790857",... | 0.0 | -1 |
Same as `accumulateTwoPhaseDispatchesSingle`, but skips over the targetID. | function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {
if (event && event.dispatchConfig.phasedRegistrationNames) {
var targetInst = event._targetInst;
var parentInst = targetInst ? getParentInstance(targetInst) : null;
traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}",
"function accumulateTwoPhaseDi... | [
"0.7414454",
"0.7414454",
"0.7414454",
"0.7414454",
"0.7414454",
"0.74034",
"0.74034",
"0.74034",
"0.73782057",
"0.73656684",
"0.7320886",
"0.7320886",
"0.7300291",
"0.7285566",
"0.7285566",
"0.7285566",
"0.7285566",
"0.7285566",
"0.7285566",
"0.7285566",
"0.7285566",
"0.72... | 0.7298766 | 61 |
Accumulates without regard to direction, does not look for phased registration names. Same as `accumulateDirectDispatchesSingle` but without requiring that the `dispatchMarker` be the same as the dispatched ID. | function accumulateDispatches(inst, ignoredDirection, event) {
if (inst && event && event.dispatchConfig.registrationName) {
var registrationName = event.dispatchConfig.registrationName;
var listener = getListener(inst, registrationName);
if (listener) {
event._dispatchListeners = accumulateInto(eve... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulate... | [
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"0.7467071",
"... | 0.0 | -1 |
Do not uses the below two methods directly! Instead use constants exported from DOMTopLevelEventTypes in ReactDOM. (It is the only module that is allowed to access these methods.) | function unsafeCastStringToDOMTopLevelType(topLevelType) {
return topLevelType;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}",
"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,tar... | [
"0.6448155",
"0.6448155",
"0.6448155",
"0.6334827",
"0.63236046",
"0.62613595",
"0.6220223",
"0.6149863",
"0.6149863",
"0.6149863",
"0.6149863",
"0.6149863",
"0.60991025",
"0.60991025",
"0.6081894",
"0.59577334",
"0.59392864",
"0.5897346",
"0.5897346",
"0.5897346",
"0.5897346... | 0.0 | -1 |
Return whether a native keypress event is assumed to be a command. This is required because Firefox fires `keypress` events for key commands (cut, copy, selectall, etc.) even though no character is inserted. | function isKeypressCommand(nativeEvent) {
return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&
// ctrlKey && altKey is equivalent to AltGr, and is not a command.
!(nativeEvent.ctrlKey && nativeEvent.altKey);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}",
"function isKeypressCommand(nativeEvent... | [
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80084205",
"0.7999546",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.7998441",
"0.79984... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.